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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
p03137 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> A(M, 0);
for (int i = 0; i < M; i++)
cin >> A[i];
sort(A.begin(), A.end());
vector<int> B(M - 1, 0);
for (int i = 0; i < M - 1; i++) {
B[i] = A[i + 1] - A[i];
}... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
if (N > M) {
cout << 0;
return 0;
}
vector<int> A(M, 0);
for (int i = 0; i < M; i++)
cin >> A[i];
sort(A.begin(), A.end());
vector<int> B(M - 1, 0);
for (int i = 0; ... | insert | 9 | 9 | 9 | 14 | 0 | |
p03137 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> X, dis_X;
for (int i = 0; i < M; i++) {
int element;
cin >> element;
X.push_back(element);
}
if (M == 1) {
cout << 0 << endl;
} else if (N > M) {
cout << 0... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> X, dis_X;
for (int i = 0; i < M; i++) {
int element;
cin >> element;
X.push_back(element);
}
if (M == 1) {
cout << 0 << endl;
} else if (N >= M) {
cout << ... | replace | 16 | 17 | 16 | 17 | 0 | |
p03137 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = int(a); i < int(b); ++i)
#define SIZE 200005
#define INF 1000000005LL
#define MOD 1000000007
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
int main() {
int n, m;
cin >> n >> m;
vector<int> data(m);
rep(i, 0, m) { cin >> data[... | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = int(a); i < int(b); ++i)
#define SIZE 200005
#define INF 1000000005LL
#define MOD 1000000007
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
int main() {
int n, m;
cin >> n >> m;
vector<int> data(m);
rep(i, 0, m) { cin >> data[... | insert | 18 | 18 | 18 | 22 | 0 | |
p03137 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, m;
cin >> n >> m;
if (m == 1) {
cout << 0 << endl;
return 0;
}
vector<int> a(m);
for (int i = 0; i < m; i++)
cin >> a[i];
sort(a.begin(), a.end());
vector<int> div(m - 1);
for (int i = 0; i < m - 1; i+... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, m;
cin >> n >> m;
if (m == 1) {
cout << 0 << endl;
return 0;
}
vector<int> a(m);
for (int i = 0; i < m; i++)
cin >> a[i];
sort(a.begin(), a.end());
vector<int> div(m - 1);
for (int i = 0; i < m - 1; i+... | replace | 21 | 23 | 21 | 24 | 0 | |
p03137 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define PI 3.14159265358979323846
constexpr int INF = numeric_limits<int>::max() / 2;
constexpr long long INFL = numeric_limits<long long>::max() / 2;
constexpr int MOD = 1000000007;
using Graph = vector<vector<int>>;
in... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define PI 3.14159265358979323846
constexpr int INF = numeric_limits<int>::max() / 2;
constexpr long long INFL = numeric_limits<long long>::max() / 2;
constexpr int MOD = 1000000007;
using Graph = vector<vector<int>>;
in... | replace | 18 | 25 | 18 | 30 | 0 | |
p03137 | C++ | Runtime Error | #include <algorithm>
#include <array>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <numeric>
#include <queue>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using l... | #include <algorithm>
#include <array>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <numeric>
#include <queue>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using l... | replace | 41 | 42 | 41 | 42 | 0 | |
p03137 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> x(m);
for (int i = 0; i < m; ++i)
cin >> x[i];
sort(x.begin(), x.end());
vector<int> diff(m - 1);
for (int i = 0; i < m; ++i)
diff[i] = x[i + 1] - x[i];
sort(diff.begin(), diff.end());
int ans =... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> x(m);
for (int i = 0; i < m; ++i)
cin >> x[i];
sort(x.begin(), x.end());
vector<int> diff(m - 1);
for (int i = 0; i < m - 1; ++i)
diff[i] = x[i + 1] - x[i];
sort(diff.begin(), diff.end());
int a... | replace | 13 | 14 | 13 | 14 | 0 | |
p03137 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
/*#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template<typename T> using gpp_set = tree<T, null_type, less<T>, rb_tree_tag,
tree_order_statistics_node_update>; template<typename T, typename L> using
gpp_map = tre... | #include <bits/stdc++.h>
using namespace std;
/*#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template<typename T> using gpp_set = tree<T, null_type, less<T>, rb_tree_tag,
tree_order_statistics_node_update>; template<typename T, typename L> using
gpp_map = tre... | replace | 107 | 109 | 107 | 109 | 0 | |
p03137 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
int N, M;
cin >> N >> M;
if (M == 1) {
cout << "0"
<< "\n";
return 0;
}
vector<int> v(M);
for (int i = 0; i < M; i++) {
cin >> v.at(i);
}
sort(v.begin(), v.end());
vector<int> sa(M - 1);
for (int i ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
int N, M;
cin >> N >> M;
if (M == 1 || N >= M) {
cout << "0"
<< "\n";
return 0;
}
vector<int> v(M);
for (int i = 0; i < M; i++) {
cin >> v.at(i);
}
sort(v.begin(), v.end());
vector<int> sa(M - 1);
f... | replace | 7 | 8 | 7 | 8 | 0 | |
p03137 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int(i) = 0; i < (n); i++)
int main() {
int n, m, ans = 0;
cin >> n >> m;
vector<int> x(m, 0), d(m - 1, 0);
REP(i, m) cin >> x.at(i);
sort(x.begin(), x.end());
REP(i, m - 1) d.at(i) = x.at(i + 1) - x.at(i);
sort(d.begin(), d.end());
co... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int(i) = 0; i < (n); i++)
int main() {
int n, m, ans = 0;
cin >> n >> m;
vector<int> x(m, 0), d(m - 1, 0);
REP(i, m) cin >> x.at(i);
sort(x.begin(), x.end());
REP(i, m - 1) d.at(i) = x.at(i + 1) - x.at(i);
sort(d.begin(), d.end());
co... | replace | 12 | 13 | 12 | 13 | 0 | |
p03137 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int(i) = 0; i < (n); i++)
int main() {
int n, m, ans = 0;
cin >> n >> m;
vector<int> x(m, 0), d(m - 1, 0);
REP(i, m) cin >> x.at(i);
sort(x.begin(), x.end());
REP(i, m - 1) d.at(i) = x.at(i + 1) - x.at(i);
sort(d.begin(), d.end(), great... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int(i) = 0; i < (n); i++)
int main() {
int n, m, ans = 0;
cin >> n >> m;
if (m != 1) {
vector<int> x(m, 0), d(m - 1, 0);
REP(i, m) cin >> x.at(i);
sort(x.begin(), x.end());
REP(i, m - 1) d.at(i) = x.at(i + 1) - x.at(i);
sort... | replace | 7 | 14 | 7 | 17 | 0 | |
p03137 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
long int n, m, x[100000], min, tmp, sum;
cin >> n >> m;
if (n >= m) {
cout << 0 << endl;
return 0;
}
cin >> x[0];
for (int i = 1; i < m; i++) {
cin >> x[i];
}
/*
for(int i=0;i<m;i++){
min = i;
for(int k=... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
long int n, m, x[100000], min, tmp, sum;
cin >> n >> m;
if (n >= m) {
cout << 0 << endl;
return 0;
}
cin >> x[0];
for (int i = 1; i < m; i++) {
cin >> x[i];
}
/*
for(int i=0;i<m;i++){
min = i;
for(int k=... | replace | 30 | 40 | 30 | 41 | TLE | |
p03137 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> l;
for (int i = 0; i < m; i++) {
int a;
cin >> a;
l.push_back(a);
}
sort(l.begin(), l.end());
vector<int> d_l;
for (int i = 0; i < m - 1; i++) {
d_l.push_back(l[i + 1] - l[i]);
}
sort(d_... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
if (n > m)
n = m;
vector<int> l;
for (int i = 0; i < m; i++) {
int a;
cin >> a;
l.push_back(a);
}
sort(l.begin(), l.end());
vector<int> d_l;
for (int i = 0; i < m - 1; i++) {
d_l.push_back(l[i + 1... | insert | 7 | 7 | 7 | 9 | 0 | |
p03137 | C++ | Runtime Error | /*Function Template*/
#include <bits/stdc++.h>
using namespace std;
const int mod = 1000000007;
#define rep(i, n) for (long long int i = 0; i < (n); i++)
int Len(int n) {
int s = 0;
while (n != 0)
s++, n /= 10;
return s;
}
int Sint(int n) {
int m = 0, s = 0, a = n;
while (a != 0)
s++, a /= 10;
for... | /*Function Template*/
#include <bits/stdc++.h>
using namespace std;
const int mod = 1000000007;
#define rep(i, n) for (long long int i = 0; i < (n); i++)
int Len(int n) {
int s = 0;
while (n != 0)
s++, n /= 10;
return s;
}
int Sint(int n) {
int m = 0, s = 0, a = n;
while (a != 0)
s++, a /= 10;
for... | insert | 83 | 83 | 83 | 87 | 0 | |
p03137 | C++ | Runtime Error | #include <iostream>
#include <queue>
using namespace std;
int main() {
int n, m, k;
cin >> n >> m;
priority_queue<int> a;
for (int i = 0; i < m; i++) {
cin >> k;
a.push(k);
}
priority_queue<int> b;
int dum;
while (-1) {
dum = a.top();
a.pop();
if (a.empty()) {
break;
}... | #include <iostream>
#include <queue>
using namespace std;
int main() {
int n, m, k;
cin >> n >> m;
priority_queue<int> a;
for (int i = 0; i < m; i++) {
cin >> k;
a.push(k);
}
priority_queue<int> b;
int dum;
while (-1) {
dum = a.top();
a.pop();
if (a.empty()) {
break;
}... | replace | 28 | 29 | 28 | 29 | 0 | |
p03137 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
if (m == 1 || m >= n) {
cout << "0" << endl;
return 0;
}
vector<int> x(m);
vector<pair<int, int>> dist;
for (int i = 0; i < m; i++) {
cin >> x.at(i);
x.at(i) += 100000;
}
sort(x.begin(), x.end());
fo... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
if (m == 1 || n >= m) {
cout << "0" << endl;
return 0;
}
vector<int> x(m);
vector<pair<int, int>> dist;
for (int i = 0; i < m; i++) {
cin >> x.at(i);
x.at(i) += 100000;
}
sort(x.begin(), x.end());
fo... | replace | 6 | 7 | 6 | 7 | 0 | |
p03137 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, m;
cin >> n >> m;
int sum = 0;
int x[m];
for (int i = 0; i < m; ++i)
cin >> x[i];
sort(x, x + m);
// m - 1個の区間を選ばなくていい
for (int i = 0; i < m - 1; ++i)
x[i] = x[i + 1] -... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, m;
cin >> n >> m;
if (n >= m) {
cout << 0 << endl;
return 0;
}
int sum = 0;
int x[m];
for (int i = 0; i < m; ++i)
cin >> x[i];
sort(x, x + m);
// m - 1個の区間を選ばなくてい... | insert | 9 | 9 | 9 | 13 | 0 | |
p03137 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
struct distandindex {
int dist;
int index;
};
bool cmp(const distandindex &a, const distandindex &b) {
return a.dist > b.dist;
}
int main() {
int N, M;
cin >> N >> M;
vector<int> x(M);
for (int i = 0; i < M; i++) {
cin... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
struct distandindex {
int dist;
int index;
};
bool cmp(const distandindex &a, const distandindex &b) {
return a.dist > b.dist;
}
int main() {
int N, M;
cin >> N >> M;
vector<int> x(M);
for (int i = 0; i < M; i++) {
cin... | replace | 24 | 25 | 24 | 25 | 0 | |
p03137 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
const int INF = 1e9;
const int MAX = 100000;
const long long LINF = 1e18;
int main() {
int N, M;
cin >> N >> M;
vector<int> X(M);
for (int i = 0; i < M; i++) {
cin >> X[i];
}
sort(X.begin(), X.end());
in... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
const int INF = 1e9;
const int MAX = 100000;
const long long LINF = 1e18;
int main() {
int N, M;
cin >> N >> M;
vector<int> X(M);
for (int i = 0; i < M; i++) {
cin >> X[i];
}
sort(X.begin(), X.end());
in... | replace | 19 | 20 | 19 | 20 | 0 | |
p03137 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(a, b) for (int a = 0; a < (b); ++a)
#define REP1(i, n) for (int i = 1; i <= (n); ++i)
#define debug(x) cerr << #x << ": " << x << '\n'
#define all(x) (x).begin(), (x).end()
#defi... | #include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(a, b) for (int a = 0; a < (b); ++a)
#define REP1(i, n) for (int i = 1; i <= (n); ++i)
#define debug(x) cerr << #x << ": " << x << '\n'
#define all(x) (x).begin(), (x).end()
#defi... | replace | 127 | 128 | 127 | 128 | 0 | |
p03137 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> X(M);
for (int i = 0; i < M; ++i) {
cin >> X.at(i);
}
sort(X.begin(), X.end());
if (M == 1) {
cout << 0 << endl;
} else {
vector<int> distance(M - 1);
int X_width = X.at(M - 1) - X.at(0);
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> X(M);
for (int i = 0; i < M; ++i) {
cin >> X.at(i);
}
sort(X.begin(), X.end());
if (M == 1) {
cout << 0 << endl;
} else {
vector<int> distance(M - 1);
int X_width = X.at(M - 1) - X.at(0);
... | replace | 23 | 24 | 23 | 24 | 0 | |
p03137 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
#define COUT(x) cout << (x) << endl
#define dump(x) cout << #x << " = " << (x) << endl;
#define Yes(x) cout << (x ? "Yes" : "No") << endl;
#define YES(x) cout << (x ? "YES" : "NO") << endl;
using ll = long long;
using P = pair<i... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
#define COUT(x) cout << (x) << endl
#define dump(x) cout << #x << " = " << (x) << endl;
#define Yes(x) cout << (x ? "Yes" : "No") << endl;
#define YES(x) cout << (x ? "YES" : "NO") << endl;
using ll = long long;
using P = pair<i... | replace | 33 | 34 | 33 | 34 | 0 | |
p03137 | C++ | Runtime Error | #define _GLIBCXX_DEBUG // TLEの原因になるので注意！！！！！！！！！！！
#include <bits/stdc++.h>
#include <cmath>
typedef long long ll;
using namespace std;
vector<int> arr;
stack<int> st;
queue<int> qu;
queue<pair<int, int>> qu2;
priority_queue<int> pq;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, n) for (int i = 1... | #define _GLIBCXX_DEBUG // TLEの原因になるので注意！！！！！！！！！！！
#include <bits/stdc++.h>
#include <cmath>
typedef long long ll;
using namespace std;
vector<int> arr;
stack<int> st;
queue<int> qu;
queue<pair<int, int>> qu2;
priority_queue<int> pq;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, n) for (int i = 1... | replace | 184 | 185 | 184 | 185 | 0 | |
p03137 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#define ll long long
#define ld long double
using namespace std;
int read() {
int x;
scanf("%d", &x);
return x;
}
int maxn, minn;
const int MAXN = 100005;
int a[MAXN], b[MAXN];
int main() {
int n = read(), m = read();... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#define ll long long
#define ld long double
using namespace std;
int read() {
int x;
scanf("%d", &x);
return x;
}
int maxn, minn;
const int MAXN = 100005;
int a[MAXN], b[MAXN];
int main() {
int n = read(), m = read();... | insert | 18 | 18 | 18 | 20 | 0 | |
p03137 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <vector>
using namespace std;
#pragma warning(disable : 4996)
int main() {
int n, m;
cin >> n >> m;
vector<int> a(m);
for (int i = 0; i < m; i++)
cin >> a[i];
sort(a.begin(), a.end());
vector<int> vc;
for (int i = ... | #include <algorithm>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <vector>
using namespace std;
#pragma warning(disable : 4996)
int main() {
int n, m;
cin >> n >> m;
vector<int> a(m);
for (int i = 0; i < m; i++)
cin >> a[i];
if (n >= m) {
cout << 0;
return 0;
}
sort(a.beg... | insert | 14 | 14 | 14 | 18 | 0 | |
p03137 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <exception>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <vector>
using namespace std;
typ... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <exception>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <vector>
using namespace std;
typ... | replace | 49 | 50 | 49 | 50 | 0 | |
p03137 | C++ | Runtime Error | #include <bits/stdc++.h>
#define REP(i, n) for (long i = 0; i < n; ++i)
using namespace std;
void solve(long N, long M, vector<long> X) {
// if there's only one target, we can win without any move
if (M == 1) {
cout << 0 << endl;
return;
}
// sort the targets
sort(X.begin(), X.end());
// calc th... | #include <bits/stdc++.h>
#define REP(i, n) for (long i = 0; i < n; ++i)
using namespace std;
void solve(long N, long M, vector<long> X) {
// if there's less number of targets than the pieces, we can win without any
// movement
if (M <= N) {
cout << 0 << endl;
return;
}
// sort the targets
sort(X.... | replace | 6 | 8 | 6 | 9 | 0 | |
p03137 | 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... | insert | 102 | 102 | 102 | 106 | 0 | |
p03137 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define ll long long
#define pb push_back
int main() {
int N, M;
vector<int> X;
cin >> N >> M;
for (int i = 0; i < M; i++) {
int x;
cin... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define ll long long
#define pb push_back
int main() {
int N, M;
vector<int> X;
cin >> N >> M;
if (N >= M) {
cout << 0 << endl;
return ... | insert | 18 | 18 | 18 | 22 | 0 | |
p03137 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define endl "\n... | #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define endl "\n... | replace | 56 | 59 | 56 | 62 | 0 | |
p03139 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
int main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n, a, b;
cin >> n >> a >> b;
cout ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
int main() {
/*
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif*/
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n, a, b;
cin >> n >> a >> b;
... | replace | 5 | 9 | 5 | 10 | 0 | |
p03139 | C++ | Runtime Error | #pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse2")
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define pii pair<int, int>
#define vi vector<int>
#define vii vector<pii>
#define mi map<int, int>
#define mii map<pii, int>
#define al... | #pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse2")
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define pii pair<int, int>
#define vi vector<int>
#define vii vector<pii>
#define mi map<int, int>
#define mii map<pii, int>
#define al... | delete | 38 | 43 | 38 | 38 | 0 | |
p03139 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define sd(x) scanf("%d", &x)
#define slld(x) scanf("%lld", &x)
#define all(x) x.begin(), x.end()
#define For(i, st, en) for (ll i = st; i < en; i++)
#define tr(x) for (auto it = x.begin(); it != x.end(); it++)
#define fast ... | #include <bits/stdc++.h>
using namespace std;
#define sd(x) scanf("%d", &x)
#define slld(x) scanf("%lld", &x)
#define all(x) x.begin(), x.end()
#define For(i, st, en) for (ll i = st; i < en; i++)
#define tr(x) for (auto it = x.begin(); it != x.end(); it++)
#define fast ... | replace | 21 | 25 | 21 | 25 | 0 | |
p03139 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define Abs(x) ((x) < 0 ? (x) * -1 : (x))
#define rep(x, y) for ((x) = 0; (x) < (y); (x)++)
#define repin(x, y) for ((x) = 0; (x) <= (y); (x)++)
#define nep(x, y) for ((x) = (y)-1; 0 <= (x); (x)--)
#define nepi(x, y,... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define Abs(x) ((x) < 0 ? (x) * -1 : (x))
#define rep(x, y) for ((x) = 0; (x) < (y); (x)++)
#define repin(x, y) for ((x) = 0; (x) <= (y); (x)++)
#define nep(x, y) for ((x) = (y)-1; 0 <= (x); (x)--)
#define nepi(x, y,... | replace | 58 | 59 | 58 | 59 | 0 | |
p03139 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define MAX 200005
#define MOD 998244353
#define pb push_back
#define mp make_pair
#define f first
#define s second
ll n, m, i, j, k, t, l, r, tmp, ans, cnt, curr, flag, sum, mn, mx, mxi, x, pre,
strt, en;
ll brr[MAX], arr[MA... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define MAX 200005
#define MOD 998244353
#define pb push_back
#define mp make_pair
#define f first
#define s second
ll n, m, i, j, k, t, l, r, tmp, ans, cnt, curr, flag, sum, mn, mx, mxi, x, pre,
strt, en;
ll brr[MAX], arr[MA... | replace | 20 | 23 | 20 | 21 | 0 | |
p03139 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <chrono>
#define rep(i, a, b) for (int i = a; i < b; i++)
#define rep2(i, a, b) for (int i = a; i >= b; i--)
#define mod 1000000007
#define INF 1e9 + 5
#define fr first
#define se second
#define int long long
#define ll long long
#define PI 3.1415926535
#define pll pair<ll, ll>
#define... | #include <bits/stdc++.h>
#include <chrono>
#define rep(i, a, b) for (int i = a; i < b; i++)
#define rep2(i, a, b) for (int i = a; i >= b; i--)
#define mod 1000000007
#define INF 1e9 + 5
#define fr first
#define se second
#define int long long
#define ll long long
#define PI 3.1415926535
#define pll pair<ll, ll>
#define... | replace | 29 | 36 | 29 | 30 | 0 | |
p03140 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main(int, char **) {
unsigned int n, ans = 0;
string a, b, c;
cin >> n >> a >> b >> c;
for (unsigned int i = 0; i < n; i++) {
if (a[i] == b[i] && a[i] == c[i])
continue;
if (a[i] == b[i])
++ans;
else if (a[i] == c[i])
++ans;
... | #include <bits/stdc++.h>
using namespace std;
int main(int, char **) {
unsigned int n, ans = 0;
string a, b, c;
cin >> n >> a >> b >> c;
for (unsigned int i = 0; i < n; i++) {
if (a[i] == b[i] && a[i] == c[i])
continue;
if (a[i] == b[i])
++ans;
else if (a[i] == c[i])
++ans;
... | replace | 24 | 25 | 24 | 25 | 1 | |
p03140 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define ll long long
using namespace std;
int main() {
int n;
cin >> n;
vector<string> abc(n);
rep(i, 3) cin >> abc[i];
int result = 0;
rep(i, n) {
set<char> s;
rep(j, 3) s.insert(abc[j][i]);
result += (s.size() - 1);
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define ll long long
using namespace std;
int main() {
int n;
cin >> n;
vector<string> abc(3);
rep(i, 3) cin >> abc[i];
int result = 0;
rep(i, n) {
set<char> s;
rep(j, 3) s.insert(abc[j][i]);
result += (s.size() - 1);
... | replace | 10 | 11 | 10 | 11 | 0 | |
p03140 | C++ | Runtime Error | #pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse2")
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define pii pair<int, int>
#define vi vector<int>
#define vii vector<pii>
#define mi map<int, int>
#define mii map<pii, int>
#define al... | #pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse2")
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define pii pair<int, int>
#define vi vector<int>
#define vii vector<pii>
#define mi map<int, int>
#define mii map<pii, int>
#define al... | delete | 52 | 57 | 52 | 52 | -11 | |
p03140 | C++ | Runtime Error | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
#define X first
#define Y second
#define vsort(v) sort((v).begin(), (v).end())
#define vrev(v) reverse((v).begin(), (v).end())
// stoi(s): string to int
// stod(s): string to ... | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
#define X first
#define Y second
#define vsort(v) sort((v).begin(), (v).end())
#define vrev(v) reverse((v).begin(), (v).end())
// stoi(s): string to int
// stod(s): string to ... | replace | 37 | 38 | 37 | 38 | 0 | |
p03140 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main(void) {
int n;
cin >> n;
string s[n];
for (int i = 0; i < 3; i++) {
cin >> s[i];
}
long sum = 0;
for (int i = 0; i < n; i++) {
if (s[0][i] == s[1][i] && s[1][i] == s[2][i]) {
} else if (s[0][i] == s[1][i] || s[1][i] == s[2][i] || s[0][i] == s[... | #include <iostream>
using namespace std;
int main(void) {
int n;
cin >> n;
string s[3];
for (int i = 0; i < 3; i++) {
cin >> s[i];
}
long sum = 0;
for (int i = 0; i < n; i++) {
if (s[0][i] == s[1][i] && s[1][i] == s[2][i]) {
} else if (s[0][i] == s[1][i] || s[1][i] == s[2][i] || s[0][i] == s[... | replace | 5 | 6 | 5 | 6 | 0 | |
p03140 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define REP(var, n) for (decltype(n) var = 0; var < (n); var++)
#define RREP(var, n) \
for (auto var = n - 1; var != static_cast<decltype(var)>(-1); var--)
#define FOR(var, a, b) for (auto var = (a); var < (b); v... | #include <bits/stdc++.h>
using namespace std;
#define REP(var, n) for (decltype(n) var = 0; var < (n); var++)
#define RREP(var, n) \
for (auto var = n - 1; var != static_cast<decltype(var)>(-1); var--)
#define FOR(var, a, b) for (auto var = (a); var < (b); v... | replace | 44 | 45 | 44 | 45 | 0 | |
p03140 | C++ | Runtime Error | // #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define pp pair<int, int>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define ld long double
#define al(a) (a).begin(), (a).end()
#define mk make_pair
#define check cout << "?" << endl;
ll MOD = 1000000007;
ll mod = ... | // #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define pp pair<int, int>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define ld long double
#define al(a) (a).begin(), (a).end()
#define mk make_pair
#define check cout << "?" << endl;
ll MOD = 1000000007;
ll mod = ... | replace | 23 | 24 | 23 | 24 | -11 | |
p03141 | C++ | Time Limit Exceeded | #include <algorithm>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using pi... | #include <algorithm>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using pi... | replace | 110 | 111 | 110 | 111 | TLE | |
p03141 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
long long ans1, ans2, n;
vector<pii> vec;
bool cmp(pii a, pii b) { return a.first + a.second < b.first + b.second; }
bool flag = 0;
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
int a, b;
cin >> a >> b;
vec.push_back(pii(a... | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
long long ans1, ans2, n;
vector<pii> vec;
bool cmp(pii a, pii b) { return a.first + a.second < b.first + b.second; }
bool flag = 0;
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
int a, b;
cin >> a >> b;
vec.push_back(pii(a... | insert | 23 | 23 | 23 | 24 | TLE | |
p03141 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<pair<int, int>> vec(n);
for (auto &v : vec) {
int a, b;
cin >> a >> b;
v = make_pair(a, b);
}
sort(vec.begin(), vec.end(), [](auto &lhs, auto &rhs) {
... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<pair<int, int>> vec(n);
for (auto &v : vec) {
int a, b;
cin >> a >> b;
v = make_pair(a, b);
}
sort(vec.begin(), vec.end(), [](auto &lhs, auto &rhs) {
... | replace | 18 | 19 | 18 | 19 | 0 | |
p03141 | C++ | Runtime Error | #include <bits/stdc++.h>
#define REP(i, a, n) for (ll i = ((ll)a); i < ((ll)n); i++)
using namespace std;
typedef long long ll;
int main(void) {
ll N;
cin >> N;
vector<ll> A(N), B(N);
REP(i, 0, N) cin >> A[i] >> B[i];
vector<ll> ord(N);
REP(i, 0, N) ord[i] = i;
sort(ord.begin(), ord.end(),
[&](c... | #include <bits/stdc++.h>
#define REP(i, a, n) for (ll i = ((ll)a); i < ((ll)n); i++)
using namespace std;
typedef long long ll;
int main(void) {
ll N;
cin >> N;
vector<ll> A(N), B(N);
REP(i, 0, N) cin >> A[i] >> B[i];
vector<ll> ord(N);
REP(i, 0, N) ord[i] = i;
sort(ord.begin(), ord.end(),
[&](c... | replace | 15 | 16 | 15 | 17 | 0 | |
p03141 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
int A[100000], B[100000];
for (int i = 0; i < N; i++)
cin >> A[i] >> B[i];
ll sum;
pair<ll, int> C[10000];
for (int i = 0; i < N; i++) {
sum = A[i] + B[i];
C[i] = make_pair(sum, i);
}
// 昇順ソ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
int A[100000], B[100000];
for (int i = 0; i < N; i++)
cin >> A[i] >> B[i];
ll sum;
pair<ll, int> C[100000];
for (int i = 0; i < N; i++) {
sum = A[i] + B[i];
C[i] = make_pair(sum, i);
}
// 昇順... | replace | 12 | 13 | 12 | 13 | 0 | |
p03141 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
using namespace std;
const int nmax = 100005;
struct grm {
long long a, b;
} a[nmax];
bool comp(grm a, grm b) { return (a.a + b.a < b.a + b.b); }
long long ans, sgn;
int x, y, n, i;
int main() {
cin >> n;
for (i = 1; i <= n; i++) {
cin >> a[i].a >> a[i].b;
}
sort(a... | #include <algorithm>
#include <iostream>
using namespace std;
const int nmax = 100005;
struct grm {
long long a, b;
} a[nmax];
bool comp(grm unu, grm doi) { return (unu.a + unu.b < doi.a + doi.b); }
long long ans, sgn;
int x, y, n, i;
int main() {
cin >> n;
for (i = 1; i <= n; i++) {
cin >> a[i].a >> a[i].b;
... | replace | 7 | 8 | 7 | 8 | 0 | |
p03141 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using ll = long long;
using ull = unsigned long long;
using namespac... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using ll = long long;
using ull = unsigned long long;
using namespac... | replace | 103 | 104 | 103 | 104 | 0 | |
p03141 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <map>
#include <queue>
#include <random>
#include <vector>
using namespace std;
int N;
pair<long long, pair<long long, long long>> P[100000];
int main(void) {
long long a, b;
scanf("%d", &N);
for (int i = ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <map>
#include <queue>
#include <random>
#include <vector>
using namespace std;
int N;
pair<long long, pair<long long, long long>> P[100000];
int main(void) {
long long a, b;
scanf("%d", &N);
for (int i = ... | replace | 27 | 28 | 27 | 28 | TLE | |
p03141 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
// #define int ll
using PII = pair<ll, ll>;
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
template <typename T> T &chmin(T &a, const T &b) { return a = min(a, b); }
template ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
// #define int ll
using PII = pair<ll, ll>;
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()
template <typename T> T &chmin(T &a, const T &b) { return a = min(a, b); }
template ... | replace | 66 | 67 | 66 | 68 | 0 | |
p03141 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
struct node {
int a, b;
int tot;
};
node peo[50005];
int cmp(node x, node y) {
if (x.tot > y.tot)
return true;
return false;
}
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> peo[i].a >> peo[i].b;
peo[i].tot = peo[i].a + peo[i].... | #include <bits/stdc++.h>
using namespace std;
struct node {
int a, b;
int tot;
};
node peo[500005];
int cmp(node x, node y) {
if (x.tot > y.tot)
return true;
return false;
}
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> peo[i].a >> peo[i].b;
peo[i].tot = peo[i].a + peo[i]... | replace | 6 | 7 | 6 | 7 | 0 | |
p03141 | C++ | Time Limit Exceeded | #include <algorithm>
#include <array>
#include <iostream>
struct Dish {
long long a;
long long b;
long long sum;
};
int main() {
std::size_t n;
std::cin >> n;
std::array<Dish, 100000> dishVec;
for (std::size_t i = 0; i < n; i++) {
std::cin >> dishVec[i].a >> dishVec[i].b;
dishVec[i].sum = dishVec[... | #include <algorithm>
#include <array>
#include <iostream>
struct Dish {
long long a;
long long b;
long long sum;
};
int main() {
std::size_t n;
std::cin >> n;
std::array<Dish, 100000> dishVec;
for (std::size_t i = 0; i < n; i++) {
std::cin >> dishVec[i].a >> dishVec[i].b;
dishVec[i].sum = dishVec[... | replace | 17 | 18 | 17 | 18 | TLE | |
p03141 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <cmath>
const double PI = 3.14159265358979323846;
// using namespace boost::multiprecision;
using namespace std;
typedef long long ll;
const double EPS = 1e-9;
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef pair<ll, ll> P;
const ll INF = 1e15;
#define cmin(x, y) x = min(x, y)... | #include <bits/stdc++.h>
#include <cmath>
const double PI = 3.14159265358979323846;
// using namespace boost::multiprecision;
using namespace std;
typedef long long ll;
const double EPS = 1e-9;
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef pair<ll, ll> P;
const ll INF = 1e15;
#define cmin(x, y) x = min(x, y)... | replace | 53 | 55 | 53 | 56 | 0 | |
p03141 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sta... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sta... | replace | 75 | 84 | 75 | 80 | 0 | |
p03141 | C++ | Runtime Error | #include <bits/stdc++.h>
#define show(x) std::cerr << #x << " = " << (x) << std::endl
using ll = long long;
template <typename T> constexpr T MOD = static_cast<T>(1000000007);
template <typename T> constexpr T INF = std::numeric_limits<T>::max() / 16;
int main() {
int N;
std::cin >> N;
using P = std::pair<ll, ll>... | #include <bits/stdc++.h>
#define show(x) std::cerr << #x << " = " << (x) << std::endl
using ll = long long;
template <typename T> constexpr T MOD = static_cast<T>(1000000007);
template <typename T> constexpr T INF = std::numeric_limits<T>::max() / 16;
int main() {
int N;
std::cin >> N;
using P = std::pair<ll, ll>... | replace | 14 | 15 | 14 | 15 | 0 | |
p03141 | C++ | Time Limit Exceeded | #include <algorithm>
#include <assert.h>
#include <bit>
#include <bitset>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <vector>
typedef long double ld;
typedef long long ll;
... | #include <algorithm>
#include <assert.h>
#include <bit>
#include <bitset>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <vector>
typedef long double ld;
typedef long long ll;
... | replace | 31 | 32 | 31 | 32 | TLE | |
p03141 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define PI acos(-1.0)
#define EPS 1e-8
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define pb push_back
#define fi first
#define se second
#define go(i, a, b) for (int i = a; i <= b; ++i)
#define gorev(i, a, b) for (int i = a; i >= b; --i... | #include <bits/stdc++.h>
using namespace std;
#define PI acos(-1.0)
#define EPS 1e-8
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define pb push_back
#define fi first
#define se second
#define go(i, a, b) for (int i = a; i <= b; ++i)
#define gorev(i, a, b) for (int i = a; i >= b; --i... | replace | 143 | 144 | 143 | 144 | TLE | |
p03141 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fr(i, a, b) for (ll i = (a), _b = (b); i <= _b; i++)
#define frr(i, a, b) for (ll i = (a), _b = (b); i >= _b; i--)
#define rep(i, n) for (ll i = 0, _n = (n); i < _n; i++)
#define repr(i, n) for (ll i = n - 1; i >= 0; i--)
#define fill(ar, val)... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fr(i, a, b) for (ll i = (a), _b = (b); i <= _b; i++)
#define frr(i, a, b) for (ll i = (a), _b = (b); i >= _b; i--)
#define rep(i, n) for (ll i = 0, _n = (n); i < _n; i++)
#define repr(i, n) for (ll i = n - 1; i >= 0; i--)
#define fill(ar, val)... | delete | 30 | 34 | 30 | 30 | -6 | terminate called after throwing an instance of 'std::bad_alloc'
what(): std::bad_alloc
|
p03141 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
int main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n;
cin >> n;
// ll a[n],b[n];
ll... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
int main() {
/*
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif */
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n;
cin >> n;
// ll a[n],b[n]... | replace | 5 | 9 | 5 | 10 | -11 | |
p03141 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
int n;
int a[10010], b[10010];
long long s[10010];
vector<pair<int, int>> V;
long long answer = 0;
int main() {
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> a[i] >> b[i];
s[i] = a[i] + b[i];
V.push_back... | #include <algorithm>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
int n;
long long a[100100], b[100100];
long long s[100100];
vector<pair<int, int>> V;
long long answer = 0;
int main() {
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> a[i] >> b[i];
s[i] = a[i] + b[i];
V.... | replace | 8 | 10 | 8 | 10 | 0 | |
p03142 | Python | Runtime Error | #!/usr/bin/env python3
N, M = map(int, input().split())
g = [[] for _ in range(N)]
rg = [[] for _ in range(N)]
for _ in range(N - 1 + M):
A, B = (int(x) - 1 for x in input().split())
g[A].append(B)
rg[B].append(A)
def dfs(s):
global ts
global used
used[s] = True
for t in g[s]:
if n... | #!/usr/bin/env python3
import sys
sys.setrecursionlimit(100000)
N, M = map(int, input().split())
g = [[] for _ in range(N)]
rg = [[] for _ in range(N)]
for _ in range(N - 1 + M):
A, B = (int(x) - 1 for x in input().split())
g[A].append(B)
rg[B].append(A)
def dfs(s):
global ts
global used
used... | insert | 1 | 1 | 1 | 4 | 0 | |
p03142 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
// 頂点数、変数
int v, e;
const int MAX_N = 10010;
// 隣接リスト
vector<int> to[MAX_N];
vector<int> from[MAX_N];
bool used[MAX_N];
// トポロジカルソートされた数列
vector<int> tps;
void dfs(int u) {
if (used[u])
return;
used[u] = true;
for ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
// 頂点数、変数
int v, e;
const int MAX_N = 100100;
// 隣接リスト
vector<int> to[MAX_N];
vector<int> from[MAX_N];
bool used[MAX_N];
// トポロジカルソートされた数列
vector<int> tps;
void dfs(int u) {
if (used[u])
return;
used[u] = true;
for... | replace | 6 | 7 | 6 | 7 | 0 | |
p03142 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define all(x) (x).begin(), (x).end()
#define m0(x) memset(x, 0, sizeof(x))
int dx4[4] = {1, 0, -1, 0}, dy4[4] = {0, 1, 0, -1};
i... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define all(x) (x).begin(), (x).end()
#define m0(x) memset(x, 0, sizeof(x))
int dx4[4] = {1, 0, -1, 0}, dy4[4] = {0, 1, 0, -1};
i... | replace | 17 | 19 | 17 | 20 | 0 | |
p03142 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N, M;
cin >> N >> M;
vector<vector<int>> G(N + 1);
vector<int> PC(N + 1, 0);
for (int i = 0; i < N + M - 1; i++) {
int a, b;
cin >> a >> b;
G[a].emplace_back(b);
PC[b]++;
}
vector<... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N, M;
cin >> N >> M;
vector<vector<int>> G(N + 1);
vector<int> PC(N + 1, 0);
for (int i = 0; i < N + M - 1; i++) {
int a, b;
cin >> a >> b;
G[a].emplace_back(b);
PC[b]++;
}
vector<... | replace | 17 | 18 | 17 | 18 | 0 | |
p03142 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define FOR(i, k, n) for (int i = (k); i < (n); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) begin(x), end(x)
using namespace std;
using vecint = vector<int>;
using ll = int64_t;
void dfs(const vector<vecint> &g, int s, vector<int> &nodes) {
for (int v : g[s]) {
dfs(g, v, nodes);
... | #include <bits/stdc++.h>
#define FOR(i, k, n) for (int i = (k); i < (n); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) begin(x), end(x)
using namespace std;
using vecint = vector<int>;
using ll = int64_t;
void dfs(const vector<vecint> &g, int s, vector<int> &nodes) {
for (int v : g[s]) {
if (nodes[v] == -1... | replace | 11 | 12 | 11 | 14 | TLE | |
p03142 | C++ | Runtime Error | #include <algorithm>
#include <cstring>
#include <iostream>
#include <queue>
#include <set>
#include <stack>
#include <utility>
#include <vector>
using namespace std;
// 頂点数、変数
int v, e;
const int MAX_N = 10010;
// 隣接リスト
vector<int> g[MAX_N];
bool used[MAX_N];
// トポロジカルソートされた数列
vector<int> ans;
void dfs(int u) {
i... | #include <algorithm>
#include <cstring>
#include <iostream>
#include <queue>
#include <set>
#include <stack>
#include <utility>
#include <vector>
using namespace std;
// 頂点数、変数
int v, e;
const int MAX_N = 100010;
// 隣接リスト
vector<int> g[MAX_N];
bool used[MAX_N];
// トポロジカルソートされた数列
vector<int> ans;
void dfs(int u) {
... | replace | 13 | 14 | 13 | 14 | 0 | |
p03142 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define Inf 0x3f3f3f3f
using namespace std;
typedef long long ll;
inline ll min(ll x, ll y) { return x < y ? x : y; }
inline ll max(ll x, ll y) { return x > y ? x : y; }
const int Maxn = 1e5 + 5;
int n, m, cnt, fir[Maxn], ind[Maxn], f[Maxn];
struct {
int to, last;
} e[Maxn];
void con(int u, i... | #include <bits/stdc++.h>
#define Inf 0x3f3f3f3f
using namespace std;
typedef long long ll;
inline ll min(ll x, ll y) { return x < y ? x : y; }
inline ll max(ll x, ll y) { return x > y ? x : y; }
const int Maxn = 1e5 + 5;
int n, m, cnt, fir[Maxn], ind[Maxn], f[Maxn];
struct {
int to, last;
} e[Maxn];
void con(int u, i... | replace | 26 | 27 | 26 | 29 | TLE | |
p03142 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define p_ary(ary, a, b, i) \
do { \
cout << "["; ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define p_ary(ary, a, b, i) \
do { \
cout << "["; ... | replace | 39 | 40 | 39 | 40 | 0 | |
p03142 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
typedef long long ll;
using namespace std;
typedef pair<int, int> P;
struct TopologicalSort {
int n;
vector<set<int>> G;
vector<bool> us... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
typedef long long ll;
using namespace std;
typedef pair<int, int> P;
struct TopologicalSort {
int n;
vector<set<int>> G;
vector<bool> us... | replace | 64 | 65 | 64 | 65 | 0 | |
p03142 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define ALL(a) (a).begin(), (a).end()
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<long long, long long> Pll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<long long> vll;
typedef vector<vector<long long>... | #include <bits/stdc++.h>
#define ALL(a) (a).begin(), (a).end()
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<long long, long long> Pll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<long long> vll;
typedef vector<vector<long long>... | replace | 64 | 65 | 64 | 66 | TLE | |
p03142 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
#define INF 1e9
#define MOD 1000000007
#define ll long long
using n... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
#define INF 1e9
#define MOD 1000000007
#define ll long long
using n... | replace | 23 | 26 | 23 | 26 | 0 | |
p03142 | C++ | Time Limit Exceeded | #include <list>
#include <stdio.h>
using namespace std;
class Node {
public:
int parentsCount = 0;
list<int> children;
int setParents = 0;
int trueParent = 0;
int trueDepth = 0;
void setDepth(int parent, int depth) {
if (trueDepth < depth) {
trueDepth = depth;
trueParent = parent;
}
... | #include <list>
#include <stdio.h>
using namespace std;
class Node {
public:
int parentsCount = 0;
list<int> children;
int setParents = 0;
int trueParent = 0;
int trueDepth = 0;
void setDepth(int parent, int depth) {
if (trueDepth < depth) {
trueDepth = depth;
trueParent = parent;
}
... | replace | 60 | 61 | 60 | 61 | TLE | |
p03142 | C++ | Runtime Error | // #include "pch.h"
// #include "stdafx.h"
#include <algorithm>
#include <cstring>
#include <iostream>
#include <math.h>
#include <queue>
#include <string>
#include <vector>
using namespace std;
/*-----------------------------------------------------------------------------
ライブラリ
-----------------------------------... | // #include "pch.h"
// #include "stdafx.h"
#include <algorithm>
#include <cstring>
#include <iostream>
#include <math.h>
#include <queue>
#include <string>
#include <vector>
using namespace std;
/*-----------------------------------------------------------------------------
ライブラリ
-----------------------------------... | replace | 91 | 92 | 91 | 92 | 0 | |
p03142 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define pb emplace_back
#define mp make_pair
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
constexpr int mod = 1e9 + 7;
constexpr int32_t inf = 1001001001;
constexpr int64_t infll = 1001001001001001001ll;
constex... | #include <bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define pb emplace_back
#define mp make_pair
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
constexpr int mod = 1e9 + 7;
constexpr int32_t inf = 1001001001;
constexpr int64_t infll = 1001001001001001001ll;
constex... | replace | 80 | 81 | 80 | 81 | 0 | |
p03142 | C++ | Time Limit Exceeded | /*
これを入れて実行
g++ code.cpp
./a.out
*/
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include ... | /*
これを入れて実行
g++ code.cpp
./a.out
*/
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include ... | insert | 89 | 89 | 89 | 91 | TLE | |
p03142 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
const int INF = 1e9, MOD = 1e9 + 7, ohara = 1e6 + 10;
const ll LINF = 1e18;
using namespace std;
#define rep(i, n) for (ll(i) = 0; (i) < (int)(n); (i)++)
#define rrep(i, a, b) for (ll i = (a); i < (b); i++)
#define rrrep(i, a, b) for (ll i = (a); i... | #include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
const int INF = 1e9, MOD = 1e9 + 7, ohara = 1e6 + 10;
const ll LINF = 1e18;
using namespace std;
#define rep(i, n) for (ll(i) = 0; (i) < (int)(n); (i)++)
#define rrep(i, a, b) for (ll i = (a); i < (b); i++)
#define rrrep(i, a, b) for (ll i = (a); i... | replace | 72 | 73 | 72 | 75 | TLE | |
p03142 | C++ | Runtime Error | #include <algorithm>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using pi... | #include <algorithm>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using pi... | replace | 96 | 99 | 96 | 99 | 0 | |
p03142 | C++ | Runtime Error | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define pll pair<ll, ll>
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define ios ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#d... | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define pll pair<ll, ll>
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define ios ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#d... | replace | 51 | 52 | 51 | 52 | 0 | |
p03142 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
// const ll mod = 1000000007;
int N, M;
vector<int> pathes[100500];
vector<int> inv[100050];
int parent[100050];
int Rank[100050];
void bfs(int from) {
if (inv[from].empty()) {
Rank[fro... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
// const ll mod = 1000000007;
int N, M;
vector<int> pathes[100500];
vector<int> inv[100050];
int parent[100050];
int Rank[100050];
void bfs(int from) {
if (inv[from].empty()) {
Rank[fro... | insert | 20 | 20 | 20 | 22 | TLE | |
p03142 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> Pii;
typedef pair<ll, ll> Pll;
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define rep2(i, a, b) for (ll i = a; i < b; ++i)
const ll MOD = 1e9 + 7;
const ll INF = 1e9;
const ll IINF = 1e18;
const double EPS = 1e-8;
const double ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> Pii;
typedef pair<ll, ll> Pll;
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define rep2(i, a, b) for (ll i = a; i < b; ++i)
const ll MOD = 1e9 + 7;
const ll INF = 1e9;
const ll IINF = 1e18;
const double EPS = 1e-8;
const double ... | insert | 49 | 49 | 49 | 52 | TLE | |
p03142 | Python | Time Limit Exceeded | n, m = map(int, input().split())
g = [[] for _ in range(n)]
inv = [0] * n
for _ in range(n - 1 + m):
a, b = map(int, input().split())
g[a - 1].append(b - 1)
inv[b - 1] += 1
for i in range(n):
if inv[i] == 0:
root = i
break
d = [0] * n
s = [root]
while s:
p = s.pop()
for node in g... | n, m = map(int, input().split())
g = [[] for _ in range(n)]
inv = [0] * n
for _ in range(n - 1 + m):
a, b = map(int, input().split())
g[a - 1].append(b - 1)
inv[b - 1] += 1
for i in range(n):
if inv[i] == 0:
root = i
break
d = [0] * n
s = [root]
while s:
p = s.pop()
for node in g... | replace | 16 | 18 | 16 | 20 | TLE | |
p03142 | C++ | Runtime Error | #include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
#define MOD 1000000007
#define REP(i, n) for (int(i) = 0;... | #include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
#define MOD 1000000007
#define REP(i, n) for (int(i) = 0;... | replace | 309 | 310 | 309 | 310 | 0 | |
p03142 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define sz(x) int(x.size())
typedef long long ll;
typedef long double ld;
typedef pair<int, int> P;
int main() {
int n, m;
cin >> n >> m;
vector<vector<int>> g(n);
vector<int> deg(n, 0);
rep(i, n + m - 1) {
int ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define sz(x) int(x.size())
typedef long long ll;
typedef long double ld;
typedef pair<int, int> P;
int main() {
int n, m;
cin >> n >> m;
vector<vector<int>> g(n);
vector<int> deg(n, 0);
rep(i, n + m - 1) {
int ... | replace | 33 | 35 | 33 | 38 | TLE | |
p03142 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define Rep(i, a, b) for (int i = a; i < b; i++)
#define REP(i, a, b) for (int i = a; i <= b; i++)
#define rev(i, n) for (int i = n - 1; i >= 0; i--)
#define vi vector<int>
#define pb push_back
#define pi pair<int, int>
#define ... | #include <bits/stdc++.h>
#define ll long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define Rep(i, a, b) for (int i = a; i < b; i++)
#define REP(i, a, b) for (int i = a; i <= b; i++)
#define rev(i, n) for (int i = n - 1; i >= 0; i--)
#define vi vector<int>
#define pb push_back
#define pi pair<int, int>
#define ... | replace | 21 | 23 | 21 | 23 | 0 | |
p03142 | C++ | Time Limit Exceeded | // #include <bits/stdc++.h>
#include <algorithm>
#include <iostream>
#include <array>
#include <bitset>
#include <complex>
#include <cstring>
#include <deque>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include... | // #include <bits/stdc++.h>
#include <algorithm>
#include <iostream>
#include <array>
#include <bitset>
#include <complex>
#include <cstring>
#include <deque>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include... | replace | 217 | 218 | 217 | 218 | TLE | |
p03142 | C++ | Time Limit Exceeded | #include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <vector>
using namespace ::std;
// vector<int> find_reachable_child(int parent, vector<int> kodomo,
// vector<vector<int> > &reachable)
// {
// for(int i(0); i < kodomo[parent].s... | #include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <vector>
using namespace ::std;
// vector<int> find_reachable_child(int parent, vector<int> kodomo,
// vector<vector<int> > &reachable)
// {
// for(int i(0); i < kodomo[parent].s... | replace | 81 | 83 | 81 | 86 | TLE | |
p03142 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int INF = 2e9 + 10;
#define fi first
#define se second
#define pb push_back
#define mp make_pair
int read() {
int xx = 0, ww = 1;
char ch = getchar();
while (ch > '9' || ch < '0') {
if (ch == '-')
ww ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int INF = 2e9 + 10;
#define fi first
#define se second
#define pb push_back
#define mp make_pair
int read() {
int xx = 0, ww = 1;
char ch = getchar();
while (ch > '9' || ch < '0') {
if (ch == '-')
ww ... | replace | 26 | 29 | 26 | 29 | 0 | |
p03142 | C++ | Time Limit Exceeded | #include "bits/stdc++.h"
using namespace std;
#define Rep(b, e, i) for (ll i = b; i <= e; i++)
#define Repr(e, b, i) for (ll i = e; i >= b; i--)
#define rep(n, i) Rep(0, n - 1, i)
#define repr(n, i) Repr(n - 1, 0, i)
#define all(v) (v).begin(), (v).end()
#define pb(v) push_back(v)
#define uniq(v) (v).erase(unique(all... | #include "bits/stdc++.h"
using namespace std;
#define Rep(b, e, i) for (ll i = b; i <= e; i++)
#define Repr(e, b, i) for (ll i = e; i >= b; i--)
#define rep(n, i) Rep(0, n - 1, i)
#define repr(n, i) Repr(n - 1, 0, i)
#define all(v) (v).begin(), (v).end()
#define pb(v) push_back(v)
#define uniq(v) (v).erase(unique(all... | replace | 81 | 83 | 81 | 86 | TLE | |
p03143 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (n); i++)
class UnionFind {
private:
vector<int> p, s, w;
vector<vector<int>> h;
public:
UnionFind(const vector<int> &v)
: p(v.size(), -1), s(v.size(), 1), w(v.begin(), v.end()) {}
void wrap() { h.p... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (n); i++)
class UnionFind {
private:
vector<int> p, s, w;
vector<vector<int>> h;
public:
UnionFind(const vector<int> &v)
: p(v.size(), -1), s(v.size(), 1), w(v.begin(), v.end()) {}
void wrap() { h.p... | insert | 95 | 95 | 95 | 99 | 0 | |
p03143 | C++ | Runtime Error | #include <bits/stdc++.h>
using i64 = long long;
template <class T = int> class UF {
T *par;
public:
UF(T n) : par(new T[n]) {
for (T i = 0; i < n; i++) {
par[i] = i;
}
}
~UF() { delete[] par; }
T root(T x) {
if (par[x] == x)
return x;
return par[x] = root(par[x]);
}
bool sa... | #include <bits/stdc++.h>
using i64 = long long;
template <class T = int> class UF {
T *par;
public:
UF(T n) : par(new T[n]) {
for (T i = 0; i < n; i++) {
par[i] = i;
}
}
~UF() { delete[] par; }
T root(T x) {
if (par[x] == x)
return x;
return par[x] = root(par[x]);
}
bool sa... | replace | 80 | 81 | 80 | 81 | 0 | |
p03143 | C++ | Runtime Error | #include <algorithm>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <s... | #include <algorithm>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <s... | insert | 123 | 123 | 123 | 128 | 0 | |
p03143 | C++ | Runtime Error |
#include "bits/stdc++.h"
#define YES "YES"
#define NO "NO"
#define YESNO OUT(three(solve(), YES, NO))
#define ECHO OUT(solve())
#define three(A, B, C) ((A) ? (B) : (C))
#define FOR(i, a, b) for (LL i = (a); i < (LL)(b); i++)
#define EFOR(i, a, b) for (LL i = (a); i <= (LL)(b); i++)
#define RFOR(i, a, b) for (LL i = (b... |
#include "bits/stdc++.h"
#define YES "YES"
#define NO "NO"
#define YESNO OUT(three(solve(), YES, NO))
#define ECHO OUT(solve())
#define three(A, B, C) ((A) ? (B) : (C))
#define FOR(i, a, b) for (LL i = (a); i < (LL)(b); i++)
#define EFOR(i, a, b) for (LL i = (a); i <= (LL)(b); i++)
#define RFOR(i, a, b) for (LL i = (b... | replace | 113 | 114 | 113 | 114 | 0 | |
p03143 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long // aaaaaaaaaaaaaaaaaa
#define rep(i, a, n) for (int i = a; i < n; i++)
#define per(i, a, n) for (int i = n - 1; i >= a; i--)
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define allr(x) (x).rbegin(), (x).rend()
#defin... | #include <bits/stdc++.h>
using namespace std;
#define int long long // aaaaaaaaaaaaaaaaaa
#define rep(i, a, n) for (int i = a; i < n; i++)
#define per(i, a, n) for (int i = n - 1; i >= a; i--)
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define allr(x) (x).rbegin(), (x).rend()
#defin... | replace | 118 | 119 | 118 | 119 | 0 | |
p03143 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <... | insert | 55 | 55 | 55 | 59 | 0 | |
p03143 | C++ | Runtime Error | #include <algorithm>
#include <cassert>
#include <cmath>
#include <iostream>
#include <map>
#include <random>
#include <set>
#include <time.h>
#include <unordered_map>
#include <vector>
#define hash akasd
#define prev aaaasds
#define rank asdfdsf
using namespace std;
typedef long long ll;
typedef long double dbl;
t... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <iostream>
#include <map>
#include <random>
#include <set>
#include <time.h>
#include <unordered_map>
#include <vector>
#define hash akasd
#define prev aaaasds
#define rank asdfdsf
using namespace std;
typedef long long ll;
typedef long double dbl;
t... | replace | 68 | 69 | 68 | 69 | -6 | terminate called after throwing an instance of 'std::bad_alloc'
what(): std::bad_alloc
|
p03143 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define rep(i, n) for (int i = 0; i < (n); i++)
#define reps(i, n) for (int i = 1; i <= (n); i++)
#define all(x) (x).begin(), (x).end()
#define uniq(x) (x).erase(unique(all(x)), (x).end())
#define bit(n) (1LL << (n))
#define... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define rep(i, n) for (int i = 0; i < (n); i++)
#define reps(i, n) for (int i = 1; i <= (n); i++)
#define all(x) (x).begin(), (x).end()
#define uniq(x) (x).erase(unique(all(x)), (x).end())
#define bit(n) (1LL << (n))
#define... | insert | 116 | 116 | 116 | 120 | 0 | |
p03143 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <map>
#include <queue>
#include <set>
#include <vector>
#define MAXN 100005
#define INF 0x3f3f3f3f
#define rint register int
#define LL long long
#define LD long double
using namespace std;
int n, m, cnt, ans, head[MAXN], f[MAXN], b[MA... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <map>
#include <queue>
#include <set>
#include <vector>
#define MAXN 100005
#define INF 0x3f3f3f3f
#define rint register int
#define LL long long
#define LD long double
using namespace std;
int n, m, cnt, ans, head[MAXN], f[MAXN], b[MA... | replace | 30 | 31 | 30 | 31 | 0 | |
p03143 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cassert>
#include <functional>
#include <iostream>
#include <numeric>
#include <tuple>
#include <vector>
int main() {
std::ios_base::sync_with_stdio(false);
std::cin.tie(nullptr);
int n, m;
std::cin >> n >> m;
std::vector<int> x(n);
for (int i = 0; i < n; ++i)
std::cin >>... | #include <algorithm>
#include <cassert>
#include <functional>
#include <iostream>
#include <numeric>
#include <tuple>
#include <vector>
int main() {
std::ios_base::sync_with_stdio(false);
std::cin.tie(nullptr);
int n, m;
std::cin >> n >> m;
std::vector<int> x(n);
for (int i = 0; i < n; ++i)
std::cin >>... | insert | 59 | 59 | 59 | 60 | TLE |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.