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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
p02973 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
long long MOD = 1000000000 + 7;
int main() {
cout << setprecision(10);
int N;
cin >> N;
deque<ll> q;
for (int i = 0; i < N; i++) {
ll tmp;
cin >> tmp;
auto itr = lower_bound(q.begin(), q.end(), tmp)... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
long long MOD = 1000000000 + 7;
int main() {
cout << setprecision(10);
int N;
cin >> N;
deque<ll> q;
for (int i = 0; i < N; i++) {
ll tmp;
cin >> tmp;
auto itr = lower_bound(q.begin(), q.end(), tmp)... | replace | 18 | 19 | 18 | 19 | 0 | |
p02973 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<long> group;
for (int i = 0; i < n; i++) {
long a;
cin >> a;
if (group.size() == 0 || group[0] > a) {
// cout << "Insert top " << a << endl;
group.insert(group.begin(),... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<long> group;
for (int i = 0; i < n; i++) {
long a;
cin >> a;
if (group.size() == 0 || group[0] >= a) {
// cout << "Insert top " << a << endl;
group.insert(group.begin()... | replace | 14 | 15 | 14 | 15 | 0 | |
p02973 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; i++)
#define reps(i, s, n) for (int i = (s), i##_len = (n); i < i##_len; i++)
#define rrep(i, n) for (int i = (n)-1; i >= 0; i--)
#define rreps(i, e, n) for (int i = (n)-1; i >= (e); i--)
#d... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; i++)
#define reps(i, s, n) for (int i = (s), i##_len = (n); i < i##_len; i++)
#define rrep(i, n) for (int i = (n)-1; i >= 0; i--)
#define rreps(i, e, n) for (int i = (n)-1; i >= (e); i--)
#d... | replace | 23 | 24 | 23 | 24 | 0 | |
p02973 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <sstream>
#include <stack>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int ... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <sstream>
#include <stack>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int ... | replace | 33 | 35 | 33 | 34 | TLE | |
p02973 | C++ | Time Limit Exceeded | // warm heart, wagging tail,and a smile just for you!
// ███████████
// ███╬╬╬╬╬╬╬╬╬╬███
// ███╬╬╬╬╬████╬╬╬╬╬╬███
// ... | // warm heart, wagging tail,and a smile just for you!
// ███████████
// ███╬╬╬╬╬╬╬╬╬╬███
// ███╬╬╬╬╬████╬╬╬╬╬╬███
// ... | replace | 64 | 65 | 64 | 65 | TLE | |
p02973 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int n, m = 1;
int a[100000];
int main() {
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
vector<pair<int, int>> c;
c.push_back(make_pair(a[n - 1], 1));
for (int i = n - 2; i >= 0; i--) {
if (a[i] >= c.back().first... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int n, m = 1;
int a[100000];
int main() {
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
vector<pair<int, int>> c;
c.push_back(make_pair(a[n - 1], 1));
for (int i = n - 2; i >= 0; i--) {
if (a[i] >= c.back().first... | replace | 28 | 29 | 28 | 33 | TLE | |
p02973 | C++ | Time Limit Exceeded | /*
これを入れて実行
g++ code.cpp
./a.out
*/
#include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <tuple>
#include <unordered_map>
#include <utility>
#includ... | /*
これを入れて実行
g++ code.cpp
./a.out
*/
#include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <tuple>
#include <unordered_map>
#include <utility>
#includ... | replace | 76 | 77 | 76 | 77 | TLE | |
p02973 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, a, b) for (int i = (a); i < (b); i++)
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> a(n);
rep(i, 0, n) cin >> a[i];
reverse(a.begin(), a.end());
vector<int> x;
x.push_back(1e9 + 1... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, a, b) for (int i = (a); i < (b); i++)
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> a(n);
rep(i, 0, n) cin >> a[i];
reverse(a.begin(), a.end());
vector<int> x;
x.push_back(1e9 + 1... | delete | 25 | 26 | 25 | 25 | TLE | |
p02973 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
using ll = long long... | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
using ll = long long... | replace | 27 | 32 | 27 | 32 | TLE | |
p02973 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep1(i, n) for (ll i = 1; i < (ll)(n); i++)
#define INF 10000000000
#define MOD 998244353
using ll = long long;
using Graph = vector<vector<int>>;
int main() {
int N;
cin >> N;
vector<ll> A(N);
rep(i, N) c... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep1(i, n) for (ll i = 1; i < (ll)(n); i++)
#define INF 10000000000
#define MOD 998244353
using ll = long long;
using Graph = vector<vector<int>>;
int main() {
int N;
cin >> N;
vector<ll> A(N);
rep(i, N) c... | replace | 18 | 19 | 18 | 19 | TLE | |
p02973 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const ll MOD = 1000000007;
// const ll MOD = 998244353;
const ll INF = MOD * MOD;
const long double EPS = 1e-12;
struct mint {
ll x;
mint(ll x = 0) : x((x % MOD + MOD) % MOD) {}
mint operator-() const { return mint(-x); }... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const ll MOD = 1000000007;
// const ll MOD = 998244353;
const ll INF = MOD * MOD;
const long double EPS = 1e-12;
struct mint {
ll x;
mint(ll x = 0) : x((x % MOD + MOD) % MOD) {}
mint operator-() const { return mint(-x); }... | replace | 2,695 | 2,696 | 2,695 | 2,696 | TLE | |
p02973 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using pi = pair<int, int>;
constexpr ll mod = 1000000007;
v... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using pi = pair<int, int>;
constexpr ll mod = 1000000007;
v... | insert | 43 | 43 | 43 | 44 | TLE | |
p02973 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <vector>
namespace multiset {
class multiset {
private:
std::vector<int> tree;
int MSB;
void add(int i, int x) {
for (; i < tree.size(); i += i & -i) {
tree[i] += x;
}
}
int sum(int i) {
int res = 0;
for (; i > 0; i -= i & -i) {
... | #include <algorithm>
#include <iostream>
#include <vector>
namespace multiset {
class multiset {
private:
std::vector<int> tree;
int MSB;
void add(int i, int x) {
for (; i < tree.size(); i += i & -i) {
tree[i] += x;
}
}
int sum(int i) {
int res = 0;
for (; i > 0; i -= i & -i) {
... | replace | 73 | 74 | 73 | 74 | 0 | |
p02973 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> rights(1, -1);
for (int i = 0; i < n; i++) {
int a;
cin >> a;
if (a <= rights[rights.size() - 1]) {
rights.push_back(a);
continue;
}
for (int j = 0; j < (int)rights.size(); j++) {
if... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> rights(1, -1);
for (int i = 0; i < n; i++) {
int a;
cin >> a;
if (a <= rights[rights.size() - 1]) {
rights.push_back(a);
continue;
}
for (int j = 0; j < (int)rights.size(); j++) {
if... | delete | 20 | 21 | 20 | 20 | TLE | |
p02973 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<ll> v;
int ans = 200000;
for (int i = 0; i < n; i++) {
ll a;
cin >> a;
auto j = upper_bou... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<ll> v;
int ans = 200000;
for (int i = 0; i < n; i++) {
ll a;
cin >> a;
auto j = upper_bou... | replace | 22 | 23 | 22 | 23 | -6 | munmap_chunk(): invalid pointer
|
p02973 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1e9;
int main() {
ll N;
cin >> N;
vector<ll> A(N);
multiset<int> T;
int cnt = 1;
for (int i = 0; i < N; i++) {
cin >> A[i];
}
T.insert(A[0]);
T.insert(INF);
for (int i = 1; i < N; i++) {
if (*T.begin() >= A[i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1e9;
int main() {
ll N;
cin >> N;
vector<ll> A(N);
multiset<int> T;
int cnt = 1;
for (int i = 0; i < N; i++) {
cin >> A[i];
}
T.insert(A[0]);
T.insert(INF);
for (int i = 1; i < N; i++) {
if (*T.begin() >= A[i... | replace | 21 | 30 | 21 | 34 | TLE | |
p02973 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <math.h>
#include <vector>
using namespace std;
#define mmum 1e9
using vint = vector<int>;
using vvint = vector<vector<int>>;
int main(int argc, char *argv[]) {
int n;
cin >> n;
vint a;
for (int i = 0; i < n; i++) {
int t;
cin >> t;
t = mmum - t;
... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <vector>
using namespace std;
#define mmum 1e9
using vint = vector<int>;
using vvint = vector<vector<int>>;
int main(int argc, char *argv[]) {
int n;
cin >> n;
vint a;
for (int i = 0; i < n; i++) {
int t;
cin >> t;
t = mmum - t;
... | delete | 22 | 23 | 22 | 22 | TLE | |
p02973 | C++ | Runtime Error | // ~/Remember,remember the 6th of March
#include <bits/stdc++.h>
typedef long long ll;
typedef unsigned long long ull;
const double PI = acos(-1.0);
const double EPS = 1e-9;
const ll MOD = 1e9 + 7;
using namespace std;
int main() {
int n;
cin >> n;
vector<int> arr(n);
for (int i = 0; i < n; i++) {
cin >> a... | // ~/Remember,remember the 6th of March
#include <bits/stdc++.h>
typedef long long ll;
typedef unsigned long long ull;
const double PI = acos(-1.0);
const double EPS = 1e-9;
const ll MOD = 1e9 + 7;
using namespace std;
int main() {
int n;
cin >> n;
vector<int> arr(n);
for (int i = 0; i < n; i++) {
cin >> a... | replace | 23 | 24 | 23 | 24 | 0 | |
p02973 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll N;
ll A[100001];
deque<ll> v;
int main() {
cin >> N;
for (int i = 0; i < N; i++)
cin >> A[i];
v.push_back(A[0]);
for (int i = 1; i < N; i++) {
auto itr = lower_bound(v.begin(), v.end(), A[i]);
if (itr == v.begin())
v.pus... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll N;
ll A[100001];
deque<ll> v;
int main() {
cin >> N;
for (int i = 0; i < N; i++)
cin >> A[i];
v.push_back(A[0]);
for (int i = 1; i < N; i++) {
auto itr = lower_bound(v.begin(), v.end(), A[i]);
if (itr == v.begin())
v.pus... | replace | 18 | 19 | 18 | 20 | 0 | |
p02973 | C++ | Runtime Error | #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>>;
template <typename T> class tRMQ {
vector<T> data;
T unit;
public:
static const long long INF = 100000000000;
int n;
function... | #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>>;
template <typename T> class tRMQ {
vector<T> data;
T unit;
public:
static const long long INF = 100000000000;
int n;
function... | replace | 87 | 88 | 87 | 88 | 0 | |
p02973 | C++ | Runtime Error | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namesp... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namesp... | replace | 536 | 538 | 536 | 538 | -11 | |
p02973 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long ul;
typedef unsigned long long ull;
typedef long long ll;
typedef vector<ll> vint;
typedef vector<vector<ll>> vvint;
typedef vector<vector<vector<ll>>> vvvint;
typedef vector<string> vstring;
typedef vector<vector<string>> vvstring;
typedef vector<cha... | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long ul;
typedef unsigned long long ull;
typedef long long ll;
typedef vector<ll> vint;
typedef vector<vector<ll>> vvint;
typedef vector<vector<vector<ll>>> vvvint;
typedef vector<string> vstring;
typedef vector<vector<string>> vvstring;
typedef vector<cha... | replace | 299 | 300 | 299 | 300 | TLE | |
p02973 | 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<int, int> P;
const LL mod = 1000000007;
const LL LINF = 1LL << 60;
... | #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<int, int> P;
const LL mod = 1000000007;
const LL LINF = 1LL << 60;
... | replace | 27 | 28 | 27 | 28 | TLE | |
p02973 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1000000007;
const int dx[4] = {+1, 0, -1, 0};
const int dy[4] = {0, -1, 0, +1};
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
int n;
cin >> n;
vector<ll> a(n);
vector<ll> b;
for (int i = 0; i < n; i++) {
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1000000007;
const int dx[4] = {+1, 0, -1, 0};
const int dy[4] = {0, -1, 0, +1};
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
int n;
cin >> n;
vector<ll> a(n);
vector<ll> b;
for (int i = 0; i < n; i++) {
... | replace | 29 | 30 | 29 | 30 | -11 | |
p02973 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector")
#pragma GCC target("sse,sse2,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define watch(x) cout << (#x) << " is " << (x) << endl
#define debug cout << "hi" << endl
using namespace std;
typedef long long ll;
typedef long double ld;
typedef ... | #include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector")
#pragma GCC target("sse,sse2,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define watch(x) cout << (#x) << " is " << (x) << endl
#define debug cout << "hi" << endl
using namespace std;
typedef long long ll;
typedef long double ld;
typedef ... | replace | 40 | 41 | 40 | 41 | TLE | |
p02973 | C++ | Time Limit Exceeded | // q055.cpp
// Tue Aug 25 22:09:54 2020
#include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <vector>
#define INTINF 2147483647
#define LLINF 9223372036854775807
#define MOD 1000000007
#define rep(i, n) for (int i ... | // q055.cpp
// Tue Aug 25 22:09:54 2020
#include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <vector>
#define INTINF 2147483647
#define LLINF 9223372036854775807
#define MOD 1000000007
#define rep(i, n) for (int i ... | replace | 30 | 31 | 30 | 31 | TLE | |
p02973 | C++ | Time Limit Exceeded | // abc134.cpp
// Sat Oct 12 12:39:21 2019
#include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <vector>
#define INTINF 2147483647
#define LLINF 9223372036854775807
using namespace std;
using ll = long long;
typedef... | // abc134.cpp
// Sat Oct 12 12:39:21 2019
#include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <vector>
#define INTINF 2147483647
#define LLINF 9223372036854775807
using namespace std;
using ll = long long;
typedef... | replace | 31 | 33 | 31 | 32 | TLE | |
p02973 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
while (cin >> n) {
multiset<int> LIS;
int temp;
cin >> temp;
LIS.insert(temp);
for (int i = 1; i < n; i++) {
cin >> temp;
if (temp <= *LIS.begin()) {
LIS.insert(temp);
} else {
auto p = lower_bou... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
while (cin >> n) {
multiset<int> LIS;
int temp;
cin >> temp;
LIS.insert(temp);
for (int i = 1; i < n; i++) {
cin >> temp;
if (temp <= *LIS.begin()) {
LIS.insert(temp);
} else {
auto p = LIS.lower... | replace | 15 | 16 | 15 | 16 | TLE | |
p02974 | C++ | Runtime Error | /*{{{*/
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <limits.h>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#define SZ(X) ((int)(X).size())
#defin... | /*{{{*/
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <limits.h>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#define SZ(X) ((int)(X).size())
#defin... | replace | 121 | 122 | 121 | 123 | 0 | |
p02974 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;... | replace | 136 | 137 | 136 | 137 | 0 | |
p02974 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
const ll MOD = 1e9 + 7;
ll N, K;
cin >> N >> K;
vector<vector<vector<ll>>> dp(N + 1,
vector<vector<ll>>(N + 1, vector<ll>(K + 1)));
dp[0][0][0] = ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
const ll MOD = 1e9 + 7;
ll N, K;
cin >> N >> K;
vector<vector<vector<ll>>> dp(N + 1,
vector<vector<ll>>(N + 2, vector<ll>(K + 1)));
dp[0][0][0] = ... | replace | 16 | 17 | 16 | 17 | 0 | |
p02974 | C++ | Runtime Error | #include <iostream>
using namespace std;
const int mod = (int)1e9 + 7;
inline void addmod(int &a, int b) {
a += b;
a %= mod;
}
int main() {
const int mid = 1300;
static int pdp[2501][51] = {}, dp[2501][51] = {};
int n, k;
cin >> n >> k;
if (k % 2 != 0) {
cout << 0 << endl;
cerr << "bad" << end... | #include <iostream>
using namespace std;
const int mod = (int)1e9 + 7;
inline void addmod(int &a, int b) {
a += b;
a %= mod;
}
int main() {
const int mid = 1300;
static int pdp[2601][51] = {}, dp[2601][51] = {};
int n, k;
cin >> n >> k;
if (k % 2 != 0) {
cout << 0 << endl;
cerr << "bad" << end... | replace | 13 | 14 | 13 | 14 | 0 | |
p02974 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
using namespace std;
typedef long long ll;
ll dp[50][50][50 * 50 + 1]; // dp[i][j][k] :=
// i番目まで見て、jこずつ添え字と数字を保留してる（互いに同じ個数となるようにしか保留ができない）とき、
// 確定してる奇妙さがkのときの場合の数
int N, K;
const ll MOD = 1000000007;
int main() {
cin >> N >> K;
dp[0][0][0] = 1;
for (int i = 0; i < N;... | #include <algorithm>
#include <iostream>
using namespace std;
typedef long long ll;
ll dp[51][51][50 * 50 + 1]; // dp[i][j][k] :=
// i番目まで見て、jこずつ添え字と数字を保留してる（互いに同じ個数となるようにしか保留ができない）とき、
// 確定してる奇妙さがkのときの場合の数
int N, K;
const ll MOD = 1000000007;
int main() {
cin >> N >> K;
dp[0][0][0] = 1;
for (int i = 0; i < N;... | replace | 6 | 7 | 6 | 7 | 0 | |
p02974 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int n, kk;
long long mod = 1e9 + 7;
long long d[51][51][2800];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
cin >> n >> kk;
d[0][0][0] = 1;
for (int i = 0; i < n; i++) {
for (int j = 0; j <= n; j++) {
for (int k = 0; k... | #include <bits/stdc++.h>
using namespace std;
int n, kk;
long long mod = 1e9 + 7;
long long d[52][52][5000];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
cin >> n >> kk;
d[0][0][0] = 1;
for (int i = 0; i < n; i++) {
for (int j = 0; j <= n; j++) {
for (int k = 0; k... | replace | 5 | 6 | 5 | 6 | 0 | |
p02974 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long
// #define double long double
#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 REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOREACH(x... | #include <bits/stdc++.h>
using namespace std;
#define int long long
// #define double long double
#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 REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOREACH(x... | replace | 158 | 159 | 158 | 159 | 0 | |
p02974 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define REP(i, n) FOR(i, 0, n)
const int MOD = 1000000007;
int main() {
// freopen("input.txt", "r", stdin);
vector<int> sz{1, 2, 3, 5, 7, 10, 13, 17, 21, 26,
31, 37, 43, 50, 57, ... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define REP(i, n) FOR(i, 0, n)
const int MOD = 1000000007;
int main() {
// freopen("input.txt", "r", stdin);
vector<int> sz{1, 2, 3, 5, 7, 10, 13, 17, 21, 26,
31, 37, 43, 50, 57, ... | replace | 1,815 | 1,816 | 1,815 | 1,819 | 0 | |
p02974 | C++ | Runtime Error | // warm heart, wagging tail,and a smile just for you!
// ███████████
// ███╬╬╬╬╬╬╬╬╬╬███
// ███╬╬╬╬╬████╬╬╬╬╬╬███
// ... | // warm heart, wagging tail,and a smile just for you!
// ███████████
// ███╬╬╬╬╬╬╬╬╬╬███
// ███╬╬╬╬╬████╬╬╬╬╬╬███
// ... | replace | 1,922 | 1,924 | 1,922 | 1,928 | 0 | |
p02974 | C++ | Runtime Error | #include <cstdint>
#include <cstdlib>
#include <iostream>
template <typename T> void fin(T const &t) {
std::cout << t << std::endl;
exit(0);
}
// mint
int64_t const MOD = 1e9 + 7;
template <int64_t Prime> struct mod_int {
int64_t v_;
mod_int(int64_t x = 0) : v_(x) { normalize(); }
void normalize() { ((v_ %=... | #include <cstdint>
#include <cstdlib>
#include <iostream>
template <typename T> void fin(T const &t) {
std::cout << t << std::endl;
exit(0);
}
// mint
int64_t const MOD = 1e9 + 7;
template <int64_t Prime> struct mod_int {
int64_t v_;
mod_int(int64_t x = 0) : v_(x) { normalize(); }
void normalize() { ((v_ %=... | replace | 70 | 71 | 70 | 71 | 127 | /tmp/25238b23-6a43-49c7-a44c-2a70cfc065d4.out: error while loading shared libraries: libc.so.6: failed to map segment from shared object
|
p02974 | C++ | Runtime Error | #include <bits/stdc++.h>
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; i++)
#define FORR(i, n) for (ll i = (ll)n - 1LL; i >= 0LL; i--)
#define rep(i, n) FOR(i, 0, n)
#define ALL(x) ((x).begin(), (x).end())
using namespace std;
using ll = long long;
template <typename T> using V = vector<T>;
constexpr int Mod = 99... | #include <bits/stdc++.h>
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; i++)
#define FORR(i, n) for (ll i = (ll)n - 1LL; i >= 0LL; i--)
#define rep(i, n) FOR(i, 0, n)
#define ALL(x) ((x).begin(), (x).end())
using namespace std;
using ll = long long;
template <typename T> using V = vector<T>;
constexpr int Mod = 99... | replace | 107 | 108 | 107 | 108 | 0 | |
p02974 | C++ | Runtime Error | #include <bits/stdc++.h>
#define MIN_INT -2147483648
#define MAX_INT 2147483647
#define MIN_LONG -9223372036854775808L
#define MAX_LONG 9223372036854775807L
#define long long long int
using namespace std;
// @author: pashka
const long MOD = 1000000007;
int main() {
ios::sync_with_stdio(false);
int n, k;
ci... | #include <bits/stdc++.h>
#define MIN_INT -2147483648
#define MAX_INT 2147483647
#define MIN_LONG -9223372036854775808L
#define MAX_LONG 9223372036854775807L
#define long long long int
using namespace std;
// @author: pashka
const long MOD = 1000000007;
int main() {
ios::sync_with_stdio(false);
int n, k;
ci... | replace | 20 | 22 | 20 | 22 | 0 | |
p02974 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
const double eps = 1e-10;
const int MOD = 1000000007;
const int INF = 1000000000;
const ll LINF = 1ll << 50;
tem... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
const double eps = 1e-10;
const int MOD = 1000000007;
const int INF = 1000000000;
const ll LINF = 1ll << 50;
tem... | replace | 26 | 27 | 26 | 27 | 0 | |
p02974 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using VS = vector<string>;
using LL = long long;
using VI = vector<int>;
using VVI = vector<VI>;
using PII = pair<int, int>;
using PLL = pair<LL, LL>;
using VL = vector<LL>;
using VVL = vector<VL>;
#define ALL(a) begin((a)), end((a))
#define RALL(a) (a).rbegin(), (a).rend... | #include <bits/stdc++.h>
using namespace std;
using VS = vector<string>;
using LL = long long;
using VI = vector<int>;
using VVI = vector<VI>;
using PII = pair<int, int>;
using PLL = pair<LL, LL>;
using VL = vector<LL>;
using VVL = vector<VL>;
#define ALL(a) begin((a)), end((a))
#define RALL(a) (a).rbegin(), (a).rend... | replace | 211 | 212 | 211 | 212 | 0 | |
p02974 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < ((ll)(n)); i++)
#define reg(i, a, b) for (ll i = ((ll)(a)); i <= ((ll)(b)); i++)
#define irep(i, n) for (ll i = ((ll)(n)-1); i >= 0; i--)
#define ireg(i, a, b) for (ll i = ((ll)(b)); i >= ((ll)(a)); i--)
/*
またぐときにコ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < ((ll)(n)); i++)
#define reg(i, a, b) for (ll i = ((ll)(a)); i <= ((ll)(b)); i++)
#define irep(i, n) for (ll i = ((ll)(n)-1); i >= 0; i--)
#define ireg(i, a, b) for (ll i = ((ll)(b)); i >= ((ll)(a)); i--)
/*
またぐときにコ... | replace | 84 | 86 | 84 | 87 | 0 | |
p02974 | C++ | Runtime Error | #pragma GCC optimize("O3")
#include <algorithm>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unordered_map>
#include <unordered_set>
using namespace std;
using QWORD = uint64... | #pragma GCC optimize("O3")
#include <algorithm>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unordered_map>
#include <unordered_set>
using namespace std;
using QWORD = uint64... | replace | 201 | 202 | 201 | 202 | 0 | |
p02974 | C++ | Runtime Error | #include <bits/stdc++.h>
#define owo(i, a, b) for (int i = (a); i < (b); ++i)
#define uwu(i, a, b) for (int i = (a)-1; i >= (b); --i)
#define senpai push_back
#define ttgl pair<int, int>
#define ayaya cout << "ayaya~" << endl
using namespace std;
/*#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
g... | #include <bits/stdc++.h>
#define owo(i, a, b) for (int i = (a); i < (b); ++i)
#define uwu(i, a, b) for (int i = (a)-1; i >= (b); --i)
#define senpai push_back
#define ttgl pair<int, int>
#define ayaya cout << "ayaya~" << endl
using namespace std;
/*#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
g... | replace | 43 | 44 | 43 | 44 | 0 | |
p02974 | C++ | Runtime Error | // #pragma GCC optimize("O3")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,tune=native")
// #pragma GCC optimize ("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
const int N = 51;
const int mod = 1e9 + 7;
ll dp[N][N][N * N];
int main() {... | // #pragma GCC optimize("O3")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,tune=native")
// #pragma GCC optimize ("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
const int N = 100;
const int mod = 1e9 + 7;
ll dp[N][N][N * N];
int main() ... | replace | 10 | 11 | 10 | 11 | 0 | |
p02974 | C++ | Runtime Error | #ifdef stderr_path
#define LOCAL
#endif
#ifdef LOCAL
#define _GLIBCXX_DEBUG
#else
#pragma GCC optimize("Ofast")
#endif
#include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <complex>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include ... | #ifdef stderr_path
#define LOCAL
#endif
#ifdef LOCAL
#define _GLIBCXX_DEBUG
#else
#pragma GCC optimize("Ofast")
#endif
#include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <complex>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include ... | replace | 447 | 448 | 447 | 448 | 0 | |
p02974 | C++ | Runtime Error | #include <bits/stdc++.h>
#define debug(x) cerr << #x << ": " << x << '\n';
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = (int)1e9;
const int MOD = (int)1e9 + 7;
template <int mod> struct ModInt {
int x;
ModInt() : x(0) {}
ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y... | #include <bits/stdc++.h>
#define debug(x) cerr << #x << ": " << x << '\n';
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = (int)1e9;
const int MOD = (int)1e9 + 7;
template <int mod> struct ModInt {
int x;
ModInt() : x(0) {}
ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y... | replace | 85 | 86 | 85 | 86 | 0 | |
p02974 | C++ | Memory Limit Exceeded | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <typeinfo>
#includ... | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <typeinfo>
#includ... | replace | 33 | 35 | 33 | 34 | MLE | |
p02974 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// #include <boost/multiprecision/cpp_int.hpp>
// typedef boost::multiprecision::cpp_int ll;
typedef long double dd;
#define i_7 (ll)(1E9 + 7)
// #define i_7 998244353
#define i_5 i_7 - 2
ll mod(ll a) {
ll c = a % i_7;
if (c >= 0)
return c;
r... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// #include <boost/multiprecision/cpp_int.hpp>
// typedef boost::multiprecision::cpp_int ll;
typedef long double dd;
#define i_7 (ll)(1E9 + 7)
// #define i_7 998244353
#define i_5 i_7 - 2
ll mod(ll a) {
ll c = a % i_7;
if (c >= 0)
return c;
r... | replace | 49 | 50 | 49 | 50 | 0 | |
p02974 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using int64 = long long;
constexpr int64 P = 1000000007;
// Verified: ABC133E, ABC132D, ABC130E
struct FiniteField {
private:
int64 x;
public:
FiniteField(int64 input_x) : x(input_x) {}
FiniteField() : x(0) {}
int64 Value() { return x; }
inline FiniteField op... | #include <bits/stdc++.h>
using namespace std;
using int64 = long long;
constexpr int64 P = 1000000007;
// Verified: ABC133E, ABC132D, ABC130E
struct FiniteField {
private:
int64 x;
public:
FiniteField(int64 input_x) : x(input_x) {}
FiniteField() : x(0) {}
int64 Value() { return x; }
inline FiniteField op... | insert | 64 | 64 | 64 | 66 | 0 | |
p02974 | C++ | Runtime Error | #include <bits/stdc++.h>
// #include <boost/multiprecision/cpp_int.hpp>
#define int long long
#define inf 1000000007
#define pa pair<int, int>
#define ll long long
#define pal pair<double, double>
#define ppap pair<pa, int>
#define PI 3.14159265358979323846
#define paa pair<int, char>
#define mp make_pair
#define p... | #include <bits/stdc++.h>
// #include <boost/multiprecision/cpp_int.hpp>
#define int long long
#define inf 1000000007
#define pa pair<int, int>
#define ll long long
#define pal pair<double, double>
#define ppap pair<pa, int>
#define PI 3.14159265358979323846
#define paa pair<int, char>
#define mp make_pair
#define p... | replace | 187 | 188 | 187 | 188 | 0 | |
p02974 | C++ | Runtime Error | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using lint = l... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using lint = l... | replace | 169 | 170 | 169 | 170 | 0 | |
p02974 | C++ | Time Limit Exceeded | #define _USE_MATH_DEFINES
#define _SILENCE_CXX17_C_HEADER_DEPRECATION_WARNING
#define _SILENCE_ALL_CXX17_DEPRECATION_WARNINGS
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
#include <immintrin.h>
#include <mmintrin.h>
#include <nmmintrin.h>
using namespace std;
#define dprint(Exp, ...) ... | #define _USE_MATH_DEFINES
#define _SILENCE_CXX17_C_HEADER_DEPRECATION_WARNING
#define _SILENCE_ALL_CXX17_DEPRECATION_WARNINGS
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
#include <immintrin.h>
#include <mmintrin.h>
#include <nmmintrin.h>
using namespace std;
#define dprint(Exp, ...) ... | delete | 1,716 | 1,746 | 1,716 | 1,716 | TLE | |
p02974 | Python | Runtime Error | import sys
input = sys.stdin.readline
sys.setrecursionlimit(100000)
mod = 10**9 + 7
def read_values():
return map(int, input().split())
def read_index():
return map(lambda x: int(x) - 1, input().split())
def read_list():
return list(read_values())
def read_lists(N):
return [read_list() for n in... | import sys
input = sys.stdin.readline
sys.setrecursionlimit(100000)
mod = 10**9 + 7
def read_values():
return map(int, input().split())
def read_index():
return map(lambda x: int(x) - 1, input().split())
def read_list():
return list(read_values())
def read_lists(N):
return [read_list() for n in... | replace | 56 | 57 | 56 | 61 | 0 | |
p02974 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long
#ifdef LOCAL_DEBUG
#include "LOCAL_DEBUG.hpp"
#endif
int pos[] = {0, 1, 3, 6, 11, 18, 28, 41, 58, 79, 105,
136, 173, 216, 266, 323, 388, 461, 543, 634, 735, 846,
968, 1101, 1246, 1403, 15... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#ifdef LOCAL_DEBUG
#include "LOCAL_DEBUG.hpp"
#endif
int pos[] = {0, 1, 3, 6, 11, 18, 28, 41, 58, 79, 105,
136, 173, 216, 266, 323, 388, 461, 543, 634, 735, 846,
968, 1101, 1246, 1403, 15... | replace | 1,559 | 1,560 | 1,559 | 1,560 | 0 | |
p02975 | Python | Runtime Error | import sys
from collections import Counter
N = int(input())
C = Counter(list(map(int, input().split())))
if len(C) == 1 and C[0] == N:
print("Yes")
elif len(C) == 2 and N % 3 == 0 and C[0] == N // 3 and N - [0] == 2 * N // 3:
print("Yes")
elif len(C) == 3 and N % 3 == 0:
b = 0
for c in C.most_common():... | import sys
from collections import Counter
N = int(input())
C = Counter(list(map(int, input().split())))
if len(C) == 1 and C[0] == N:
print("Yes")
elif len(C) == 2 and N % 3 == 0 and C[0] == N // 3 and N - C[0] == 2 * N // 3:
print("Yes")
elif len(C) == 3 and N % 3 == 0:
b = 0
for c in C.most_common()... | replace | 7 | 8 | 7 | 8 | 0 | |
p02975 | Python | Runtime Error | from collections import defaultdict
n = int(input())
a = tuple(map(int, input().split()))
can = True
if n % 3 == 0:
d = defaultdict(int)
for aa in a:
d[aa] += 1
m = n // 3
t = []
for number, cnt in d.items():
if cnt % m != 0:
can = False
break
else:... | from collections import defaultdict
n = int(input())
a = tuple(map(int, input().split()))
can = True
if n % 3 == 0:
d = defaultdict(int)
for aa in a:
d[aa] += 1
m = n // 3
t = []
for number, cnt in d.items():
if cnt % m != 0:
can = False
break
else:... | replace | 20 | 23 | 20 | 23 | 0 | |
p02975 | C++ | Runtime Error | #pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <bits/stdc++.h>
using namespace std;
#define MP make_pair
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) (int((x.size())))
#define fi first
#define se ... | #pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <bits/stdc++.h>
using namespace std;
#define MP make_pair
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) (int((x.size())))
#define fi first
#define se ... | replace | 146 | 148 | 146 | 147 | -11 | |
p02975 | C++ | Time Limit Exceeded | #define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
#include <unordered_map>
#define LL long long
using namespace std;
#define MAXN 200005
#define pp 1000000007
// set<int> s;
unordered_map<int, int> m;
int nums[MAXN];
int main() {
int n;
bool flag = true;
scanf("%d", &n);
for (int i = 0; i < n; i++) {... | #define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
#include <unordered_map>
#define LL long long
using namespace std;
#define MAXN 200005
#define pp 1000000007
// set<int> s;
unordered_map<int, int> m;
int nums[MAXN];
int main() {
int n;
bool flag = true;
scanf("%d", &n);
for (int i = 0; i < n; i++) {... | insert | 44 | 44 | 44 | 48 | TLE | |
p02975 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int n;
int a[300001];
int b[100001];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
int k = 1;
sort(a + 1, a + 1 + n);
a[n + 1] = -2;
for (int i = 1; a[i + 1] != -2 && i < 300001; i++)
if (a[i] == a[i + 1]) {
a[n ... | #include <bits/stdc++.h>
using namespace std;
int n;
int a[300001];
int b[100001];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
int s = 0;
for (int i = 1; i <= n; i++)
s = s ^ a[i];
if (s)
printf("No\n");
else
printf("Yes\n");
return 0;
}
| replace | 12 | 38 | 12 | 16 | 0 | |
p02975 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <queue>
#include <stack>
using namespace std;
typedef pair<long long int, long long int> pa;
#define resize(A) A.resize(unique(A.begin(), A.end()) - A.begin())
#define pb push_back
#define MAX 200005
long long int MOD = 1e9 + 7;
long long int INF = 1e18;
int main() {
ios_base::sy... | #include <bits/stdc++.h>
#include <queue>
#include <stack>
using namespace std;
typedef pair<long long int, long long int> pa;
#define resize(A) A.resize(unique(A.begin(), A.end()) - A.begin())
#define pb push_back
#define MAX 200005
long long int MOD = 1e9 + 7;
long long int INF = 1e18;
int main() {
ios_base::sy... | replace | 41 | 42 | 41 | 42 | 0 | |
p02975 | C++ | Runtime Error | /*Lucky_Glass*/
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <map>
using namespace std;
const int N = 8e4;
int cas, n;
long long A[N + 3];
map<long long, int> cnt;
bool Solve2() {
int stk[5] = {}, nstk = 0;
for (map<long long, int>::iterator it = cnt.begin(); it != cnt.end(); it++) {
if... | /*Lucky_Glass*/
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <map>
using namespace std;
const int N = 1e5;
int cas, n;
long long A[N + 3];
map<long long, int> cnt;
bool Solve2() {
int stk[5] = {}, nstk = 0;
for (map<long long, int>::iterator it = cnt.begin(); it != cnt.end(); it++) {
if... | replace | 7 | 8 | 7 | 8 | 0 | |
p02975 | C++ | Runtime Error | #include <bits/stdc++.h>
#define MAXN 10000
using namespace std;
typedef long long ll;
int main() {
// freopen("t.txt","r",stdin);
int n;
cin >> n;
int a[10002];
for (int i = 1; i <= n; i++)
cin >> a[i];
int t = a[1], kq;
for (int i = 2; i <= n; i++) {
t = t ^ a[i];
}
if (t == 0) {
cout... | #include <bits/stdc++.h>
#define MAXN 10000
using namespace std;
typedef long long ll;
int main() {
// freopen("t.txt","r",stdin);
int n;
cin >> n;
int a[100002];
for (int i = 1; i <= n; i++)
cin >> a[i];
int t = a[1], kq;
for (int i = 2; i <= n; i++) {
t = t ^ a[i];
}
if (t == 0) {
cou... | replace | 11 | 12 | 11 | 12 | 0 | |
p02975 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using llong = long long;
using ldbl = long double;
using lpair = pair<llong, llong>;
#define ALL(x) x.begin(), x.end()
const llong inf = 1100100100100100ll;
const llong mod = 1e9 + 7;
int main() {
llong N;
vector<llong> a;
map<llong, llong> m;
cin >> N;
a.res... | #include <bits/stdc++.h>
using namespace std;
using llong = long long;
using ldbl = long double;
using lpair = pair<llong, llong>;
#define ALL(x) x.begin(), x.end()
const llong inf = 1100100100100100ll;
const llong mod = 1e9 + 7;
int main() {
llong N;
vector<llong> a;
map<llong, llong> m;
cin >> N;
a.res... | replace | 30 | 32 | 30 | 35 | 0 | |
p02975 | C++ | Runtime Error | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
#define LL long long
LL read() {
LL f = 1, x = 0;
char c = getchar();
while (c < '0' || '9' < c) ... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
#define LL long long
LL read() {
LL f = 1, x = 0;
char c = getchar();
while (c < '0' || '9' < c) ... | replace | 25 | 26 | 25 | 26 | 0 | |
p02975 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL_DEBUG
#include "LOCAL_DEBUG.hpp"
#endif
#define int long long
void fail() {
cout << "No" << endl;
exit(0);
}
signed main() {
int n;
cin >> n;
vector<int> a(n);
map<int, int> mp;
for (int i = 0; i < n; i++) {
cin >> a[i];
mp[a[i]]++;
}... | #include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL_DEBUG
#include "LOCAL_DEBUG.hpp"
#endif
#define int long long
void fail() {
cout << "No" << endl;
exit(0);
}
signed main() {
int n;
cin >> n;
vector<int> a(n);
map<int, int> mp;
for (int i = 0; i < n; i++) {
cin >> a[i];
mp[a[i]]++;
}... | replace | 39 | 40 | 39 | 40 | 0 | |
p02975 | C++ | Runtime Error | #include <bits/stdc++.h>
int main() {
using namespace std;
size_t N;
cin >> N;
unordered_map<unsigned long, size_t> mp;
for (unsigned long i = 0, a; i < N; ++i) {
cin >> a;
++mp[a];
}
if (mp.size() > 3)
return 0 & puts("No");
if (mp.size() == 1)
return 0 & puts(mp[0] == N ? "Yes" : "No"... | #include <bits/stdc++.h>
int main() {
using namespace std;
size_t N;
cin >> N;
unordered_map<unsigned long, size_t> mp;
for (unsigned long i = 0, a; i < N; ++i) {
cin >> a;
++mp[a];
}
if (mp.size() > 3)
return 0 & puts("No");
if (mp.size() == 1)
return 0 & puts(mp[0] == N ? "Yes" : "No"... | replace | 24 | 26 | 24 | 25 | -6 | 8866038d-cc79-4ae4-9136-26c7a7111b18.out: /home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02975/C++/s059737996.cpp:21: int main(): Assertion `0' failed.
|
p02975 | C++ | Runtime Error | // sjq
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <stack>
#include <vector>
using namespace std;
typedef long long LL;
const int N = 80000;
int n;
LL a[N + 5];
int C[N + 5];
vector<LL> V;
int main() {
// freopen("circle.in", "r", stdin);
// freopen("circle.out", "w", stdout);
int T;
... | // sjq
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <stack>
#include <vector>
using namespace std;
typedef long long LL;
const int N = 100000;
int n;
LL a[N + 5];
int C[N + 5];
vector<LL> V;
int main() {
// freopen("circle.in", "r", stdin);
// freopen("circle.out", "w", stdout);
int T;
... | replace | 10 | 11 | 10 | 11 | 0 | |
p02975 | C++ | Runtime Error | #include <algorithm>
#include <cassert>
#include <chrono>
#include <cmath>
#include <cstdio>
#include <ctime>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namesp... | #include <algorithm>
#include <cassert>
#include <chrono>
#include <cmath>
#include <cstdio>
#include <ctime>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namesp... | delete | 168 | 169 | 168 | 168 | 0 | |
p02975 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <ext/pb_ds/detail/standard_policies.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define endl "\n"
const int MAX = 100005;
const long long mod = 1.0e9 + 7;
int main() {
ios_base::sync_with_stdio(fa... | #include <bits/stdc++.h>
#include <ext/pb_ds/detail/standard_policies.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define endl "\n"
const int MAX = 100005;
const long long mod = 1.0e9 + 7;
int main() {
ios_base::sync_with_stdio(fa... | delete | 14 | 18 | 14 | 14 | -11 | |
p02975 | C++ | Time Limit Exceeded | typedef long long ll;
#include <bits/stdc++.h>
using namespace std;
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val) {
std::fill((T *)array, (T *)(array + N), val);
}
ll askx(ll a, ll b) {
ll ans = 0;
for (int i = 0; i < 30; i++) {
if (b & (1 << i)) {
if (a & (1 << i))... | typedef long long ll;
#include <bits/stdc++.h>
using namespace std;
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val) {
std::fill((T *)array, (T *)(array + N), val);
}
ll askx(ll a, ll b) {
ll ans = 0;
for (int i = 0; i < 30; i++) {
if (b & (1 << i)) {
if (a & (1 << i))... | insert | 55 | 55 | 55 | 74 | TLE | |
p02975 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> A(n);
map<int, int> cnt;
for (int i = 0; i < n; i++) {
cin >> A[i];
cnt[A[i]] += 1;
}
if (cnt[0] == n) {
cout << "Yes" << endl;
return 0;
}
if (n % 3 != 0) {
cout << "No" << endl;
return 0... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> A(n);
map<int, int> cnt;
for (int i = 0; i < n; i++) {
cin >> A[i];
cnt[A[i]] += 1;
}
if (cnt[0] == n) {
cout << "Yes" << endl;
return 0;
}
if (n % 3 != 0) {
cout << "No" << endl;
return 0... | replace | 27 | 28 | 27 | 28 | 0 | |
p02975 | C++ | Runtime Error | #include <cstdio>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int No() {
cout << "No";
return 0;
}
int Yes() {
cout << "Yes";
return 0;
}
int main() {
int a[3][2] = {}, n;
cin >> n;
for (int i = 0; i < n; i++) {
int tmp;
cin >> tmp;
for (int ... | #include <cstdio>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int No() {
cout << "No";
return 0;
}
int Yes() {
cout << "Yes";
return 0;
}
int main() {
int a[3][2] = {}, n;
cin >> n;
for (int i = 0; i < n; i++) {
int tmp;
cin >> tmp;
for (int ... | replace | 39 | 41 | 39 | 40 | -8 | |
p02975 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
int t, n, a[N], b[N], num[N], tot, c;
map<int, int> cnt, tmp;
void solve() {
if (tot > 3) {
puts("No");
return;
} else if (tot == 1) {
if (num[0] == 0) {
puts("Yes");
return;
} else {
puts("No");
return;
... | #include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
int t, n, a[N], b[N], num[N], tot, c;
map<int, int> cnt, tmp;
void solve() {
if (tot > 3) {
puts("No");
return;
} else if (tot == 1) {
if (num[0] == 0) {
puts("Yes");
return;
} else {
puts("No");
return;
... | replace | 42 | 43 | 42 | 43 | TLE | |
p02975 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
const int MAXN = 1e5 + 5;
int n, a[MAXN];
map<int, int> num;
vector<int> vals;
int main() {
scanf("%d", &n);
bool doZero = false;
for (int i = 0; i < n; ++i) {
scanf("%d", &a[i]);
num[a[i]]++;
if (a[i] == 0)
doZero = true;
}
if (n % 3 == 0) {
... | #include "bits/stdc++.h"
using namespace std;
const int MAXN = 1e5 + 5;
int n, a[MAXN];
map<int, int> num;
vector<int> vals;
int main() {
scanf("%d", &n);
bool doZero = false;
for (int i = 0; i < n; ++i) {
scanf("%d", &a[i]);
num[a[i]]++;
if (a[i] == 0)
doZero = true;
}
if (n % 3 == 0) {
... | replace | 31 | 33 | 31 | 32 | -6 | 243a2eb5-cb0e-4235-976c-e0bcb59e4879.out: /home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02975/C++/s340144915.cpp:32: int main(): Assertion `false' failed.
|
p02975 | C++ | Runtime Error | // Ruthless Coding
#include <bits/stdc++.h>
#define uni(x) (x).resize(unique(ALL(x)) - (x).begin())
#define fprint(v) \
for (auto x : v) \
cout << x << ' '
#define ALL(x) (x).begin(), (x).end()
... | // Ruthless Coding
#include <bits/stdc++.h>
#define uni(x) (x).resize(unique(ALL(x)) - (x).begin())
#define fprint(v) \
for (auto x : v) \
cout << x << ' '
#define ALL(x) (x).begin(), (x).end()
... | delete | 68 | 69 | 68 | 68 | 0 | |
p02975 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <map>
using namespace std;
#define N 80005
#define ll long long
int t, n;
ll a[N];
int main() {
// freopen("circle.in","r",stdin);
// freopen("circle.out","w",stdout);
// scanf("%d",&t);
// while(t--)
//{
int k = 0;
scanf("%d", &n);
for (int i = 1; i <= n;... | #include <algorithm>
#include <cstdio>
#include <map>
using namespace std;
#define N 100005
#define ll long long
int t, n;
ll a[N];
int main() {
// freopen("circle.in","r",stdin);
// freopen("circle.out","w",stdout);
// scanf("%d",&t);
// while(t--)
//{
int k = 0;
scanf("%d", &n);
for (int i = 1; i <= n... | replace | 4 | 5 | 4 | 5 | 0 | |
p02975 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <vector>
using namespace std;
typedef long long ll;
bool solve(int N, vector<int> &a) {
map<int, int> s;
for (int i = 0; i < N; i++) {
... | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <vector>
using namespace std;
typedef long long ll;
bool solve(int N, vector<int> &a) {
map<int, int> s;
for (int i = 0; i < N; i++) {
... | insert | 18 | 18 | 18 | 21 | 0 | |
p02975 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <unordered_map>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> num;
map<int, int> nums;
for (int i = 0; i < n; i++) {
int t;
cin >> t;
num.push_back(t);
if (nums.find(t) != nums... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <unordered_map>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> num;
map<int, int> nums;
for (int i = 0; i < n; i++) {
int t;
cin >> t;
num.push_back(t);
if (nums.find(t) != nums... | insert | 22 | 22 | 22 | 30 | TLE | |
p02975 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define finish(x) return cout << x << endl, 0
#define ll long long
int n;
vector<int> a;
vector<int> calc(int x, int y) {
vector<int> ret = {x, y};
for (int i = 0; i < n - 2; i++) {
ret.push_back(ret[(int)ret.size() - 2] ^ ret.back());
}
return ret;
}
int main... | #include <bits/stdc++.h>
using namespace std;
#define finish(x) return cout << x << endl, 0
#define ll long long
int n;
vector<int> a;
vector<int> calc(int x, int y) {
vector<int> ret = {x, y};
for (int i = 0; i < n - 2; i++) {
ret.push_back(ret[(int)ret.size() - 2] ^ ret.back());
}
return ret;
}
int main... | replace | 25 | 27 | 25 | 27 | TLE | |
p02975 | C++ | Runtime Error | #include <bits/stdc++.h>
//----***やべーやつら***----
using namespace std;
#define int long long
//----***型定義***----
using ll = long long;
using P = pair<int, int>;
//----***Like a Pythonista***----
#define REP(ii, jj, nn) for (ll ii = jj; ii < (nn); ii++)
#define RREP(ii, nn, jj) for (ll ii = nn; jj < ii; ii--)
#define ea... | #include <bits/stdc++.h>
//----***やべーやつら***----
using namespace std;
#define int long long
//----***型定義***----
using ll = long long;
using P = pair<int, int>;
//----***Like a Pythonista***----
#define REP(ii, jj, nn) for (ll ii = jj; ii < (nn); ii++)
#define RREP(ii, nn, jj) for (ll ii = nn; jj < ii; ii--)
#define ea... | replace | 102 | 103 | 102 | 103 | 0 | |
p02975 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef string str;
typedef vector<int> vint;
typedef vector<double> vdou;
typedef vector<ll> vll;
typedef vector<vint> vvint;
typedef vector<str> vstr;
typedef pair<int, int> pii;
typedef vector<pii> vpii;
#define REP(i, n) for (ll(i) = 0; (i) < (ll... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef string str;
typedef vector<int> vint;
typedef vector<double> vdou;
typedef vector<ll> vll;
typedef vector<vint> vvint;
typedef vector<str> vstr;
typedef pair<int, int> pii;
typedef vector<pii> vpii;
#define REP(i, n) for (ll(i) = 0; (i) < (ll... | replace | 65 | 66 | 65 | 121 | TLE | |
p02975 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = (a); i <= (b); ++i)
#define rrep(i, a, b) for (int i = (a); i >= (b); --i)
#define PB push_back
#define MP make_pair
#define PII pair<int, int>
typedef long long LL;
const LL MOD = 998244353;
const int INF = 0x3fffffff;
const int N = 100010... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = (a); i <= (b); ++i)
#define rrep(i, a, b) for (int i = (a); i >= (b); --i)
#define PB push_back
#define MP make_pair
#define PII pair<int, int>
typedef long long LL;
const LL MOD = 998244353;
const int INF = 0x3fffffff;
const int N = 100010... | delete | 16 | 19 | 16 | 16 | 0 | |
p02975 | C++ | Time Limit Exceeded | #include <algorithm>
#include <array>
#include <cmath>
#include <cstdio>
#include <map>
#include <memory.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
void re(int &x);
template <class T> void re(std::vector<T> &a);
void pr(const char *x);
void ps();
te... | #include <algorithm>
#include <array>
#include <cmath>
#include <cstdio>
#include <map>
#include <memory.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
void re(int &x);
template <class T> void re(std::vector<T> &a);
void pr(const char *x);
void ps();
te... | replace | 52 | 53 | 52 | 53 | TLE | |
p02975 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
#define REP(i, n) for (int i = 0; i < n; ++i)
#define ALL(name) name.begin(), name.end()
#define SORT(name) sort(name.begin(), name.end())
#define ZERO(p) memset(p, 0, sizeof(p))
#define MINUS(p) memset(p, -1, sizeof(p))
#if 1
#define ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
#define REP(i, n) for (int i = 0; i < n; ++i)
#define ALL(name) name.begin(), name.end()
#define SORT(name) sort(name.begin(), name.end())
#define ZERO(p) memset(p, 0, sizeof(p))
#define MINUS(p) memset(p, -1, sizeof(p))
#if 1
#define ... | replace | 58 | 59 | 58 | 72 | 0 | |
p02975 | C++ | Runtime Error | #include <bits/stdc++.h>
#define REP(i, n) for (long long i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main() {
cin.tie(0)->sync_with_stdio(false);
ll n;
cin >> n;
ll cnt0 = 0;
map<ll, ll> hat;
REP(i, n) {
ll tmp;
cin >> tmp;
if (tmp == 0)
cnt0++;
hat[tmp]++;
... | #include <bits/stdc++.h>
#define REP(i, n) for (long long i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main() {
cin.tie(0)->sync_with_stdio(false);
ll n;
cin >> n;
ll cnt0 = 0;
map<ll, ll> hat;
REP(i, n) {
ll tmp;
cin >> tmp;
if (tmp == 0)
cnt0++;
hat[tmp]++;
... | replace | 33 | 34 | 33 | 34 | 0 | |
p02975 | C++ | Time Limit Exceeded | // A.
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <set>
#include <sstream>
#include <vector>
using namespace std;
int main(int argc, char *argv[]) {
int n;
cin >> n;
vector<int> a(n);
map<int, int> m;
for (int i = 0; i < n; ++i) {
cin >> a[i];
... | // A.
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <set>
#include <sstream>
#include <vector>
using namespace std;
int main(int argc, char *argv[]) {
int n;
cin >> n;
vector<int> a(n);
map<int, int> m;
for (int i = 0; i < n; ++i) {
cin >> a[i];
... | replace | 24 | 27 | 24 | 30 | TLE | |
p02975 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
#define INF 1000000000000
#define MAX 1000000000000000000
typedef long long ll;
typedef pair<ll, int> P;
typedef pair<pair<int, int>, int> p;
#define bit(n, k) ((n >> k... | #include <algorithm>
#include <bitset>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
#define INF 1000000000000
#define MAX 1000000000000000000
typedef long long ll;
typedef pair<ll, int> P;
typedef pair<pair<int, int>, int> p;
#define bit(n, k) ((n >> k... | replace | 38 | 41 | 38 | 41 | 1 | |
p02975 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
#define fi first
#define se second
#define repl(i, a, b) for (ll i = (ll)(a); i < (ll)(b); i++)
#define rep(i, n) repl(i, 0, n)
#define all(x) (x).begin(), (x).end()
#define dbg(x) cout << #x "=... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
#define fi first
#define se second
#define repl(i, a, b) for (ll i = (ll)(a); i < (ll)(b); i++)
#define rep(i, n) repl(i, 0, n)
#define all(x) (x).begin(), (x).end()
#define dbg(x) cout << #x "=... | insert | 41 | 41 | 41 | 45 | TLE | |
p02976 | Python | Runtime Error | #!/usr/bin/env python3
import sys
sys.setrecursionlimit(100000)
n, m = [int(x) for x in input().split()]
edges = []
g = [[] for _ in range(n)]
for _ in range(m):
a, b = [int(x) for x in input().split()]
a -= 1
b -= 1
e = len(edges)
g[a].append(e)
g[b].append(e)
edges.append((a, b))
if m ... | #!/usr/bin/env python3
import sys
sys.setrecursionlimit(1000000)
n, m = [int(x) for x in input().split()]
edges = []
g = [[] for _ in range(n)]
for _ in range(m):
a, b = [int(x) for x in input().split()]
a -= 1
b -= 1
e = len(edges)
g[a].append(e)
g[b].append(e)
edges.append((a, b))
if m... | replace | 4 | 5 | 4 | 5 | 0 | |
p02976 | C++ | Runtime Error | #define _CRT_SECURE_NO_WARNINGS
#define _SCL_SECURE_NO_WARNINGS
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <m... | #define _CRT_SECURE_NO_WARNINGS
#define _SCL_SECURE_NO_WARNINGS
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <m... | replace | 131 | 132 | 131 | 132 | 0 | |
p02976 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main(void) {
int N, M;
cin >> N >> M;
if (M % 2 == 1) {
cout << "-1" << endl;
return 0;
}
vector<vector<int>> to(M);
for (int i = 0; i < M; i++) {
int a, b;
cin >> a >> b;
a--;
b--;
to[a].push_back(b)... | #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main(void) {
int N, M;
cin >> N >> M;
if (M % 2 == 1) {
cout << "-1" << endl;
return 0;
}
vector<vector<int>> to(N);
for (int i = 0; i < M; i++) {
int a, b;
cin >> a >> b;
a--;
b--;
to[a].push_back(b)... | replace | 14 | 15 | 14 | 15 | 0 | |
p02976 | 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 MOD = 1000000007;
// const ll MOD=998244353;
template <typename T, typename U>
istream &operator>>... | #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 MOD = 1000000007;
// const ll MOD=998244353;
template <typename T, typename U>
istream &operator>>... | insert | 85 | 85 | 85 | 86 | 0 | |
p02976 | C++ | Runtime Error | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdint>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include ... | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdint>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include ... | replace | 107 | 108 | 107 | 108 | 0 | |
p02976 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long
#define BUF 1e5
#define INF 1 << 30
constexpr ll mod = 1e9 + 7;
using namespace std;
ll A, B, C, D, G, H, N, M, L, K, P, Q, R, W, X, Y, Z;
string S, T;
ll ans = 0;
void dfs(int node, vector<vector<int>> &tree, vector<int> &parent,
vector<int> &out) {
int p = par... | #include <bits/stdc++.h>
#define ll long long
#define BUF 1e5
#define INF 1 << 30
constexpr ll mod = 1e9 + 7;
using namespace std;
ll A, B, C, D, G, H, N, M, L, K, P, Q, R, W, X, Y, Z;
string S, T;
ll ans = 0;
void dfs(int node, vector<vector<int>> &tree, vector<int> &parent,
vector<int> &out) {
int p = par... | replace | 13 | 14 | 13 | 14 | 0 | |
p02976 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
vector<vector<int>> graph;
vector<int> degree;
vector<int> depth;
vector<pair<int, int>> ans;
void DFS(int v, int previous_v) {
for (int adjacent : graph[v]) {
if (adjacent == previous_v)
continue;
if (depth[adjacent] == -1) { // just dive down
dept... | #include <bits/stdc++.h>
using namespace std;
vector<vector<int>> graph;
vector<int> degree;
vector<int> depth;
vector<pair<int, int>> ans;
void DFS(int v, int previous_v) {
for (int adjacent : graph[v]) {
if (adjacent == previous_v)
continue;
if (depth[adjacent] == -1) { // just dive down
dept... | replace | 42 | 43 | 42 | 43 | 0 | |
p02976 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
struct edge {
int to, next, ok;
} e[N];
int n, m, good = 1, h[N];
int visited[N], check[N];
void add(int u, int v) {
e[++good] = (edge){v, h[u], 0};
h[u] = good;
}
void dfs(int u, int p) {
visited[u] = ++*visited;
for (int i = h[u]; i; i = e... | #include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 5;
struct edge {
int to, next, ok;
} e[N];
int n, m, good = 1, h[N];
int visited[N], check[N];
void add(int u, int v) {
e[++good] = (edge){v, h[u], 0};
h[u] = good;
}
void dfs(int u, int p) {
visited[u] = ++*visited;
for (int i = h[u]; i; i = e... | replace | 2 | 3 | 2 | 3 | 0 | |
p02976 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define N 10005
int n, m, fa[N], out[N];
vector<int> g[N];
inline int Find(int x) { return x == fa[x] ? x : fa[x] = Find(fa[x]); }
inline void dfs(int x, int fa) {
for (int i = 0; i < g[x].size(); i++) {
int v = g[x][i];
if (v == fa)
continue;
dfs(v, x);... | #include <bits/stdc++.h>
using namespace std;
#define N 100005
int n, m, fa[N], out[N];
vector<int> g[N];
inline int Find(int x) { return x == fa[x] ? x : fa[x] = Find(fa[x]); }
inline void dfs(int x, int fa) {
for (int i = 0; i < g[x].size(); i++) {
int v = g[x][i];
if (v == fa)
continue;
dfs(v, x)... | replace | 2 | 3 | 2 | 3 | 0 | |
p02976 | C++ | Runtime Error | #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 <dequ... | #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 <dequ... | replace | 114 | 115 | 114 | 115 | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.