problem_id stringlengths 6 6 | language stringclasses 2
values | original_status stringclasses 3
values | original_src stringlengths 19 243k | changed_src stringlengths 19 243k | change stringclasses 3
values | i1 int64 0 8.44k | i2 int64 0 8.44k | j1 int64 0 8.44k | j2 int64 0 8.44k | error stringclasses 270
values | stderr stringlengths 0 226k |
|---|---|---|---|---|---|---|---|---|---|---|---|
p02579 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int x[4] = {-1, 0, 1, 0};
int y[4] = {0, 1, 0, -1};
queue<P> q;
char c[1100][1100];
int b[1100][1100];
int h, w, ch, dh, cw, dw;
int main() {
cin >> h >> w;
cin >> ch >> cw >> dh >> dw;
for (int i = 1; i <= h; i++) {
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int x[4] = {-1, 0, 1, 0};
int y[4] = {0, 1, 0, -1};
queue<P> q;
char c[1100][1100];
int b[1100][1100];
int h, w, ch, dh, cw, dw;
int main() {
cin >> h >> w;
cin >> ch >> cw >> dh >> dw;
for (int i = 1; i <= h; i++) {
... | replace | 26 | 27 | 26 | 27 | 0 | |
p02579 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
const int N = 1e3 + 7;
int mat[N][N];
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int h, w, sI, sJ, eI, eJ;
cin >> h >> w >> sI >> sJ >> eI >> eJ;
sI--;
sJ--;
eI--;
eJ--;
for (int i = 0; i < h; i++) {
string s;
cin >> s;
for (int j = 0; ... | #include <bits/stdc++.h>
using namespace std;
const int N = 1e3 + 7;
int mat[N][N];
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int h, w, sI, sJ, eI, eJ;
cin >> h >> w >> sI >> sJ >> eI >> eJ;
sI--;
sJ--;
eI--;
eJ--;
for (int i = 0; i < h; i++) {
string s;
cin >> s;
for (int j = 0; ... | replace | 55 | 56 | 55 | 56 | TLE | |
p02579 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <memory>
#include <queue>
#inc... | #include <algorithm>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <memory>
#include <queue>
#inc... | replace | 405 | 409 | 405 | 407 | 0 | |
p02579 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <memory>
#include <queue>
#inc... | #include <algorithm>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <memory>
#include <queue>
#inc... | replace | 389 | 390 | 389 | 390 | 0 | |
p02580 | C++ | Runtime Error | #include "bits/stdc++.h"
#define rep(i, j) for (int i = 0; i < j; i++)
#define srep(i, j, k) for (int i = j; i < k; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
using ull = unsigned long long;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
... | #include "bits/stdc++.h"
#define rep(i, j) for (int i = 0; i < j; i++)
#define srep(i, j, k) for (int i = j; i < k; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
using ull = unsigned long long;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
... | replace | 139 | 140 | 139 | 140 | 0 | |
p02580 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define fast \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define fast \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.... | replace | 78 | 80 | 78 | 80 | 0 | |
p02580 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
using namespace std;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
#define REP(i, l, n) for (int i = (l), i##_len = (n); i < i##_len; ++i)
#define ALL(x) (x).begin(), (x).end()
#define pb push_back
ll gcd(ll a, ll b) { return b ? gcd(b, a... | #include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
using namespace std;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
#define REP(i, l, n) for (int i = (l), i##_len = (n); i < i##_len; ++i)
#define ALL(x) (x).begin(), (x).end()
#define pb push_back
ll gcd(ll a, ll b) { return b ? gcd(b, a... | replace | 65 | 66 | 65 | 67 | TLE | |
p02580 | C++ | Time Limit Exceeded |
/**
* Dont raise your voice, improve your argument.
* --Desmond Tutu
*/
#include <bits/stdc++.h>
using namespace std;
const bool ready = []() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(12);
return true;
}();
const double PI = acos(-1);
using ll = long long;
#define int ... |
/**
* Dont raise your voice, improve your argument.
* --Desmond Tutu
*/
#include <bits/stdc++.h>
using namespace std;
const bool ready = []() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(12);
return true;
}();
const double PI = acos(-1);
using ll = long long;
#define int ... | replace | 91 | 92 | 91 | 95 | TLE | |
p02580 | C++ | Runtime Error | /// mAAria...
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); ... | /// mAAria...
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); ... | replace | 99 | 100 | 99 | 100 | 0 | |
p02580 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a) for (int i = 0; i < (a); i++)
typedef pair<int, int> P;
typedef long long ll;
const int INF = 1001001001;
const int MOD = 1000000007;
const double PI = acos(-1);
int main() {
int H, W, M;
cin >> H >> W >> M;
set<pair<int, int>> S;
vector<vecto... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a) for (int i = 0; i < (a); i++)
typedef pair<int, int> P;
typedef long long ll;
const int INF = 1001001001;
const int MOD = 1000000007;
const double PI = acos(-1);
int main() {
int H, W, M;
cin >> H >> W >> M;
set<pair<int, int>> S;
vector<vecto... | insert | 65 | 65 | 65 | 66 | TLE | |
p02580 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ll h, w, m;
cin >> h >> w >> m;
ll a[h][w];
for (ll i = 0; i < h; i++)
for (ll j = 0; j < w; j++) {
a[i][j] = 0;
}
set<pair<ll, ll>> s;
vector<ll> mpr(300001, 0);
vector<ll> mpc(300001, 0);
while (m--) {
ll... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
ll h, w, m;
cin >> h >> w >> m;
set<pair<ll, ll>> s;
vector<ll> mpr(300001, 0);
vector<ll> mpc(300001, 0);
while (m--) {
ll x, y;
cin >> x >> y;
x--;
y--;
s.insert({x, y});
mpr[x]++;
mpc[y]++;
}
... | replace | 6 | 11 | 6 | 7 | 0 | |
p02580 | C++ | Runtime Error | #include "bits/stdc++.h"
#define rep(i, j) for (int i = 0; i < j; i++)
#define srep(i, j, k) for (int i = j; i < k; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
using ull = unsigned long long;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
... | #include "bits/stdc++.h"
#define rep(i, j) for (int i = 0; i < j; i++)
#define srep(i, j, k) for (int i = j; i < k; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
using ull = unsigned long long;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
... | replace | 139 | 140 | 139 | 140 | 0 | |
p02580 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define forr(i, a, n) for (long long int i = a; i < n; i++)
#define loop(i, a, n) for (long long int i = a; i >= n; i--)
int main() {
ios_base ::sync_with_stdio(false), cin.tie(NULL);
int a, b, c, ans = -1;
cin >> a >> b >> c;
int x[c], y[c], m2x = -1, m1x = -1;
... | #include <bits/stdc++.h>
using namespace std;
#define forr(i, a, n) for (long long int i = a; i < n; i++)
#define loop(i, a, n) for (long long int i = a; i >= n; i--)
int main() {
ios_base ::sync_with_stdio(false), cin.tie(NULL);
int a, b, c, ans = -1;
cin >> a >> b >> c;
int x[c], y[c], m2x = -1, m1x = -1;
... | insert | 34 | 34 | 34 | 36 | TLE | |
p02580 | C++ | Time Limit Exceeded | // Romene
#include <bits/stdc++.h>
#include <string>
#include <sstream>
using namespace std;
#define ll long long
#define ld long double
#define pb push_back
#define pf push_front
#define f first
#define s second
#define all(c) c.begin(), c.end()
#define ulli unsigned long long int
#define lli long long int
#define... | // Romene
#include <bits/stdc++.h>
#include <string>
#include <sstream>
using namespace std;
#define ll long long
#define ld long double
#define pb push_back
#define pf push_front
#define f first
#define s second
#define all(c) c.begin(), c.end()
#define ulli unsigned long long int
#define lli long long int
#define... | replace | 114 | 132 | 114 | 119 | TLE | |
p02580 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef int_fast32_t int32;
typedef int_fast64_t int64;
const int32 inf = 1e9 + 7;
const int32 MOD = 1000000007;
const int64 llinf = 1e18;
#define YES(n) cout << ((n) ? "YES\n" : "NO\n")
#define Yes(n) cout << ((n) ? "Yes\n" : "No\n")
#define POSSIBLE(n) cout << ((n) ? "... | #include <bits/stdc++.h>
using namespace std;
typedef int_fast32_t int32;
typedef int_fast64_t int64;
const int32 inf = 1e9 + 7;
const int32 MOD = 1000000007;
const int64 llinf = 1e18;
#define YES(n) cout << ((n) ? "YES\n" : "NO\n")
#define Yes(n) cout << ((n) ? "Yes\n" : "No\n")
#define POSSIBLE(n) cout << ((n) ? "... | replace | 69 | 74 | 69 | 78 | TLE | |
p02580 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
#define mp make_pair
ll bg = 100000000007;
#define ff(i, n) for (i = 0; i < n; i++)
ll row[300001];
int main() {
ll kamal;
kamal = 1;
while (kamal--) {
ll i, j, h, w, m;
cin >> h >> w >> m;
vector<set<ll>> adj(... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
#define mp make_pair
ll bg = 100000000007;
#define ff(i, n) for (i = 0; i < n; i++)
ll row[300001];
int main() {
ll kamal;
kamal = 1;
while (kamal--) {
ll i, j, h, w, m;
cin >> h >> w >> m;
vector<set<ll>> adj(... | replace | 25 | 26 | 25 | 26 | 0 | |
p02580 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define deb(x) cerr << #x << ":" << x << "\n"
#define all(x) x.begin(), x.end()
#define sz(x) x.size()
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define deb(x) cerr << #x << ":" << x << "\n"
#define all(x) x.begin(), x.end()
#define sz(x) x.size()
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set ... | insert | 44 | 44 | 44 | 49 | TLE | |
p02580 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rng(i, a, b) for (int i = int(a); i < int(b); i++)
#define rep(i, b) rng(i, 0, b)
#define gnr(i, a, b) for (int i = int(b) - 1; i >= int(a); i--)
#define per(i, b) gnr(i, 0, b)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int h, w, m;
cin >> ... | #include <bits/stdc++.h>
#define rng(i, a, b) for (int i = int(a); i < int(b); i++)
#define rep(i, b) rng(i, 0, b)
#define gnr(i, a, b) for (int i = int(b) - 1; i >= int(a); i--)
#define per(i, b) gnr(i, 0, b)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int h, w, m;
cin >> ... | insert | 60 | 60 | 60 | 64 | TLE | |
p02580 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pb push_back
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
#define FOR(i, a, b) for (int i = a; i <= (b); i++)
#define ROF(i, a, b) for (int i = a; i >= (b); i--)
using pii = pair<int, int>;
using vpii = vector<pi... | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pb push_back
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
#define FOR(i, a, b) for (int i = a; i <= (b); i++)
#define ROF(i, a, b) for (int i = a; i >= (b); i--)
using pii = pair<int, int>;
using vpii = vector<pi... | replace | 39 | 40 | 39 | 40 | 0 | |
p02580 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int n, m, k, x, y;
vector<pair<int, int>> p;
vector<int> col, row;
int main() {
cin >> n >> m >> k;
row.assign(n + 1, 0);
col.assign(m + 1, 0);
int mxr = 0, mxc = 0;
for (int i = 0; i < k; i++) {
cin >> x >> y;
p.push_back({x, y});
row[x]++;
col... | #include <bits/stdc++.h>
using namespace std;
int n, m, k, x, y;
vector<pair<int, int>> p;
vector<int> col, row;
int main() {
cin >> n >> m >> k;
row.assign(n + 1, 0);
col.assign(m + 1, 0);
int mxr = 0, mxc = 0;
for (int i = 0; i < k; i++) {
cin >> x >> y;
p.push_back({x, y});
row[x]++;
col... | replace | 19 | 20 | 19 | 20 | 0 | |
p02580 | C++ | Runtime Error | #include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, n) for (int i = 1; i <= (int)(n); i++)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = long long;
using pi = pair<int, int>;
const ll INF = 1LL << 60;
int main() {
int ... | #include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, n) for (int i = 1; i <= (int)(n); i++)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = long long;
using pi = pair<int, int>;
const ll INF = 1LL << 60;
int main() {
int ... | replace | 34 | 40 | 34 | 41 | 0 | |
p02580 | C++ | Runtime Error | #include <bits/stdc++.h>
// #pragma GCC optimize("Ofast")
// #pragma GCC target("avx,avx2,fma")
using namespace std;
typedef long long ll;
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
// typedef
// tree<int,null_type,less<int>,rb_tree_tag,tree_ord... | #include <bits/stdc++.h>
// #pragma GCC optimize("Ofast")
// #pragma GCC target("avx,avx2,fma")
using namespace std;
typedef long long ll;
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
// typedef
// tree<int,null_type,less<int>,rb_tree_tag,tree_ord... | replace | 25 | 26 | 25 | 26 | 0 | |
p02580 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
#define ALL(c) (c).begin(), (c).end()
#define SUM(x) std::accumulate(ALL(x), 0LL)
#define MIN(v) *std::min_element(v.begin(), v.end())
#define MAX(v) *std::max_element(v.begin(), v.end())
#define EXIST(v, x) (std::find(... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
#define ALL(c) (c).begin(), (c).end()
#define SUM(x) std::accumulate(ALL(x), 0LL)
#define MIN(v) *std::min_element(v.begin(), v.end())
#define MAX(v) *std::max_element(v.begin(), v.end())
#define EXIST(v, x) (std::find(... | delete | 107 | 118 | 107 | 107 | TLE | |
p02580 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define endl '\n'
#define uset unordered_set
#define umap unordered_map
#define all(var) var.begin(), var.end()
#define input freopen("input", "r", stdin)
#define output freopen("output", "w", stdout)
#define Fast ios_base::sync_with_stdio(0), cin.tie(NULL), cout.tie(NULL)
typedef long long ll;... | #include <bits/stdc++.h>
#define endl '\n'
#define uset unordered_set
#define umap unordered_map
#define all(var) var.begin(), var.end()
#define input freopen("input", "r", stdin)
#define output freopen("output", "w", stdout)
#define Fast ios_base::sync_with_stdio(0), cin.tie(NULL), cout.tie(NULL)
typedef long long ll;... | replace | 46 | 47 | 46 | 47 | TLE | |
p02580 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ar array
#define endl '\n'
#define ll long long
#define in insert
#define pb push_back
#define vt vector
#define P_Q(x) priority_queue<x>
#define p_q(x) priority_queue<x, vector<x>, greater<x>>
#define Rep(i, a, b) for (int i = a; i <= b; i++)
#define Rev(i, a, b) f... | #include <bits/stdc++.h>
using namespace std;
#define ar array
#define endl '\n'
#define ll long long
#define in insert
#define pb push_back
#define vt vector
#define P_Q(x) priority_queue<x>
#define p_q(x) priority_queue<x, vector<x>, greater<x>>
#define Rep(i, a, b) for (int i = a; i <= b; i++)
#define Rev(i, a, b) f... | replace | 62 | 67 | 62 | 68 | 0 | |
p02580 | C++ | Runtime Error | // #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
//----------------------- Print Function ----------------------//
inline void print() { cout << endl; }
template <typename First, typename... Rest>
void print(const First &first, const Rest &...rest) {
cout << first << ' ';
print(rest...);
}... | // #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
//----------------------- Print Function ----------------------//
inline void print() { cout << endl; }
template <typename First, typename... Rest>
void print(const First &first, const Rest &...rest) {
cout << first << ' ';
print(rest...);
}... | replace | 51 | 52 | 51 | 52 | 0 | |
p02580 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define pll pair<long long, long long>
#define f first
#define s second
#define debug cout << "here\n"
#define MOD 1000000009
const int MAXN = 2e5 + 15;
using namespace std;
int R[MAXN], C[MAXN];
void solve() {
int n, m, q;
cin >> n >> m >> q;
... | #include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define pll pair<long long, long long>
#define f first
#define s second
#define debug cout << "here\n"
#define MOD 1000000009
const int MAXN = 3e5 + 15;
using namespace std;
int R[MAXN], C[MAXN];
void solve() {
int n, m, q;
cin >> n >> m >> q;
... | replace | 9 | 10 | 9 | 10 | 0 | |
p02580 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define N (1000000000 + 7)
// #define N 9982... | #include <algorithm>
#include <bitset>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define N (1000000000 + 7)
// #define N 9982... | insert | 64 | 64 | 64 | 68 | TLE | |
p02580 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using Int = long long;
const char newl = '\n';
template <typename T1, typename T2> inline void chmin(T1 &a, T2 b) {
if (a > b)
a = b;
}
template <typename T1, typename T2> inline void chmax(T1 &a, T2 b) {
if (a < b)
a = b;
}
template <typename T> void drop(con... | #include <bits/stdc++.h>
using namespace std;
using Int = long long;
const char newl = '\n';
template <typename T1, typename T2> inline void chmin(T1 &a, T2 b) {
if (a > b)
a = b;
}
template <typename T1, typename T2> inline void chmax(T1 &a, T2 b) {
if (a < b)
a = b;
}
template <typename T> void drop(con... | replace | 64 | 67 | 64 | 77 | TLE | |
p02580 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
/* typedef */
typedef long long ll;
typedef pair<int, int> pii;
/* constant */
const int INF = 1 << 30;
const ll LINF = 1LL << 50;
const int NIL = -1;
// const int MAX = 300001;
const int MAX = 10;
const int mod = 1000000007;
const double pi = 3.141592653589;
/* global vari... | #include <bits/stdc++.h>
using namespace std;
/* typedef */
typedef long long ll;
typedef pair<int, int> pii;
/* constant */
const int INF = 1 << 30;
const ll LINF = 1LL << 50;
const int NIL = -1;
const int MAX = 300001;
const int mod = 1000000007;
const double pi = 3.141592653589;
/* global variables */
/* function */... | replace | 9 | 11 | 9 | 10 | 0 | |
p02580 | C++ | Time Limit Exceeded | // I'll always miss you like a darling.
#include <bits/stdc++.h>
using namespace std;
#define LL long long
#define LD long double
#define ull unsigned long long
#define x first
#define y second
#define pb push_back
#define pf push_front
#define mp make_pair
#define Pair pair<int, int>
#define pLL pair<LL, LL>
#define ... | // I'll always miss you like a darling.
#include <bits/stdc++.h>
using namespace std;
#define LL long long
#define LD long double
#define ull unsigned long long
#define x first
#define y second
#define pb push_back
#define pf push_front
#define mp make_pair
#define Pair pair<int, int>
#define pLL pair<LL, LL>
#define ... | insert | 204 | 204 | 204 | 205 | TLE | |
p02580 | C++ | Runtime Error | #include <bits/stdc++.h>
#define poi 201000
using namespace std;
typedef long long ll;
struct girl {
int x, y;
bool operator<(const girl &b) const { return (x ^ b.x) ? x < b.x : y < b.y; }
} a[poi];
int b[poi], ans, h, w, n, tans;
set<pair<int, int>> s;
inline int re() {
char x = getchar();
int k = 1, y = 0;
... | #include <bits/stdc++.h>
#define poi 601000
using namespace std;
typedef long long ll;
struct girl {
int x, y;
bool operator<(const girl &b) const { return (x ^ b.x) ? x < b.x : y < b.y; }
} a[poi];
int b[poi], ans, h, w, n, tans;
set<pair<int, int>> s;
inline int re() {
char x = getchar();
int k = 1, y = 0;
... | replace | 1 | 2 | 1 | 2 | 0 | |
p02580 | C++ | Time Limit Exceeded | /* -*- coding: utf-8 -*-
*
* e.cc: E - Bomber
*/
#include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <st... | /* -*- coding: utf-8 -*-
*
* e.cc: E - Bomber
*/
#include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <st... | replace | 97 | 99 | 97 | 102 | TLE | |
p02580 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = (a); i < (b); ++i)
#define trav(a, x) for (auto &a : x)
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define sz(x) ((int)(x).size())
#define endl '\n'
typedef long long ll;
typedef pair<int, int> pii;
ty... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = (a); i < (b); ++i)
#define trav(a, x) for (auto &a : x)
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define sz(x) ((int)(x).size())
#define endl '\n'
typedef long long ll;
typedef pair<int, int> pii;
ty... | insert | 70 | 70 | 70 | 72 | TLE | |
p02580 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
const int N = 300004;
int cnth[N], cntw[N], x[N], y[N];
map<int, bool> mp[N];
int32_t main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int h, w, m;
cin >> h >> w >> m;
for (int i = 0; i < m; i++) {
cin >> x[i] >> y[i];
mp[x[i]][y[i]] = t... | #include <bits/stdc++.h>
using namespace std;
const int N = 300004;
int cnth[N], cntw[N], x[N], y[N];
map<int, bool> mp[N];
int32_t main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int h, w, m;
cin >> h >> w >> m;
for (int i = 0; i < m; i++) {
cin >> x[i] >> y[i];
mp[x[i]][y[i]] = t... | insert | 33 | 33 | 33 | 37 | TLE | |
p02580 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ... | replace | 80 | 81 | 80 | 81 | 0 | |
p02580 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 1e5 + 5;
ll n, m;
map<int, int> x, y;
struct node {
int x, y;
};
node a[maxn];
int main() {
std::ios::sync_with_stdio(false);
cin >> n >> m;
int t;
cin >> t;
for (int i = 1; i <= t; i++) {
cin >> a[i].x >> a[i].y;
x... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 5e5 + 5;
ll n, m;
map<int, int> x, y;
struct node {
int x, y;
};
node a[maxn];
int main() {
std::ios::sync_with_stdio(false);
cin >> n >> m;
int t;
cin >> t;
for (int i = 1; i <= t; i++) {
cin >> a[i].x >> a[i].y;
x... | replace | 3 | 4 | 3 | 4 | 0 | |
p02580 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
usin... | #include <algorithm>
#include <bitset>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
usin... | replace | 142 | 143 | 142 | 143 | 0 | |
p02580 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
template <typename T>
using ordered_set =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
/*
s.find_by_order(k) ---> returns iterat... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
template <typename T>
using ordered_set =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
/*
s.find_by_order(k) ---> returns iterat... | insert | 159 | 159 | 159 | 160 | TLE | |
p02580 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define endl '\n'
#define rep(i, n) for (int i = 0; i < n; i++)
#define all(v) v.begin(), v.end()
#define F first
#define S second
ll n, m, m1;
ll solve() {
cin >> n >> m >> m1;
map<ll, vector<pair<ll, ll>>> mr, mc;
map<pair<ll, ll>, bool> m2... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define endl '\n'
#define rep(i, n) for (int i = 0; i < n; i++)
#define all(v) v.begin(), v.end()
#define F first
#define S second
ll n, m, m1;
void solve() {
cin >> n >> m >> m1;
map<ll, vector<pair<ll, ll>>> mr, mc;
map<pair<ll, ll>, bool> ... | replace | 9 | 10 | 9 | 10 | 0 | |
p02580 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i, n) for (int i = (n)-1; i >= 0; i--)
#define FOR(i, a, b) for (... | #include <algorithm>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i, n) for (int i = (n)-1; i >= 0; i--)
#define FOR(i, a, b) for (... | replace | 67 | 68 | 67 | 68 | TLE | |
p02580 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define froop1(a, n) for (int i = a; i < n; i++)
#define froop2(a, n) for (int i = a; i > n; i--)
#define ll long long
#define pq(name, type) priority_queue<type> name
#define vec(name, type, length, value) vector<type> name(length, value)
#define vec2(name, type, length... | #include <bits/stdc++.h>
using namespace std;
#define froop1(a, n) for (int i = a; i < n; i++)
#define froop2(a, n) for (int i = a; i > n; i--)
#define ll long long
#define pq(name, type) priority_queue<type> name
#define vec(name, type, length, value) vector<type> name(length, value)
#define vec2(name, type, length... | replace | 44 | 49 | 44 | 47 | TLE | |
p02580 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
using namespace std;
using P = pair<int, int>;
typedef long long ll;
int main() {
int h, w, n;
cin >> h >> w >> n;
vector<int> hs(h), ws(w);
set<P> s;
for (int i = 0; i < n; i++) {
... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
using namespace std;
using P = pair<int, int>;
typedef long long ll;
int main() {
int h, w, n;
cin >> h >> w >> n;
vector<int> hs(h), ws(w);
set<P> s;
for (int i = 0; i < n; i++) {
... | replace | 45 | 47 | 45 | 47 | 0 | |
p02580 | C++ | Time Limit Exceeded | #include "bits/stdc++.h"
using namespace std;
#define endl "\n"
typedef long long int ll;
#define f first
#define s second
inline void fastio() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
}
inline void setPrecision(int n) { cout.precision(n); }
// DEBUG
#define dbg(x) cerr << (#x) << ": " << x << ... | #include "bits/stdc++.h"
using namespace std;
#define endl "\n"
typedef long long int ll;
#define f first
#define s second
inline void fastio() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
}
inline void setPrecision(int n) { cout.precision(n); }
// DEBUG
#define dbg(x) cerr << (#x) << ": " << x << ... | insert | 92 | 92 | 92 | 94 | TLE | |
p02580 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main() {
int h, w, m;
cin >> h >> w >> m;
int mxr = -1, mxc = -1;
vector<vector<int>> row(h), colum(w);
vector<int> mxh, mxw;
rep(i, m) {
int hi, wi;
cin... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main() {
int h, w, m;
cin >> h >> w >> m;
int mxr = -1, mxc = -1;
vector<vector<int>> row(h), colum(w);
vector<int> mxh, mxw;
rep(i, m) {
int hi, wi;
cin... | replace | 28 | 29 | 28 | 29 | 0 | |
p02580 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using ll = long long;
using ld = long double;
#define F first
#define S second
const ll mod = 1e9 + 7;
const ll INF = 922337203685477;
#define pb push_back
#define deb(x) cout << '>' << #x << ':' << x << endl;
#define fastio \
io... | #include <bits/stdc++.h>
using ll = long long;
using ld = long double;
#define F first
#define S second
const ll mod = 1e9 + 7;
const ll INF = 922337203685477;
#define pb push_back
#define deb(x) cout << '>' << #x << ':' << x << endl;
#define fastio \
io... | insert | 39 | 39 | 39 | 43 | TLE | |
p02580 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
int hcnt[300005] = {};
int wcnt[300005] = {};
vector<int> hp, wp;
map<pair<int, int>, int> coors;
int main() {
int h, w;
cin >> h >> w;
int m;
cin >> m;
int hm = 0, wm = 0;
for (int i = 0; i < m; ++i) {
int hh, ww;
scanf("%d%d",... | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
int hcnt[300005] = {};
int wcnt[300005] = {};
vector<int> hp, wp;
map<pair<int, int>, int> coors;
int main() {
int h, w;
cin >> h >> w;
int m;
cin >> m;
int hm = 0, wm = 0;
for (int i = 0; i < m; ++i) {
int hh, ww;
scanf("%d%d",... | insert | 39 | 39 | 39 | 41 | TLE | |
p02580 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define I inline void
using namespace std;
using ll = long long;
using ld = long double;
const int N = 2e6 + 7;
// How interesting!
int n, m, k;
int col[N], row[N];
vector<pair<int, int>> ed;
map<pair<int, int>, int> mp;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
// f... | #include <bits/stdc++.h>
#define I inline void
using namespace std;
using ll = long long;
using ld = long double;
const int N = 2e6 + 7;
// How interesting!
int n, m, k;
int col[N], row[N];
vector<pair<int, int>> ed;
map<pair<int, int>, int> mp;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
// f... | replace | 53 | 54 | 53 | 59 | TLE | |
p02580 | C++ | Runtime Error | // Template
#include <bits/stdc++.h>
#define rep_override(x, y, z, name, ...) name
#define rep2(i, n) for (int i = 0; i < (n); ++i)
#define rep3(i, l, r) for (int i = (l); i < (r); ++i)
#define rep(...) rep_override(__VA_ARGS__, rep3, rep2)(__VA_ARGS__)
#define per(i, n) for (int i = (n)-1; i >= 0; --i)
#define all(x) ... | // Template
#include <bits/stdc++.h>
#define rep_override(x, y, z, name, ...) name
#define rep2(i, n) for (int i = 0; i < (n); ++i)
#define rep3(i, l, r) for (int i = (l); i < (r); ++i)
#define rep(...) rep_override(__VA_ARGS__, rep3, rep2)(__VA_ARGS__)
#define per(i, n) for (int i = (n)-1; i >= 0; --i)
#define all(x) ... | replace | 106 | 107 | 106 | 107 | 0 | |
p02580 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
// long long
using ll = long long;
// pair<int, int>
using PII = pair<int, int>;
// 最大値、mod
const int MOD = 1000000007;
const int mod = 1000000007;
const int INF = 1000000000;
const long long LINF = 1e18;
const int MAX = 510000;
// 出力系
#define print(x) cout << x << endl... | #include <bits/stdc++.h>
using namespace std;
// long long
using ll = long long;
// pair<int, int>
using PII = pair<int, int>;
// 最大値、mod
const int MOD = 1000000007;
const int mod = 1000000007;
const int INF = 1000000000;
const long long LINF = 1e18;
const int MAX = 510000;
// 出力系
#define print(x) cout << x << endl... | replace | 369 | 379 | 369 | 377 | TLE | |
p02580 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int h, w, m;
cin >> h >> w >> m;
vector<int> vh(h + 1, 0);
vector<int> vw(w + 1, 0);
unordered_map<string, int> u;
for (int i = 0; i < m; i++) {
int l, r;
cin >> l >> r;
vh[l]++;
v... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int h, w, m;
cin >> h >> w >> m;
vector<int> vh(h + 1, 0);
vector<int> vw(w + 1, 0);
unordered_map<string, int> u;
for (int i = 0; i < m; i++) {
int l, r;
cin >> l >> r;
vh[l]++;
v... | insert | 51 | 51 | 51 | 52 | TLE | |
p02580 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define ll long long
#define ll_MAX LONG_LONG_MAX
#define ll_MIN LONG_LONG_MIN
#define pi pair<ll, ll>
#define endl "\n"
#define MAXN 100005
using namespace std;
ll h, w, m, a, b;
vector<ll> v, v1;
unordered_map<ll, l... | #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define ll long long
#define ll_MAX LONG_LONG_MAX
#define ll_MIN LONG_LONG_MIN
#define pi pair<ll, ll>
#define endl "\n"
#define MAXN 100005
using namespace std;
ll h, w, m, a, b;
vector<ll> v, v1;
unordered_map<ll, l... | insert | 39 | 39 | 39 | 43 | TLE | |
p02580 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <forward_list>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <utility>
#include <vector>
#define... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <forward_list>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <utility>
#include <vector>
#define... | insert | 67 | 67 | 67 | 68 | TLE | |
p02580 | C++ | Runtime Error | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <cctype>
#include <cmath>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#in... | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <cctype>
#include <cmath>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#in... | insert | 97 | 97 | 97 | 99 | 0 | |
p02580 | C++ | Runtime Error | /* بِسْمِ اللَّهِ الرَّحْمَٰنِ الرَّحِيمِ */
// codeforces
#include <bits/stdc++.h>
// #pragma GCC target ("avx2")
// #pragma GCC optimization ("O3")
// #pragma GCC optimization ("unroll-loops")
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define FASTIO ios::sync_w... | /* بِسْمِ اللَّهِ الرَّحْمَٰنِ الرَّحِيمِ */
// codeforces
#include <bits/stdc++.h>
// #pragma GCC target ("avx2")
// #pragma GCC optimization ("O3")
// #pragma GCC optimization ("unroll-loops")
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define FASTIO ios::sync_w... | replace | 58 | 59 | 58 | 59 | -11 | |
p02580 | C++ | Time Limit Exceeded | /**
* author: otera
**/
#include <algorithm>
#include <bitset>
#include <cassert>
#include <ciso646>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <se... | /**
* author: otera
**/
#include <algorithm>
#include <bitset>
#include <cassert>
#include <ciso646>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <se... | insert | 105 | 105 | 105 | 106 | TLE | |
p02580 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
const int maxn = 1e5 + 10;
int x, y, r[maxn], c[maxn];
vector<int> rr, cc;
set<pair<int, int>> st;
void solve() {
int h, w, m;
cin >> h >> w >> m;
int mr = 0, mc = 0;
for (int i = 0; i < m; i++) {
cin >> x >> y;
st.insert(make_pair(x,... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
const int maxn = 3e5 + 10;
int x, y, r[maxn], c[maxn];
vector<int> rr, cc;
set<pair<int, int>> st;
void solve() {
int h, w, m;
cin >> h >> w >> m;
int mr = 0, mc = 0;
for (int i = 0; i < m; i++) {
cin >> x >> y;
st.insert(make_pair(x,... | replace | 5 | 6 | 5 | 6 | 0 | |
p02580 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const static ll INF = 1e15;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
// __uint128_t
const ll MOD = 1e9 + 7;
int main() {
ll H, W, M;
cin >> H >> W >> M;
map<ll, ll> MH, MW;
vector<pair<ll, ll>> V(H + 1);
for (int i = 0; i < M; i+... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const static ll INF = 1e15;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
// __uint128_t
const ll MOD = 1e9 + 7;
int main() {
ll H, W, M;
cin >> H >> W >> M;
map<ll, ll> MH, MW;
vector<pair<ll, ll>> V(M);
for (int i = 0; i < M; i++) {... | replace | 12 | 13 | 12 | 13 | 0 | |
p02580 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define all(a) a.begin(), a.end()
using ll = long long;
const int INF = 1 << 30;
const ll INFll = 1LL << 62;
const int mod = int(1e9) + 7;
using P = pair<ll, ll>;
using ld = long double;
int main() {
int H, W, m;
cin >> H >> W >> m;
int mxh = 0, mxw = 0;
ll MX = 3... | #include <bits/stdc++.h>
using namespace std;
#define all(a) a.begin(), a.end()
using ll = long long;
const int INF = 1 << 30;
const ll INFll = 1LL << 62;
const int mod = int(1e9) + 7;
using P = pair<ll, ll>;
using ld = long double;
int main() {
int H, W, m;
cin >> H >> W >> m;
int mxh = 0, mxw = 0;
ll MX = 3... | insert | 42 | 42 | 42 | 47 | TLE | |
p02580 | C++ | Time Limit Exceeded | using namespace std;
#include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
typedef double db;
typedef string str;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<db, db> pd;
typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<ll> vl;
typedef vector<db> vd;
typedef vecto... | using namespace std;
#include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
typedef double db;
typedef string str;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<db, db> pd;
typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<ll> vl;
typedef vector<db> vd;
typedef vecto... | replace | 552 | 556 | 552 | 561 | TLE | |
p02580 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define int long long
map<int, int> row, col;
vector<int> a, b;
map<pair<int, int>, int> mp;
signed main() {
int n, m, k;
cin >> n >> m >> k;
int maxn_row = -1, maxn_col = -1;
for (int i = 0; i < k; i++) {
int x, y;
cin >> x >> y;
row[x]++, col[y]++;
... | #include <bits/stdc++.h>
using namespace std;
#define int long long
map<int, int> row, col;
vector<int> a, b;
map<pair<int, int>, int> mp;
signed main() {
int n, m, k;
cin >> n >> m >> k;
int maxn_row = -1, maxn_col = -1;
for (int i = 0; i < k; i++) {
int x, y;
cin >> x >> y;
row[x]++, col[y]++;
... | replace | 26 | 29 | 26 | 39 | TLE | |
p02580 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
int row[30020];
int maxi[30020];
int col[30020];
vector<pii> cols;
map<pii, int> m;
int main() {
int H, W, M, ans = 0;
scanf("%d%d%d", &H, &W, &M);
for (int i = 0, x, y; i < M; i++) {
scanf("%d%d", &x, &y);
m[... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
int row[300020];
int maxi[300020];
int col[300020];
vector<pii> cols;
map<pii, int> m;
int main() {
int H, W, M, ans = 0;
scanf("%d%d%d", &H, &W, &M);
for (int i = 0, x, y; i < M; i++) {
scanf("%d%d", &x, &y);
... | replace | 5 | 8 | 5 | 8 | 0 | |
p02580 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define endl '\n'
typedef pair<int, int> P;
typedef long long ll;
set<P> Check;
int H[30005], W[30005];
int main() {
// cin.tie(0);
// ios_base::sync_with_stdio(false);
int h, w, m;
cin >> h >> w;
cin >> m;
fo... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define endl '\n'
typedef pair<int, int> P;
typedef long long ll;
set<P> Check;
int H[300005], W[300005];
int main() {
// cin.tie(0);
// ios_base::sync_with_stdio(false);
int h, w, m;
cin >> h >> w;
cin >> m;
... | replace | 7 | 8 | 7 | 8 | 0 | |
p02580 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
bool bad(const pair<int, int> &p1, const pair<int, int> &p2) {
return p1.first > p2.first;
}
void solve() {
int H, W, M;
cin >> H >> W >> M;
vector<int> row(H, 0);
vector<int> col(W, 0);
set<pair<int, int>> st;
for (int i = 0; i < M; ++... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
bool bad(const pair<int, int> &p1, const pair<int, int> &p2) {
return p1.first > p2.first;
}
void solve() {
int H, W, M;
cin >> H >> W >> M;
vector<int> row(H, 0);
vector<int> col(W, 0);
set<pair<int, int>> st;
for (int i = 0; i < M; ++... | insert | 47 | 47 | 47 | 51 | TLE | |
p02580 | C++ | Runtime Error | #include <memory.h>
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <uti... | #include <memory.h>
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <uti... | replace | 66 | 67 | 66 | 67 | 0 | |
p02580 | C++ | Runtime Error | /*
ABC026 高橋君の給料 DFS
int dfs(int n,vector<vector<int>> G){
int mi = 1000000000;
int ma = 0;
int w,v;
for(int i=0;i<G[n].size();i++){
v = G[n][i];
if(G[v].size() == 0)w = 1;
else w = dfs(v,G);
mi = min(mi,w);
ma = max(ma,w);
}
return mi + ma + 1;
}
int main() {
int n;
cin >> n;
Gra... | /*
ABC026 高橋君の給料 DFS
int dfs(int n,vector<vector<int>> G){
int mi = 1000000000;
int ma = 0;
int w,v;
for(int i=0;i<G[n].size();i++){
v = G[n][i];
if(G[v].size() == 0)w = 1;
else w = dfs(v,G);
mi = min(mi,w);
ma = max(ma,w);
}
return mi + ma + 1;
}
int main() {
int n;
cin >> n;
Gra... | replace | 469 | 525 | 469 | 507 | 0 | |
p02580 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define lli long long int
#define double long double
#define all(x) x.begin(), x.end()
#define fast_io \
... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define lli long long int
#define double long double
#define all(x) x.begin(), x.end()
#define fast_io \
... | replace | 69 | 71 | 69 | 73 | 0 | |
p02580 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> Pii;
typedef pair<int, ll> Pil;
typedef pair<ll, ll> Pll;
typedef pair<ll, int> Pli;
#define fi first
#define se second
const ll MOD = 1e9 + 7;
const ll MOD2 = 998244353;
const ll MOD3 = 1812447359;
co... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> Pii;
typedef pair<int, ll> Pil;
typedef pair<ll, ll> Pll;
typedef pair<ll, int> Pli;
#define fi first
#define se second
const ll MOD = 1e9 + 7;
const ll MOD2 = 998244353;
const ll MOD3 = 1812447359;
co... | replace | 59 | 60 | 59 | 61 | TLE | |
p02580 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define R cin >>
#define ll long long
#define ln cout << '\n'
#define in(a) insert(a)
#define pb(a) push_back(a)
#define pd(a) printf("%.10f\n", a)
#define mem(a) memset(a, 0, sizeof(a))
#define all(c) (c).begin(), (c).end()
#define iter(c) ... | #include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define R cin >>
#define ll long long
#define ln cout << '\n'
#define in(a) insert(a)
#define pb(a) push_back(a)
#define pd(a) printf("%.10f\n", a)
#define mem(a) memset(a, 0, sizeof(a))
#define all(c) (c).begin(), (c).end()
#define iter(c) ... | replace | 33 | 34 | 33 | 34 | 0 | |
p02580 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main(int argc, const char *argv[]) {
//
int h, w, m;
cin >> h >> w >> m;
vector<pair<int, int>> tgts(m);
vector<int> cnt_row(h, 0), cnt_col(w, 0);
for (int i = 0; i < m; ++i) {
cin >> tgts[i].first >> tgts[i].second;
cnt_row[tgts[i].first]++;
... | #include <bits/stdc++.h>
using namespace std;
int main(int argc, const char *argv[]) {
//
int h, w, m;
cin >> h >> w >> m;
vector<pair<int, int>> tgts(m);
vector<int> cnt_row(h, 0), cnt_col(w, 0);
for (int i = 0; i < m; ++i) {
cin >> tgts[i].first >> tgts[i].second;
tgts[i].first--;
tgts[i].s... | insert | 13 | 13 | 13 | 15 | 0 | |
p02580 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; i++)
#define RFOR(i, a, n) for (ll i = (ll)n - 1; i >= (ll)a; i--)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) RFOR(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define bra(first, second) '(' << fi... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; i++)
#define RFOR(i, a, n) for (ll i = (ll)n - 1; i >= (ll)a; i--)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) RFOR(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define bra(first, second) '(' << fi... | replace | 48 | 49 | 48 | 56 | TLE | |
p02580 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REPD(i, n) for (ll i = n - 1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = a; i <= (ll)(b); i++)
#define FORD(i, a, b) for (ll i = a; i >= (l... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REPD(i, n) for (ll i = n - 1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = a; i <= (ll)(b); i++)
#define FORD(i, a, b) for (ll i = a; i >= (l... | replace | 34 | 49 | 34 | 47 | TLE | |
p02580 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define FASTIO \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
using namespace std;
using ll = long... | #include <bits/stdc++.h>
#define FASTIO \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
using namespace std;
using ll = long... | insert | 41 | 41 | 41 | 43 | TLE | |
p02580 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define N 200200
pair<int, int> v[N];
pair<int, int> l[N], c[N];
int i, x, y, ml, mc, h, w, n, ii, jj, j;
long long cntc, cntl, ans;
map<pair<int, int>, bool> sel;
int main() {
cin >> h >> w >> n;
for (i = 0; i < n; ++i) {
cin >> v[i].first >> v[i].second;
sel[... | #include <bits/stdc++.h>
using namespace std;
#define N 300300
pair<int, int> v[N];
pair<int, int> l[N], c[N];
int i, x, y, ml, mc, h, w, n, ii, jj, j;
long long cntc, cntl, ans;
map<pair<int, int>, bool> sel;
int main() {
cin >> h >> w >> n;
for (i = 0; i < n; ++i) {
cin >> v[i].first >> v[i].second;
sel[... | replace | 3 | 4 | 3 | 4 | 0 | |
p02580 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
template <typename T>
using ordered_set =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define int long long
#define ar array
#defin... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
template <typename T>
using ordered_set =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define int long long
#define ar array
#defin... | replace | 53 | 54 | 53 | 59 | TLE | |
p02580 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define ff first
#define ss second
#define int long long
#define all(x) (x).begin(), (x).end()
#define what_is(x) cerr << #x << " is " << x << endl;
#define eb emplace_back
#define pii pair<int, int>
using namespace std;
const int mxn = 300005;
vector<int> fx(mxn, 0), fy(mxn, 0);
void solve()... | #include <bits/stdc++.h>
#define ff first
#define ss second
#define int long long
#define all(x) (x).begin(), (x).end()
#define what_is(x) cerr << #x << " is " << x << endl;
#define eb emplace_back
#define pii pair<int, int>
using namespace std;
const int mxn = 300005;
vector<int> fx(mxn, 0), fy(mxn, 0);
void solve()... | replace | 39 | 40 | 39 | 45 | TLE | |
p02580 | C++ | Runtime Error | #include <cstring>
#include <iostream>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
int main() {
const int MAX = 30000;
int H, W, M;
cin >> H >> W >> M;
int h[MAX], w[MAX] = {0};
for (int i = 0; i < M; i++) {
cin >> h[i] >> w[i];
h[i]--;
w[i]--;
}
// Cre... | #include <cstring>
#include <iostream>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
int main() {
const int MAX = 300000;
int H, W, M;
cin >> H >> W >> M;
int h[MAX], w[MAX] = {0};
for (int i = 0; i < M; i++) {
cin >> h[i] >> w[i];
h[i]--;
w[i]--;
}
// Cr... | replace | 9 | 10 | 9 | 10 | 0 | |
p02580 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
int main() {
int H, W, M;
cin >> H >> W >> M;
vector<int> g(H), r(W);
map<pair<int, int>, int> mp;
int gm = 0, rm = 0;
for (int i = 0; i < M; i++) {
int h, w;
cin >> h >> w;
g[h - 1]++;
r[w - 1]++;
mp[make_pair(h - ... | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
int main() {
int H, W, M;
cin >> H >> W >> M;
vector<int> g(H), r(W);
map<pair<int, int>, int> mp;
int gm = 0, rm = 0;
for (int i = 0; i < M; i++) {
int h, w;
cin >> h >> w;
g[h - 1]++;
r[w - 1]++;
mp[make_pair(h - ... | insert | 38 | 38 | 38 | 40 | TLE | |
p02580 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define all(x) (x).begin(), (x).end()
using ll = long long;
string char_to_string(char val) { return string(1, val); }
int char_to_int(char val) { return val - '0'; }
template <class T> inline bool chmin(T ... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define all(x) (x).begin(), (x).end()
using ll = long long;
string char_to_string(char val) { return string(1, val); }
int char_to_int(char val) { return val - '0'; }
template <class T> inline bool chmin(T ... | replace | 60 | 61 | 60 | 61 | TLE | |
p02580 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int h, w, m;
typedef pair<int, int> P;
// 行与列
unordered_map<int, int> m1;
unordered_map<int, int> m2;
map<P, int> c;
int main() {
vector<int> col, row;
int ans = 0;
int max1 = -1, max2 = -1;
int index1, index2;
cin >> h >> w >> m;
int x, y... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int h, w, m;
typedef pair<int, int> P;
// 行与列
unordered_map<int, int> m1;
unordered_map<int, int> m2;
map<P, int> c;
int main() {
vector<int> col, row;
int ans = 0;
int max1 = -1, max2 = -1;
int index1, index2;
cin >> h >> w >> m;
int x, y... | insert | 54 | 54 | 54 | 56 | TLE | |
p02580 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long int
using namespace __gnu_pbds;
typedef tree<pair<ll, pair<ll, ll>>, null_type, less<pair<ll, pair<ll, ll>>>,
rb_tree_tag, tree_order_statistics_node_update>
... | #include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long int
using namespace __gnu_pbds;
typedef tree<pair<ll, pair<ll, ll>>, null_type, less<pair<ll, pair<ll, ll>>>,
rb_tree_tag, tree_order_statistics_node_update>
... | insert | 154 | 154 | 154 | 155 | TLE | |
p02580 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <string>
#include <vector>
#define fast \
ios_base::sync_with_stdio(0); \
cin.tie(0); ... | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <string>
#include <vector>
#define fast \
ios_base::sync_with_stdio(0); \
cin.tie(0); ... | insert | 101 | 101 | 101 | 103 | TLE | |
p02580 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
const double PI = 3.141592653589;
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(0); ... | #include <bits/stdc++.h>
using namespace std;
const double PI = 3.141592653589;
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(0); ... | insert | 93 | 93 | 93 | 97 | TLE | |
p02580 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define fi(a, b) for (int i = a; i < b; i++)
#define fj(a, b) for (int j = a; j < b; j++)
#define ff first
#define ss second
#define ll long long
#define ld long double
#define ull unsigned long long
#define bp(x) __builtin_popcount(x)
#define pr(x) ... | #include <bits/stdc++.h>
using namespace std;
#define fi(a, b) for (int i = a; i < b; i++)
#define fj(a, b) for (int j = a; j < b; j++)
#define ff first
#define ss second
#define ll long long
#define ld long double
#define ull unsigned long long
#define bp(x) __builtin_popcount(x)
#define pr(x) ... | replace | 51 | 52 | 51 | 60 | TLE | |
p02580 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll hor[300005], ver[300005];
int main() {
ll n, m, t, res = 0;
cin >> n >> m >> t;
set<pair<ll, ll>> s;
set<ll> px, py;
while (t--) {
ll x, y;
cin >> x >> y;
hor[x]++;
ver[y]++;
s.insert({x, y});
}
ll mx = *max_elem... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll hor[300005], ver[300005];
int main() {
ll n, m, t, res = 0;
cin >> n >> m >> t;
set<pair<ll, ll>> s;
set<ll> px, py;
while (t--) {
ll x, y;
cin >> x >> y;
hor[x]++;
ver[y]++;
s.insert({x, y});
}
ll mx = *max_elem... | insert | 35 | 35 | 35 | 39 | TLE | |
p02580 | Python | Time Limit Exceeded | #!/usr/bin/env python3
def main():
H, W, M = map(int, input().split())
bomb = [list(map(int, input().split())) for i in range(M)]
H_bomb = [0] * (H + 1)
W_bomb = [0] * (W + 1)
for b in bomb:
H_bomb[b[0]] += 1
W_bomb[b[1]] += 1
ans = max(H_bomb) + max(W_bomb)
H_bomb_index = ... | #!/usr/bin/env python3
def main():
H, W, M = map(int, input().split())
bomb = [list(map(int, input().split())) for i in range(M)]
H_bomb = [0] * (H + 1)
W_bomb = [0] * (W + 1)
for b in bomb:
H_bomb[b[0]] += 1
W_bomb[b[1]] += 1
max_h, max_w = max(H_bomb), max(W_bomb)
cnt = H... | replace | 11 | 25 | 11 | 17 | TLE | |
p02580 | Python | Runtime Error | H, W, M = map(int, input().split())
B = [list(map(int, input().split())) for _ in range(M)]
bombs_row = [0] * H
bombs_col = [0] * W
for b in B:
bombs_row[b[0] - 1] += 1
bombs_col[b[1] - 1] += 1
row_max = max(bombs_row)
col_max = max(bombs_col)
row_max_count = bombs_row.count(row_max)
col_max_count = bombs_... | H, W, M = map(int, input().split())
B = [list(map(int, input().split())) for _ in range(M)]
bombs_row = [0] * H
bombs_col = [0] * W
for b in B:
bombs_row[b[0] - 1] += 1
bombs_col[b[1] - 1] += 1
row_max = max(bombs_row)
col_max = max(bombs_col)
row_max_count = bombs_row.count(row_max)
col_max_count = bombs_... | replace | 24 | 25 | 24 | 25 | IndexError: list index out of range | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02580/Python/s510602402.py", line 25, in <module>
if bombs_row[b[0]] == row_max and bombs_col[b[1]] == col_max:
IndexError: list index out of range
|
p02580 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<vi> vvi;
#define INF 1000000000
#define pb push_back
#define sz(a) int((a).size())
#define all(c) c.begin(), c.end()
#define tr(c, i) for (typeof(c).begin() i =... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<vi> vvi;
#define INF 1000000000
#define pb push_back
#define sz(a) int((a).size())
#define all(c) c.begin(), c.end()
#define tr(c, i) for (typeof(c).begin() i =... | replace | 48 | 50 | 48 | 50 | 0 | |
p02580 | C++ | Time Limit Exceeded | // Fri Aug 21 19:35:37 IST 2020
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define forn(ii, a, b) for (int ii = (int)a; ii < (int)b; ii++)
#define scan(any) \
for (auto &i : any) ... | // Fri Aug 21 19:35:37 IST 2020
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define forn(ii, a, b) for (int ii = (int)a; ii < (int)b; ii++)
#define scan(any) \
for (auto &i : any) ... | insert | 59 | 59 | 59 | 62 | TLE | |
p02580 | C++ | Runtime Error | #include <bits/stdc++.h>
using ll = long long;
#define FOR(i, k, n) for (ll i = (k); i < (n); i++)
#define FORe(i, k, n) for (ll i = (k); i <= (n); i++)
#define FORr(i, k, n) for (ll i = (k)-1; i > (n); i--)
#define FORre(i, k, n) for (ll i = (k)-1; i >= (n); i--)
#define REP(i, n) FOR(i, 0, n)
#define REPr(i, n) FORre... | #include <bits/stdc++.h>
using ll = long long;
#define FOR(i, k, n) for (ll i = (k); i < (n); i++)
#define FORe(i, k, n) for (ll i = (k); i <= (n); i++)
#define FORr(i, k, n) for (ll i = (k)-1; i > (n); i--)
#define FORre(i, k, n) for (ll i = (k)-1; i >= (n); i--)
#define REP(i, n) FOR(i, 0, n)
#define REPr(i, n) FORre... | replace | 35 | 41 | 35 | 38 | 0 | |
p02580 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
using ll = long long;
using P = pair<ll, ll>... | #include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
using ll = long long;
using P = pair<ll, ll>... | insert | 76 | 76 | 76 | 83 | TLE | |
p02580 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
int main(void) {
int H, W, M;
cin >> H >> W >> M;
// map<int,int> X, Y;
// map< pair<int,int> ,int> mp;
vector... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
int main(void) {
int H, W, M;
cin >> H >> W >> M;
// map<int,int> X, Y;
// map< pair<int,int> ,int> mp;
vector... | replace | 45 | 46 | 45 | 47 | 0 | |
p02580 | C++ | Time Limit Exceeded | /*
author : seryu
title : ABC176E_"Bomber"
*/
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define reps(i, n) for (int i = 1; i <= n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
#define rreps(i, n) for (int i = n; i >= 1; i--)
#define mrep(i, j, n) for (int i ... | /*
author : seryu
title : ABC176E_"Bomber"
*/
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define reps(i, n) for (int i = 1; i <= n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
#define rreps(i, n) for (int i = n; i >= 1; i--)
#define mrep(i, j, n) for (int i ... | replace | 70 | 72 | 70 | 88 | TLE | |
p02580 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define MOD 1000000007
using namespace std;
using ll = long long;
int mp[1005][1005] = {};
int main() {
int h, w, m;
cin >> h >> w >> m;
vector<int> height(h), width(w);
set<pair<int, int>> block;
rep(i, m) {
int hei, wid;
... | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define MOD 1000000007
using namespace std;
using ll = long long;
int mp[1005][1005] = {};
int main() {
int h, w, m;
cin >> h >> w >> m;
vector<int> height(h), width(w);
set<pair<int, int>> block;
rep(i, m) {
int hei, wid;
... | replace | 27 | 33 | 27 | 32 | TLE | |
p02580 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define pb push_back
using namespace std;
typedef long long ll;
int main() {
int H, W, m;
cin >> H >> W >> m;
vector<int> a(H), b(W);
set<pair<int, int>> bomb;
rep(i, m) {
int h, w;
cin >> h >> w;
h--;
w--;
bomb.inser... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define pb push_back
using namespace std;
typedef long long ll;
int main() {
int H, W, m;
cin >> H >> W >> m;
vector<int> a(H), b(W);
set<pair<int, int>> bomb;
rep(i, m) {
int h, w;
cin >> h >> w;
h--;
w--;
bomb.inser... | insert | 29 | 29 | 29 | 33 | TLE | |
p02580 | C++ | Time Limit Exceeded | #pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define JAM(x) cout << #x << " = " << x << "\n"
#define II() \
({ ... | #pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define JAM(x) cout << #x << " = " << x << "\n"
#define II() \
({ ... | replace | 134 | 135 | 134 | 135 | TLE | |
p02580 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define maxn 30001
#define LL long long
#define inf 10000000000
#define mod 1000000007
#define pi 3.14159265359
using namespace std;
int dx[24... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define maxn 300010
#define LL long long
#define inf 10000000000
#define mod 1000000007
#define pi 3.14159265359
using namespace std;
int dx[2... | replace | 11 | 12 | 11 | 12 | 0 | |
p02580 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fi first
#define se second
#define inf 1e15
#define N 100005
int row[N];
int col[N];
vector<int> rowv, colv;
set<pair<int, int>> bomb;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int t = 1;
// ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fi first
#define se second
#define inf 1e15
#define N 300005
int row[N];
int col[N];
vector<int> rowv, colv;
set<pair<int, int>> bomb;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int t = 1;
// ... | replace | 8 | 9 | 8 | 9 | 0 | |
p02580 | C++ | Time Limit Exceeded | #pragma region header
#include <bits/stdc++.h>
#define int long long
#define all(a) begin(a), end(a)
#define rall(a) rbegin(a), rend(a)
#define mp make_pair
#define rep1(i, n) for (decltype(+n) i = 0; i < (n); i++)
#define rrep1(i, n) for (auto i = n - 1; i > static_cast<decltype(i)>(-1); i--)
#define rep2(i, a, b) for... | #pragma region header
#include <bits/stdc++.h>
#define int long long
#define all(a) begin(a), end(a)
#define rall(a) rbegin(a), rend(a)
#define mp make_pair
#define rep1(i, n) for (decltype(+n) i = 0; i < (n); i++)
#define rrep1(i, n) for (auto i = n - 1; i > static_cast<decltype(i)>(-1); i--)
#define rep2(i, a, b) for... | replace | 138 | 139 | 138 | 139 | TLE | |
p02580 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = int;
using ull = uint;
ull hashfunc(int64_t v) { return (ull)(v % 1000033LL); }
int64_t makekey(ll h, ll w) { return 1000037LL * h + w; }
const uint8_t HASH_EMPTY = 0;
const uint8_t HASH_EXIST = 1;
const uint8_t HASH_DELETED = 2;
template <class K, class V> st... | #include <bits/stdc++.h>
using namespace std;
using ll = int;
using ull = uint;
ull hashfunc(int64_t v) { return (ull)(v % 1000033LL); }
int64_t makekey(ll h, ll w) { return 1000037LL * h + 1000721LL * w + (h * w); }
const uint8_t HASH_EMPTY = 0;
const uint8_t HASH_EXIST = 1;
const uint8_t HASH_DELETED = 2;
template... | replace | 7 | 8 | 7 | 8 | TLE |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.