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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
p02941 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define start_routine() int begtime = clock();
#def... | #include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define start_routine() int begtime = clock();
#def... | insert | 137 | 137 | 137 | 141 | TLE | |
p02941 | C++ | Time Limit Exceeded | #include <iostream>
#include <queue>
#include <vector>
using namespace std;
#define MIN(a, b) (((a) < (b)) ? (a) : (b))
#define MAX(a, b) (((a) < (b)) ? (b) : (a))
using ll = long long;
using ld = long double;
int const nmax = 200000;
int target[1 + nmax], v[1 + nmax];
int main() {
ios::sync_with_stdio(0);
cin.... | #include <iostream>
#include <queue>
#include <vector>
using namespace std;
#define MIN(a, b) (((a) < (b)) ? (a) : (b))
#define MAX(a, b) (((a) < (b)) ? (b) : (a))
using ll = long long;
using ld = long double;
int const nmax = 200000;
int target[1 + nmax], v[1 + nmax];
int main() {
ios::sync_with_stdio(0);
cin.... | insert | 47 | 47 | 47 | 49 | TLE | |
p02941 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rng(i, l, r) for (int i = int(l); i < int(r); i++)
#define rep(i, r) rng(i, 0, r)
#define rrng(i, l, r) for (int i = int(r) - 1; i >= int(l); i--)
#define rrep(i, r) rrng(i, 0, r)
#define pb push_back
#define eb emplace_back
#define mp make_pa... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rng(i, l, r) for (int i = int(l); i < int(r); i++)
#define rep(i, r) rng(i, 0, r)
#define rrng(i, l, r) for (int i = int(r) - 1; i >= int(l); i--)
#define rrep(i, r) rrng(i, 0, r)
#define pb push_back
#define eb emplace_back
#define mp make_pa... | replace | 181 | 182 | 181 | 182 | 0 | |
p02941 | C++ | Time Limit Exceeded | #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... | delete | 54 | 55 | 54 | 54 | TLE | |
p02941 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define MOD 1000000007
#define pb push_back
#define all(a) (a).begin(), (a).end()
#define F first
#define S second
#define endl '\n'
#define PI 3.14159265359d
#define sz(x) (int)x.size()
#define rep(i, a, b) for (int i = a; i < b; i++)
#define magic 10... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define MOD 1000000007
#define pb push_back
#define all(a) (a).begin(), (a).end()
#define F first
#define S second
#define endl '\n'
#define PI 3.14159265359d
#define sz(x) (int)x.size()
#define rep(i, a, b) for (int i = a; i < b; i++)
#define magic 10... | replace | 54 | 60 | 54 | 55 | 0 | |
p02941 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using i64 = long long;
const i64 MOD = 998244353;
const i64 INF = i64(1e18) + 7;
template <typename T> bool chmin(T &x, T y) {
if (x > y) {
x = y;
return true;
}
return false;
}
template <typename T> bool chmax(T &x, T y) {
if (x < y) {
x = y;
r... | #include <bits/stdc++.h>
using namespace std;
using i64 = long long;
const i64 MOD = 998244353;
const i64 INF = i64(1e18) + 7;
template <typename T> bool chmin(T &x, T y) {
if (x > y) {
x = y;
return true;
}
return false;
}
template <typename T> bool chmax(T &x, T y) {
if (x < y) {
x = y;
r... | insert | 52 | 52 | 52 | 56 | TLE | |
p02941 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define mp make_pair
#define pb push_back
#define f(i, x, n) for (int i = x; i < n; i++)
#define all(c) c.begin(), c.end()
#define int ll
#define print(x) cerr << (#x) << "is " << x << "\n"
using ll = long long;
using pii = pair<int, int>;
c... | #include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define mp make_pair
#define pb push_back
#define f(i, x, n) for (int i = x; i < n; i++)
#define all(c) c.begin(), c.end()
#define int ll
#define print(x) cerr << (#x) << "is " << x << "\n"
using ll = long long;
using pii = pair<int, int>;
c... | replace | 17 | 21 | 17 | 21 | 0 | |
p02941 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef stack<int> S;
const int N = 200200;
int n;
int a[N];
int b[N];
S s;
void gg() {
puts("-1");
exit(0);
}
int main() {
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
for (int i = 0; i < n; i++) {
scanf("%d... | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef stack<int> S;
const int N = 200200;
int n;
int a[N];
int b[N];
S s;
void gg() {
puts("-1");
exit(0);
}
int main() {
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
for (int i = 0; i < n; i++) {
scanf("%d... | insert | 20 | 20 | 20 | 23 | 0 | |
p02941 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define TRACE
#ifdef TRACE
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void __f(const char *name, Arg1 &&arg1) {
cerr << name << " : " << arg1 << std::endl;
}
template <typename Arg1, typename... Args>
void __f(const char *names, Arg1 &&ar... | #include <bits/stdc++.h>
using namespace std;
#define TRACE
#ifdef TRACE
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void __f(const char *name, Arg1 &&arg1) {
cerr << name << " : " << arg1 << std::endl;
}
template <typename Arg1, typename... Args>
void __f(const char *names, Arg1 &&ar... | replace | 69 | 71 | 69 | 73 | TLE | |
p02941 | C++ | Time Limit Exceeded | /*
`-:://:::-
`//:-------:/:`
.+:--.......--:+`
`+:--..`````..--//`
.o:--..`` ``..--:o`
... | /*
`-:://:::-
`//:-------:/:`
.+:--.......--:+`
`+:--..`````..--//`
.o:--..`` ``..--:o`
... | insert | 353 | 353 | 353 | 355 | TLE | |
p02941 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = a; i < b; ++i)
#define REP(i, n) FOR(i, 0, n)
#define _ << " " <<
#define pb push_back
#define fi first
#define se second
typedef double lf;
typedef long long ll;
typedef pair<int, int> pii;
const int mod = 998244353;
int add(int x, int y... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = a; i < b; ++i)
#define REP(i, n) FOR(i, 0, n)
#define _ << " " <<
#define pb push_back
#define fi first
#define se second
typedef double lf;
typedef long long ll;
typedef pair<int, int> pii;
const int mod = 998244353;
int add(int x, int y... | insert | 62 | 62 | 62 | 65 | 0 | |
p02941 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = (a); i < (b); ++i)
#define trav(a, x) for (auto &a : x)
#define all(x) x.begin(), x.end()
#define sz(x) (int)(x).size()
#define pb push_back
#define fst first
#define snd second
#define PI (acos(-1))
#define max(a, b) ((a) > (b) ? (a) : (b... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = (a); i < (b); ++i)
#define trav(a, x) for (auto &a : x)
#define all(x) x.begin(), x.end()
#define sz(x) (int)(x).size()
#define pb push_back
#define fst first
#define snd second
#define PI (acos(-1))
#define max(a, b) ((a) > (b) ? (a) : (b... | replace | 49 | 55 | 49 | 50 | TLE | |
p02941 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cassert>
#include <cmath>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string.h>
#include <string>
#include... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string.h>
#include <string>
#include... | replace | 136 | 160 | 136 | 153 | TLE | |
p02941 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
// typedef vector<vector<ll>> Graph;
const ll mod = 1e9 + 7;
// const ll mod = 998244353;
#define REP(i, n) for (ll i = 0; i < (l... | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
// typedef vector<vector<ll>> Graph;
const ll mod = 1e9 + 7;
// const ll mod = 998244353;
#define REP(i, n) for (ll i = 0; i < (l... | replace | 113 | 114 | 113 | 114 | TLE | |
p02941 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
using namespace std;
void read(int &x) {
char ch;
bool ok;
for (ok = 0, ch = getchar(); !isdigit(ch); ch = getchar())
if (ch == '-')
ok = 1;
for (x = 0; isdigit(ch); x = x * 10 + ch - '0', ch = getchar())
... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
using namespace std;
void read(int &x) {
char ch;
bool ok;
for (ok = 0, ch = getchar(); !isdigit(ch); ch = getchar())
if (ch == '-')
ok = 1;
for (x = 0; isdigit(ch); x = x * 10 + ch - '0', ch = getchar())
... | replace | 36 | 38 | 36 | 39 | 0 | |
p02941 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
#define mod 1000000007
#define N 200010
ll a[N], b[N], n, ans;
void calc() {
for (int i = 0; i < n; i++) {
int j = (i + 1) % n, k = (i + 2) % n;
ll p = b[i] + b[k];
ll cnt = (b[j] - a[j]) / p;
ans += ... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
#define mod 1000000007
#define N 200010
ll a[N], b[N], n, ans;
void calc() {
for (int i = 0; i < n; i++) {
int j = (i + 1) % n, k = (i + 2) % n;
ll p = b[i] + b[k];
ll cnt = (b[j] - a[j]) / p;
ans += ... | replace | 26 | 27 | 26 | 27 | TLE | |
p02941 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define REP(i, n) for (int64_t i = 0; i < (n); i++)
#define ALL(a) (a).begin(), (a).end()
#define SORT(c) sort((c).begin(), (c).end())
#define REV(c) reverse((c).begin(), (c).end())
#define YES cout << "YES" << endl;
#define NO cout << "NO" << endl;
#define Yes cout << "Yes" << endl;
#define No... | #include <bits/stdc++.h>
#define REP(i, n) for (int64_t i = 0; i < (n); i++)
#define ALL(a) (a).begin(), (a).end()
#define SORT(c) sort((c).begin(), (c).end())
#define REV(c) reverse((c).begin(), (c).end())
#define YES cout << "YES" << endl;
#define NO cout << "NO" << endl;
#define Yes cout << "Yes" << endl;
#define No... | replace | 73 | 76 | 73 | 77 | TLE | |
p02941 | C++ | Time Limit Exceeded | /*
* じょえチャンネル
* 高評価・チャンネル登録よろしくおねがいします！
* https://www.youtube.com/channel/UCRXsI3FL_kvaVL9zoolBfbQ
*/
#include <bits/stdc++.h>
// #pragma GCC target("avx2")
// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")
// here!!!
// define int long long !!!!!
#define int long long
// define int long l... | /*
* じょえチャンネル
* 高評価・チャンネル登録よろしくおねがいします！
* https://www.youtube.com/channel/UCRXsI3FL_kvaVL9zoolBfbQ
*/
#include <bits/stdc++.h>
// #pragma GCC target("avx2")
// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")
// here!!!
// define int long long !!!!!
#define int long long
// define int long l... | insert | 858 | 858 | 858 | 862 | TLE | |
p02941 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define li long long int
#define rep(i, to) for (li i = 0; i < ((li)(to)); i++)
#define repp(i, start, to) for (li i = (li)(start); i < ((li)(to)); i++)
#define pb push_back
#define sz(v) ((li)(v).size())
#define bgn(v) ((v).begin())
#define eend(v) ((v).end())
#define all... | #include <bits/stdc++.h>
using namespace std;
#define li long long int
#define rep(i, to) for (li i = 0; i < ((li)(to)); i++)
#define repp(i, start, to) for (li i = (li)(start); i < ((li)(to)); i++)
#define pb push_back
#define sz(v) ((li)(v).size())
#define bgn(v) ((v).begin())
#define eend(v) ((v).end())
#define all... | replace | 111 | 112 | 111 | 112 | TLE | |
p02941 | C++ | Time Limit Exceeded | #include "bits/stdc++.h"
using namespace std;
#define ll long long int
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n; i >= 0; i--)
#define REP(i, s, t) for (int i = s; i <= t; i++)
#define RREP(i, s, t) for (int i = s; i >= t; i--)
#define dump(x) cerr << #x << " = " << (x) << endl;
#d... | #include "bits/stdc++.h"
using namespace std;
#define ll long long int
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n; i >= 0; i--)
#define REP(i, s, t) for (int i = s; i <= t; i++)
#define RREP(i, s, t) for (int i = s; i >= t; i--)
#define dump(x) cerr << #x << " = " << (x) << endl;
#d... | insert | 42 | 42 | 42 | 44 | TLE | |
p02941 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
typedef long double ld;
const int inf = 1e9 + 7;
const ll longinf = 1LL << 60;
#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); ++i)
#define rep(i, n) REP(i, 0, n)
#define F first
#define S second
const int mx = 2000... | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
typedef long double ld;
const int inf = 1e9 + 7;
const ll longinf = 1LL << 60;
#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); ++i)
#define rep(i, n) REP(i, 0, n)
#define F first
#define S second
const int mx = 2000... | replace | 40 | 41 | 40 | 41 | TLE | |
p02941 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
// #include <boost/multiprecision/cpp_int.hpp>
using namespace std;
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define MIN(a) *std::min_element((a).begin(), (a).end())
#define MAX(a) *std::max_element((a).begin(), (a).end())
#define SUM(a) std::accumulate((a... | #include <bits/stdc++.h>
// #include <boost/multiprecision/cpp_int.hpp>
using namespace std;
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define MIN(a) *std::min_element((a).begin(), (a).end())
#define MAX(a) *std::max_element((a).begin(), (a).end())
#define SUM(a) std::accumulate((a... | replace | 195 | 196 | 195 | 196 | TLE | |
p02941 | C++ | Time Limit Exceeded | #include <cstdio>
#include <cstring>
#include <queue>
using namespace std;
struct node {
int v, p;
bool operator<(const node &a) const { return v < a.v; }
};
int a[200005], b[200005];
priority_queue<node> q;
int main(void) {
int n, i, x, p, l, tmp;
long long ans = 0;
node k;
scanf("%d", &n);
for (i = 0; ... | #include <cstdio>
#include <cstring>
#include <queue>
using namespace std;
struct node {
int v, p;
bool operator<(const node &a) const { return v < a.v; }
};
int a[200005], b[200005];
priority_queue<node> q;
int main(void) {
int n, i, x, p, l, tmp;
long long ans = 0;
node k;
scanf("%d", &n);
for (i = 0; ... | replace | 47 | 49 | 47 | 51 | TLE | |
p02941 | C++ | Runtime Error | #include <bits/stdc++.h>
#define fo(i, l, r) for (int i = l; i <= r; i++)
#define of(i, l, r) for (int i = l; i >= r; i--)
#define fe(i, u) for (int i = head[u]; i; i = e[i].next)
#define el putchar('\n')
#define ta putchar(' ')
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
inline void open(con... | #include <bits/stdc++.h>
#define fo(i, l, r) for (int i = l; i <= r; i++)
#define of(i, l, r) for (int i = l; i >= r; i--)
#define fe(i, u) for (int i = head[u]; i; i = e[i].next)
#define el putchar('\n')
#define ta putchar(' ')
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
inline void open(con... | replace | 30 | 31 | 30 | 31 | 0 | |
p02941 | C++ | Runtime Error | #include <cstdio>
#include <cstdlib>
#include <cstring>
#include <map>
#include <queue>
#include <set>
#include <vector>
#define X first
#define Y second
#define PB push_back
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
const int N = 2e5 + 500;
const int INF = 0x3f3... | #include <cstdio>
#include <cstdlib>
#include <cstring>
#include <map>
#include <queue>
#include <set>
#include <vector>
#define X first
#define Y second
#define PB push_back
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
const int N = 2e5 + 500;
const int INF = 0x3f3... | replace | 42 | 46 | 42 | 48 | 0 | |
p02941 | C++ | Time Limit Exceeded | #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 | 33 | 34 | 33 | 35 | TLE | |
p02941 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vll = vector<ll>;
using vvi = vector<vector<int>>;
using vvl = vector<vector<ll>>;
struct N {
int i;
ll v;
};
bool operator<(const N &l, const N &r) { return l.v < r.v; }
int main() {
cin.tie(nullptr);
ios::sy... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vll = vector<ll>;
using vvi = vector<vector<int>>;
using vvl = vector<vector<ll>>;
struct N {
int i;
ll v;
};
bool operator<(const N &l, const N &r) { return l.v < r.v; }
int main() {
cin.tie(nullptr);
ios::sy... | replace | 45 | 47 | 45 | 49 | TLE | |
p02941 | C++ | Time Limit Exceeded | #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 ll long long int
const int INF = 2147483647;
using namespace std;
bool match[200000] = {};
ll a[200000] = {};
ll b[200000] = {};
priority_queue<pair<ll, ll>> q;
int n;
ll dfs(int i) {
ll ... | #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 ll long long int
const int INF = 2147483647;
using namespace std;
bool match[200000] = {};
ll a[200000] = {};
ll b[200000] = {};
priority_queue<pair<ll, ll>> q;
int n;
ll dfs(int i) {
ll ... | insert | 21 | 21 | 21 | 24 | TLE | |
p02941 | C++ | Time Limit Exceeded | // #include <bits/stdc++.h>
#include <algorithm>
#include <cmath>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <time.h>
#include <vector>
using namespace std;
... | // #include <bits/stdc++.h>
#include <algorithm>
#include <cmath>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <time.h>
#include <vector>
using namespace std;
... | insert | 89 | 89 | 89 | 94 | TLE | |
p02941 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define R cin >>
#define Z class
#define ll long long
#define ln cout << '\n'
#define in(a) insert(a)
#define pb(a) push_back(a)
#define pd(a) printf("%.10f\n", a)
#define mem(a) memset(a, 0, sizeof(a))
#define all(c) (c).begin(), (c).end()
... | #include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define R cin >>
#define Z class
#define ll long long
#define ln cout << '\n'
#define in(a) insert(a)
#define pb(a) push_back(a)
#define pd(a) printf("%.10f\n", a)
#define mem(a) memset(a, 0, sizeof(a))
#define all(c) (c).begin(), (c).end()
... | replace | 63 | 64 | 63 | 65 | TLE | |
p02941 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <queue>
#define st first
#define nd second
using namespace std;
using ll = long long;
using pii = pair<int, int>;
const int N = 1e5 + 10;
int a[N], b[N];
int main() {
int n;
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
}
a[0] = a[n]... | #include <algorithm>
#include <cstdio>
#include <queue>
#define st first
#define nd second
using namespace std;
using ll = long long;
using pii = pair<int, int>;
const int N = 2e5 + 10;
int a[N], b[N];
int main() {
int n;
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
}
a[0] = a[n]... | replace | 9 | 10 | 9 | 10 | 0 | |
p02941 | C++ | Time Limit Exceeded | #include <algorithm>
#include <assert.h>
#include <cmath>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
#define vi vector<int... | #include <algorithm>
#include <assert.h>
#include <cmath>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
#define vi vector<int... | insert | 101 | 101 | 101 | 103 | TLE | |
p02941 | C++ | Time Limit Exceeded | #include <map>
#include <set>
#include <stdio.h>
#include <utility>
#include <vector>
// Attributes
typedef long long int lld;
int n;
lld operation = 0;
std::map<lld, std::vector<int>> indices;
std::vector<lld> init, result;
// Pop largest indices one. Return {result value, index}
std::pair<lld, int> pop_largest() {
... | #include <map>
#include <set>
#include <stdio.h>
#include <utility>
#include <vector>
// Attributes
typedef long long int lld;
int n;
lld operation = 0;
std::map<lld, std::vector<int>> indices;
std::vector<lld> init, result;
// Pop largest indices one. Return {result value, index}
std::pair<lld, int> pop_largest() {
... | replace | 77 | 84 | 77 | 85 | TLE | |
p02941 | C++ | Time Limit Exceeded | #include <iostream>
#include <queue>
#include <utility>
#define llint long long
using namespace std;
typedef pair<llint, llint> P;
llint n;
llint a[200005], b[200005];
priority_queue<P> Q;
int main(void) {
ios::sync_with_stdio(0);
cin.tie(0);
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
for (int... | #include <iostream>
#include <queue>
#include <utility>
#define llint long long
using namespace std;
typedef pair<llint, llint> P;
llint n;
llint a[200005], b[200005];
priority_queue<P> Q;
int main(void) {
ios::sync_with_stdio(0);
cin.tie(0);
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
for (int... | insert | 44 | 44 | 44 | 51 | TLE | |
p02941 | C++ | Time Limit Exceeded | #define DEBUG 0
#include <bits/stdc++.h>
using namespace std;
#if DEBUG
// basic debugging macros
int __i__, __j__;
#define printLine(l) \
for (__i__ = 0; __i__ < l; __i__++) { \
cout << "-"; ... | #define DEBUG 0
#include <bits/stdc++.h>
using namespace std;
#if DEBUG
// basic debugging macros
int __i__, __j__;
#define printLine(l) \
for (__i__ = 0; __i__ < l; __i__++) { \
cout << "-"; ... | replace | 111 | 112 | 111 | 112 | TLE | |
p02941 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> P;
typedef pair<int, int> Pi;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define fi first
#define se second
#define endl "\n"
template <typename T> inline b... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> P;
typedef pair<int, int> Pi;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define fi first
#define se second
#define endl "\n"
template <typename T> inline b... | replace | 109 | 117 | 109 | 110 | TLE | |
p02941 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pll;
#define FOR(i, n, m) for (ll(i) = (m); (i) < (n); ++(i))
#define REP(i, n) FOR(i, n, 0)
#define OF64 std::setprecision(10)
const ll MOD = 1000000007;
const ll INF = (ll)1e15;
ll A[200005];
ll B[200005];
int main() {
... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pll;
#define FOR(i, n, m) for (ll(i) = (m); (i) < (n); ++(i))
#define REP(i, n) FOR(i, n, 0)
#define OF64 std::setprecision(10)
const ll MOD = 1000000007;
const ll INF = (ll)1e15;
ll A[200005];
ll B[200005];
int main() {
... | replace | 33 | 37 | 33 | 41 | TLE | |
p02941 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#pragma region Macros
#define ios \
ios::sync_with_stdio(false); \
cin.tie(nullptr);
#define VEC(type, name, size) ... | #include <bits/stdc++.h>
using namespace std;
#pragma region Macros
#define ios \
ios::sync_with_stdio(false); \
cin.tie(nullptr);
#define VEC(type, name, size) ... | replace | 124 | 126 | 124 | 131 | TLE | |
p02941 | C++ | Time Limit Exceeded | // #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
#define ll long long
#define ld long double
#define P pair<ll, ll>
#define FOR(i, n, m) for (ll i = n; i < (ll)m; i++)
#define FORr(i, m, n) for (ll i = n; i >= (ll)m; i--)
#define FORm(i, m) for (auto i = m.begin(); i != m.end... | // #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#include <iostream>
using namespace std;
#define ll long long
#define ld long double
#define P pair<ll, ll>
#define FOR(i, n, m) for (ll i = n; i < (ll)m; i++)
#define FORr(i, m, n) for (ll i = n; i >= (ll)m; i--)
#define FORm(i, m) for (auto i = m.begin(); i != m.end... | delete | 48 | 53 | 48 | 48 | TLE | |
p02941 | C++ | Time Limit Exceeded | #include <cstdio>
#include <queue>
using namespace std;
int a[200000];
int b[200000];
int main() {
int n, i;
long long ans = 0;
priority_queue<pair<int, int>> q;
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", &a[i]);
for (i = 0; i < n; i++)
scanf("%d", &b[i]);
for (i = 0; i < n; i++)
... | #include <cstdio>
#include <queue>
using namespace std;
int a[200000];
int b[200000];
int main() {
int n, i;
long long ans = 0;
priority_queue<pair<int, int>> q;
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%d", &a[i]);
for (i = 0; i < n; i++)
scanf("%d", &b[i]);
for (i = 0; i < n; i++)
... | insert | 44 | 44 | 44 | 50 | TLE | |
p02941 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using pii = pair<int, int>;
int n, a[200010], b[200010];
int norm(int x) {
x = ((x % n) + n) % n;
return x ? x : n;
}
int &A(int i) { return a[norm(i)]; }
int &B(int i) { return b[norm(i)]; }
bool f(int i) { return B(i) >= B(i - 1) + B(i + 1) + A(i); }
int main() {
... | #include <bits/stdc++.h>
using namespace std;
using pii = pair<int, int>;
int n, a[200010], b[200010];
int norm(int x) {
x = ((x % n) + n) % n;
return x ? x : n;
}
int &A(int i) { return a[norm(i)]; }
int &B(int i) { return b[norm(i)]; }
bool f(int i) { return B(i) >= B(i - 1) + B(i + 1) + A(i); }
int main() {
... | insert | 29 | 29 | 29 | 33 | TLE | |
p02941 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[]) {
int n;
cin >> n;
long long a[n], b[n];
multiset<pair<long long, int>> memo;
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
for (int i = 0; i < n; ++i) {
cin >> b[i];
if (a[i] != b[i]) {
memo.insert(make... | #include <bits/stdc++.h>
using namespace std;
int main(int argc, char const *argv[]) {
int n;
cin >> n;
long long a[n], b[n];
multiset<pair<long long, int>> memo;
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
for (int i = 0; i < n; ++i) {
cin >> b[i];
if (a[i] != b[i]) {
memo.insert(make... | replace | 19 | 40 | 19 | 34 | TLE | |
p02941 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, a[100100], b[100100];
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
set<pair<int, int>> s;
for (int i = 0; i < n; i++) {
cin >> b[i];
s.insert({b[i], i});
}
long long ans = ... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, a[200100], b[200100];
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
set<pair<int, int>> s;
for (int i = 0; i < n; i++) {
cin >> b[i];
s.insert({b[i], i});
}
long long ans = ... | replace | 7 | 8 | 7 | 8 | 0 | |
p02941 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define mp make_pair
#define pb push_back
#define ff first
#define ss second
#define ll long long
typedef pair<ll, ll> pll;
typedef vector<pll> vi;
#define out(x) return cout << x, 0;
#define precision(x, d) cout << fixed << setprecisio... | #include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define mp make_pair
#define pb push_back
#define ff first
#define ss second
#define ll long long
typedef pair<ll, ll> pll;
typedef vector<pll> vi;
#define out(x) return cout << x, 0;
#define precision(x, d) cout << fixed << setprecisio... | replace | 22 | 23 | 22 | 23 | TLE | |
p02941 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define x first
#define y second
#define pb push_back
#define mp make_pair
typedef pair<int, int> pii;
typedef long long ll;
const int MOD = 1e9 + 7;
const int BASE = 27;
const int N = 100001;
const ll oo = 1e18;
const double EPS = 1e-9;
int n, a[N], b[N];
priority_queue<... | #include <bits/stdc++.h>
using namespace std;
#define x first
#define y second
#define pb push_back
#define mp make_pair
typedef pair<int, int> pii;
typedef long long ll;
const int MOD = 1e9 + 7;
const int BASE = 27;
const int N = 200001;
const ll oo = 1e18;
const double EPS = 1e-9;
int n, a[N], b[N];
priority_queue<... | replace | 10 | 11 | 10 | 11 | 0 | |
p02941 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
int main() {
using namespace std;
unsigned long N;
cin >> N;
vector<unsigned long> A(N), B(N);
copy_n(istream_iterator<unsigned long>(cin), N, A.begin());
priority_queue<pair<unsigned long, unsigned long>> pq;
for (unsigned long i = 0; i < N; ++i) {
cin >> B[i];
if (B[i... | #include <bits/stdc++.h>
int main() {
using namespace std;
unsigned long N;
cin >> N;
vector<unsigned long> A(N), B(N);
copy_n(istream_iterator<unsigned long>(cin), N, A.begin());
priority_queue<pair<unsigned long, unsigned long>> pq;
for (unsigned long i = 0; i < N; ++i) {
cin >> B[i];
if (B[i... | delete | 25 | 28 | 25 | 25 | TLE | |
p02941 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
mt19937 mt(736);
void solve(istream &cin = std::cin, ostream &cout = std::cout) {
int n;
cin >> n;
vector<int> a(n), b(n);
for (auto &it : a)
cin >> it;
priority_queue<pair<int, int>> pq;
for (size_t i = 0; i < b.size(); i++) {
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
mt19937 mt(736);
void solve(istream &cin = std::cin, ostream &cout = std::cout) {
int n;
cin >> n;
vector<int> a(n), b(n);
for (auto &it : a)
cin >> it;
priority_queue<pair<int, int>> pq;
for (size_t i = 0; i < b.size(); i++) {
... | insert | 43 | 43 | 43 | 49 | TLE | |
p02941 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
long long n;
vector<long long> a, b;
priority_queue<pair<int, int>> pq;
long long solve();
int main() {
cin >> n;
a.resize(n);
b.resize(n);
for (int i = 0; i < n; ++i)
cin >> a[i];
for (int i = 0; i < n; ++i)
cin >> b[i];
cout << solve() << endl;
re... | #include <bits/stdc++.h>
using namespace std;
long long n;
vector<long long> a, b;
priority_queue<pair<int, int>> pq;
long long solve();
int main() {
cin >> n;
a.resize(n);
b.resize(n);
for (int i = 0; i < n; ++i)
cin >> a[i];
for (int i = 0; i < n; ++i)
cin >> b[i];
cout << solve() << endl;
re... | replace | 31 | 35 | 31 | 37 | TLE | |
p02941 | 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, fr, to) for (int i = fr; i <= to; ++i)
#define foreach(i, dat) \
f... | #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, fr, to) for (int i = fr; i <= to; ++i)
#define foreach(i, dat) \
f... | replace | 37 | 38 | 37 | 38 | TLE | |
p02941 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
#define PB push_back
#define MP make_pair
#define st first
#define nd second
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;
using vll ... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
#define PB push_back
#define MP make_pair
#define st first
#define nd second
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;
using vll ... | replace | 88 | 89 | 88 | 89 | TLE | |
p02941 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("Ofast")
#define va first
#define vb second
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
int n, arr[202020], brr[202020];
ll ans;
priority_queue<pii> pq;
inline int pv(int x) {
if (x == 0)
return n - 1;... | #include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("Ofast")
#define va first
#define vb second
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
int n, arr[202020], brr[202020];
ll ans;
priority_queue<pii> pq;
inline int pv(int x) {
if (x == 0)
return n - 1;... | replace | 53 | 54 | 53 | 55 | TLE | |
p02941 | C++ | Runtime Error | #include <algorithm>
#include <array>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <limits.h>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <time.h>
#include <unordered_map>
#in... | #include <algorithm>
#include <array>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <limits.h>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <time.h>
#include <unordered_map>
#in... | replace | 173 | 175 | 173 | 177 | 0 | |
p02941 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstring> //memset(dp,0,sizeof(dp))
#include <functional>
#include <iomanip>
#include <iostream>
#include <locale>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
#define ll long long
#d... | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstring> //memset(dp,0,sizeof(dp))
#include <functional>
#include <iomanip>
#include <iostream>
#include <locale>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
#define ll long long
#d... | insert | 61 | 61 | 61 | 65 | TLE | |
p02941 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int INF = INT_MAX;
const ll LINF = LLONG_MAX;
const ll MOD = 1e9 + 7;
template <class T> ostream &operator<<(ostream &o, const vector<T> &v) {
o << "[";
for (int i = 0; i < (int)v.size(); i++)
o << (i > 0 ? ", ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int INF = INT_MAX;
const ll LINF = LLONG_MAX;
const ll MOD = 1e9 + 7;
template <class T> ostream &operator<<(ostream &o, const vector<T> &v) {
o << "[";
for (int i = 0; i < (int)v.size(); i++)
o << (i > 0 ? ", ... | replace | 61 | 62 | 61 | 62 | TLE | |
p02941 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int INF = INT_MAX;
const ll LINF = LLONG_MAX;
const ll MOD = 1e9 + 7;
template <class T> ostream &operator<<(ostream &o, const vector<T> &v) {
o << "[";
for (int i = 0; i < (int)v.size(); i++)
o << (i > 0 ? ", ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int INF = INT_MAX;
const ll LINF = LLONG_MAX;
const ll MOD = 1e9 + 7;
template <class T> ostream &operator<<(ostream &o, const vector<T> &v) {
o << "[";
for (int i = 0; i < (int)v.size(); i++)
o << (i > 0 ? ", ... | replace | 63 | 64 | 63 | 64 | TLE | |
p02941 | C++ | Time Limit Exceeded | // #define _GLIBCXX_DEBUG // for STL debug (optional)
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#inc... | // #define _GLIBCXX_DEBUG // for STL debug (optional)
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#inc... | replace | 101 | 102 | 101 | 102 | TLE | |
p02941 | C++ | Time Limit Exceeded | /*
#pragma GCC optimize("O2")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx,avx2,sse,sse2,fma,tune=native")
//*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
... | /*
#pragma GCC optimize("O2")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx,avx2,sse,sse2,fma,tune=native")
//*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
... | insert | 68 | 68 | 68 | 70 | TLE | |
p02941 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define int long long
using namespace std;
const int INF = 1e10;
const int MOD = 1e9 + 7;
#define dump(x) cout << #x << " = " << (x) << endl;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORR(i, a, b) for (int i = (a); i <= (b); ++i)
#define pb push_back
#define all(v) (v).begin... | #include <bits/stdc++.h>
#define int long long
using namespace std;
const int INF = 1e10;
const int MOD = 1e9 + 7;
#define dump(x) cout << #x << " = " << (x) << endl;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORR(i, a, b) for (int i = (a); i <= (b); ++i)
#define pb push_back
#define all(v) (v).begin... | insert | 53 | 53 | 53 | 57 | TLE | |
p02941 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <limits.h>
#include <queue>
#include <string>
#include <vector>
#define rep(i, n) (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
int n;
cin >> n;
vector<long long> a(n), b(n);
for
rep(i, n) cin >> b[i];
for
re... | #include <algorithm>
#include <iostream>
#include <limits.h>
#include <queue>
#include <string>
#include <vector>
#define rep(i, n) (int i = 0; i < (int)(n); i++)
using namespace std;
int main() {
int n;
cin >> n;
vector<long long> a(n), b(n);
for
rep(i, n) cin >> b[i];
for
re... | insert | 30 | 30 | 30 | 34 | TLE | |
p02941 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main(void) {
long n;
cin >> n;
vector<long> a(n), b(n);
for (auto &x : a)
cin >> x;
for (auto &x : b)
cin >> x;
long c = 0, r = 0;
for (int i = 0; i < n; i++)
if (a[i] == b[i])
c++;
set<long> s;
for (int i = 0; i < n; i++)
if... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
long n;
cin >> n;
vector<long> a(n), b(n);
for (auto &x : a)
cin >> x;
for (auto &x : b)
cin >> x;
long c = 0, r = 0;
for (int i = 0; i < n; i++)
if (a[i] == b[i])
c++;
set<long> s;
for (int i = 0; i < n; i++)
if... | insert | 33 | 33 | 33 | 35 | TLE | |
p02941 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define repp(i, n, m) for (int(i) = (n); (i) < (m); (i)++)
#define repn(i, n) for (int(i) = 1; (i) <= (n); (i)++)
#define repr(i, n) for (int(i) = (n - 1); (i) >= 0; (i)--)
#define all(x) (x).begin(), (x).end()
#define l... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define repp(i, n, m) for (int(i) = (n); (i) < (m); (i)++)
#define repn(i, n) for (int(i) = 1; (i) <= (n); (i)++)
#define repr(i, n) for (int(i) = (n - 1); (i) >= 0; (i)--)
#define all(x) (x).begin(), (x).end()
#define l... | replace | 69 | 73 | 69 | 75 | TLE | |
p02941 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define Rep(i, n) for (int i = 0; i < (int)(n); i++)
#define For(i, n1, n2) for (int i = (int)(n1); i < (int)(n2); i++)
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define RREP(i, n) for (ll i = ((ll)(n)-1); i >= 0; i--)
#define FOR(i, n1, n2) for (ll i = (ll)(n1); i... | #include <bits/stdc++.h>
using namespace std;
#define Rep(i, n) for (int i = 0; i < (int)(n); i++)
#define For(i, n1, n2) for (int i = (int)(n1); i < (int)(n2); i++)
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define RREP(i, n) for (ll i = ((ll)(n)-1); i >= 0; i--)
#define FOR(i, n1, n2) for (ll i = (ll)(n1); i... | replace | 142 | 143 | 142 | 143 | 0 | |
p02941 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL << 62
#define inf 1000000007
ll a[200010], b[200010];
priority_queue<pair<ll, ll>> que;
int main() {
ll n, cnt = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
ll x;
cin >>... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL << 62
#define inf 1000000007
ll a[200010], b[200010];
priority_queue<pair<ll, ll>> que;
int main() {
ll n, cnt = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
ll x;
cin >>... | insert | 37 | 37 | 37 | 39 | TLE | |
p02941 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL << 62
#define inf 1000000007
ll a[200010], b[200010];
int main() {
ll n;
cin >> n;
for (ll i = 0; i < n; i++) {
cin >> a[i];
}
priority_queue<pair<ll, ll>> ch;
for (ll i = 0; i < n; i++) {
cin >> b[i];
ch.push(m... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL << 62
#define inf 1000000007
ll a[200010], b[200010];
int main() {
ll n;
cin >> n;
for (ll i = 0; i < n; i++) {
cin >> a[i];
}
priority_queue<pair<ll, ll>> ch;
for (ll i = 0; i < n; i++) {
cin >> b[i];
ch.push(m... | replace | 38 | 40 | 38 | 45 | TLE | |
p02941 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
struct node {
int x, y;
bool operator<(const node s) const { return x > s.x; }
} b[100010];
int a[100010], c[100010];
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 1; i <= n; i++) {
cin >> b[i].x;
c[i - 1] = b[i]... | #include <bits/stdc++.h>
using namespace std;
struct node {
int x, y;
bool operator<(const node s) const { return x > s.x; }
} b[1000010];
int a[1000010], c[1000010];
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 1; i <= n; i++) {
cin >> b[i].x;
c[i - 1] = b... | replace | 5 | 7 | 5 | 7 | 0 | |
p02941 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define ll long long
#define f first
#define s second
#define pb push_back
using namespace std;
ll n, raod, a[300005], b[300005];
ll kk(ll x) {
if (x == 1)
return b[n] + b[2];
if (x == n)
return b[1] + b[n - 1];
return b[x - 1] + b[x + 1];
}
set<pair<ll, ll>> st;
set<pair<ll, ll>>... | #include <bits/stdc++.h>
#define ll long long
#define f first
#define s second
#define pb push_back
using namespace std;
ll n, raod, a[300005], b[300005];
ll kk(ll x) {
if (x == 1)
return b[n] + b[2];
if (x == n)
return b[1] + b[n - 1];
return b[x - 1] + b[x + 1];
}
set<pair<ll, ll>> st;
set<pair<ll, ll>>... | replace | 41 | 43 | 41 | 52 | TLE | |
p02941 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int const N = 2e5 + 5;
int const MAX = 105;
int n, a[N], d[N];
int main() {
ios_base::sync_with_stdio(0);
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> d[i];
}
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
priority_queue<pair<int, int>> que;
fo... | #include <bits/stdc++.h>
using namespace std;
int const N = 2e5 + 5;
int const MAX = 105;
int n, a[N], d[N];
int main() {
ios_base::sync_with_stdio(0);
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> d[i];
}
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
priority_queue<pair<int, int>> que;
fo... | replace | 35 | 36 | 35 | 36 | TLE | |
p02941 | C++ | Time Limit Exceeded | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfenv>
#include <chrono>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#inc... | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfenv>
#include <chrono>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#inc... | replace | 94 | 98 | 94 | 100 | TLE | |
p02941 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, o, n) for (long long i = o; i < n; i++)
#define oneforall \
ios::sync_with_stdio(false); \
cin.tie(0);
#define all(v) (v).begin(), (v).end()
#defi... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, o, n) for (long long i = o; i < n; i++)
#define oneforall \
ios::sync_with_stdio(false); \
cin.tie(0);
#define all(v) (v).begin(), (v).end()
#defi... | replace | 60 | 68 | 60 | 81 | TLE | |
p02941 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cout.precision(12);
cout << fixed;
int n;
cin >> n;
vector<int> a(n), b(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
set<pair<int, int>> s;
for... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cout.precision(12);
cout << fixed;
int n;
cin >> n;
vector<int> a(n), b(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
cin >> b[i];
}
set<pair<int, int>> s;
for... | replace | 48 | 49 | 48 | 55 | TLE | |
p02941 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
// #include <boost/multiprecision/cpp_int.hpp>
#pragma GCC optimize("O3")
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPP(i, n) for (int i = 1; i <= n; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define EPS (1e-9)
#define INF (1e17)
#define PI (acos(-1))
// const double PI = ac... | #include <bits/stdc++.h>
// #include <boost/multiprecision/cpp_int.hpp>
#pragma GCC optimize("O3")
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPP(i, n) for (int i = 1; i <= n; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define EPS (1e-9)
#define INF (1e17)
#define PI (acos(-1))
// const double PI = ac... | insert | 93 | 93 | 93 | 97 | TLE | |
p02941 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define dup(x, y) (((x) + (y)-1) / (y)) // dup * y >= x なる最小のdup.
using namespace std;
typedef long... | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define dup(x, y) (((x) + (y)-1) / (y)) // dup * y >= x なる最小のdup.
using namespace std;
typedef long... | replace | 34 | 35 | 34 | 35 | TLE | |
p02941 | C++ | Time Limit Exceeded | #include <queue>
#include <stdio.h>
using namespace std;
long long n;
long long a[200000];
long long b[200000];
long long s, t, x, y, z;
long long ans;
priority_queue<long long> q;
int main() {
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%lld", a + i);
s += a[i];
}
for (int i = 0; i < n; i++) ... | #include <queue>
#include <stdio.h>
using namespace std;
long long n;
long long a[200000];
long long b[200000];
long long s, t, x, y, z;
long long ans;
priority_queue<long long> q;
int main() {
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%lld", a + i);
s += a[i];
}
for (int i = 0; i < n; i++) ... | replace | 29 | 30 | 29 | 30 | TLE | |
p02941 | C++ | Runtime Error | #include <algorithm>
#include <cassert>
#include <chrono>
#include <cstring>
#include <iostream>
#include <random>
#include <set>
#include <string>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> a(n), b(n);
for (int i = 0; i < n; ++i)
cin >> a[i];
set<pair<int, int... | #include <algorithm>
#include <cassert>
#include <chrono>
#include <cstring>
#include <iostream>
#include <random>
#include <set>
#include <string>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> a(n), b(n);
for (int i = 0; i < n; ++i)
cin >> a[i];
set<pair<int, int... | replace | 51 | 52 | 51 | 55 | 0 | |
p02941 | 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;
int main() {
int N;
ll ans = 0;
cin >> N;
vector<int> A(N), B(N);
rep(i, N) cin >> A[i];
priority_queue<vector<int>> q;
rep(i, N) {
cin >> B[i];
q.push({B[i], i});
}
while (!q.em... | #include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
int main() {
int N;
ll ans = 0;
cin >> N;
vector<int> A(N), B(N);
rep(i, N) cin >> A[i];
priority_queue<vector<int>> q;
rep(i, N) {
cin >> B[i];
q.push({B[i], i});
}
while (!q.em... | replace | 26 | 27 | 26 | 27 | TLE | |
p02941 | 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;
int main() {
int N;
ll ans = 0;
cin >> N;
vector<int> A(N), B(N);
rep(i, N) cin >> A[i];
priority_queue<vector<int>> q;
rep(i, N) {
cin >> B[i];
q.push({B[i], i});
}
while (!q.em... | #include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
int main() {
int N;
ll ans = 0;
cin >> N;
vector<int> A(N), B(N);
rep(i, N) cin >> A[i];
priority_queue<vector<int>> q;
rep(i, N) {
cin >> B[i];
q.push({B[i], i});
}
while (!q.em... | replace | 26 | 27 | 26 | 27 | TLE | |
p02941 | C++ | Time Limit Exceeded | #pragma GCC optimize("Ofast")
#pragma GCC optimize("no-stack-protector")
// #pragma GCC optimize("unroll-loops")
#pragma GCC optimize("fast-math")
#pragma GCC target("sse,sse2,sse3,ssse3,popcnt,abm,mmx,tune=native")
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <d... | #pragma GCC optimize("Ofast")
#pragma GCC optimize("no-stack-protector")
// #pragma GCC optimize("unroll-loops")
#pragma GCC optimize("fast-math")
#pragma GCC target("sse,sse2,sse3,ssse3,popcnt,abm,mmx,tune=native")
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <d... | replace | 71 | 73 | 71 | 81 | TLE | |
p02941 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define ff(i, x, y) for (int i = x; i <= y; i++)
#define fs(i, x, y) for (int i = x; i >= y; i--)
#define maxn 200005
using namespace std;
typedef long long ll;
typedef struct node {
int id, val;
node(int a1, int a2) {
id = a1;
val = a2;
}
};
bool operator<(const node &a1, const n... | #include <bits/stdc++.h>
#define ff(i, x, y) for (int i = x; i <= y; i++)
#define fs(i, x, y) for (int i = x; i >= y; i--)
#define maxn 200005
using namespace std;
typedef long long ll;
typedef struct node {
int id, val;
node(int a1, int a2) {
id = a1;
val = a2;
}
};
bool operator<(const node &a1, const n... | insert | 27 | 27 | 27 | 31 | TLE | |
p02941 | C++ | Runtime Error | // minamoto
#include <bits/stdc++.h>
#define R register
#define fp(i, a, b) for (R int i = (a), I = (b) + 1; i < I; ++i)
#define fd(i, a, b) for (R int i = (a), I = (b)-1; i > I; --i)
#define go(u) for (int i = head[u], v = e[i].v; i; i = e[i].nx, v = e[i].v)
template <class T> inline bool cmax(T &a, const T &b) {
re... | // minamoto
#include <bits/stdc++.h>
#define R register
#define fp(i, a, b) for (R int i = (a), I = (b) + 1; i < I; ++i)
#define fd(i, a, b) for (R int i = (a), I = (b)-1; i > I; --i)
#define go(u) for (int i = head[u], v = e[i].v; i; i = e[i].nx, v = e[i].v)
template <class T> inline bool cmax(T &a, const T &b) {
re... | replace | 17 | 18 | 17 | 18 | -11 | |
p02941 | C++ | Runtime Error | #include <algorithm>
#include <complex>
#include <fstream>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
const int NMAX = 1e5 + 5;
int n, a[NMAX], b[NMAX];
ll ans = 0;
pair<int, int> p;
bool possible = true;
priority_queue<pair<int,... | #include <algorithm>
#include <complex>
#include <fstream>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
const int NMAX = 2 * 1e5 + 5;
int n, a[NMAX], b[NMAX];
ll ans = 0;
pair<int, int> p;
bool possible = true;
priority_queue<pair<... | replace | 11 | 12 | 11 | 12 | 0 | |
p02941 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
// #define MOD 998244353
#define INF 1145141919810893364
#define PI 3.141592653589
typedef pair<int, int> PP;
typedef long long ll;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <c... | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
// #define MOD 998244353
#define INF 1145141919810893364
#define PI 3.141592653589
typedef pair<int, int> PP;
typedef long long ll;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <c... | replace | 58 | 62 | 58 | 59 | TLE | |
p02942 | C++ | Runtime Error | // ██████╗ ██╗ ██╗██╗ ██████╗ ███████╗
// ██╔══██╗██║ ██║██║ ██╔══██╗██╔════╝
// ██████╔╝██║ ██║██║█████╗██║ ██║█████╗
// ██╔══██╗██║ ██║██║╚════╝██║ ██║██╔══╝
// ██║ ██║╚██████╔╝██║ ██████╔╝███████╗
// ╚═╝ ╚═╝ ╚═════╝ ╚═╝ ╚═════╝ ╚══════╝
#include <bits/stdc++.h>
// #pragma GCC target(... | // ██████╗ ██╗ ██╗██╗ ██████╗ ███████╗
// ██╔══██╗██║ ██║██║ ██╔══██╗██╔════╝
// ██████╔╝██║ ██║██║█████╗██║ ██║█████╗
// ██╔══██╗██║ ██║██║╚════╝██║ ██║██╔══╝
// ██║ ██║╚██████╔╝██║ ██████╔╝███████╗
// ╚═╝ ╚═╝ ╚═════╝ ╚═╝ ╚═════╝ ╚══════╝
#include <bits/stdc++.h>
// #pragma GCC target(... | replace | 97 | 98 | 97 | 98 | 0 | |
p02942 | C++ | Runtime Error | /*Lucky_Glass*/
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <queue>
using namespace std;
const int N = 100, inf = (1 << 29);
int Rr, Cc, Ps, Pt, Emat[N + 3][N + 3], Edep[N * 3], Eans[N + 3][N + 3];
bool Bb[N + 3][N + 3];
vector<int> Vec[N + 3];
struct GGRAPH {
struct GNODE {
int to, cap,... | /*Lucky_Glass*/
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <queue>
using namespace std;
const int N = 100, inf = (1 << 29);
int Rr, Cc, Ps, Pt, Emat[N + 3][N + 3], Edep[N * 3], Eans[N + 3][N + 3];
bool Bb[N + 3][N + 3];
vector<int> Vec[N + 3];
struct GGRAPH {
struct GNODE {
int to, cap,... | replace | 17 | 18 | 17 | 18 | 0 | |
p02942 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cstdio>
const int N = 101;
int a[N][N];
int r[N]; // r[x] = row of element x
int p[N][N]; // p[x][y] = row of element y in column x
int next(int row) {
int col = 0;
while (a[row][col] != -1)
++col;
return col;
}
int main() {
int n, m;
scanf("%d%d", &n, &m);
for (int i... | #include <algorithm>
#include <cstdio>
const int N = 101;
int a[N][N];
int r[N * N]; // r[x] = row of element x
int p[N][N]; // p[x][y] = row of element y in column x
int next(int row) {
int col = 0;
while (a[row][col] != -1)
++col;
return col;
}
int main() {
int n, m;
scanf("%d%d", &n, &m);
for (int... | replace | 4 | 6 | 4 | 6 | TLE | |
p02942 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
namespace maxflow {
#define inf 999999999
struct edge {
int to, nxt, f;
} e[20001];
int head[211];
int edge_cnt;
int s, t;
void init(int s1, int t1) {
s = s1, t = t1;
edge_cnt = -1;
memset(head, -1, sizeof(head));
}
void add(int u, int v, int f) {
e[++edge_cnt].nx... | #include <bits/stdc++.h>
using namespace std;
namespace maxflow {
#define inf 999999999
struct edge {
int to, nxt, f;
} e[200001];
int head[211];
int edge_cnt;
int s, t;
void init(int s1, int t1) {
s = s1, t = t1;
edge_cnt = -1;
memset(head, -1, sizeof(head));
}
void add(int u, int v, int f) {
e[++edge_cnt].n... | replace | 6 | 7 | 6 | 7 | 0 | |
p02942 | C++ | Runtime Error | #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 | 65 | 66 | 65 | 66 | 0 | |
p02942 | C++ | Runtime Error | // #pragma GCC optimize("O3")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
#define mem(a, v) memset((a), (v), sizeof(a))
#define enl printf("\n")
#define case(t) printf("Case #%d: ", (t))
#define ni(n) scanf("%d", &(n))
#define nl(n) scanf("%... | // #pragma GCC optimize("O3")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
#define mem(a, v) memset((a), (v), sizeof(a))
#define enl printf("\n")
#define case(t) printf("Case #%d: ", (t))
#define ni(n) scanf("%d", &(n))
#define nl(n) scanf("%... | replace | 40 | 41 | 40 | 41 | 0 | |
p02942 | C++ | Runtime Error | #include <bits/stdc++.h>
#define maxn 128
using namespace std;
int n, m;
int a[maxn][maxn];
void read() {
cin >> n >> m;
int i, j;
for (i = 0; i < n; i++)
for (j = 0; j < m; j++)
cin >> a[i][j];
}
vector<int> v[maxn];
bool used[maxn * maxn];
bool tused[maxn * maxn];
int match[maxn * maxn];
void cl... | #include <bits/stdc++.h>
#define maxn 128
using namespace std;
int n, m;
int a[maxn][maxn];
void read() {
cin >> n >> m;
int i, j;
for (i = 0; i < n; i++)
for (j = 0; j < m; j++)
cin >> a[i][j];
}
vector<int> v[maxn * maxn];
bool used[maxn * maxn];
bool tused[maxn * maxn];
int match[maxn * maxn];
... | replace | 17 | 18 | 17 | 18 | 0 | |
p02942 | C++ | Runtime Error | #include <bits/stdc++.h>
#define MAXN 128
using namespace std;
int n, m;
vector<int> g[MAXN];
int a[MAXN][MAXN], b[MAXN][MAXN], us[MAXN][MAXN], used[MAXN], mt[MAXN];
void read() {
int i, j;
cin >> n >> m;
for (i = 0; i < n; i++)
for (j = 0; j < m; j++)
cin >> a[i][j];
}
bool try_kuhn(int v) {
if (use... | #include <bits/stdc++.h>
#define MAXN 128 * 4
using namespace std;
int n, m;
vector<int> g[MAXN];
int a[MAXN][MAXN], b[MAXN][MAXN], us[MAXN][MAXN], used[MAXN], mt[MAXN];
void read() {
int i, j;
cin >> n >> m;
for (i = 0; i < n; i++)
for (j = 0; j < m; j++)
cin >> a[i][j];
}
bool try_kuhn(int v) {
if ... | replace | 1 | 2 | 1 | 2 | 0 | |
p02942 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
const int N = 210, M = 20010;
const int INF = 1e9;
struct edge {
int from, to, flow, cap;
edge() {}
edge(int _1, int _2, int _3, int _4) : from(_1), to(_2),... | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
const int N = 210, M = 40010;
const int INF = 1e9;
struct edge {
int from, to, flow, cap;
edge() {}
edge(int _1, int _2, int _3, int _4) : from(_1), to(_2),... | replace | 11 | 12 | 11 | 12 | 0 | |
p02942 | C++ | Runtime Error | /*
_|_| _| _| _|
_| _| _| _|_| _|_|_|_| _| _| _|
_| _| _|_| _| _| _|_|
_| _| _| _| _| _| _| _|
_|_| _| _|_|_|_| _|_| _| _|
*/
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
... | /*
_|_| _| _| _|
_| _| _| _|_| _|_|_|_| _| _| _|
_| _| _|_| _| _| _|_|
_| _| _| _| _| _| _| _|
_|_| _| _|_|_|_| _|_| _| _|
*/
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
... | replace | 29 | 31 | 29 | 32 | 0 | |
p02942 | C++ | Runtime Error | // Love and Freedom.
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <queue>
#include <vector>
#define ll long long
#define inf 20021225
#define N 210
#define M 20001
using namespace std;
int read() {
int s = 0, f = 1;
char ch = getchar();
while (ch < '0' || ch > '9') {
if ... | // Love and Freedom.
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <queue>
#include <vector>
#define ll long long
#define inf 20021225
#define N 410
#define M 40001
using namespace std;
int read() {
int s = 0, f = 1;
char ch = getchar();
while (ch < '0' || ch > '9') {
if ... | replace | 9 | 11 | 9 | 11 | 0 | |
p02942 | C++ | Runtime Error | #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... | replace | 56 | 57 | 56 | 57 | 0 | |
p02942 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define N 210
#define M 200010
#define inf 2147483647
#define col(x) (((x - 1) / m) + 1)
inline int read() {
int x = 0;
char ch = getchar();
while (!isdigit(ch))
ch = getchar();
while (isdigit(ch))
x = x * 10 + ch - '0', ch = getchar();
return x;
}
int tot... | #include <bits/stdc++.h>
using namespace std;
#define N 210
#define M 200010
#define inf 2147483647
#define col(x) (((x - 1) / m) + 1)
inline int read() {
int x = 0;
char ch = getchar();
while (!isdigit(ch))
ch = getchar();
while (isdigit(ch))
x = x * 10 + ch - '0', ch = getchar();
return x;
}
int tot... | insert | 61 | 61 | 61 | 62 | 0 | |
p02942 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
const int maxi = 1e6 + 10;
int a[110][110], b[110][110];
string s;
int n, m;
vector<int> v[maxi];
set<pair<int, int>> st;
int c[110][110];
int cnt[110][110];
int calc(int x) {
int val = x / m;
if (x % m != 0)
val++;
return val;
}
int main()... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
const int maxi = 1e6 + 10;
int a[110][110], b[110][110];
string s;
int n, m;
vector<int> v[maxi];
set<pair<int, int>> st;
int c[110][110];
int cnt[110][110];
int calc(int x) {
int val = x / m;
if (x % m != 0)
val++;
return val;
}
int main()... | replace | 40 | 43 | 40 | 41 | TLE | |
p02942 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long int ull;
typedef long long int ll;
typedef pair<ll, ll> pll;
typedef long double D;
typedef complex<D> P;
#define F first
#define S second
const ll E = 1e18 + 7;
const ll MOD = 998244353;
// 1000000007;
template <typename T, typename U>
istream &... | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long int ull;
typedef long long int ll;
typedef pair<ll, ll> pll;
typedef long double D;
typedef complex<D> P;
#define F first
#define S second
const ll E = 1e18 + 7;
const ll MOD = 998244353;
// 1000000007;
template <typename T, typename U>
istream &... | replace | 173 | 175 | 173 | 175 | -11 | |
p02942 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define PP pair<int, pair<int, int>>
const int MAX = 510000;
const int MOD = 998244353;
const int INV2 = (MOD + 1) / 2;
signed main() {
int n, m;
cin >> n >> m;
int a[n][m];
pair<int, int> ichi[n * m + 1];
for (int i = 0; i < n; i++)
for... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define PP pair<int, pair<int, int>>
const int MAX = 510000;
const int MOD = 998244353;
const int INV2 = (MOD + 1) / 2;
signed main() {
int n, m;
cin >> n >> m;
int a[n][m];
pair<int, int> ichi[n * m + 1];
for (int i = 0; i < n; i++)
for... | replace | 29 | 30 | 29 | 32 | TLE | |
p02942 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define f(a, b, c) for (int a = (b); a <= (c); ++a)
const int maxn = 2e4 + 1;
int he[maxn], ne[maxn], to[maxn], w[maxn], cnt = 1;
inline void addedge(int x, int y, int z) {
ne[++cnt] = he[x], he[x] = cnt, to[cnt] = y, w[cnt] = z;
ne[++cnt] = he[y], he[y] = cnt, to[cnt] ... | #include <bits/stdc++.h>
using namespace std;
#define f(a, b, c) for (int a = (b); a <= (c); ++a)
const int maxn = 3e4 + 2;
int he[maxn], ne[maxn], to[maxn], w[maxn], cnt = 1;
inline void addedge(int x, int y, int z) {
ne[++cnt] = he[x], he[x] = cnt, to[cnt] = y, w[cnt] = z;
ne[++cnt] = he[y], he[y] = cnt, to[cnt] ... | replace | 3 | 4 | 3 | 4 | TLE | |
p02942 | C++ | Time Limit Exceeded | #include <cstdio>
#include <cstring>
#include <iostream>
#include <vector>
#define MN 210
#define MM 20100
int h[MN], nxt[MM], to[MM], cap[MM], K = 1;
int q[MN], hh = 0, tt = 0;
int iter[MN], d[MN];
int A[MN][MN], B[MN][MN], C[MN][MN];
std::vector<int> cnt[MN][MN];
void ins(int u, int v, int c) {
nxt[++K] = h[u];
... | #include <cstdio>
#include <cstring>
#include <iostream>
#include <vector>
#define MN 210
#define MM 21000
int h[MN], nxt[MM], to[MM], cap[MM], K = 1;
int q[MN], hh = 0, tt = 0;
int iter[MN], d[MN];
int A[MN][MN], B[MN][MN], C[MN][MN];
std::vector<int> cnt[MN][MN];
void ins(int u, int v, int c) {
nxt[++K] = h[u];
... | replace | 5 | 6 | 5 | 6 | TLE | |
p02942 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
const int MAXN = 105;
int n, m, a[MAXN][MAXN];
vector<int> gr[MAXN][MAXN];
inline void addEdge(int u, int v, int c) {
gr[u][v].push_back(c), gr[v][u].push_back... | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
const int MAXN = 505;
int n, m, a[MAXN][MAXN];
vector<int> gr[MAXN][MAXN];
inline void addEdge(int u, int v, int c) {
gr[u][v].push_back(c), gr[v][u].push_back... | replace | 9 | 10 | 9 | 10 | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.