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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
p02642 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
const int maxn = 1000005;
vector<int> mark(maxn);
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
++mark[a[i]];
}
for (int i = n -... | #include <bits/stdc++.h>
using namespace std;
const int maxn = 1000005;
vector<int> mark(maxn);
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
++mark[a[i]];
}
if (mark[1] > 0)... | insert | 19 | 19 | 19 | 26 | TLE | |
p02642 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <math.h>
#include <string>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i < (n); i++)
const int M = 1000005;
int main() {
int n;
cin >> n;
vector<int> a(n);
vector<int> c(M);
... | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <math.h>
#include <string>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i < (n); i++)
const int M = 1000005;
int main() {
int n;
cin >> n;
vector<int> a(n);
vector<int> c(M);
... | insert | 18 | 18 | 18 | 22 | TLE | |
p02642 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
#define cuttime ios::sync_with_stdio(false)
#define swap(x, y) x ^= y, y ^= x,... | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
#define cuttime ios::sync_with_stdio(false)
#define swap(x, y) x ^= y, y ^= x,... | replace | 53 | 54 | 53 | 55 | TLE | |
p02642 | C++ | Runtime Error | #include <algorithm>
#include <cstring>
#include <iostream>
#include <vector>
using namespace std;
int y[1000010];
int same[1000010];
bool divisor(int n) {
for (int i = 1; i * i <= n; i++) {
if (n % i == 0) {
if (y[i] == 1 || y[n / i] == 1) {
return false;
}
}
}
return true;
}
int m... | #include <algorithm>
#include <cstring>
#include <iostream>
#include <vector>
using namespace std;
int y[1000010];
int same[1000010];
bool divisor(int n) {
for (int i = 1; i * i <= n; i++) {
if (n % i == 0) {
if (y[i] == 1 || y[n / i] == 1) {
return false;
}
}
}
return true;
}
int m... | replace | 23 | 24 | 23 | 24 | 0 | |
p02642 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<long long> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a.begin(), a.end());
long long M = a[n - 1];
long long d[200000] = {0};
for (int i = 0; i < n; i++) {
for (int j = 1; j * a[i] <= M; j++) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<long long> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a.begin(), a.end());
long long M = a[n - 1];
long long d[1000000 + 10] = {0};
for (int i = 0; i < n; i++) {
for (int j = 1; j * a[i] <= M; j+... | replace | 13 | 14 | 13 | 14 | 0 | |
p02642 | C++ | Time Limit Exceeded | #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 ff first
#define ss second
#define endl "\n"
#define loop(i, s, e) for (int i = s; i < e; i++)
#define int long long
#define vi vector<int>
#define S(v) sort(v... | #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 ff first
#define ss second
#define endl "\n"
#define loop(i, s, e) for (int i = s; i < e; i++)
#define int long long
#define vi vector<int>
#define S(v) sort(v... | replace | 99 | 100 | 99 | 101 | TLE | |
p02642 | C++ | Runtime Error | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
using ll = long long;
const int INF = 5000;
int main() {
int n;
cin >> n;
int M = 1e05 + 5;
vector<int> a(n), cnt(M);
rep(i, n) cin >> a[i];
for (int x : a) {
if (cnt[x] != 0) {
c... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
using ll = long long;
const int INF = 5000;
int main() {
int n;
cin >> n;
int M = 1e06 + 5;
vector<int> a(n), cnt(M);
rep(i, n) cin >> a[i];
for (int x : a) {
if (cnt[x] != 0) {
c... | replace | 10 | 11 | 10 | 11 | 0 | |
p02642 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define rep(i, l, r) for (ll i = (ll)l; i < (ll)(r); i++)
int main() {
ll N;
cin >> N;
vector<ll> A(N);
map<ll, ll> mA;
ll ma = 0;
rep(i, 0, N) {
cin >> A[i];
mA[A[i]]++;
ma = max(ma, A[i]);
}
sort(A.begin(), A.end());
... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define rep(i, l, r) for (ll i = (ll)l; i < (ll)(r); i++)
int main() {
ll N;
cin >> N;
vector<ll> A(N);
map<ll, ll> mA;
ll ma = 0;
rep(i, 0, N) {
cin >> A[i];
mA[A[i]]++;
ma = max(ma, A[i]);
}
sort(A.begin(), A.end());
... | replace | 18 | 19 | 18 | 19 | 0 | |
p02642 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#define N 200010
using namespace std;
int a[N];
map<int, int> mp;
int main() {
// x+y=a
// 2x+4y=b
int n;
while (scanf("%d", &n) != EOF) {
for (int i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
sort(a, a... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#define N 200010
using namespace std;
int a[N];
map<int, int> mp;
int main() {
// x+y=a
// 2x+4y=b
int n;
while (scanf("%d", &n) != EOF) {
for (int i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
sort(a, a... | replace | 25 | 27 | 25 | 28 | TLE | |
p02642 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define l_ength size
#pragma GCC target("avx")
#pragma GCC optimize("unroll-loops")
const int inf = (1 << 30);
const int mod = 1000000007; // 998244353
using ll = long long;
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n;
cin >> n;
vector<int> ... | #include <bits/stdc++.h>
#define l_ength size
#pragma GCC target("avx")
#pragma GCC optimize("unroll-loops")
const int inf = (1 << 30);
const int mod = 1000000007; // 998244353
using ll = long long;
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n;
cin >> n;
vector<int> ... | insert | 33 | 33 | 33 | 35 | TLE | |
p02642 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define rep(i, a, b) for (i = a; i < b; i++)
ll int large = (ll int)1e18;
ll int mod = (ll int)1e9 + 7;
ll int const N = (ll int)1e6 + 10;
ll int mod_exp(ll int x, ll int n) {
ll int result = 1;
while (n > 0) {
if (n % 2 ==... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define rep(i, a, b) for (i = a; i < b; i++)
ll int large = (ll int)1e18;
ll int mod = (ll int)1e9 + 7;
ll int const N = (ll int)1e6 + 10;
ll int mod_exp(ll int x, ll int n) {
ll int result = 1;
while (n > 0) {
if (n % 2 ==... | replace | 22 | 23 | 22 | 23 | 0 | |
p02642 | C++ | Runtime Error | #include <iostream>
#include <vector>
const int MAXVAL = 1e2;
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<int> a(n);
vector<int> cnt(MAXVAL + 1);
vector<int> ans(MAXVAL + 1, 1);
for (int i = 0; i < n; i++) {
cin >> a[i];
cnt[a[i]]++;
}
... | #include <iostream>
#include <vector>
const int MAXVAL = 1e6;
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<int> a(n);
vector<int> cnt(MAXVAL + 1);
vector<int> ans(MAXVAL + 1, 1);
for (int i = 0; i < n; i++) {
cin >> a[i];
cnt[a[i]]++;
}
... | replace | 3 | 4 | 3 | 4 | 0 | |
p02642 | C++ | Runtime Error | // #pragma GCC optimize "trapv"
#include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define sz(x) (int)x.size()
#define debug(x) cout << #x << ':' << x << endl;
#define rep(i, n) for (int i = 0; i < n; i++)
#define reps(i, n) for (int i = 1; i <= n; i++)
#define make_unique(v) ... | // #pragma GCC optimize "trapv"
#include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define sz(x) (int)x.size()
#define debug(x) cout << #x << ':' << x << endl;
#define rep(i, n) for (int i = 0; i < n; i++)
#define reps(i, n) for (int i = 1; i <= n; i++)
#define make_unique(v) ... | replace | 57 | 58 | 57 | 58 | 0 | |
p02642 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define int long long int
#define MOD 1000000007
#define N 1000003
#define pii pair<int, int>
#define MAX 1000000000000000000
#define _mp make_pair
#define pb push_back
#define _sort(v) sort(v.begin(), v.end())
#define _rsort(v) sort(v.rbegin(), v.rend())
using namespace std;
int32_t main() {... | #include <bits/stdc++.h>
#define int long long int
#define MOD 1000000007
#define N 1000003
#define pii pair<int, int>
#define MAX 1000000000000000000
#define _mp make_pair
#define pb push_back
#define _sort(v) sort(v.begin(), v.end())
#define _rsort(v) sort(v.rbegin(), v.rend())
using namespace std;
int32_t main() {... | insert | 20 | 20 | 20 | 24 | TLE | |
p02642 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = INT32_MAX;
const ll INFL = INT64_MAX;
const int mod = 1e9 + 7;
template <typename T> void print_vec(vector<T> v) {
for (T i : v)
cout << i << " ";
cout <... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = INT32_MAX;
const ll INFL = INT64_MAX;
const int mod = 1e9 + 7;
template <typename T> void print_vec(vector<T> v) {
for (T i : v)
cout << i << " ";
cout <... | replace | 14 | 15 | 14 | 15 | 0 | |
p02642 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
typedef pair<ll, P> PP;
static const double EPS = 1e-8;
static const double PI = 4.0 * atan(1.0);
static const ll INF = 1023456789;
#define REP(i, n) for (int i = 0; i < n; ++i)
#define REPR(i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
typedef pair<ll, P> PP;
static const double EPS = 1e-8;
static const double PI = 4.0 * atan(1.0);
static const ll INF = 1023456789;
#define REP(i, n) for (int i = 0; i < n; ++i)
#define REPR(i... | replace | 41 | 44 | 41 | 42 | 0 | |
p02642 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const int M = 200010;
signed main() {
int N;
cin >> N;
vector<int> A(N);
rep(i, N) cin >> A[i];
vector<int> cnt(M);
for (int x : A) {
if (cnt[x] != 0) {
cnt[x] = 2;
con... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const int M = 1000010;
signed main() {
int N;
cin >> N;
vector<int> A(N);
rep(i, N) cin >> A[i];
vector<int> cnt(M);
for (int x : A) {
if (cnt[x] != 0) {
cnt[x] = 2;
co... | replace | 5 | 6 | 5 | 6 | 0 | |
p02642 | C++ | Time Limit Exceeded | /*#include <boost/multiprecision/cpp_dec_float.hpp>
#include <boost/multiprecision/cpp_int.hpp>
#include <boost/rational.hpp>
*/
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
using ll = long long;
using ld = long double;
using pll = pair<ll, ll>... | /*#include <boost/multiprecision/cpp_dec_float.hpp>
#include <boost/multiprecision/cpp_int.hpp>
#include <boost/rational.hpp>
*/
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
using ll = long long;
using ld = long double;
using pll = pair<ll, ll>... | replace | 50 | 52 | 50 | 56 | TLE | |
p02642 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep2(x, fr, to) for (int x = (fr); x < (to); x++)
#define rep(x, to) for (int x = 0; x < (to); x++)
#define repr(x, fr, to) for (int x = (fr); x >= (to); x--)
#define all(c) c.begin(), c.end()
#define sz(v) (int)v.size()
using namespace std;
typedef long long ll;
typedef vector<int> V... | #include <bits/stdc++.h>
#define rep2(x, fr, to) for (int x = (fr); x < (to); x++)
#define rep(x, to) for (int x = 0; x < (to); x++)
#define repr(x, fr, to) for (int x = (fr); x >= (to); x--)
#define all(c) c.begin(), c.end()
#define sz(v) (int)v.size()
using namespace std;
typedef long long ll;
typedef vector<int> V... | replace | 32 | 33 | 32 | 33 | 0 | |
p02642 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define fi first
#define se second
#define pb push_back
#define debug(x) cerr << #... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define fi first
#define se second
#define pb push_back
#define debug(x) cerr << #... | insert | 38 | 38 | 38 | 39 | TLE | |
p02642 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
const int max_n = 2 * 1e5;
cin >> n;
int a[max_n + 1];
for (int i = 0; i < n; i++)
cin >> a[i];
vector<int> dp(2 * 1e6, 0);
for (int i = 0; i < n; i++) {
int now = a[i];
if (dp[now] == 1) {
dp[now]++;
// continue;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
const int max_n = 2 * 1e5;
cin >> n;
int a[max_n + 1];
for (int i = 0; i < n; i++)
cin >> a[i];
vector<int> dp(2 * 1e6, 0);
for (int i = 0; i < n; i++) {
int now = a[i];
if (dp[now] != 0) {
dp[now]++;
// continue;
... | replace | 14 | 15 | 14 | 15 | TLE | |
p02642 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
int const MAX = 1000001;
int a[MAX + 5];
int main() {
int n;
cin >> n;
rep(i, n) {
int x;
cin >> x;
a[x]++;
}
int ans = 0;
for (int i = 1; i < MAX; i++) {
if (a[i] == 1)
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
int const MAX = 1000001;
int a[MAX + 5];
int main() {
int n;
cin >> n;
rep(i, n) {
int x;
cin >> x;
a[x]++;
}
int ans = 0;
for (int i = 1; i < MAX; i++) {
if (a[i] == 1)
... | replace | 22 | 23 | 22 | 23 | 0 | |
p02642 | C++ | Runtime Error | #include "bits/stdc++.h"
#define rep(i, N) for (int i = 0; i < N; i++)
typedef long long ll;
const int mod = 1e9 + 7;
using namespace std;
const int MAXA = 100000;
int main(void) {
ll N;
cin >> N;
vector<ll> A(N);
rep(i, N) cin >> A[i];
vector<int> sieve(MAXA + 1, 0);
for (auto x : A) {
if (sieve... | #include "bits/stdc++.h"
#define rep(i, N) for (int i = 0; i < N; i++)
typedef long long ll;
const int mod = 1e9 + 7;
using namespace std;
const int MAXA = 1000005;
int main(void) {
ll N;
cin >> N;
vector<ll> A(N);
rep(i, N) cin >> A[i];
vector<int> sieve(MAXA + 1, 0);
for (auto x : A) {
if (siev... | replace | 10 | 11 | 10 | 11 | 0 | |
p02642 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define loop(i, x, z) for (int i = x; i < z; i++)
int n, A[200002], cnt[200002], ans = 0;
bool vis[1000002];
int main() {
cin >> n;
loop(i, 0, n) cin >> A[i], cnt[A[i]]++;
sort(A, A + n);
if (A[0] == 1) {
if (cnt[1] == 1)
cout << 1;
else
cout << ... | #include <bits/stdc++.h>
using namespace std;
#define loop(i, x, z) for (int i = x; i < z; i++)
int n, A[200002], cnt[1000002], ans = 0;
bool vis[1000002];
int main() {
cin >> n;
loop(i, 0, n) cin >> A[i], cnt[A[i]]++;
sort(A, A + n);
if (A[0] == 1) {
if (cnt[1] == 1)
cout << 1;
else
cout <<... | replace | 3 | 4 | 3 | 4 | 0 | |
p02642 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define repp(i, l, r) for (long long i = (l); i < (r); i++)
#define rep(i, n) for (long long i = 0; i < (n); ++i)
#define per(i, n) for (long long i = (n); i >= 0; --i)
const int INF = 2147483647; // int max
const long long int MOD = 1000000007;
using namespace std;
using ll = long long;
using ... | #include <bits/stdc++.h>
#define repp(i, l, r) for (long long i = (l); i < (r); i++)
#define rep(i, n) for (long long i = 0; i < (n); ++i)
#define per(i, n) for (long long i = (n); i >= 0; --i)
const int INF = 2147483647; // int max
const long long int MOD = 1000000007;
using namespace std;
using ll = long long;
using ... | replace | 35 | 38 | 35 | 41 | TLE | |
p02642 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
int n, a[110000];
int f[1100000];
int main() {
cin >> n;
for (int i = 1; i <= n; ++i)
scanf("%d", &a[i]);
sort(a + 1, a + n + 1);
int cnt = 0;
for (int i = 1; i <= n; ++i) {
if (f[a[i]] == 0 && (i == n || a[i] != a[i + 1])... | #include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
int n, a[210000];
int f[1100000];
int main() {
cin >> n;
for (int i = 1; i <= n; ++i)
scanf("%d", &a[i]);
sort(a + 1, a + n + 1);
int cnt = 0;
for (int i = 1; i <= n; ++i) {
if (f[a[i]] == 0 && (i == n || a[i] != a[i + 1])... | replace | 4 | 5 | 4 | 5 | 0 | |
p02642 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define finish(x) return cout << x << endl, 0
#define ll long long
const int N = 1000001;
int n, cnt[N];
vector<int> a;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n;
a.resize(n);
for (auto &i : a)
cin >> i;
map<int, int> f;
for (auto ... | #include <bits/stdc++.h>
using namespace std;
#define finish(x) return cout << x << endl, 0
#define ll long long
const int N = 1000001;
int n, cnt[N];
vector<int> a;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n;
a.resize(n);
for (auto &i : a)
cin >> i;
map<int, int> f;
for (auto ... | replace | 20 | 21 | 20 | 21 | TLE | |
p02642 | C++ | Time Limit Exceeded | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdlib>
#include <ctype.h>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define vint vector<int>
... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdlib>
#include <ctype.h>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define vint vector<int>
... | insert | 29 | 29 | 29 | 31 | TLE | |
p02642 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
constexpr int MAX = 1e6;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (auto &e : a)
cin >> e;
sort(a.begin(), a.end());
int r = 0;
vector<bool> v(MAX + 1, true);
for (int i = 0; i < n; i++) {
if ((i == n || a[i] != a[i + 1]) && v[a[i]])
... | #include <bits/stdc++.h>
using namespace std;
constexpr int MAX = 1e6;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (auto &e : a)
cin >> e;
sort(a.begin(), a.end());
int r = 0;
vector<bool> v(MAX + 1, true);
for (int i = 0; i < n; i++) {
if (!v[a[i]])
continue;
if (i == n || a... | replace | 15 | 16 | 15 | 18 | TLE | |
p02642 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define dbg puts("It's Just Begining.Wait For The End!!!!!\n")
#define CHECK(x) cout << (#x) << " is " << (x) << "\n";
#define endl printf("\n")
typedef pair<ll, ll> pii;
#define pb push_back
#define ms(a, b) memset(a, b, sizeof(a))
#define in(x) scanf(... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define dbg puts("It's Just Begining.Wait For The End!!!!!\n")
#define CHECK(x) cout << (#x) << " is " << (x) << "\n";
#define endl printf("\n")
typedef pair<ll, ll> pii;
#define pb push_back
#define ms(a, b) memset(a, b, sizeof(a))
#define in(x) scanf(... | replace | 36 | 37 | 36 | 37 | TLE | |
p02642 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
#define ll long long
#define rep(i, n) for (int i = 0; i < (n); i++)
#define COS 200005
int main() {
int n;
cin >> n;
vector<ll> a(n);
vector<bool> b(COS, false);
ll i, j;
ll ans = 0;
rep(i, n) { cin >> a[i]; }
sort(a.begin(), a.end());
rep(i, n - 1) {
... | #include "bits/stdc++.h"
using namespace std;
#define ll long long
#define rep(i, n) for (int i = 0; i < (n); i++)
#define COS 2000005
int main() {
int n;
cin >> n;
vector<ll> a(n);
vector<bool> b(COS, false);
ll i, j;
ll ans = 0;
rep(i, n) { cin >> a[i]; }
sort(a.begin(), a.end());
rep(i, n - 1) {... | replace | 5 | 6 | 5 | 6 | 0 | |
p02642 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define PI 3.14159265358979323
#define ll long long int
#define vi vector<int>
#define vl vector<ll>
#define all(v) (v).begin(), (v).end()
#define pb push_back
ll power(ll a, ll b) { // a^b
ll res = 1;
while (b > 0) {
if (b & 1) {
res = (res * a);
b--;
... | #include <bits/stdc++.h>
using namespace std;
#define PI 3.14159265358979323
#define ll long long int
#define vi vector<int>
#define vl vector<ll>
#define all(v) (v).begin(), (v).end()
#define pb push_back
ll power(ll a, ll b) { // a^b
ll res = 1;
while (b > 0) {
if (b & 1) {
res = (res * a);
b--;
... | replace | 23 | 24 | 23 | 24 | TLE | |
p02642 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
int main() {
int n;
cin >> n;
int a[200001];
for (int i = 1; i <= 2000000; i++) {
a[i] = 0;
}
rep(i, n) {
int x;
cin >> x;
a[x]++;
}
int ans = 0;
for (int i = 1; i <= ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
int main() {
int n;
cin >> n;
int a[2000001];
for (int i = 1; i <= 2000000; i++) {
a[i] = 0;
}
rep(i, n) {
int x;
cin >> x;
a[x]++;
}
int ans = 0;
for (int i = 1; i <=... | replace | 9 | 10 | 9 | 10 | -11 | |
p02642 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
#define INF LONG_MAX
#define MOD 1000000007
#define rng(a) a.begin(), a.end()
#define rrng(a) a.end(), a.begin()
#define endl "\n"
#define int ll
signed main() {
ios::sync_with_stdio(fals... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
#define INF LONG_MAX
#define MOD 1000000007
#define rng(a) a.begin(), a.end()
#define rrng(a) a.end(), a.begin()
#define endl "\n"
#define int ll
signed main() {
ios::sync_with_stdio(fals... | insert | 28 | 28 | 28 | 30 | TLE | |
p02642 | C++ | Runtime Error | #include <algorithm>
#include <complex>
#include <functional>
#include <iostream>
#include <map>
#include <memory>
#include <queue>
#include <regex>
#include <set>
#include <sstream>
#include <string>
#include <thread>
#include <tuple>
#include <type_traits>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n);... | #include <algorithm>
#include <complex>
#include <functional>
#include <iostream>
#include <map>
#include <memory>
#include <queue>
#include <regex>
#include <set>
#include <sstream>
#include <string>
#include <thread>
#include <tuple>
#include <type_traits>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n);... | replace | 29 | 30 | 29 | 30 | 0 | |
p02642 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define all(x) begin(x), end(x)
#define gets(s) fgets(s, size(s), stdin)
using namespace std;
typedef long long ll;
typedef string str;
template <typename T> using vec = vector<T>;
template <typename T> using uset = unordered_set<T>;
template <typen... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define all(x) begin(x), end(x)
#define gets(s) fgets(s, size(s), stdin)
using namespace std;
typedef long long ll;
typedef string str;
template <typename T> using vec = vector<T>;
template <typename T> using uset = unordered_set<T>;
template <typen... | replace | 15 | 16 | 15 | 16 | 0 | |
p02642 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int N;
constexpr int maxA = 1000001;
vector<int> input;
vector<bool> table(maxA, true);
int main() {
cin >> N;
input.resize(N);
for (int i = 0; i < N; i++)
cin >> input[i];
sort(input.begin(), input.end());
for (int i = 0; i < N; i++) {
for (int j = 2; j... | #include <bits/stdc++.h>
using namespace std;
int N;
constexpr int maxA = 1000001;
vector<int> input;
vector<bool> table(maxA, true);
int main() {
cin >> N;
input.resize(N);
for (int i = 0; i < N; i++)
cin >> input[i];
sort(input.begin(), input.end());
for (int i = 0; i < N; i++) {
if (!table[input[... | insert | 15 | 15 | 15 | 17 | TLE | |
p02642 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define mp(a, b) make_pair(a, b)
#define pb(a) push_back(a)
#define fr(i, n) for (i = 0; i < n; i++)
#define F first
#define S second
#define fast std::ios_base::sync_with_stdio(false)
#define mod 1000000007
#define pi 3.14159265
map<lli, lli> m;
b... | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define mp(a, b) make_pair(a, b)
#define pb(a) push_back(a)
#define fr(i, n) for (i = 0; i < n; i++)
#define F first
#define S second
#define fast std::ios_base::sync_with_stdio(false)
#define mod 1000000007
#define pi 3.14159265
lli m[1000005];
bo... | replace | 11 | 12 | 11 | 12 | TLE | |
p02642 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define d long double
#define scf(n) scanf("%d", &n)
#define lscf(n) scanf("%lld", &n)
#define dscf(n) scanf("%Lf", &n)
#define pri(n) printf("%d ", (int)n)
#define lpri(n) printf("%lld ", n)
#define dpri(n) printf("%Lf ", n)
#define prin(n) printf("%... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define d long double
#define scf(n) scanf("%d", &n)
#define lscf(n) scanf("%lld", &n)
#define dscf(n) scanf("%Lf", &n)
#define pri(n) printf("%d ", (int)n)
#define lpri(n) printf("%lld ", n)
#define dpri(n) printf("%Lf ", n)
#define prin(n) printf("%... | replace | 62 | 67 | 62 | 69 | TLE | |
p02642 | C++ | Runtime Error | #include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <complex>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <regex>
#include <set>
#include <stack>
#include <vector>
using namespace std;
#define rep(i, n) for (in... | #include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <complex>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <regex>
#include <set>
#include <stack>
#include <vector>
using namespace std;
#define rep(i, n) for (in... | replace | 85 | 86 | 85 | 86 | 0 | |
p02642 | C++ | Time Limit Exceeded | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef pair<ll, ll> pll;
typedef long double ld;
const ll mod = 1e9 + 7;
ll solve(void) {
ll n;
cin >> n;
vll A(n);
sort(A.begin(), A.end());
for (auto &a : A) {
cin >> a;
}
map<ll, ll> m;
for (auto a : ... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef pair<ll, ll> pll;
typedef long double ld;
const ll mod = 1e9 + 7;
ll solve(void) {
ll n;
cin >> n;
vll A(n);
sort(A.begin(), A.end());
for (auto &a : A) {
cin >> a;
}
map<ll, ll> m;
for (auto a : ... | replace | 25 | 26 | 25 | 27 | TLE | |
p02642 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
int main() {
int N;
cin >> N;
vector<long long> A(N);
vector<int> B(100001, 0);
for (int i = 0; i < N; i++)
cin >> A[i], B[A[i]]++;
int ANS = 0;
for (int i = 0; i < N; i++) {
bool check = true;
B[A[i]]--;
for (int j = 1; j * j <= A[i]; j++) {
... | #include "bits/stdc++.h"
using namespace std;
int main() {
int N;
cin >> N;
vector<long long> A(N);
vector<int> B(1000001, 0);
for (int i = 0; i < N; i++)
cin >> A[i], B[A[i]]++;
int ANS = 0;
for (int i = 0; i < N; i++) {
bool check = true;
B[A[i]]--;
for (int j = 1; j * j <= A[i]; j++) {... | replace | 7 | 8 | 7 | 8 | 0 | |
p02642 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define all(a) (a).begin(), (a).end()
using namespace std;
using Graph = vector<vector<int>>;
typedef pair<int, int> P;
typedef long long ll;
int main() {
ll n;
cin >> n;
vector<ll> a(n);
bool dp[1000005];
rep(i, 1000005) dp[i] = false;... | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define all(a) (a).begin(), (a).end()
using namespace std;
using Graph = vector<vector<int>>;
typedef pair<int, int> P;
typedef long long ll;
int main() {
ll n;
cin >> n;
vector<ll> a(n);
bool dp[1000005];
rep(i, 1000005) dp[i] = false;... | replace | 33 | 34 | 33 | 34 | TLE | |
p02642 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define Int int32_t
#define all(c) c.begin(), c.end()
#define FAST ios_base::sync_with_stdio(false), cin.tie(NULL);
#define pii pair<int, int>
#define pb push_back
#define F first
#define S second
#define endl "\n"
#define bitcnt(n) __builtin_popcountl... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define Int int32_t
#define all(c) c.begin(), c.end()
#define FAST ios_base::sync_with_stdio(false), cin.tie(NULL);
#define pii pair<int, int>
#define pb push_back
#define F first
#define S second
#define endl "\n"
#define bitcnt(n) __builtin_popcountl... | insert | 44 | 44 | 44 | 52 | TLE | |
p02642 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
typedef long long ll;
typedef unsigned long long ull;
typedef long double LD;
using namespace std;
cons... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
typedef long long ll;
typedef unsigned long long ull;
typedef long double LD;
using namespace std;
cons... | replace | 34 | 35 | 34 | 35 | 0 | |
p02642 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define MOD 1000000007
#define print(A, n) \
for (ll i = 0; i < n; ++i) \
cout << A[i] << ' '; ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define MOD 1000000007
#define print(A, n) \
for (ll i = 0; i < n; ++i) \
cout << A[i] << ' '; ... | replace | 141 | 142 | 141 | 142 | TLE | |
p02644 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define endl "\... | #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define endl "\... | replace | 41 | 42 | 41 | 43 | TLE | |
p02644 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cassert>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <vector>
// #include <boost/multiprecision/cpp_int.hpp... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <vector>
// #include <boost/multiprecision/cpp_int.hpp... | replace | 157 | 159 | 157 | 161 | TLE | |
p02644 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <vector>
#define LL long long
#define pb push_back
#define mp make_pair
#define INF 0x3f3f3f3f
#define Inf 1000000000000000000LL
#define F first
#define S second
using namespace std;
typedef pair<int, int> pii;
int d... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <vector>
#define LL long long
#define pb push_back
#define mp make_pair
#define INF 0x3f3f3f3f
#define Inf 1000000000000000000LL
#define F first
#define S second
using namespace std;
typedef pair<int, int> pii;
int d... | replace | 47 | 48 | 47 | 48 | TLE | |
p02644 | C++ | Time Limit Exceeded | /**
* author: boutarou
* created: 14.06.2020 21:50:21
**/
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define fcout cout << fixed << setprecision(15)
using lint = long long;
using P = pair<int, int>;
template <class T> inline bool chmax(T &a, const T &b) {
... | /**
* author: boutarou
* created: 14.06.2020 21:50:21
**/
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define fcout cout << fixed << setprecision(15)
using lint = long long;
using P = pair<int, int>;
template <class T> inline bool chmax(T &a, const T &b) {
... | insert | 72 | 72 | 72 | 76 | TLE | |
p02644 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using Int = long long;
int PREP = (cin.tie(nullptr), ios::sync_with_stdio(false),
cout << fixed << setprecision(9), 0);
// int SEGV = getenv("D") || (exit(system("D= SEGFAULT_SIGNALS=all catchsegv
// ./prog.exe") >> 8), 0);
template <class T> using MinHeap = pri... | #include <bits/stdc++.h>
using namespace std;
using Int = long long;
int PREP = (cin.tie(nullptr), ios::sync_with_stdio(false),
cout << fixed << setprecision(9), 0);
// int SEGV = getenv("D") || (exit(system("D= SEGFAULT_SIGNALS=all catchsegv
// ./prog.exe") >> 8), 0);
template <class T> using MinHeap = pri... | insert | 44 | 44 | 44 | 46 | TLE | |
p02644 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rep2(i, i0, n) for (int i = i0; i < n; ++i)
int main() {
int h, w, k;
cin >> h >> w >> k;
int x1, x2, y1, y2;
cin >> y1 >> x1 >> y2 >> x2;
x1--;
y1--;
x2--;
y2--;
vector<vector<b... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rep2(i, i0, n) for (int i = i0; i < n; ++i)
int main() {
int h, w, k;
cin >> h >> w >> k;
int x1, x2, y1, y2;
cin >> y1 >> x1 >> y2 >> x2;
x1--;
y1--;
x2--;
y2--;
vector<vector<b... | replace | 53 | 58 | 53 | 59 | TLE | |
p02644 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define all(x) (x).begin(), (x).end()
#define P_B push_back
#define PO_B pop_back
#define E_B emplace_back
#defin... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define all(x) (x).begin(), (x).end()
#define P_B push_back
#define PO_B pop_back
#define E_B emplace_back
#defin... | replace | 71 | 72 | 71 | 72 | TLE | |
p02644 | 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;
#define ll long long
#define fio \
ios_base::sync_with_stdio(false); ... | #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;
#define ll long long
#define fio \
ios_base::sync_with_stdio(false); ... | insert | 89 | 89 | 89 | 92 | TLE | |
p02644 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define syosu(x) fixed << setprecision(x)
using namespace std;
typedef long long ll;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair<int, int> P;
typedef pair<double, double> pdd;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<do... | #include <bits/stdc++.h>
#define syosu(x) fixed << setprecision(x)
using namespace std;
typedef long long ll;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair<int, int> P;
typedef pair<double, double> pdd;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<do... | replace | 78 | 80 | 78 | 82 | TLE | |
p02644 | C++ | Time Limit Exceeded | #include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
// マクロ&定数&関数 ===========... | #include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
// マクロ&定数&関数 ===========... | insert | 526 | 526 | 526 | 529 | TLE | |
p02644 | C++ | Time Limit Exceeded | #include <iostream>
#include <queue>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int H, W, K;
pair<int, int> st, ter;
vector<vector<char>> c;
vector<vector<int>> d;
queue<pair<long long, long long>> q;
vector<pair<int, int>> direction = {{1, 0}, {0, 1}, {-1, 0}, {0, -1}};
long long bfs... | #include <iostream>
#include <queue>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int H, W, K;
pair<int, int> st, ter;
vector<vector<char>> c;
vector<vector<int>> d;
queue<pair<long long, long long>> q;
vector<pair<int, int>> direction = {{1, 0}, {0, 1}, {-1, 0}, {0, -1}};
long long bfs... | replace | 32 | 36 | 32 | 38 | TLE | |
p02644 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
using Graph = vector<vector<ll>>;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, m, n) for (ll i = m; i < (ll)(n); i++)
#define rrep(i, n, m) for (ll i = n; i >= (ll)(m); i--)
const int dx[4] = {1, 0, -1, 0... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
using Graph = vector<vector<ll>>;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, m, n) for (ll i = m; i < (ll)(n); i++)
#define rrep(i, n, m) for (ll i = n; i >= (ll)(m); i--)
const int dx[4] = {1, 0, -1, 0... | insert | 56 | 56 | 56 | 60 | TLE | |
p02644 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const ll maxn = 1e6 + 5;
const ll maxm = 1e3 + 5;
namespace IO {
const int SIZE = (1 << 20) + 1;
char ibuf[SIZE], *iS, *iT, obuf[SIZE], *oS = obuf, *oT = obuf + SIZE - 1;
char _st[55];
int _qr = 0;
inline char gc() {
r... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const ll maxn = 1e6 + 5;
const ll maxm = 1e3 + 5;
namespace IO {
const int SIZE = (1 << 20) + 1;
char ibuf[SIZE], *iS, *iT, obuf[SIZE], *oS = obuf, *oT = obuf + SIZE - 1;
char _st[55];
int _qr = 0;
inline char gc() {
r... | replace | 78 | 81 | 78 | 81 | TLE | |
p02644 | C++ | Time Limit Exceeded | /*
* Lang : C++
* Author : little_angel
*/
#include <bits/stdc++.h>
using namespace std;
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int H, W, K;
cin >> H >> W >> K;
vector<pair<int, int>> del = {{1, 0}, {-1, 0}, {0, 1}, {0, -1}};
const int inf = 1e9... | /*
* Lang : C++
* Author : little_angel
*/
#include <bits/stdc++.h>
using namespace std;
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int H, W, K;
cin >> H >> W >> K;
vector<pair<int, int>> del = {{1, 0}, {-1, 0}, {0, 1}, {0, -1}};
const int inf = 1e9... | replace | 36 | 37 | 36 | 38 | TLE | |
p02644 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define INF 1000000007
#define LINF (1LL << 61)
#define PI 3.14159265358979
typedef long long i64;
typedef pair<i64, i64> P;
inline i64 mod(i64 a, i64 m) { return (a % m + m) % m; }
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return ... | #include <bits/stdc++.h>
using namespace std;
#define INF 1000000007
#define LINF (1LL << 61)
#define PI 3.14159265358979
typedef long long i64;
typedef pair<i64, i64> P;
inline i64 mod(i64 a, i64 m) { return (a % m + m) % m; }
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return ... | replace | 61 | 62 | 61 | 63 | TLE | |
p02644 | C++ | Time Limit Exceeded | #include "bits/stdc++.h"
#define _USE_MATH_DEFINES
#include <math.h>
using namespace std;
using ll = long long;
using vll = std::vector<ll>;
using vvll = std::vector<vll>;
using vvvll = std::vector<vvll>;
using ld = long double;
using vld = std::vector<ld>;
using vvld = std::vector<vld>;
using vvvld = std::vector<vvl... | #include "bits/stdc++.h"
#define _USE_MATH_DEFINES
#include <math.h>
using namespace std;
using ll = long long;
using vll = std::vector<ll>;
using vvll = std::vector<vll>;
using vvvll = std::vector<vvll>;
using ld = long double;
using vld = std::vector<ld>;
using vvld = std::vector<vld>;
using vvvld = std::vector<vvl... | insert | 279 | 279 | 279 | 281 | TLE | |
p02644 | C++ | Time Limit Exceeded | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
// template
#define rep(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define ALL(v) (v).begin(), (v).end()
typedef long long int ll;
const int inf = 0x3fffffff;
const ll INF = 0x1fffffffffffffff;
const double eps = 1e-12;
template <typename ... | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
// template
#define rep(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define ALL(v) (v).begin(), (v).end()
typedef long long int ll;
const int inf = 0x3fffffff;
const ll INF = 0x1fffffffffffffff;
const double eps = 1e-12;
template <typename ... | insert | 54 | 54 | 54 | 56 | TLE | |
p02644 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
// Define
using ll = long long;
using ull = unsigned long long;
using ld = long double;
template <class T> using pvector = vector<pair<T, T>>;
template <class T>
using rpriority_queue = priority_queue<T, vector<T>, greater<T>>;
constexpr const ll dx[4] = {1, 0, -1, 0};
con... | #include <bits/stdc++.h>
using namespace std;
// Define
using ll = long long;
using ull = unsigned long long;
using ld = long double;
template <class T> using pvector = vector<pair<T, T>>;
template <class T>
using rpriority_queue = priority_queue<T, vector<T>, greater<T>>;
constexpr const ll dx[4] = {1, 0, -1, 0};
con... | delete | 166 | 167 | 166 | 166 | TLE | |
p02644 | C++ | Time Limit Exceeded | // #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
using vint = vector<int>;
using vvint = vector<vint>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vchar = vector<char>;
using vvchar = vector<vchar>;
using ld = long double;
using vld = ve... | // #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
using vint = vector<int>;
using vvint = vector<vint>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vchar = vector<char>;
using vvchar = vector<vchar>;
using ld = long double;
using vld = ve... | replace | 80 | 81 | 80 | 82 | TLE | |
p02644 | C++ | Time Limit Exceeded | #include "algorithm"
#include "cmath"
#include "cstdio"
#include "cstring"
#include "iostream"
#include "map"
#include "queue"
#include "set"
#include "vector"
using namespace std;
#define MAXN 1000006
// #define int long long
#define rep(i, a, b) for (int i = (a), i##end = (b); i <= i##end; ++i)
#define per(i, a, b) f... | #include "algorithm"
#include "cmath"
#include "cstdio"
#include "cstring"
#include "iostream"
#include "map"
#include "queue"
#include "set"
#include "vector"
using namespace std;
#define MAXN 1000006
// #define int long long
#define rep(i, a, b) for (int i = (a), i##end = (b); i <= i##end; ++i)
#define per(i, a, b) f... | replace | 53 | 55 | 53 | 56 | TLE | |
p02644 | C++ | Time Limit Exceeded | // f-pond-skater.yml
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
const int INF = 0x3f3f3f3f;
const ll LLINF = 0x3f3f3f3f3f3f3f3f;
template <typename V> using uset = unordered_set<V>;
template <typename K, typename V> using umap = unordered_map<K, V>;
template <typena... | // f-pond-skater.yml
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
const int INF = 0x3f3f3f3f;
const ll LLINF = 0x3f3f3f3f3f3f3f3f;
template <typename V> using uset = unordered_set<V>;
template <typename K, typename V> using umap = unordered_map<K, V>;
template <typena... | replace | 46 | 50 | 46 | 52 | TLE | |
p02644 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REP1(i, a, b) for (int i = a; i <= (int)(b); i++)
#define ALL(x) begin(x), end(x)
#define PB push_back
using namespace std;
typedef int64_t LL;
typedef vector<int> VI;
typedef pair<int, int> PII;
template <class T> inline bool chmax(... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define REP1(i, a, b) for (int i = a; i <= (int)(b); i++)
#define ALL(x) begin(x), end(x)
#define PB push_back
using namespace std;
typedef int64_t LL;
typedef vector<int> VI;
typedef pair<int, int> PII;
template <class T> inline bool chmax(... | insert | 56 | 56 | 56 | 58 | TLE | |
p02644 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
// #define int long long
int dx[] = {1, 0, -1, 0};
int dy[] = {0, 1, 0, -1};
int32_t main() {
ios::sync_with_stdio(0), cin.tie(0);
int h, w, k;
cin >> h >> w >> k;
int a, b, c, d;
cin >> a >> b >> c >> d;
--a, --b, --c, --d;
int l[h][w];
memset(l, -1, size... | #include <bits/stdc++.h>
using namespace std;
// #define int long long
int dx[] = {1, 0, -1, 0};
int dy[] = {0, 1, 0, -1};
int32_t main() {
ios::sync_with_stdio(0), cin.tie(0);
int h, w, k;
cin >> h >> w >> k;
int a, b, c, d;
cin >> a >> b >> c >> d;
--a, --b, --c, --d;
int l[h][w];
memset(l, -1, size... | insert | 35 | 35 | 35 | 37 | TLE | |
p02644 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define REP(i, m, n) for (int i = (m); i < (int)(n); i++)
#define RREP(i, m, n) for (int i = (int)(n - 1); i >= m; i--)
#define rep(i, n) REP(i, 0, n)
#define rrep(i, n) RREP(i, 0, n)
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define fi... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, m, n) for (int i = (m); i < (int)(n); i++)
#define RREP(i, m, n) for (int i = (int)(n - 1); i >= m; i--)
#define rep(i, n) REP(i, 0, n)
#define rrep(i, n) RREP(i, 0, n)
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define fi... | replace | 94 | 96 | 94 | 98 | TLE | |
p02644 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
////////////////////////////// Begin Macros
#define all(x) (x).begin(), (x).end()
#define rep(i, N) for (int i = 0; i < (int)(N); i++)
#define reprev(i, N) for (int i = (int)(N)-1; i >= 0; i--)
#define rep1(i, N) for (int i = 1; i <= (int)(N); i++)
#define rep1rev(i, N)... | #include <bits/stdc++.h>
using namespace std;
////////////////////////////// Begin Macros
#define all(x) (x).begin(), (x).end()
#define rep(i, N) for (int i = 0; i < (int)(N); i++)
#define reprev(i, N) for (int i = (int)(N)-1; i >= 0; i--)
#define rep1(i, N) for (int i = 1; i <= (int)(N); i++)
#define rep1rev(i, N)... | replace | 191 | 193 | 191 | 197 | TLE | |
p02644 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
const int dx[] = {1, 0, -1, 0};
const int dy[] = {0, 1, 0, -1};
int main() {
int h, w, k;
cin >> h >> w >> k;
int x1, y1, x2, y2;
cin >> x1 >> y1 >> x2 >> y2;
x1--, y1--, x2--, y2--;
vector<string> field(h);
re... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
const int dx[] = {1, 0, -1, 0};
const int dy[] = {0, 1, 0, -1};
int main() {
int h, w, k;
cin >> h >> w >> k;
int x1, y1, x2, y2;
cin >> x1 >> y1 >> x2 >> y2;
x1--, y1--, x2--, y2--;
vector<string> field(h);
re... | insert | 38 | 38 | 38 | 40 | TLE | |
p02644 | C++ | Time Limit Exceeded | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
#define rep(i, begin, n) for (int i = begin; i < n; i++)
#define repe(i, begin, n) for (int i = begin; i <= n; i++)
#define repr(i, begin, n) for (int i = begin; i > begin - n; i--)
#define repre(i,... | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
#define rep(i, begin, n) for (int i = begin; i < n; i++)
#define repe(i, begin, n) for (int i = begin; i <= n; i++)
#define repr(i, begin, n) for (int i = begin; i > begin - n; i--)
#define repre(i,... | insert | 82 | 82 | 82 | 85 | TLE | |
p02644 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define whole(x) (x).begin(), (x).end()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
using P = pair<int, int>;
#define debug(var) cerr << "[" << #var ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define whole(x) (x).begin(), (x).end()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
using P = pair<int, int>;
#define debug(var) cerr << "[" << #var ... | insert | 47 | 47 | 47 | 49 | TLE | |
p02644 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
const ll INF = 1e18;
int main() {
int h, w, k, x, y, nx, ny, K;
cin >> h >> w >> k;
int a, b, c, d;
cin >> a >> b >> c >> d;
a-... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
const ll INF = 1e18;
int main() {
int h, w, k, x, y, nx, ny, K;
cin >> h >> w >> k;
int a, b, c, d;
cin >> a >> b >> c >> d;
a-... | replace | 41 | 43 | 41 | 45 | TLE | |
p02644 | C++ | Time Limit Exceeded | #include <algorithm>
#include <complex>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define REP(i, m, n) for (int i... | #include <algorithm>
#include <complex>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define REP(i, m, n) for (int i... | insert | 102 | 102 | 102 | 104 | TLE | |
p02644 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#ifdef tabr
#include "library/debug.cpp"
#else
#define debug(...)
#endif
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int h, w, k;
cin >> h >> w >> k;
int sx, sy, tx, ty;
cin >> sx >> sy >> tx >> ty;
vector<vector<int>> d(h + 2,... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#ifdef tabr
#include "library/debug.cpp"
#else
#define debug(...)
#endif
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int h, w, k;
cin >> h >> w >> k;
int sx, sy, tx, ty;
cin >> sx >> sy >> tx >> ty;
vector<vector<int>> d(h + 2,... | insert | 50 | 50 | 50 | 51 | TLE | |
p02644 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i <= (n); i++)
#define all(x) (x).begin(), (x).end()
#define V vector
typedef V<int> vi;
typedef V<vi> vvi;
typedef long long ll;
typedef pair<int, int> P;
typedef tuple<int, int, int> T;
con... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i <= (n); i++)
#define all(x) (x).begin(), (x).end()
#define V vector
typedef V<int> vi;
typedef V<vi> vvi;
typedef long long ll;
typedef pair<int, int> P;
typedef tuple<int, int, int> T;
con... | insert | 44 | 44 | 44 | 46 | TLE | |
p02644 | C++ | Time Limit Exceeded | /**Bismillahir Rahmanir Raheem
Author:Refatul Fahad**/
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define ff first
#define ss second
#define pb push_back
#define vi vector<int>
#define pii pair<int, int>
#define pil pair<int, ll>
const int N = 1e6 + 5;
const ... | /**Bismillahir Rahmanir Raheem
Author:Refatul Fahad**/
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define ff first
#define ss second
#define pb push_back
#define vi vector<int>
#define pii pair<int, int>
#define pil pair<int, ll>
const int N = 1e6 + 5;
const ... | replace | 59 | 60 | 59 | 60 | TLE | |
p02644 | C++ | Time Limit Exceeded | // F.
#include <algorithm>
#include <iostream>
#include <queue>
#include <sstream>
#include <vector>
using namespace std;
typedef long long LL;
typedef pair<int, int> II;
typedef pair<LL, II> III;
int main(int argc, char *argv[]) {
#ifdef _MSC_VER
while (true)
#endif
{
int h = -1, w, k, sx, sy, gx, gy;
L... | // F.
#include <algorithm>
#include <iostream>
#include <queue>
#include <sstream>
#include <vector>
using namespace std;
typedef long long LL;
typedef pair<int, int> II;
typedef pair<LL, II> III;
int main(int argc, char *argv[]) {
#ifdef _MSC_VER
while (true)
#endif
{
int h = -1, w, k, sx, sy, gx, gy;
L... | replace | 52 | 54 | 52 | 56 | TLE | |
p02644 | C++ | Time Limit Exceeded | // #pragma GCC optimize(2)
// #pragma G++ optimize(2)
// #pragma comment(linker,"/STACK:102400000,102400000")
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int ui;
typedef unsigned long long ull;
typedef float fl;
typedef long double ld;
typedef pair<int, int> pii;
#if (WIN32) |... | // #pragma GCC optimize(2)
// #pragma G++ optimize(2)
// #pragma comment(linker,"/STACK:102400000,102400000")
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int ui;
typedef unsigned long long ull;
typedef float fl;
typedef long double ld;
typedef pair<int, int> pii;
#if (WIN32) |... | replace | 101 | 102 | 101 | 103 | TLE | |
p02644 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define all(x) x.begin(), x.end()
#define sz(x) (int)x.size()
#define pb push_back
#define endl '\n'
#define snd second
#define fst first
#define fastio cin.tie(NULL), cout.sync_with_stdio(true)
typedef long long int ll;
typedef unsigned long long int ull;
typedef vector... | #include <bits/stdc++.h>
using namespace std;
#define all(x) x.begin(), x.end()
#define sz(x) (int)x.size()
#define pb push_back
#define endl '\n'
#define snd second
#define fst first
#define fastio cin.tie(NULL), cout.sync_with_stdio(true)
typedef long long int ll;
typedef unsigned long long int ull;
typedef vector... | replace | 50 | 52 | 50 | 54 | TLE | |
p02644 | C++ | Time Limit Exceeded | #include <fstream>
#include <iostream>
#include <set>
#include <vector>
// BE CAREFUL WITH HASH TABLE & UNORDERED MAP
// #include <ext/pb_ds/assoc_container.hpp>
// using namespace __gnu_pbds;
using namespace std;
#define MOD 998244353
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define F0R(i, b) FOR(i, 0, b... | #include <fstream>
#include <iostream>
#include <set>
#include <vector>
// BE CAREFUL WITH HASH TABLE & UNORDERED MAP
// #include <ext/pb_ds/assoc_container.hpp>
// using namespace __gnu_pbds;
using namespace std;
#define MOD 998244353
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define F0R(i, b) FOR(i, 0, b... | replace | 68 | 69 | 68 | 69 | TLE | |
p02644 | C++ | Time Limit Exceeded | #include "bits/stdc++.h"
#define FI first.first
#define SE first.second
#define TH second
#define fi first
#define se second
#define th second
using namespace std;
template <typename T> string to_string(const vector<T> &vc, int w) {
if (vc.empty())
return "";
if (w + 1 == vc.size())
return to_string(vc[w]... | #include "bits/stdc++.h"
#define FI first.first
#define SE first.second
#define TH second
#define fi first
#define se second
#define th second
using namespace std;
template <typename T> string to_string(const vector<T> &vc, int w) {
if (vc.empty())
return "";
if (w + 1 == vc.size())
return to_string(vc[w]... | replace | 87 | 88 | 87 | 88 | TLE | |
p02644 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
// #include <atcoder/all>
#define ll long long int
#define ld long double
#define yorn(f) std::cout << ((f) ? "Yes" : "No") << endl;
#define YORN(f) std::cout << ((f) ? "YES" : "NO") << endl;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repi(i, n) for (ll i = 1; i < (ll)(n); i++)
... | #include <bits/stdc++.h>
// #include <atcoder/all>
#define ll long long int
#define ld long double
#define yorn(f) std::cout << ((f) ? "Yes" : "No") << endl;
#define YORN(f) std::cout << ((f) ? "YES" : "NO") << endl;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define repi(i, n) for (ll i = 1; i < (ll)(n); i++)
... | insert | 73 | 73 | 73 | 76 | TLE | |
p02644 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
const int INF = 1 << 30;
const int MaxRC = 1e3;
int dx[4] = {0, 1, 0, -1};
int dy[4] = {1, 0, -1, 0};
struct DATA {
int x, y;
DATA(int x = 0, int y = 0) : x(x), y(y) {}
} st, ed, now, nxt;
int main() {
int R, C, K;
while (scanf("%d %d %d\n", &R, &C, &K) != EOF) {... | #include <bits/stdc++.h>
using namespace std;
const int INF = 1 << 30;
const int MaxRC = 1e3;
int dx[4] = {0, 1, 0, -1};
int dy[4] = {1, 0, -1, 0};
struct DATA {
int x, y;
DATA(int x = 0, int y = 0) : x(x), y(y) {}
} st, ed, now, nxt;
int main() {
int R, C, K;
while (scanf("%d %d %d\n", &R, &C, &K) != EOF) {... | replace | 39 | 41 | 39 | 43 | TLE | |
p02644 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>... | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>... | insert | 85 | 85 | 85 | 87 | TLE | |
p02644 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define ll long long
using namespace std;
const int INF = 1e9;
int d[4][2] = {{0, 1}, {1, 0}, {-1, 0}, {0, -1}};
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int h, w, kk, x1, y1, x2, y2;
cin >> h >> w >> kk >> x1 >> y1 >> x2 >> y2;
vector<vector<int>> ... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
const int INF = 1e9;
int d[4][2] = {{0, 1}, {1, 0}, {-1, 0}, {0, -1}};
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int h, w, kk, x1, y1, x2, y2;
cin >> h >> w >> kk >> x1 >> y1 >> x2 >> y2;
vector<vector<int>> ... | replace | 36 | 37 | 36 | 38 | TLE | |
p02644 | C++ | Runtime Error | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <assert.h>
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <climits>
#include <complex> // complex
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include... | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <assert.h>
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <climits>
#include <complex> // complex
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include... | replace | 81 | 82 | 81 | 82 | 0 | |
p02644 | C++ | Time Limit Exceeded | #include <algorithm>
#include <functional>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define DB cerr << "D" << endl
#define pb push_back
using namespace std;
using ll = long long;
using ld = long double;
const int INF = 1e9;
const ll LINF = 1e18;
const double dINF = 1e18;
c... | #include <algorithm>
#include <functional>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define DB cerr << "D" << endl
#define pb push_back
using namespace std;
using ll = long long;
using ld = long double;
const int INF = 1e9;
const ll LINF = 1e18;
const double dINF = 1e18;
c... | insert | 117 | 117 | 117 | 119 | TLE | |
p02644 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, x, y) for (ll i = (x); i < (y); i++)
#define rrep(i, x, y) for (ll i = (ll)(y)-1; i >= (x); i--)
#define all(x) (x).begin(), (x).end()
#ifdef LOCAL
#define debug(x) \
cerr << #x << " = " << (x) ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, x, y) for (ll i = (x); i < (y); i++)
#define rrep(i, x, y) for (ll i = (ll)(y)-1; i >= (x); i--)
#define all(x) (x).begin(), (x).end()
#ifdef LOCAL
#define debug(x) \
cerr << #x << " = " << (x) ... | insert | 93 | 93 | 93 | 95 | TLE | |
p02644 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define mod 1'000'000'007
typedef long long ll;
template <typename T> void deb(initializer_list<T> l) {
for (auto &e : l)
cout << e << ' ';
cout << endl;
}
int n, m, k;
vector<pair<int, int>> dir{{1, 0}, {-1, 0}, {0, 1}, {0, -1}};
bool ok(int i, int j) { return... | #include <bits/stdc++.h>
using namespace std;
#define mod 1'000'000'007
typedef long long ll;
template <typename T> void deb(initializer_list<T> l) {
for (auto &e : l)
cout << e << ' ';
cout << endl;
}
int n, m, k;
vector<pair<int, int>> dir{{1, 0}, {-1, 0}, {0, 1}, {0, -1}};
bool ok(int i, int j) { return... | insert | 58 | 58 | 58 | 60 | TLE | |
p02644 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const ll INF = 1e18;
const int di[4] = {-1, 0, 1, 0};
const int dj[4] = {0, 1, 0, -1};
int main() {
int h, w, k, si, sj, gi, gj;
cin >> h >> w >> k >> si >> sj >> gi >> gj;
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const ll INF = 1e18;
const int di[4] = {-1, 0, 1, 0};
const int dj[4] = {0, 1, 0, -1};
int main() {
int h, w, k, si, sj, gi, gj;
cin >> h >> w >> k >> si >> sj >> gi >> gj;
... | insert | 49 | 49 | 49 | 51 | TLE | |
p02644 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define FOR(__I, __N) for (int __I = 0; __I < __N; ++__I)
typedef long long int64;
typedef pair<int, ... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define FOR(__I, __N) for (int __I = 0; __I < __N; ++__I)
typedef long long int64;
typedef pair<int, ... | insert | 67 | 67 | 67 | 72 | TLE | |
p02644 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int dx[4] = {0, 0, 1, -1};
int dy[4] = {1, -1, 0, 0};
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int h, w, k;
cin >> h >> w >> k;
int x1, y1, x2, y2;
cin >> x1 >> y1 >> x2 >> y2;
x1--, y1--, x2--, y2--;
string S[h];
for (int i = 0; i < h... | #include <bits/stdc++.h>
using namespace std;
int dx[4] = {0, 0, 1, -1};
int dy[4] = {1, -1, 0, 0};
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int h, w, k;
cin >> h >> w >> k;
int x1, y1, x2, y2;
cin >> x1 >> y1 >> x2 >> y2;
x1--, y1--, x2--, y2--;
string S[h];
for (int i = 0; i < h... | insert | 35 | 35 | 35 | 37 | TLE | |
p02644 | C++ | Time Limit Exceeded | // Remeber Choose Compiler: GCC9
#include <bits/stdc++.h>
using namespace std;
// Debug Output Utility
#ifdef LOCAL
#define dbg(args...) \
do { \
cout << #args << " -> "; ... | // Remeber Choose Compiler: GCC9
#include <bits/stdc++.h>
using namespace std;
// Debug Output Utility
#ifdef LOCAL
#define dbg(args...) \
do { \
cout << #args << " -> "; ... | replace | 74 | 76 | 74 | 80 | TLE | |
p02644 | C++ | Time Limit Exceeded | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author tatsumack
*/
#include <fstream>
#include <iostream>
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define FOR(i, a, b) for (int i = (a), i##_len = (b); i <= i##_len; ++i)... | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author tatsumack
*/
#include <fstream>
#include <iostream>
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define FOR(i, a, b) for (int i = (a), i##_len = (b); i <= i##_len; ++i)... | replace | 61 | 63 | 61 | 65 | TLE | |
p02644 | 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 | 96 | 96 | 96 | 98 | TLE | |
p02644 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define endl '\n'
#define fast ios::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define zy -2147382637
#define bql 2147483647
#define ll long long
#define ull unsigned long long
#define ld long double
#define il inline
#define sz(x) x.size()
#define maxn 100010
#define rp(i, l, r) for (int i = ... | #include <bits/stdc++.h>
#define endl '\n'
#define fast ios::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define zy -2147382637
#define bql 2147483647
#define ll long long
#define ull unsigned long long
#define ld long double
#define il inline
#define sz(x) x.size()
#define maxn 100010
#define rp(i, l, r) for (int i = ... | replace | 129 | 131 | 129 | 131 | TLE | |
p02644 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
int main() {
int H, W, K, x1, y1, x2, y2, dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
cin >> H >> W >> K >> x1 >> y1 >> x2 >> y2;
vector<string> c(H);
rep(i, H) cin >> c[i];
vector<vector<int>... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
int main() {
int H, W, K, x1, y1, x2, y2, dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
cin >> H >> W >> K >> x1 >> y1 >> x2 >> y2;
vector<string> c(H);
rep(i, H) cin >> c[i];
vector<vector<int>... | replace | 26 | 27 | 26 | 27 | TLE |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.