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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
p03202 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef int _loop_int;
#define REP(i, n) for (_loop_int i = 0; i < (_loop_int)(n); ++i)
#define FOR(i, a, b) for (_loop_int i = (_loop_int)(a); i < ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef int _loop_int;
#define REP(i, n) for (_loop_int i = 0; i < (_loop_int)(n); ++i)
#define FOR(i, a, b) for (_loop_int i = (_loop_int)(a); i < ... | replace | 83 | 85 | 83 | 85 | 0 | |
p03202 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
struct node {
map<int, int> s;
inline void clear(int x) {
while (s.size() && (--s.end())->first >= x)
s.erase(--s.end());
}
inline int &operator[](int x) {
if (!s.count(x))
s[x] = 0;
return s[x];
}
} s;
int n, a[200010];
inline int check(in... | #include <bits/stdc++.h>
using namespace std;
struct node {
map<int, int> s;
inline void clear(int x) {
while (s.size() && (--s.end())->first >= x)
s.erase(--s.end());
}
inline int &operator[](int x) {
if (!s.count(x))
s[x] = 0;
return s[x];
}
} s;
int n, a[200010];
inline int check(in... | replace | 37 | 38 | 37 | 44 | TLE | |
p03202 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
vector<long long> a;
bool check(int k) {
map<int, int> mp;
for (int i = 1; i < a.size(); i++) {
if (a[i] <= a[i - 1]) {
int p = a[i];
mp.erase(mp.upper_bound(p), mp.end());
while (mp[p] == k - 1) ... | #include <algorithm>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
vector<long long> a;
bool check(int k) {
map<int, int> mp;
for (int i = 1; i < a.size(); i++) {
if (a[i] > a[i - 1])
continue;
if (k == 1)
return false;
if (a[i] <= a[i - 1]) {
int p = a[i... | insert | 12 | 12 | 12 | 16 | TLE | |
p03202 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
const int MaxN = 200000 + 5;
int N;
int A[MaxN];
vector<pii> vec;
void init() {
scanf("%d", &N);
for (int i = 1; i <= N; ++i)
scanf("%d", &A[i]);
}
bool is_increase() {
for (int i = 2; i <= N; ++i)
if (A[i] <= A[i - 1])
r... | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
const int MaxN = 200000 + 5;
int N;
int A[MaxN];
vector<pii> vec;
void init() {
scanf("%d", &N);
for (int i = 1; i <= N; ++i)
scanf("%d", &A[i]);
}
bool is_increase() {
for (int i = 2; i <= N; ++i)
if (A[i] <= A[i - 1])
r... | replace | 102 | 103 | 102 | 103 | TLE | |
p03202 | C++ | Time Limit Exceeded | // #pragma GCC optimize(2)
// #pragma G++ optimize(2)
// #pragma comment(linker,"/STACK:102400000,102400000")
// #include <bits/stdc++.h>
#include <algorithm>
#include <array>
#include <atomic>
#include <bitset>
#include <cassert>
#include <ccomplex>
#include <cctype>
#include <cerrno>
#include <cfenv>
#include <cfloa... | // #pragma GCC optimize(2)
// #pragma G++ optimize(2)
// #pragma comment(linker,"/STACK:102400000,102400000")
// #include <bits/stdc++.h>
#include <algorithm>
#include <array>
#include <atomic>
#include <bitset>
#include <cassert>
#include <ccomplex>
#include <cctype>
#include <cerrno>
#include <cfenv>
#include <cfloa... | replace | 239 | 240 | 239 | 240 | TLE | |
p03202 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
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##_len = (n); i < i##_len; ++i)
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
template <class T> bool chmax(T &a, const T &b) {
if (a < ... | #include <bits/stdc++.h>
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##_len = (n); i < i##_len; ++i)
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
template <class T> bool chmax(T &a, const T &b) {
if (a < ... | replace | 84 | 85 | 84 | 89 | TLE | |
p03202 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
const int mx = 200005;
int n, a[mx], l, r = mx;
int main() {
scanf("%d", &n);
rep(i, n) scanf("%d", a + i);
while (l + 1 < r) {
int mid = (l + r) / 2, hight = 0;
bool ok = true;
map<int, int> mp;
rep(i, n)... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
const int mx = 200005;
int n, a[mx], l, r = mx;
int main() {
scanf("%d", &n);
rep(i, n) scanf("%d", a + i);
while (l + 1 < r) {
int mid = (l + r) / 2, hight = 0;
bool ok = true;
map<int, int> mp;
rep(i, n)... | insert | 17 | 17 | 17 | 21 | TLE | |
p03202 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define pp pair<int, int>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define ll long long
#define ld long double
#define all(a) (a).begin(), (a).end()
#define mk make_pair
ll MOD = 1000000007;
int inf = 1000001000;
ll INF = 100000000000000000;
int main() {
int ... | #include <bits/stdc++.h>
using namespace std;
#define pp pair<int, int>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define ll long long
#define ld long double
#define all(a) (a).begin(), (a).end()
#define mk make_pair
ll MOD = 1000000007;
int inf = 1000001000;
ll INF = 100000000000000000;
int main() {
int ... | insert | 36 | 36 | 36 | 38 | TLE | |
p03202 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
bool can(int n, const vector<int> &a, int x) {
map<int, int> ma;
for (int i = 1; i < n; ++i) {
if (a[i] > a[i - 1])
continue;
int k = a[i];
auto p = ma.upper_bound(k);
if (p != ma.end())
ma.erase(p);
++ma[k];
while (k > 0 && ma[k] ==... | #include <bits/stdc++.h>
using namespace std;
bool can(int n, const vector<int> &a, int x) {
if (x == 1)
for (int i = 1; i < n; ++i)
if (a[i] <= a[i - 1])
return false;
map<int, int> ma;
for (int i = 1; i < n; ++i) {
if (a[i] > a[i - 1])
continue;
int k = a[i];
auto p = ma.upp... | insert | 4 | 4 | 4 | 8 | TLE | |
p03202 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include ... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include ... | replace | 82 | 86 | 82 | 92 | TLE | |
p03202 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
bool f(const long kind, const size_t n, const vector<long> &a) {
map<long, long> c;
for (size_t i = 0; i < n - 1; i++) {
if (a[i] >= a[i + 1]) {
for_each(c.lower_bound(a[i + 1]), c.end(),
[](pair<const long, long> &x) { x.second = 0; });
... | #include <bits/stdc++.h>
using namespace std;
bool f(const long kind, const size_t n, const vector<long> &a) {
map<long, long> c;
for (size_t i = 1; i < n; i++) {
if (a[i - 1] >= a[i]) {
c.erase(c.lower_bound(a[i]), c.end());
long j = a[i] - 1;
c[j]++;
for (;;) {
if (c[j] < kind... | replace | 5 | 10 | 5 | 9 | TLE | |
p03202 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define _USE_MATH_DEFINES_
#define ll long long
#define ld long double
#define Accepted 0
#define pb push_back
#define mp make_pair
#define sz(x) (int)(x.size())
#define every(x) x.begin(), x.end()
#define F first
#define S second
#define lb lower_bound
#define ub upper_bo... | #include <bits/stdc++.h>
using namespace std;
#define _USE_MATH_DEFINES_
#define ll long long
#define ld long double
#define Accepted 0
#define pb push_back
#define mp make_pair
#define sz(x) (int)(x.size())
#define every(x) x.begin(), x.end()
#define F first
#define S second
#define lb lower_bound
#define ub upper_bo... | insert | 45 | 45 | 45 | 48 | TLE | |
p03202 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = int(a); i < int(b); i++)
#define rer(i, a, b) for (int i = int(a) - 1; i >= int(b); i--)
using namespace std;
typedef long long int ll;
ll A[200000];
int N;
bool C(ll x) {
map<ll, int> m;
rep(i, 1, N) {
if (A[i] <= A[i - 1]) {
rer(j, A[i - 1] + 1... | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = int(a); i < int(b); i++)
#define rer(i, a, b) for (int i = int(a) - 1; i >= int(b); i--)
using namespace std;
typedef long long int ll;
ll A[200000];
int N;
bool C(ll x) {
map<ll, int> m;
rep(i, 1, N) {
if (A[i] <= A[i - 1]) {
m.erase(m.upper_bou... | replace | 12 | 13 | 12 | 13 | TLE | |
p03202 | C++ | Runtime Error | #include <bits/stdc++.h>
#define N 100010
using namespace std;
typedef long long ll;
char *p1, *p2, buf[100000];
#define nc() \
(p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 100000, stdin), p1 == p2) \
? EOF ... | #include <bits/stdc++.h>
#define N 200010
using namespace std;
typedef long long ll;
char *p1, *p2, buf[100000];
#define nc() \
(p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 100000, stdin), p1 == p2) \
? EOF ... | replace | 2 | 3 | 2 | 3 | 0 | |
p03202 | C++ | Time Limit Exceeded | #include <cstdio>
#include <iostream>
#include <map>
using namespace std;
int n, a[200005];
int lt = 1, rt, md, ans;
int f(int p) {
int i, t;
map<int, int> mp;
for (i = 2; i <= n; i++)
if (a[i] <= a[i - 1]) {
t = a[i];
mp.erase(mp.upper_bound(t), mp.end());
for (; t && mp[t] == p - 1; t--)... | #include <cstdio>
#include <iostream>
#include <map>
using namespace std;
int n, a[200005];
int lt = 1, rt, md, ans;
int f(int p) {
int i, t;
map<int, int> mp;
if (p == 1) {
for (i = 2; i <= n; i++)
if (a[i] <= a[i - 1])
return 0;
return 1;
}
for (i = 2; i <= n; i++)
if (a[i] <= a[... | insert | 11 | 11 | 11 | 17 | TLE | |
p03202 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
typedef long long ll;
inline int read() {
int x = 0, f = 1;
char ch = getchar();
while (ch < '0' || ch > '9') {
if (ch == '-')
f = -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9') {
x = (x ... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
typedef long long ll;
inline int read() {
int x = 0, f = 1;
char ch = getchar();
while (ch < '0' || ch > '9') {
if (ch == '-')
f = -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9') {
x = (x ... | replace | 50 | 52 | 50 | 53 | TLE | |
p03202 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < int(n); ++i)
#define rep1(i, n) for (int i = 1; i <= int(n); ++i)
#define all(a) (a).begin(), (a).end()
#define debug(x) cerr << (#x) << ": " << (x) << endl
int n;
vector<int> a;
void show(map<int, int> mp, int size) {
rep1(i, size)... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < int(n); ++i)
#define rep1(i, n) for (int i = 1; i <= int(n); ++i)
#define all(a) (a).begin(), (a).end()
#define debug(x) cerr << (#x) << ": " << (x) << endl
int n;
vector<int> a;
void show(map<int, int> mp, int size) {
rep1(i, size)... | replace | 21 | 22 | 21 | 22 | TLE | |
p03202 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <vector>
#define M 400010
#define PI pair<int, int>
#define f first
#define s second
using namespace std;
typedef long long ll;
int n, ans;
int X[M];
bool check(int x) {
int t = 1;
vector<PI> V(0);
for (int i = 2; i <= n; i++)
if (X[i] <= X... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <vector>
#define M 400010
#define PI pair<int, int>
#define f first
#define s second
using namespace std;
typedef long long ll;
int n, ans;
int X[M];
bool check(int x) {
int t = 1;
vector<PI> V(0);
for (int i = 2; i <= n; i++)
if (X[i] <= X... | replace | 42 | 43 | 42 | 43 | TLE | |
p03202 | C++ | Time Limit Exceeded | /*{{{*/
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <limits.h>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#define SZ(X) ((int)(X).size())
#defin... | /*{{{*/
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <limits.h>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#define SZ(X) ((int)(X).size())
#defin... | replace | 133 | 134 | 133 | 134 | TLE | |
p03202 | C++ | Runtime Error | #include <stdio.h>
int a[131072];
int wz[131072], val[131072];
int num = 0;
int mid;
bool inc(int wz1) {
if (wz1 <= 0) {
return false;
}
if (mid == 1) {
return false;
}
while (num) {
if (wz[num - 1] <= wz1) {
break;
}
num--;
}
if (!num) {
wz[num] = wz1;
val[num] = 0;
... | #include <stdio.h>
int a[262144];
int wz[262144], val[262144];
int num = 0;
int mid;
bool inc(int wz1) {
if (wz1 <= 0) {
return false;
}
if (mid == 1) {
return false;
}
while (num) {
if (wz[num - 1] <= wz1) {
break;
}
num--;
}
if (!num) {
wz[num] = wz1;
val[num] = 0;
... | replace | 1 | 3 | 1 | 3 | 0 | |
p03202 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int n, m;
int i, j, k;
string str;
int a[200000];
bool test() {
vector<int> d, dv;
d.push_back(a[0]);
dv.push_back(1);
for (i = 1; i < n; i++) {
if (a[i] > a[i - 1]) {
d.push_back(a[i]);
dv.push_back(1);
} else if (a[i] == a[i - 1]) {
dv... | #include <bits/stdc++.h>
using namespace std;
int n, m;
int i, j, k;
string str;
int a[200000];
bool test() {
if (m == 1) {
for (i = 1; i < n; i++) {
if (a[i] <= a[i - 1]) {
return false;
}
}
}
vector<int> d, dv;
d.push_back(a[0]);
dv.push_back(1);
for (i = 1; i < n; i++) {
... | insert | 9 | 9 | 9 | 16 | TLE | |
p03202 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MX = 200005;
int A[MX];
vector<pair<int, int>> st;
int lt[MX];
int a[MX];
int M;
void inc(int i, int t) {
while (true) {
int j = (int)st.size() - 1;
while (st[j].first > i)
j--;
if (lt[i] < st[j].second) {
lt[i]... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MX = 200005;
int A[MX];
vector<pair<int, int>> st;
int lt[MX];
int a[MX];
int M;
void inc(int i, int t) {
while (true) {
int j = (int)st.size() - 1;
while (st[j].first > i)
j--;
if (lt[i] < st[j].second) {
lt[i]... | insert | 42 | 42 | 42 | 44 | 0 | |
p03202 | C++ | Time Limit Exceeded | #include <algorithm>/*{{{*/
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
using namespace std;
typedef long long lld;
typedef long double lf;
typedef unsi... | #include <algorithm>/*{{{*/
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
using namespace std;
typedef long long lld;
typedef long double lf;
typedef unsi... | replace | 70 | 71 | 70 | 73 | TLE | |
p03202 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cassert>
#include <cmath>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define InfL 1000000000
#define InfLL 1000000000000000000LL
#define mod 1000000007
#define rep(i, n) for (int(i) = 0; (i)... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define InfL 1000000000
#define InfLL 1000000000000000000LL
#define mod 1000000007
#define rep(i, n) for (int(i) = 0; (i)... | replace | 39 | 40 | 39 | 44 | TLE | |
p03202 | C++ | Runtime Error | #include <cstdio>
#include <vector>
using namespace std;
const int N = 100500;
int L[N];
int n;
struct item {
bool zero;
int x;
};
bool can(int al) {
vector<item> st = {{true, L[0]}};
for (int i = 1; i < n; i++) {
if (L[i] > L[i - 1]) {
st.emplace_back(item{true, L[i] - L[i - 1]});
} else if ... | #include <cstdio>
#include <vector>
using namespace std;
const int N = 3e5 + 7;
int L[N];
int n;
struct item {
bool zero;
int x;
};
bool can(int al) {
vector<item> st = {{true, L[0]}};
for (int i = 1; i < n; i++) {
if (L[i] > L[i - 1]) {
st.emplace_back(item{true, L[i] - L[i - 1]});
} else if... | replace | 4 | 5 | 4 | 5 | 0 | |
p03202 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#define _USE_MATH_DEFINES
#include <functional>
#include <math.h>
using namespace std;
#define rep(i, x) for (ll i = 0; i < x; i++)
#define repn(i, x) for (ll i... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#define _USE_MATH_DEFINES
#include <functional>
#include <math.h>
using namespace std;
#define rep(i, x) for (ll i = 0; i < x; i++)
#define repn(i, x) for (ll i... | insert | 134 | 134 | 134 | 138 | TLE | |
p03202 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#define N 200005
using namespace std;
int n, a[N], cur;
class Segment_T {
struct tree {
int lc, rc, v, f;
void set() {
v = 0;
f = 1;
}
} t[N * 100];
int root, sz;
bool flag;
... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#define N 200005
using namespace std;
int n, a[N], cur;
class Segment_T {
struct tree {
int lc, rc, v, f;
void set() {
v = 0;
f = 1;
}
} t[N * 100];
int root, sz;
bool flag;
... | insert | 106 | 106 | 106 | 111 | TLE | |
p03202 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#include <iomanip>
using namespace std;
#define reps(i, s, n) for (int i = s; i < n; i++)
#define rep(i, n) reps(i, 0, n)
#define Rreps(i, n, e) for (int i = n - 1; i >= e; --i)
#define Rrep(i, n) Rreps(i, n, 0)
#define ALL(a) a.begin(), a.end()
#define fi first
#define se second
#define mp mak... | #include <bits/stdc++.h>
#include <iomanip>
using namespace std;
#define reps(i, s, n) for (int i = s; i < n; i++)
#define rep(i, n) reps(i, 0, n)
#define Rreps(i, n, e) for (int i = n - 1; i >= e; --i)
#define Rrep(i, n) Rreps(i, n, 0)
#define ALL(a) a.begin(), a.end()
#define fi first
#define se second
#define mp mak... | delete | 37 | 39 | 37 | 37 | TLE | |
p03202 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for (int i =... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for (int i =... | replace | 47 | 48 | 47 | 58 | TLE | |
p03202 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, g, I;
cin >> n;
long long S[n], M = 5000000000, p, k, L = 0, R = 200002, t;
for (int i = 0; i < n; i++) {
cin >> S[i];
}
while (R - L > 1) {
t = (L + R) / 2;
g = 1;
set<long long> Se;
set<long long>::iterator it;
map... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, g, I;
cin >> n;
long long S[n], M = 5000000000, p, k, L = 0, R = 200002, t;
for (int i = 0; i < n; i++) {
cin >> S[i];
}
while (R - L > 1) {
t = (L + R) / 2;
g = 1;
set<long long> Se;
set<long long>::iterator it;
uno... | replace | 16 | 17 | 16 | 17 | TLE | |
p03202 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
const int MOD = 1e9 + 7;
const int iINF = 1000000000;
const long long int llINF = 1000000000000000000;
u... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
const int MOD = 1e9 + 7;
const int iINF = 1000000000;
const long long int llINF = 1000000000000000000;
u... | replace | 68 | 69 | 68 | 80 | 0 | |
p03202 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast")
typedef long long lint;
typedef unsigned int uint;
typedef pair<int, int> pii;
typedef pair<lint, lint> pll;
typedef unsigned long long ulint;
#define endl '\n'
#define fst first
#define sed second
#define pb push_back
#define rint register int... | #include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast")
typedef long long lint;
typedef unsigned int uint;
typedef pair<int, int> pii;
typedef pair<lint, lint> pll;
typedef unsigned long long ulint;
#define endl '\n'
#define fst first
#define sed second
#define pb push_back
#define rint register int... | insert | 25 | 25 | 25 | 32 | TLE | |
p03202 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define REP(i, a, b) for (int i = (a), _end_ = (b); i <= _end_; i++)
#define DREP(i, a, b) for (int i = (a), _end_ = (b); i >= _end_; i--)
#define EREP(i, u) for (int i = start[u]; i; i = e[i].next)
#define fi first
#define se second
#define mkr(a, b) m... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define REP(i, a, b) for (int i = (a), _end_ = (b); i <= _end_; i++)
#define DREP(i, a, b) for (int i = (a), _end_ = (b); i >= _end_; i--)
#define EREP(i, u) for (int i = start[u]; i; i = e[i].next)
#define fi first
#define se second
#define mkr(a, b) m... | insert | 54 | 54 | 54 | 58 | TLE | |
p03202 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, s, t) for (int i = s; i <= (t); ++i)
#define dec(i, s, t) for (int i = s; i >= (t); --i)
#define mp(a, b) make_pair(a, b)
using namespace std;
const int N = 1e5 + 50;
int n, a[N];
bool chk(int x) {
if (x == 1) {
rep(i, 2, n) if (a[i] <= a[i - 1]) return false;
return t... | #include <bits/stdc++.h>
#define rep(i, s, t) for (int i = s; i <= (t); ++i)
#define dec(i, s, t) for (int i = s; i >= (t); --i)
#define mp(a, b) make_pair(a, b)
using namespace std;
const int N = 3e5 + 50;
int n, a[N];
bool chk(int x) {
if (x == 1) {
rep(i, 2, n) if (a[i] <= a[i - 1]) return false;
return t... | replace | 5 | 6 | 5 | 6 | 0 | |
p03202 | C++ | Time Limit Exceeded | // #pragma GCC optimize("Ofast")
// #pragma GCC target("avx2,tune=native")
// #pragma GCC optimize("unroll-loops")
#pragma GCC optimize("trapv")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define pb... | // #pragma GCC optimize("Ofast")
// #pragma GCC target("avx2,tune=native")
// #pragma GCC optimize("unroll-loops")
// #pragma GCC optimize("trapv")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define... | replace | 3 | 4 | 3 | 4 | TLE | |
p03202 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define MP make_pair
using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
const int INF = 1e9 + 7;
int n, a[200005];
bool check(int m) {
map<int, int> cur;
for (i... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define MP make_pair
using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
const int INF = 1e9 + 7;
int n, a[200005];
bool check(int m) {
if (m == 1) {
for (int ... | insert | 13 | 13 | 13 | 19 | TLE | |
p03202 | C++ | Time Limit Exceeded | #include "bits/stdc++.h"
using namespace std;
using LL = long long;
using ULL = unsigned long long;
const double PI = acos(-1);
template <class T> constexpr T INF() { return ::std::numeric_limits<T>::max(); }
template <class T> constexpr T HINF() { return INF<T>() / 2; }
template <typename T_char> T_char TL(T_char cX) ... | #include "bits/stdc++.h"
using namespace std;
using LL = long long;
using ULL = unsigned long long;
const double PI = acos(-1);
template <class T> constexpr T INF() { return ::std::numeric_limits<T>::max(); }
template <class T> constexpr T HINF() { return INF<T>() / 2; }
template <typename T_char> T_char TL(T_char cX) ... | replace | 105 | 106 | 105 | 106 | TLE | |
p03202 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++)
cin >> A[i];
int l = 0, r = N;
while (r - l > 1) {
int c = (l + r) / 2;
map<int, int> mp;
for (int i = 1; i < N; i++) {
if (A[i] >= 100000)
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++)
cin >> A[i];
int l = 0, r = N;
while (r - l > 1) {
int c = (l + r) / 2;
map<int, int> mp;
for (int i = 1; i < N; i++) {
if (A[i] >= 100000)
... | insert | 28 | 28 | 28 | 30 | TLE | |
p03202 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5;
int n, a[maxn + 3];
bool check(int k) {
map<int, int> M;
for (int i = 1; i <= n; i++) {
if (a[i] <= a[i - 1]) {
while (!M.empty() && M.rbegin()->first > a[i]) {
map<int, int>::iterator it = M.end();
M.erase(--it);
... | #include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5;
int n, a[maxn + 3];
bool check(int k) {
map<int, int> M;
for (int i = 1; i <= n; i++) {
if (a[i] <= a[i - 1]) {
if (k == 1) {
return false;
}
while (!M.empty() && M.rbegin()->first > a[i]) {
map<int, int>::it... | insert | 10 | 10 | 10 | 13 | TLE | |
p03202 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define SORT(x) sort((x).begin(), (x).end())
#define ALL(x) (x).begin(), (x).end()
#define rep(i, n) for (ll i = 0; i < n; i++)
#define reps(i, m, n) for (ll i = m; i < n; i++)
#define repr(i, m, n) for (ll i = m; i >= n; i--)
template <class T> bool maxi(T &a, const T &b) {
if (a < b) {
... | #include <bits/stdc++.h>
#define SORT(x) sort((x).begin(), (x).end())
#define ALL(x) (x).begin(), (x).end()
#define rep(i, n) for (ll i = 0; i < n; i++)
#define reps(i, m, n) for (ll i = m; i < n; i++)
#define repr(i, m, n) for (ll i = m; i >= n; i--)
template <class T> bool maxi(T &a, const T &b) {
if (a < b) {
... | replace | 47 | 48 | 47 | 48 | TLE | |
p03202 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int MAX_N = 2e5 + 10;
int N, A[MAX_N];
bool check(int sigma) {
static pair<int, int> stk[MAX_N];
int top = 0;
for (int i = 1; i <= N; i++) {
int delta = A[i] - A[i - 1];
if (delta > 0) {
stk[++top] = make_pair(1, delta);
} else {
whil... | #include <bits/stdc++.h>
using namespace std;
const int MAX_N = 2e5 + 10;
int N, A[MAX_N];
bool check(int sigma) {
static pair<int, int> stk[MAX_N];
int top = 0;
for (int i = 1; i <= N; i++) {
int delta = A[i] - A[i - 1];
if (delta > 0) {
stk[++top] = make_pair(1, delta);
} else {
whil... | replace | 38 | 39 | 38 | 41 | 0 | |
p03202 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <queue>
using namespace std;
int n;
int a[200005], l, r, tail;
struct que {
int x, v;
} sta[200005];
void insert(int x, int v) {
while (sta[tail].x > x)
tail--;
if (sta[tail].x == x)
... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <queue>
using namespace std;
int n;
int a[200005], l, r, tail;
struct que {
int x, v;
} sta[200005];
void insert(int x, int v) {
while (sta[tail].x > x)
tail--;
if (sta[tail].x == x)
... | replace | 43 | 44 | 43 | 44 | TLE | |
p03202 | C++ | Time Limit Exceeded | //
// main.cpp
//
#include <algorithm>
#include <array>
#include <assert.h>
#include <complex>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <math.h>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#inclu... | //
// main.cpp
//
#include <algorithm>
#include <array>
#include <assert.h>
#include <complex>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <math.h>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#inclu... | insert | 55 | 55 | 55 | 63 | TLE | |
p03203 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define range(i, m, n) for (int i = m; i < n; i++)
#define husk(i, m, n) for (int i = m; i > n; i--)
int n, h, w;
int main() {
cin >> h >> w >> n;
set<pair<int, int>> obs;
vector<vector<int>> to(w);
range(i, 0, n) {
int x, y;
cin >> x >> y;
x--;
... | #include <bits/stdc++.h>
using namespace std;
#define range(i, m, n) for (int i = m; i < n; i++)
#define husk(i, m, n) for (int i = m; i > n; i--)
int n, h, w;
int main() {
cin >> h >> w >> n;
set<pair<int, int>> obs;
vector<vector<int>> to(w);
range(i, 0, n) {
int x, y;
cin >> x >> y;
x--;
... | replace | 20 | 21 | 20 | 21 | 0 | |
p03203 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
int n, m, q;
#define Maxn 100010
int mins[Maxn];
inline void rd(int &x) {
x = 0;
char ch = getchar();
while (ch < '0' || ch > '9')
ch = getchar();
while (ch >= '0' && ch <= '9') {
x = x * 10 + ch - '0';
... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
int n, m, q;
#define Maxn 200010
int mins[Maxn];
inline void rd(int &x) {
x = 0;
char ch = getchar();
while (ch < '0' || ch > '9')
ch = getchar();
while (ch >= '0' && ch <= '9') {
x = x * 10 + ch - '0';
... | replace | 6 | 7 | 6 | 7 | 0 | |
p03203 | C++ | Runtime Error | #include <algorithm>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <tuple>
#include <vector>
using namesp... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <tuple>
#include <vector>
using namesp... | replace | 32 | 33 | 32 | 33 | 0 | |
p03203 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int h, w, n;
cin >> h >> w >> n;
set<int> xs[w];
for (int i = 0; i < n; i++) {
int x, y;
cin >> x >> y;
--y;
--x;
xs[y].insert(x);
}
for (int i = 0; i < w; i++) {
xs[i].insert(h);
}
if (h == 1 || xs[1].find(0) != xs[1].e... | #include <bits/stdc++.h>
using namespace std;
int main() {
int h, w, n;
cin >> h >> w >> n;
set<int> xs[w];
for (int i = 0; i < n; i++) {
int x, y;
cin >> x >> y;
--y;
--x;
xs[y].insert(x);
}
for (int i = 0; i < w; i++) {
xs[i].insert(h);
}
if (h == 1 || (w > 1 && xs[1].find(0) ... | replace | 17 | 18 | 17 | 18 | TLE | |
p03203 | C++ | Runtime Error | #include <bits/stdc++.h>
#define GET_MACRO(_1, _2, _3, _4, _5, _6, _7, _8, NAME, ...) NAME
#define pr(...) \
cerr << GET_MACRO(__VA_ARGS__, pr8, pr7, pr6, pr5, pr4, pr3, pr2, \
pr1)(__VA_ARGS__) ... | #include <bits/stdc++.h>
#define GET_MACRO(_1, _2, _3, _4, _5, _6, _7, _8, NAME, ...) NAME
#define pr(...) \
cerr << GET_MACRO(__VA_ARGS__, pr8, pr7, pr6, pr5, pr4, pr3, pr2, \
pr1)(__VA_ARGS__) ... | replace | 112 | 113 | 112 | 113 | 0 | |
p03203 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define repl(i, l, r) for (ll i = (l); i < (r); i++)
#define per(i, n) for (ll i = n - 1; i >= 0; i--)
#define perl(i, r, l) for (ll i = r - 1; i >= l; i--)
#define fi first
#define se second
#define pb push_back
#define ins inse... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define repl(i, l, r) for (ll i = (l); i < (r); i++)
#define per(i, n) for (ll i = n - 1; i >= 0; i--)
#define perl(i, r, l) for (ll i = r - 1; i >= l; i--)
#define fi first
#define se second
#define pb push_back
#define ins inse... | replace | 66 | 67 | 66 | 68 | 0 | |
p03203 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> Pii;
typedef pair<ll, ll> Pll;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rep2(i, a, b) for (ll i = (a); i < (b); ++i)
#define debug(x) cout << #x << '=' << x << endl
#define all(v) (v).begin(), (v).end()
const ll MOD... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> Pii;
typedef pair<ll, ll> Pll;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rep2(i, a, b) for (ll i = (a); i < (b); ++i)
#define debug(x) cout << #x << '=' << x << endl
#define all(v) (v).begin(), (v).end()
const ll MOD... | replace | 53 | 54 | 53 | 54 | 0 | |
p03203 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef ve... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef ve... | insert | 26 | 26 | 26 | 27 | 0 | |
p03203 | C++ | Runtime Error | #include <bits/stdc++.h>
#define int long long
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef pair<int, int> pii;
const int INF = 1l << 60;
#define u_b upper_bound
#define l_b lower_bound
int shortest[200200];
set<int> obj[200200];
signed main() {
int H, W, N;
cin >> H >> W >> N;
... | #include <bits/stdc++.h>
#define int long long
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef pair<int, int> pii;
const int INF = 1l << 60;
#define u_b upper_bound
#define l_b lower_bound
int shortest[200200];
set<int> obj[200200];
signed main() {
int H, W, N;
cin >> H >> W >> N;
... | delete | 46 | 48 | 46 | 46 | 0 | |
p03203 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <iomanip>
using namespace std;
#define reps(i, s, n) for (int i = s; i < n; i++)
#define rep(i, n) reps(i, 0, n)
#define Rreps(i, n, e) for (int i = n - 1; i >= e; --i)
#define Rrep(i, n) Rreps(i, n, 0)
#define ALL(a) a.begin(), a.end()
#define fi first
#define se second
#define mp mak... | #include <bits/stdc++.h>
#include <iomanip>
using namespace std;
#define reps(i, s, n) for (int i = s; i < n; i++)
#define rep(i, n) reps(i, 0, n)
#define Rreps(i, n, e) for (int i = n - 1; i >= e; --i)
#define Rrep(i, n) Rreps(i, n, 0)
#define ALL(a) a.begin(), a.end()
#define fi first
#define se second
#define mp mak... | replace | 28 | 29 | 28 | 34 | 0 | |
p03203 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
set<int> Se[100001];
int main() {
int n, m, k, X, Y, Mi = 20000000, t = 0;
cin >> m >> n >> k;
set<int>::iterator it;
for (int i = 0; i < k; i++) {
cin >> X >> Y;
X--;
Y--;
Se[Y].insert(X);
}
for (int i = 0; i < n; i++) {
Se[i].insert(m);
... | #include <bits/stdc++.h>
using namespace std;
set<int> Se[200001];
int main() {
int n, m, k, X, Y, Mi = 20000000, t = 0;
cin >> m >> n >> k;
set<int>::iterator it;
for (int i = 0; i < k; i++) {
cin >> X >> Y;
X--;
Y--;
Se[Y].insert(X);
}
for (int i = 0; i < n; i++) {
Se[i].insert(m);
... | replace | 4 | 5 | 4 | 5 | 0 | |
p03203 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(it, st, en) for (int it = (st); it < (int)(en); ++it)
#define all(c) (c).begin(), (c).end()
#define debug(x) cerr << #x << " = " << x << endl
#define eb emplace_back
#define X first
#define Y second
typedef long long int ll;
typedef long double ld;
typedef vecto... | #include <bits/stdc++.h>
using namespace std;
#define rep(it, st, en) for (int it = (st); it < (int)(en); ++it)
#define all(c) (c).begin(), (c).end()
#define debug(x) cerr << #x << " = " << x << endl
#define eb emplace_back
#define X first
#define Y second
typedef long long int ll;
typedef long double ld;
typedef vecto... | replace | 17 | 18 | 17 | 18 | 0 | |
p03203 | C++ | Runtime Error | #define _USE_MATH_DEFINES
#define _CRT_SECURE_NO_WARNINGS
#include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define rrep(i, n) for (int i = (n)-1; i >= 0; --i)
#define rfor(i, m, n) for (int i = (m); i >= (n); --i)
#define sz(x) ((int)(x).size(... | #define _USE_MATH_DEFINES
#define _CRT_SECURE_NO_WARNINGS
#include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define rrep(i, n) for (int i = (n)-1; i >= 0; --i)
#define rfor(i, m, n) for (int i = (m); i >= (n); --i)
#define sz(x) ((int)(x).size(... | replace | 587 | 588 | 587 | 588 | 0 | |
p03203 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int H, W, N;
int main() {
cin >> H >> W >> N;
vector<vector<int>> G(H + 1);
vector<set<int>> A(H + 1);
for (int i = 0; i <= H; i++) {
G[i].push_back(W);
A[i].insert(W);
}
for (int i = 0; i < N; i++) {
int x, y;
cin >> x >> y;
x--;
y--;
... | #include <bits/stdc++.h>
using namespace std;
int H, W, N;
int main() {
cin >> W >> H >> N;
vector<vector<int>> G(H + 1);
vector<set<int>> A(H + 1);
for (int i = 0; i <= H; i++) {
G[i].push_back(W);
A[i].insert(W);
}
for (int i = 0; i < N; i++) {
int x, y;
cin >> x >> y;
x--;
y--;
... | replace | 4 | 5 | 4 | 5 | 0 | |
p03203 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define NDEBUG
#include <cassert>
typedef long long ll;
typedef long double Double;
typedef unsigned long long ull;
typedef pair<int, int> ii;
typedef pair<ll, ll> llll;
typedef pair<double, double> dd;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vec... | #include <bits/stdc++.h>
using namespace std;
#define NDEBUG
#include <cassert>
typedef long long ll;
typedef long double Double;
typedef unsigned long long ull;
typedef pair<int, int> ii;
typedef pair<ll, ll> llll;
typedef pair<double, double> dd;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vec... | replace | 68 | 69 | 68 | 69 | 0 | |
p03203 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cassert>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
#define repeat(i, n) for... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
#define repeat(i, n) for... | replace | 39 | 40 | 39 | 40 | 0 | |
p03203 | C++ | Runtime Error | #include <algorithm>
#include <cassert>
#include <cstdio>
#include <set>
#include <vector>
using namespace std;
#define sz(a) ((int)(a).size())
#define pb push_back
#define mp make_pair
#define fs first
#define sc second
const int N = (int)3e5 + 10;
int h, w, n, x, y;
vector<int> bad[N];
int main() {
scanf("%d%d%d"... | #include <algorithm>
#include <cassert>
#include <cstdio>
#include <set>
#include <vector>
using namespace std;
#define sz(a) ((int)(a).size())
#define pb push_back
#define mp make_pair
#define fs first
#define sc second
const int N = (int)3e5 + 10;
int h, w, n, x, y;
vector<int> bad[N];
int main() {
scanf("%d%d%d"... | replace | 72 | 73 | 72 | 73 | 0 | |
p03203 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int n, m;
int i, j, k;
string str;
int h, w;
int main() {
cin >> h >> w >> n;
vector<pair<int, int>> b(n);
vector<vector<int>> f(w);
for (i = 0; i < n; i++) {
int x, y;
cin >> x >> y;
x--;
y--;
b[i] = make_pair(x, y);
}
sort(b.begin(), b.e... | #include <bits/stdc++.h>
using namespace std;
int n, m;
int i, j, k;
string str;
int h, w;
int main() {
cin >> w >> h >> n;
vector<pair<int, int>> b(n);
vector<vector<int>> f(w);
for (i = 0; i < n; i++) {
int x, y;
cin >> x >> y;
x--;
y--;
b[i] = make_pair(x, y);
}
sort(b.begin(), b.e... | replace | 10 | 11 | 10 | 11 | 0 | |
p03203 | C++ | Runtime Error | #include <algorithm>
#include <cassert>
#include <chrono>
#include <cmath>
#include <cstdio>
#include <ctime>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namesp... | #include <algorithm>
#include <cassert>
#include <chrono>
#include <cmath>
#include <cstdio>
#include <ctime>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namesp... | replace | 134 | 135 | 134 | 135 | 0 | |
p03203 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
typedef ... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
typedef ... | replace | 83 | 84 | 83 | 84 | 0 | |
p03203 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <set>
int const maxN = 21;
int op[maxN];
std::set<int> ops[maxN];
int main() {
int h, w, n;
scanf("%d%d%d", &h, &w, &n);
for (int i = 0; i < n; i++) {
int x, y;
scanf("%d%d", &x, &y);
ops[y].emplace(x);
}
int offset = 0;
for (int i = 1; i <= w; i++... | #include <algorithm>
#include <cstdio>
#include <set>
int const maxN = 200001;
int op[maxN];
std::set<int> ops[maxN];
int main() {
int h, w, n;
scanf("%d%d%d", &h, &w, &n);
for (int i = 0; i < n; i++) {
int x, y;
scanf("%d%d", &x, &y);
ops[y].emplace(x);
}
int offset = 0;
for (int i = 1; i <= w;... | replace | 3 | 4 | 3 | 4 | 0 | |
p03203 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
ll ans = 1LL << 50;
set<ll> s[100010];
int main() {
ll h, w, n;
cin >> h >> w >> n;
// vector<vector<char>> v(h+1, vector<char>(w+1,'.') );
map<pair<ll, ll>, bool> m;
rep(i, n) {
ll x, y... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
ll ans = 1LL << 50;
set<ll> s[200010];
int main() {
ll h, w, n;
cin >> h >> w >> n;
// vector<vector<char>> v(h+1, vector<char>(w+1,'.') );
map<pair<ll, ll>, bool> m;
rep(i, n) {
ll x, y... | replace | 5 | 6 | 5 | 6 | 0 | |
p03203 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using pii = pair<int, int>;
int main() {
ios_base::sync_with_stdio(false);
int h, w, n;
cin >> h >> w >> n;
vector<pii> objs;
for (int i = 0; i < n; ++i) {
int x, y;
cin >> x >> y;
... | #include <algorithm>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using pii = pair<int, int>;
int main() {
ios_base::sync_with_stdio(false);
int h, w, n;
cin >> w >> h >> n;
vector<pii> objs;
for (int i = 0; i < n; ++i) {
int x, y;
cin >> x >> y;
... | replace | 12 | 13 | 12 | 13 | 0 | |
p03203 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
vector<ll> kabe[200005];
int main() {
ll h, w, n;
cin >> h >> w >> n;
ll ans = h;
for (int i = 0; i < n; i++) {
ll x, y;
cin >> x >> y;
kabe[x].push_back(y);
}
for (int i = 1; i <= h; i++) {
kabe[i].push_back(17441744);
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
vector<ll> kabe[200005];
int main() {
ll h, w, n;
cin >> h >> w >> n;
ll ans = h;
for (int i = 0; i < n; i++) {
ll x, y;
cin >> x >> y;
kabe[x].push_back(y);
}
for (int i = 1; i <= h; i++) {
kabe[i].push_back(17441744);
... | replace | 18 | 19 | 18 | 19 | 0 | |
p03203 | C++ | Runtime Error | #include <algorithm>
#include <array>
#include <assert.h>
#include <bitset>
#include <chrono>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <s... | #include <algorithm>
#include <array>
#include <assert.h>
#include <bitset>
#include <chrono>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <s... | replace | 84 | 85 | 84 | 85 | 0 | |
p03203 | C++ | Runtime Error | #include <algorithm>
#include <chrono>
#include <climits>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#defin... | #include <algorithm>
#include <chrono>
#include <climits>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#defin... | replace | 53 | 54 | 53 | 54 | 0 | |
p03203 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define all(c) (c).begin(), (c).end()
#define pb push_back
#define dbg(...) \
do { \
cerr << __LINE__ <<... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define all(c) (c).begin(), (c).end()
#define pb push_back
#define dbg(...) \
do { \
cerr << __LINE__ <<... | replace | 85 | 86 | 85 | 86 | 0 | |
p03203 | C++ | Runtime Error | #include <bits/stdc++.h>
#define x first
#define y second
#define y1 Y1
#define y2 Y2
#define mp make_pair
#define pb push_back
#define DEBUG(x) cout << #x << " = " << x << endl;
using namespace std;
typedef long long LL;
typedef pair<int, int> pii;
template <typename T> inline int Chkmax(T &a, T b) {
return a < ... | #include <bits/stdc++.h>
#define x first
#define y second
#define y1 Y1
#define y2 Y2
#define mp make_pair
#define pb push_back
#define DEBUG(x) cout << #x << " = " << x << endl;
using namespace std;
typedef long long LL;
typedef pair<int, int> pii;
template <typename T> inline int Chkmax(T &a, T b) {
return a < ... | replace | 38 | 39 | 38 | 39 | 0 | |
p03203 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define REP(i, m, n) for (int i = (m); i < (n); i++)
#define rep(i, n) REP(i, 0, n)
#define pb push_back
#define all(a) a.begin(), a.end()
#define rall(c) (c).rbegin(), (c).rend()
#define mp make_pair
#define endl '\n'
#define vec vector<ll>
#define ma... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define REP(i, m, n) for (int i = (m); i < (n); i++)
#define rep(i, n) REP(i, 0, n)
#define pb push_back
#define all(a) a.begin(), a.end()
#define rall(c) (c).rbegin(), (c).rend()
#define mp make_pair
#define endl '\n'
#define vec vector<ll>
#define ma... | replace | 39 | 40 | 39 | 40 | 0 | |
p03203 | C++ | Runtime Error | #pragma GCC optimize("Ofast")
#include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
... | #pragma GCC optimize("Ofast")
#include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
... | replace | 275 | 276 | 275 | 276 | 1 | |
p03203 | C++ | Runtime Error | #pragma GCC optimize("Ofast")
#include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
... | #pragma GCC optimize("Ofast")
#include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
... | replace | 274 | 275 | 274 | 275 | 0 | |
p03203 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <cstring>
using namespace std;
#define MAXS 200000
int h, w, n, ans;
int x[MAXS + 3], y[MAXS + 3];
int vis[MAXS + 3];
int main() {
scanf("%d %d %d", &h, &w, &n);
ans = h;
memset(vis, 0x3f, sizeof(vis));
for (int i = 1; i <= n; i++) {
scanf("%d %d", &x[i], &y... | #include <algorithm>
#include <cstdio>
#include <cstring>
using namespace std;
#define MAXS 200000
int h, w, n, ans;
int x[MAXS + 3], y[MAXS + 3];
int vis[MAXS + 3];
int main() {
scanf("%d %d %d", &h, &w, &n);
ans = h;
memset(vis, 0x3f, sizeof(vis));
for (int i = 1; i <= n; i++) {
scanf("%d %d", &x[i], &y... | replace | 20 | 22 | 20 | 23 | 0 | |
p03203 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define ALL(a) a.begin(), a.end()
#define RALL(a) a.rbegin(), a.rend()
typedef long long LL;
typedef pair<LL, LL> P;
const LL mod = 1000000007;
const LL LINF = 1ll << 60;
co... | #include <bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define ALL(a) a.begin(), a.end()
#define RALL(a) a.rbegin(), a.rend()
typedef long long LL;
typedef pair<LL, LL> P;
const LL mod = 1000000007;
const LL LINF = 1ll << 60;
co... | replace | 19 | 20 | 19 | 20 | 0 | |
p03203 | C++ | Runtime Error | #include <bits/stdc++.h>
#define pb emplace_back
#define mp make_pair
#define int long long
#define y second
#define x first
using namespace std;
int32_t main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.precision(10);
int h;
cin >> h;
int w;
cin >> w;
int n;
cin >> n;
std::set<pair<int, i... | #include <bits/stdc++.h>
#define pb emplace_back
#define mp make_pair
#define int long long
#define y second
#define x first
using namespace std;
int32_t main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.precision(10);
int h;
cin >> h;
int w;
cin >> w;
int n;
cin >> n;
std::set<pair<int, i... | replace | 38 | 39 | 38 | 39 | 0 | |
p03203 | C++ | Runtime Error | /*
`-:://:::-
`//:-------:/:`
.+:--.......--:+`
`+:--..`````..--//`
.o:--..`` ``..--:o`
... | /*
`-:://:::-
`//:-------:/:`
.+:--.......--:+`
`+:--..`````..--//`
.o:--..`` ``..--:o`
... | insert | 320 | 320 | 320 | 321 | 0 | |
p03203 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define dump(a) cout << (a) << endl;
typedef long long ll;
ll mod = 1e9 + 7;
int main() {
int h, w, n;
cin >> h >> w >> n;
vector<int... | #include <algorithm>
#include <cmath>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define dump(a) cout << (a) << endl;
typedef long long ll;
ll mod = 1e9 + 7;
int main() {
int h, w, n;
cin >> h >> w >> n;
vector<int... | replace | 17 | 18 | 17 | 18 | 0 | |
p03203 | C++ | Runtime Error | #include <bits/stdc++.h>
typedef long long ll;
ll gi() {
ll x = 0, f = 1;
char ch = getchar();
while (!isdigit(ch))
f ^= ch == '-', ch = getchar();
while (isdigit(ch))
x = x * 10 + ch - '0', ch = getchar();
return f ? x : -x;
}
int mn[100010];
int main() {
#ifdef XZZSB
freopen("in.in", "r", stdin);
... | #include <bits/stdc++.h>
typedef long long ll;
ll gi() {
ll x = 0, f = 1;
char ch = getchar();
while (!isdigit(ch))
f ^= ch == '-', ch = getchar();
while (isdigit(ch))
x = x * 10 + ch - '0', ch = getchar();
return f ? x : -x;
}
int mn[200010];
int main() {
#ifdef XZZSB
freopen("in.in", "r", stdin);
... | replace | 11 | 12 | 11 | 12 | 0 | |
p03203 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <cstring>
using namespace std;
int n, h, w, ans, minp[100005];
int main() {
scanf("%d%d%d", &h, &w, &n);
ans = h;
for (int i = 1; i <= h; i++)
minp[i] = w + 1;
for (int i = 1; i <= n; i++) {
int x, y;
scanf("%d%d", &x, &y);
minp[x] = min(minp[x], y... | #include <algorithm>
#include <cstdio>
#include <cstring>
using namespace std;
int n, h, w, ans, minp[200005];
int main() {
scanf("%d%d%d", &h, &w, &n);
ans = h;
for (int i = 1; i <= h; i++)
minp[i] = w + 1;
for (int i = 1; i <= n; i++) {
int x, y;
scanf("%d%d", &x, &y);
minp[x] = min(minp[x], y... | replace | 4 | 5 | 4 | 5 | 0 | |
p03203 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define REP(i, m, n) for (int i = (int)m; i <... | #include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define REP(i, m, n) for (int i = (int)m; i <... | replace | 26 | 27 | 26 | 27 | 0 | |
p03203 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
/**** Type Define ****/
typedef... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
/**** Type Define ****/
typedef... | replace | 234 | 236 | 234 | 235 | 0 | |
p03203 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <utility>
#include <vector>
using namespace std;
int main() {
int h, w, n;
cin >> h >> w >> n;
if (n == 0) {
cout << h << endl;
return 0;
}
vector<pair<int, int>> a;
for (int i = 0; i < n; i++) {
int x, y;
cin >> x >> y;
if (x < y)
... | #include <algorithm>
#include <iostream>
#include <utility>
#include <vector>
using namespace std;
int main() {
int h, w, n;
cin >> h >> w >> n;
if (n == 0) {
cout << h << endl;
return 0;
}
vector<pair<int, int>> a;
for (int i = 0; i < n; i++) {
int x, y;
cin >> x >> y;
if (x < y)
... | replace | 34 | 35 | 34 | 35 | 0 | |
p03203 | C++ | Runtime Error | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <utili... | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <utili... | replace | 78 | 79 | 78 | 79 | 0 | |
p03203 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using uint = unsigned int;
using ll = long long;
using ull = unsigned long long;
constexpr ll TEN(int n) { return (n == 0) ? 1 : 10 * TEN(n - 1); }
template <class T> using V = vector<T>;
template <class T> using VV = V<V<T>>;
int main() {
cin.tie(0);
ios::sync_with_s... | #include <bits/stdc++.h>
using namespace std;
using uint = unsigned int;
using ll = long long;
using ull = unsigned long long;
constexpr ll TEN(int n) { return (n == 0) ? 1 : 10 * TEN(n - 1); }
template <class T> using V = vector<T>;
template <class T> using VV = V<V<T>>;
int main() {
cin.tie(0);
ios::sync_with_s... | replace | 15 | 16 | 15 | 16 | 0 | |
p03203 | C++ | Runtime Error | #include <algorithm>
#include <array>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define FOR(i, a, b) for (decltype(b) i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
typedef long lon... | #include <algorithm>
#include <array>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define FOR(i, a, b) for (decltype(b) i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
typedef long lon... | replace | 35 | 36 | 35 | 36 | 0 | |
p03203 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <set>
#include <utility>
#include <vector>
using namespace std;
typedef pair<int, int> Pii;
set<int> mp[200000];
int main() {
int h, w, n, x, y;
cin >> h >> w >> n;
for (int i = 0; i < n; ++i) {
cin >> x >> y;
mp[y].insert(x);
}
for (int i = 1; i... | #include <algorithm>
#include <iostream>
#include <set>
#include <utility>
#include <vector>
using namespace std;
typedef pair<int, int> Pii;
set<int> mp[200001];
int main() {
int h, w, n, x, y;
cin >> h >> w >> n;
for (int i = 0; i < n; ++i) {
cin >> x >> y;
mp[y].insert(x);
}
for (int i = 1; i... | replace | 10 | 11 | 10 | 11 | 0 | |
p03203 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using P = pair<int, int>;
int main() {
int H, W, N;
cin >> H >> W >> N;
map<P, int> mp;
vector<vector<int>> g(H);
for (int i = 0; i < N; i++) {
int X, Y;
cin >> X >> Y, X--, Y--;
g[X].push_back(Y);
mp[{X, Y}] = 1;
}
for (int x = 0; x <= H; x++... | #include <bits/stdc++.h>
using namespace std;
using P = pair<int, int>;
int main() {
int H, W, N;
cin >> H >> W >> N;
map<P, int> mp;
vector<vector<int>> g(H + 1);
for (int i = 0; i < N; i++) {
int X, Y;
cin >> X >> Y, X--, Y--;
g[X].push_back(Y);
mp[{X, Y}] = 1;
}
for (int x = 0; x <= H;... | replace | 8 | 9 | 8 | 9 | 0 | |
p03203 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define mp make_pair
using namespace std;
typedef int32_t i32;
typedef uint32_t u32;
typedef int64_t i64;
typedef uint64_t u64;
typedef pair<int, int> pii;
typedef pair<i64, int> pli;
typedef pair<int, i64> pil;
typedef pair<i64, i64> pll;
typedef vector<int> vi;
typedef vector<i64> vl;
tem... | #include <bits/stdc++.h>
#define mp make_pair
using namespace std;
typedef int32_t i32;
typedef uint32_t u32;
typedef int64_t i64;
typedef uint64_t u64;
typedef pair<int, int> pii;
typedef pair<i64, int> pli;
typedef pair<int, i64> pil;
typedef pair<i64, i64> pll;
typedef vector<int> vi;
typedef vector<i64> vl;
tem... | replace | 41 | 42 | 41 | 42 | TLE | |
p03203 | C++ | Runtime Error | //* AuThOr GaRyMr *//
#include <bits/stdc++.h>
#define rb(a, b, c) for (int a = b; a <= c; ++a)
#define rl(a, b, c) for (int a = b; a >= c; --a)
#define niv vector<int>
#define LL long long
#define IT iterator
#define PB push_back
#define II(a, b) make_pair(a, b)
#define FIR first
#define SEC second
#define FREO freope... | //* AuThOr GaRyMr *//
#include <bits/stdc++.h>
#define rb(a, b, c) for (int a = b; a <= c; ++a)
#define rl(a, b, c) for (int a = b; a >= c; --a)
#define niv vector<int>
#define LL long long
#define IT iterator
#define PB push_back
#define II(a, b) make_pair(a, b)
#define FIR first
#define SEC second
#define FREO freope... | replace | 22 | 23 | 22 | 23 | 0 | |
p03203 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
constexpr int inf = 1e9;
int main() {
int h, w, n;
cin >> h >> w >> n;
vector<vector<int>> xs(w, vector<int>(1, h + 1));
for (int i = 0; i < n; ++i) {
int x, y;
cin >> x >> y;
xs[y - 1].push_back(x);
}
for (auto &xx : xs)
sort(xx.begin(), xx.en... | #include <bits/stdc++.h>
using namespace std;
constexpr int inf = 1e9;
int main() {
int h, w, n;
cin >> h >> w >> n;
vector<vector<int>> xs(w, vector<int>(1, h + 1));
for (int i = 0; i < n; ++i) {
int x, y;
cin >> x >> y;
xs[y - 1].push_back(x);
}
for (auto &xx : xs)
sort(xx.begin(), xx.en... | replace | 37 | 38 | 37 | 38 | 0 | |
p03203 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define INF 1000000000
#define REP(i, n) for (int(i) = 0; (i) < (int)(n); (i)++)
typedef long long LL;
LL H, W, N;
typedef pair<int, int> P;
vector<int> G[200011];
int main() {
cin >> H >> W >> N;
REP(i, N) {
int X, Y;
cin >> X >> Y;
G[Y].push_back(X);
}
... | #include <bits/stdc++.h>
using namespace std;
#define INF 1000000000
#define REP(i, n) for (int(i) = 0; (i) < (int)(n); (i)++)
typedef long long LL;
LL H, W, N;
typedef pair<int, int> P;
vector<int> G[200011];
int main() {
cin >> H >> W >> N;
REP(i, N) {
int X, Y;
cin >> X >> Y;
G[Y].push_back(X);
}
... | replace | 18 | 19 | 18 | 19 | 0 | |
p03203 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define fi first
#define se second
#define mp make_pair
#define fastIO \
ios::sync_with_stdio(false); \
c... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define fi first
#define se second
#define mp make_pair
#define fastIO \
ios::sync_with_stdio(false); \
c... | replace | 15 | 16 | 15 | 16 | 0 | |
p03203 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return true;
}
return false;
}
// std::vector Declaration
template <typen... | #include <bits/stdc++.h>
using namespace std;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return true;
}
return false;
}
// std::vector Declaration
template <typen... | replace | 202 | 203 | 202 | 203 | 0 | |
p03204 | C++ | Time Limit Exceeded | /**
* author: tourist
* created: 19.12.2019 15:19:08
**/
#include <bits/stdc++.h>
using namespace std;
template <typename T> class graph {
public:
struct edge {
int from;
int to;
T cost;
};
vector<edge> edges;
vector<vector<int>> g;
int n;
graph(int _n) : n(_n) { g.resize(n); }
... | /**
* author: tourist
* created: 19.12.2019 15:19:08
**/
#include <bits/stdc++.h>
using namespace std;
template <typename T> class graph {
public:
struct edge {
int from;
int to;
T cost;
};
vector<edge> edges;
vector<vector<int>> g;
int n;
graph(int _n) : n(_n) { g.resize(n); }
... | replace | 560 | 579 | 560 | 575 | TLE | |
p03204 | C++ | Runtime Error | // This amazing code is by Eric Sunli Chen.
#include <bits/stdc++.h>
using namespace std;
template <typename T> bool get_int(T &x) {
char t = getchar();
bool neg = false;
x = 0;
for (; (t > '9' || t < '0') && t != '-' && t != EOF; t = getchar())
;
if (t == '-')
neg = true, t = getchar();
if (t == EO... | // This amazing code is by Eric Sunli Chen.
#include <bits/stdc++.h>
using namespace std;
template <typename T> bool get_int(T &x) {
char t = getchar();
bool neg = false;
x = 0;
for (; (t > '9' || t < '0') && t != '-' && t != EOF; t = getchar())
;
if (t == '-')
neg = true, t = getchar();
if (t == EO... | replace | 45 | 46 | 45 | 46 | 0 | |
p03204 | C++ | Time Limit Exceeded |
#include <bits/stdc++.h>
#define ln '\n'
#define all(dat) dat.begin(), dat.end()
#define loop(i, to) for (int i = 0; i < to; ++i)
#define cont(i, to) for (int i = 1; i <= to; ++i)
#define circ(i, fm, to) for (int i = fm; i <= to; ++i)
#define foreach(i, dat) \
... |
#include <bits/stdc++.h>
#define ln '\n'
#define all(dat) dat.begin(), dat.end()
#define loop(i, to) for (int i = 0; i < to; ++i)
#define cont(i, to) for (int i = 1; i <= to; ++i)
#define circ(i, fm, to) for (int i = fm; i <= to; ++i)
#define foreach(i, dat) \
... | replace | 128 | 134 | 128 | 134 | TLE | |
p03204 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#define N (100010)
#define P ()
#define M (N << 1)
#define inf (0x7f7f7f7f)
#define rg register int
#define Label puts("NAIVE")
#define spa pr... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#define N (200010)
#define P ()
#define M (N << 1)
#define inf (0x7f7f7f7f)
#define rg register int
#define Label puts("NAIVE")
#define spa pr... | replace | 10 | 11 | 10 | 11 | 0 | |
p03204 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (ll(i) = (0); (i) < (n); ++i)
#define REV(i, n) for (ll(i) = (n)-1; (i) >= 0; --i)
#define PB push_back
#define EB emplace_back
#define MP make_pair
#define FI first
#define SE second
#define SHOW1d(v, n) ... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (ll(i) = (0); (i) < (n); ++i)
#define REV(i, n) for (ll(i) = (n)-1; (i) >= 0; --i)
#define PB push_back
#define EB emplace_back
#define MP make_pair
#define FI first
#define SE second
#define SHOW1d(v, n) ... | replace | 47 | 48 | 47 | 48 | TLE |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.