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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
p02888 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
const ll LINF = 1e18;
const int MOD = 1e9 + 7;
#define REP(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define REPR(i, n) for (int(i) = (n - 1); (i) >= 0; i--)
#define FOR(i, m, n) for (int(i) = (m); (i) < (n); i++)
#define FORR(i, ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 1e9;
const ll LINF = 1e18;
const int MOD = 1e9 + 7;
#define REP(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define REPR(i, n) for (int(i) = (n - 1); (i) >= 0; i--)
#define FOR(i, m, n) for (int(i) = (m); (i) < (n); i++)
#define FORR(i, ... | insert | 24 | 24 | 24 | 25 | TLE | |
p02888 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
int counter = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < n - 2; i++) {
for (int j = i + 1; j < n - 1; j++) {
for (int k = j + 1; k < n; k++) {
if (a[i] + a[j] > a[k] && a[j]... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
int counter = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a, a + n);
// int o,p,mid;
int i = 0;
int j = 1;
int k;
while (i < n - 2) {
k = j + 1;
while (k < n && a[i] + a[j] > a[k]) {
... | replace | 10 | 16 | 10 | 25 | TLE | |
p02888 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
#define out(a) cout << a << " "
int main() {
int N, cnt = 0;
cin >> N;
vector<int> ls(N);
rep(i, N) cin >> ls[i];
for (int i = 0; i < N; i++)
for (int j = i + 1; j < N; j++)
for (int ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
#define out(a) cout << a << " "
int main() {
int N, cnt = 0;
cin >> N;
vector<int> ls(N);
rep(i, N) cin >> ls[i];
sort(ls.begin(), ls.end());
for (int i = 0; i < N; i++)
for (int j = i + ... | insert | 11 | 11 | 11 | 12 | TLE | |
p02888 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[1000];
for (int i = 0; i < n; i++)
cin >> a[i];
sort(a, a + n);
int s = 0;
for (int i = 0; i < n - 1; i++) {
for (int j = i + 1; j < n - 1; j++) {
int x = lower_bound(a, a + n, a[i] + a[j]) - a - j - 1;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[2000];
for (int i = 0; i < n; i++)
cin >> a[i];
sort(a, a + n);
int s = 0;
for (int i = 0; i < n - 1; i++) {
for (int j = i + 1; j < n - 1; j++) {
int x = lower_bound(a, a + n, a[i] + a[j]) - a - j - 1;
... | replace | 6 | 7 | 6 | 7 | 0 | |
p02888 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
int a[1000 + 5];
int binary(int l, int r, int x) {
int ans = l - 1;
while (l <= r) {
int mid = (l + r) >> 1;
if (a[mid] < x) {
ans = mid, l = mid + 1;
} else
r = mid - 1;
}
return ans;
}
int main() {
int n;
cin >> n;
for (int i = 1; ... | #include "bits/stdc++.h"
using namespace std;
int a[2000 + 5];
int binary(int l, int r, int x) {
int ans = l - 1;
while (l <= r) {
int mid = (l + r) >> 1;
if (a[mid] < x) {
ans = mid, l = mid + 1;
} else
r = mid - 1;
}
return ans;
}
int main() {
int n;
cin >> n;
for (int i = 1; ... | replace | 3 | 4 | 3 | 4 | 0 | |
p02888 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, ans = 0;
cin >> n;
vector<int> l(n);
for (int i = 0; i < n; i++) {
cin >> l[i];
}
for (int i = 0; i < n - 2; i++) {
for (int j = i + 1; j < n - 1; j++) {
for (int k = j + 1; k < n; k++) {
if (l[i] < l[j] + l[k] && l[j] <... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, ans = 0;
cin >> n;
vector<int> l(n);
for (int i = 0; i < n; i++) {
cin >> l[i];
}
sort(l.begin(), l.end());
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < n; j++) {
int k = lower_bound(l.begin(), l.end(), l[i] + l[j]) -... | replace | 9 | 16 | 9 | 14 | TLE | |
p02888 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; ++i)
cin >> a[i];
int ans = 0;
sort(a, a + n);
for (int i = 0; i < n; ++i) {
for (int j = i + 1; j < n; ++j) {
for (int k = j + 1; k < n; ++k) {
int len = a[i]... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; ++i)
cin >> a[i];
int ans = 0;
sort(a, a + n);
for (int i = 0; i < n; ++i) {
for (int j = i + 1; j < n; ++j) {
for (int k = j + 1; k < n; ++k) {
if (a[k] < a[i... | replace | 14 | 18 | 14 | 15 | TLE | |
p02888 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define all(a) a.begin(), a.end()
#define F first
#define S second
#define pb push_back
#define ll long long
#define ld long double
#define mkp make_pair
#define sz(x) (int)x.size()
#define pi pair<long long, long lon... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define all(a) a.begin(), a.end()
#define F first
#define S second
#define pb push_back
#define ll long long
#define ld long double
#define mkp make_pair
#define sz(x) (int)x.size()
#define pi pair<long long, long lon... | replace | 51 | 52 | 51 | 52 | 0 | |
p02888 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(N);
for (int i = 0; i < N; i++)
cin >> A[i];
long long ans = 0;
for (int i = 0; i < N; i++)
for (int j = i + 1; j < N; j++)
for (int k = j + 1; k < N; k++)
if (A[i] + A[j] > A[k] && A[i] + A[k] > ... | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstdio>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
... | replace | 0 | 1 | 0 | 34 | TLE | |
p02888 | 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 pair<int, int> P;
int main() {
int n;
cin >> n;
vector<int> l(n);
rep(i, n) cin >> l[i];
sort(l.begin(), l.end());
int res = 0;
for (int i = 0; i < n; i)... | #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 pair<int, int> P;
int main() {
int n;
cin >> n;
vector<int> l(n);
rep(i, n) cin >> l[i];
sort(l.begin(), l.end());
int res = 0;
for (int i = 0; i < n; i+... | replace | 14 | 16 | 14 | 16 | TLE | |
p02888 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < n; i++)
const ll INF = 1LL << 60;
signed main() {
ll n;
cin >> n;
... | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < n; i++)
const ll INF = 1LL << 60;
signed main() {
ll n;
cin >> n;
... | replace | 26 | 27 | 26 | 27 | TLE | |
p02888 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int d[N];
vector<int> L;
for (int i = 0; i < N; i++) {
cin >> d[i];
L.push_back(d[i]);
}
sort(L.begin(), L.end());
long long int ans = 0;
for (vector<int>::iterator e = L.end(); e - 1 != L.begin(); e--) {
for (vect... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int d[N];
vector<int> L;
for (int i = 0; i < N; i++) {
cin >> d[i];
L.push_back(d[i]);
}
sort(L.begin(), L.end());
long long int ans = 0;
for (vector<int>::iterator e = L.end() - 1; e - 1 != L.begin(); e--) {
for (... | replace | 13 | 15 | 13 | 15 | -11 | |
p02888 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define eb(t) emplace_back(t)
typedef long long ll;
typedef long long unsigned int llu;
ll MOD = 1000000007;
ll INF = 1000000009;
ll l[1010];
void solve() {
ll n;
cin >> n;
rep(i, n) { cin >> l[i]; }
l[n] = 2000;
sor... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define eb(t) emplace_back(t)
typedef long long ll;
typedef long long unsigned int llu;
ll MOD = 1000000007;
ll INF = 1000000009;
ll l[2010];
void solve() {
ll n;
cin >> n;
rep(i, n) { cin >> l[i]; }
l[n] = 2000;
sor... | replace | 9 | 10 | 9 | 10 | 0 | |
p02888 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define pie 3.141592653589793238462643383279
#define int long long
#define mod 1000000007
#define INF LLONG_MAX / 5
#define all(v) v.begin(), v.end()
#define P pair<int, int>
#define S second
#define F first
#define f(i, n) for (int i = 0; i < n; i++)
int x[1000];
signed ma... | #include <bits/stdc++.h>
using namespace std;
#define pie 3.141592653589793238462643383279
#define int long long
#define mod 1000000007
#define INF LLONG_MAX / 5
#define all(v) v.begin(), v.end()
#define P pair<int, int>
#define S second
#define F first
#define f(i, n) for (int i = 0; i < n; i++)
int x[2000];
signed ma... | replace | 11 | 12 | 11 | 12 | 0 | |
p02888 | C++ | Runtime Error | #include <algorithm>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <time.h>
#include <vector>
using namespace std;
#define rep(i, a, n) fo... | #include <algorithm>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <time.h>
#include <vector>
using namespace std;
#define rep(i, a, n) fo... | replace | 125 | 126 | 125 | 126 | 0 | |
p02888 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int l[1111];
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++)
cin >> l[i];
sort(l, l + n);
int r = 0;
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < n; j++) {
int p = lower_bound(l, l + n, l[i] + l[j]) - l;
r += max(0, p - ... | #include <bits/stdc++.h>
using namespace std;
int l[2222];
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++)
cin >> l[i];
sort(l, l + n);
int r = 0;
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < n; j++) {
int p = lower_bound(l, l + n, l[i] + l[j]) - l;
r += max(0, p - ... | replace | 4 | 5 | 4 | 5 | 0 | |
p02888 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int n;
vector<int> l;
bool isok(int a, int b, int c) {
if (l[a] + l[b] > l[c])
return true;
else
return false;
}
int nibutan(int a, int b) {
int ok = b, ng = n;
while (ng - ok > 1)... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int n;
vector<int> l;
bool isok(int a, int b, int c) {
if (l[a] + l[b] > l[c])
return true;
else
return false;
}
int nibutan(int a, int b) {
int ok = b, ng = n;
while (ng - ok > 1)... | insert | 30 | 30 | 30 | 31 | -11 | |
p02888 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, count = 0;
cin >> n;
vector<int> l(n);
for (int i = 0; i < n; i++) {
cin >> l[i];
}
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < n; j++) {
for (int k ... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, count = 0;
cin >> n;
vector<int> l(n);
for (int i = 0; i < n; i++) {
cin >> l[i];
}
sort(l.begin(), l.end());
for (int i = 0; i < n; i++) {
for (int j = i + 1; j <... | insert | 13 | 13 | 13 | 14 | TLE | |
p02888 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define REP(type, i, a, b) for (type i = a; i < b; i++)
typedef long long ll;
using namespace std;
int main(void) {
ll N, ans;
scanf("%lld", &N);
vector<ll> L(N);
REP(int, i, 0, N) scanf("%lld", &L.at(i));
// sort(L.begin(),L.end());
ans = 0;
REP(int, i, 0, N - 2) {
REP(int... | #include <bits/stdc++.h>
#define REP(type, i, a, b) for (type i = a; i < b; i++)
typedef long long ll;
using namespace std;
int main(void) {
ll N, ans;
scanf("%lld", &N);
vector<ll> L(N);
REP(int, i, 0, N) scanf("%lld", &L.at(i));
sort(L.begin(), L.end());
ans = 0;
REP(int, i, 0, N - 2) {
REP(int, ... | replace | 12 | 13 | 12 | 13 | TLE | |
p02888 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, l[3000];
int cnt = 0;
int i, j, k;
cin >> n;
for (i = 0; i < n; i++)
... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, l[3000];
int cnt = 0;
int i, j, k;
cin >> n;
for (i = 0; i < n; i++)
... | replace | 23 | 24 | 23 | 24 | TLE | |
p02888 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, N) for (int i = 0; i < (int)N; i++)
using namespace std;
int main() {
int64_t N, b, e, m, count = 0;
vector<int64_t> L(1024);
cin >> N;
rep(i, N) { cin >> L.at(i); }
sort(L.begin(), L.end(), greater<int>());
rep(i, N - 2) {
for (int64_t j = i + 1; j < N - 1; j++) ... | #include <bits/stdc++.h>
#define rep(i, N) for (int i = 0; i < (int)N; i++)
using namespace std;
int main() {
int64_t N, b, e, m, count = 0;
vector<int64_t> L(pow(2, 16));
cin >> N;
rep(i, N) { cin >> L.at(i); }
sort(L.begin(), L.end(), greater<int>());
rep(i, N - 2) {
for (int64_t j = i + 1; j < N - 1;... | replace | 5 | 6 | 5 | 6 | 0 | |
p02888 | C++ | Runtime Error | #pragma GCC optimize(3)
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/hash_policy.hpp>
#include <ext/pb_ds/priority_queue.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ex... | #pragma GCC optimize(3)
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/hash_policy.hpp>
#include <ext/pb_ds/priority_queue.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ex... | replace | 26 | 27 | 26 | 27 | 0 | |
p02888 | C++ | Runtime Error | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <vector>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
using namespace std;
#define rep(i, n) for (int i = 0, i##_len = (n); i ... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <vector>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
using namespace std;
#define rep(i, n) for (int i = 0, i##_len = (n); i ... | replace | 120 | 121 | 120 | 121 | 0 | |
p02888 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, sum = 0;
cin >> N;
vector<int> L(N);
for (int n = 0; n < N; n++) {
cin >> L.at(n);
}
sort(L.begin(), L.end());
for (int x = 0; x < N; x++) {
for (int y = x + 1; y < N; y++) {
for (int z = y + 1; z < N; z++) {
if (L.... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, sum = 0;
cin >> N;
vector<int> L(N);
for (int n = 0; n < N; n++) {
cin >> L.at(n);
}
sort(L.begin(), L.end());
for (int x = 0; x < N; x++) {
for (int y = x + 1; y < N; y++) {
for (int z = y + 1; z < N; z++) {
if (L.... | replace | 16 | 18 | 16 | 17 | TLE | |
p02888 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <string>
#include <vector>
#define rip(i, n) for (int i = 0; i < n; i++)
#define ll long long
#define lb long double
#define vec vector<int>
#define vec2 vector<vector<int>>
#define set setprecision
#define mod 10000000... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <string>
#include <vector>
#define rip(i, n) for (int i = 0; i < n; i++)
#define ll long long
#define lb long double
#define vec vector<int>
#define vec2 vector<vector<int>>
#define set setprecision
#define mod 10000000... | replace | 43 | 44 | 43 | 44 | TLE | |
p02888 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef tuple<ll, int, int> tlii;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
typedef vector<vector<ll>> vvl;
typedef vector<vector<int>> vvi;
#define rep(i, a, b) for (ll i = (a); i < (b); i++)
#define rrep(i, a, b) for (ll i = (a); i > (b)... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef tuple<ll, int, int> tlii;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
typedef vector<vector<ll>> vvl;
typedef vector<vector<int>> vvi;
#define rep(i, a, b) for (ll i = (a); i < (b); i++)
#define rrep(i, a, b) for (ll i = (a); i > (b)... | replace | 71 | 77 | 71 | 84 | TLE | |
p02888 | C++ | Time Limit Exceeded | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n;
cin >> n;
vector<int> L(n);
REP(i, n) cin >> L[i];
// int n = 2000;
// vector<int> L(n);
// random_device rnd;
// REP(i,n)L[i] = rnd() % 100;
sort(L.begin(), ... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n;
cin >> n;
vector<int> L(n);
REP(i, n) cin >> L[i];
// int n = 2000;
// vector<int> L(n);
// random_device rnd;
// REP(i,n)L[i] = rnd() % 100;
sort(L.begin(), L.end());
int ans = 0... | delete | 0 | 1 | 0 | 0 | TLE | |
p02888 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
#define all(x) (x).beg... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
#define all(x) (x).beg... | replace | 53 | 57 | 53 | 55 | TLE | |
p02888 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)x.size()
#define pb push_back
#define fi first
#define se second
#define mp make_pair
#define debug(x) cerr << " - " << #x << ": " << x << endl;
#define debugs(x, y) ... | #include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)x.size()
#define pb push_back
#define fi first
#define se second
#define mp make_pair
#define debug(x) cerr << " - " << #x << ": " << x << endl;
#define debugs(x, y) ... | replace | 24 | 25 | 24 | 25 | 0 | |
p02888 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
using namespace std;
int v[1004];
int caut_bin(int st, int fin, int sum) {
int p = st;
while (st <= fin) {
int mij = (st + fin) / 2;
if (v[mij] >= sum) {
fin = mij - 1;
} else {
st = mij + 1;
}
}
return st - p;
}
int main() {
int n;
cin ... | #include <algorithm>
#include <iostream>
using namespace std;
int v[2004];
int caut_bin(int st, int fin, int sum) {
int p = st;
while (st <= fin) {
int mij = (st + fin) / 2;
if (v[mij] >= sum) {
fin = mij - 1;
} else {
st = mij + 1;
}
}
return st - p;
}
int main() {
int n;
cin ... | replace | 3 | 4 | 3 | 4 | 0 | |
p02888 | C++ | Time Limit Exceeded | /**
* author: yuya1234
* created: 17.07.2020 09:17:47
**/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
long double eps = 1.0E-14;
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REPD(i, n) for (ll i = n - 1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = a; i <= (ll)(b); i+... | /**
* author: yuya1234
* created: 17.07.2020 09:17:47
**/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
long double eps = 1.0E-14;
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REPD(i, n) for (ll i = n - 1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = a; i <= (ll)(b); i+... | replace | 55 | 58 | 55 | 66 | TLE | |
p02888 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
using namespace std;
long long l[2010], cnt[1010][2010] = {}, ans = 0;
int main() {
int i, j, n;
cin >> n;
for (i = 0; i < n; i++) {
cin >> l[i];
}
sort(l, l + n);
for (i = 1; i <= n; i++) {
for (j = 0; j <= 1000; j++) {
cnt[i][j] = cnt[i - 1][j];
}... | #include <algorithm>
#include <iostream>
using namespace std;
long long l[2010], cnt[2010][2010] = {}, ans = 0;
int main() {
int i, j, n;
cin >> n;
for (i = 0; i < n; i++) {
cin >> l[i];
}
sort(l, l + n);
for (i = 1; i <= n; i++) {
for (j = 0; j <= 1000; j++) {
cnt[i][j] = cnt[i - 1][j];
}... | replace | 3 | 4 | 3 | 4 | 0 | |
p02888 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
typedef long long ll;
const ll INF = 1e9 + 7;
templat... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
typedef long long ll;
const ll INF = 1e9 + 7;
templat... | insert | 42 | 42 | 42 | 43 | TLE | |
p02888 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
bool flag(int a, int b, int c) {
return ((a < b + c) && (b < a + c) && (c < b + a));
}
int main() {
ios_base ::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
int v[n];
for (int i = 0; i < n; ++i) {
cin >> v[i];
}
int count = 0;
for (int i ... | #include <bits/stdc++.h>
using namespace std;
bool flag(int a, int b, int c) {
return ((a < b + c) && (b < a + c) && (c < b + a));
}
int main() {
ios_base ::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
int v[n];
for (int i = 0; i < n; ++i) {
cin >> v[i];
}
sort(v, v + n);
int count ... | insert | 16 | 16 | 16 | 17 | TLE | |
p02888 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#include <numeric>
#include <vector>
#define PI 3.14159265358979323846
#define MAXINF (1e18L)
#define INF (1e9L)
#define EPS (1e-9)
#define MOD ((ll)(1e9 + 7))
#define REP(i, n) for (int i = 0; i < int(n); ++i)
#define Rep(i, sta, n) for (int i = sta; i < n; i++)
#define RREP(i, n) for (int i =... | #include <bits/stdc++.h>
#include <numeric>
#include <vector>
#define PI 3.14159265358979323846
#define MAXINF (1e18L)
#define INF (1e9L)
#define EPS (1e-9)
#define MOD ((ll)(1e9 + 7))
#define REP(i, n) for (int i = 0; i < int(n); ++i)
#define Rep(i, sta, n) for (int i = sta; i < n; i++)
#define RREP(i, n) for (int i =... | replace | 63 | 69 | 63 | 79 | TLE | |
p02888 | C++ | Time Limit Exceeded | //
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vl = vector<ll>;
using vvl = vector<vl>;
using vi = vector<int>;
using vvi = vector<vi>;
#define ote(x) cout << (x) << endl
#define all(x) (x).begin(), (x).end()
#define rp(i, s, e) for (int i = (s); i < (e); ++i)
using PII = pair<int, int>;
v... | //
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vl = vector<ll>;
using vvl = vector<vl>;
using vi = vector<int>;
using vvi = vector<vi>;
#define ote(x) cout << (x) << endl
#define all(x) (x).begin(), (x).end()
#define rp(i, s, e) for (int i = (s); i < (e); ++i)
using PII = pair<int, int>;
v... | replace | 26 | 28 | 26 | 31 | TLE | |
p02888 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
void go();
int main() {
#ifdef tokitsukaze
freopen("TEST.txt", "r", stdin);
#endif
go();
return 0;
}
/********************************* head *********************************/
int n, a[10];
int cmp(int a, int b) { return a > b; }
LL ans;
void... | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
void go();
int main() {
#ifdef tokitsukaze
freopen("TEST.txt", "r", stdin);
#endif
go();
return 0;
}
/********************************* head *********************************/
int n, a[100100];
int cmp(int a, int b) { return a > b; }
LL ans;
... | replace | 14 | 15 | 14 | 15 | 0 | |
p02888 | C++ | Runtime Error | #include <algorithm>
#include <cctype>
#include <cstdio>
#include <iostream>
#include <map>
#include <math.h>
#include <set>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using i8 = int8_t;
using u8 = uint8_t;
using i16 = int16_t;
using u16 = uint16_t;
using i32 = int32_t;
using u32 = uint32_t... | #include <algorithm>
#include <cctype>
#include <cstdio>
#include <iostream>
#include <map>
#include <math.h>
#include <set>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using i8 = int8_t;
using u8 = uint8_t;
using i16 = int16_t;
using u16 = uint16_t;
using i32 = int32_t;
using u32 = uint32_t... | replace | 66 | 67 | 66 | 68 | -11 | |
p02888 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> l(n);
vector<int> a(1001);
for (int i = 0; i < n; i++) {
cin >> l.at(i);
a.at(l.at(i))++;
}
int64_t ans = 0;
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < n; j++) {
if (i != j) {
fo... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> l(n);
vector<int> a(1001);
for (int i = 0; i < n; i++) {
cin >> l.at(i);
a.at(l.at(i))++;
}
int64_t ans = 0;
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < n; j++) {
if (i != j) {
fo... | replace | 16 | 18 | 16 | 19 | TLE | |
p02888 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef pair<int, int> P;
int n, l[2020];
int main() {
cin >> n;
rep(i, n) cin >> l[i];
sort(l, l + n);
int sum = 0;
for (int i = 0; i < n - 1; i++) {
for (int j = i + 1; j < n; j++) {
int a = min(l[... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef pair<int, int> P;
int n, l[2020];
int main() {
cin >> n;
rep(i, n) cin >> l[i];
sort(l, l + n);
int sum = 0;
for (int i = 0; i < n - 1; i++) {
for (int j = i + 1; j < n; j++) {
int a = min(l[... | replace | 18 | 19 | 18 | 19 | TLE | |
p02888 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REPD(i, n) for (ll i = n - 1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = a; i <= (ll)(b); i++)
#define FORD(i, a, b) for (ll i = a; i >= (l... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REPD(i, n) for (ll i = n - 1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = a; i <= (ll)(b); i++)
#define FORD(i, a, b) for (ll i = a; i >= (l... | replace | 25 | 31 | 25 | 30 | TLE | |
p02888 | C++ | Time Limit Exceeded | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define mfill(x, y) memset(x, y, sizeof(x))
#define all(v) v.begin(), v.end()
#define in(x, y, h, w) if (0 <= x && x < h && 0 <= y && y < w)
#define y0 y12345
#define y1 y54321
#ifdef LOCAL
#define debug(... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define mfill(x, y) memset(x, y, sizeof(x))
#define all(v) v.begin(), v.end()
#define in(x, y, h, w) if (0 <= x && x < h && 0 <= y && y < w)
#define y0 y12345
#define y1 y54321
#ifdef LOCAL
#define debug(...) fprintf(stderr, __... | delete | 0 | 1 | 0 | 0 | TLE | |
p02888 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main(void) {
int n;
int cnt = 0;
cin >> n;
vector<int> L(n, 0);
rep(i, n) cin >> L[i];
sort(L.begin(), L.end());
// rep(i, n) cout << L[i];
rep(i, n) {
rep(j, n) {
rep(k, n) {
if (i != j and... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main(void) {
int n;
int cnt = 0;
cin >> n;
vector<int> L(n, 0);
rep(i, n) cin >> L[i];
sort(L.begin(), L.end());
// rep(i, n) cout << L[i];
rep(i, n) {
rep(j, n) {
if (i != j) {
if (i < j) {... | replace | 13 | 16 | 13 | 16 | TLE | |
p02888 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <utility>
#include <vector>
typedef long long ll;
#define PB push_back
#define FOR(n) for (int i = 0; i < n; ++i)
#define RFOR(n) for (int i = n; i >= 0; --i)
#define FORR(start, end) for (int i = start; i < end; ++i)
#define COUT(n) cout << n << " " << flush
#define vi... | #include <algorithm>
#include <iostream>
#include <utility>
#include <vector>
typedef long long ll;
#define PB push_back
#define FOR(n) for (int i = 0; i < n; ++i)
#define RFOR(n) for (int i = n; i >= 0; --i)
#define FORR(start, end) for (int i = start; i < end; ++i)
#define COUT(n) cout << n << " " << flush
#define vi... | replace | 18 | 19 | 18 | 19 | 0 | |
p02888 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <queue>
#include <stdio.h>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
vector<int> L(N);
for (int... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <queue>
#include <stdio.h>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
vector<int> L(N);
for (int... | replace | 49 | 51 | 49 | 51 | TLE | |
p02888 | C++ | Time Limit Exceeded | #include <algorithm>
#include <array>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <memory>
#include <numeric>
#include <queue>
#include <random>
#include <stack>
#include <string>
#include... | #include <algorithm>
#include <array>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <memory>
#include <numeric>
#include <queue>
#include <random>
#include <stack>
#include <string>
#include... | replace | 30 | 32 | 30 | 32 | TLE | |
p02888 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = unsigned long long;
int main() {
int N;
cin >> N;
int L[1001];
for (int i = 0; i < N; ++i)
cin >> L[i];
sort(L, L + N);
int ans = 0;
for (int i = 0; i < N - 2; ++i) {
for (int j = i + 1; j < N - 1; ++j) {
for (int k = j + 1; k < N; ... | #include <bits/stdc++.h>
using namespace std;
using ll = unsigned long long;
int main() {
int N;
cin >> N;
int L[2001];
for (int i = 0; i < N; ++i)
cin >> L[i];
sort(L, L + N);
int ans = 0;
for (int i = 0; i < N - 2; ++i) {
for (int j = i + 1; j < N - 1; ++j) {
for (int k = j + 1; k < N; ... | replace | 7 | 8 | 7 | 8 | 0 | |
p02888 | C++ | Runtime Error | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <chrono>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#inclu... | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <chrono>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#inclu... | replace | 71 | 72 | 71 | 72 | -6 | Fatal glibc error: malloc assertion failure in sysmalloc: (old_top == initial_top (av) && old_size == 0) || ((unsigned long) (old_size) >= MINSIZE && prev_inuse (old_top) && ((unsigned long) old_end & (pagesize - 1)) == 0)
|
p02888 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, R = 0, flg = 0;
cin >> N;
vector<int> L(N);
for (int i = 0; i < N; i++) {
cin >> L.at(i);
}
sort(L.begin(), L.end());
for (int i = 0; i < N - 2; i++) {
for (int j = i + 1; j < N - 1; j++) {
flg = 0;
for (int k = j + 1;... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, R = 0, flg = 0;
cin >> N;
vector<int> L(N);
for (int i = 0; i < N; i++) {
cin >> L.at(i);
}
sort(L.begin(), L.end());
for (int i = 0; i < N - 2; i++) {
for (int j = i + 1; j < N - 1; j++) {
flg = 0;
for (int k = j + 1;... | replace | 21 | 23 | 21 | 25 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): vector::_M_range_check: __n (which is 4) >= this->size() (which is 4)
|
p02888 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define ROOP(i, N) for (int i = 0; i++; i < N)
#define RVROOP(i, N) for (int i = N; i--; i >= 0)
#define INF 1e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
vector<int> L(N);
for (int i = 0; i < N; i++) {
cin >> L.at(i... | #include <bits/stdc++.h>
#define ROOP(i, N) for (int i = 0; i++; i < N)
#define RVROOP(i, N) for (int i = N; i--; i >= 0)
#define INF 1e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
vector<int> L(N);
for (int i = 0; i < N; i++) {
cin >> L.at(i... | replace | 21 | 28 | 21 | 32 | TLE | |
p02888 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using P = pair<int, int>;
using PL = pair<ll, ll>;
using vp = vector<P>;
using vpl = vector<PL>;
template <typename T> constexpr auto inf = numeric_limits<T>... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using P = pair<int, int>;
using PL = pair<ll, ll>;
using vp = vector<P>;
using vpl = vector<PL>;
template <typename T> constexpr auto inf = numeric_limits<T>... | replace | 103 | 104 | 103 | 104 | 0 | |
p02888 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> L(N);
for (int i = 0; i < N; i++) {
cin >> L[i];
}
int ans = 0;
for (int i = 0; i < N - 2; i++) {
for (int j = i + 1; j < N - 1; j++) {
for (int k = j + 1; k < N; k++) {
if (L[i] < L[j] + L[k] &&... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> L(N);
for (int i = 0; i < N; i++) {
cin >> L[i];
}
int ans = 0;
for (int i = 0; i < N - 2; i++) {
for (int j = i + 1; j < N - 1; j++) {
for (int k = j + 1; k < N; k++) {
if (max({L[i], L[j], L[k]... | replace | 14 | 15 | 14 | 15 | TLE | |
p02888 | C++ | Time Limit Exceeded | #include <algorithm> /*sort()を使用するのに必要*/
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
vector<int> L;
cin >> N;
for (int i = 0; i < N; i++) {
int j;
cin >> j;
L.push_back(j);
}
// sort(L.begin(), L.end());
int count = 0;
for (int i = 0; i < N - 2; i++) {... | #include <algorithm> /*sort()を使用するのに必要*/
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
vector<int> L;
cin >> N;
for (int i = 0; i < N; i++) {
int j;
cin >> j;
L.push_back(j);
}
sort(L.begin(), L.end());
int count = 0;
for (int i = 0; i < N - 2; i++) {
... | replace | 17 | 18 | 17 | 18 | TLE | |
p02888 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
//----***やべーやつら***----
using namespace std;
#define int long long
//----***型定義***----
using ll = long long;
using pll = pair<ll, ll>;
using pdd = pair<double, double>;
typedef long double lb;
typedef vector<int, vector<int>> vvec;
typedef long double ld;
//----***Like a Pythonista***----
#def... | #include <bits/stdc++.h>
//----***やべーやつら***----
using namespace std;
#define int long long
//----***型定義***----
using ll = long long;
using pll = pair<ll, ll>;
using pdd = pair<double, double>;
typedef long double lb;
typedef vector<int, vector<int>> vvec;
typedef long double ld;
//----***Like a Pythonista***----
#def... | replace | 78 | 82 | 78 | 87 | TLE | |
p02888 | C++ | Runtime Error | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a), _b = (b); i <= _b; i++)
#define FORN(i, b, a) for (int i = (b); _a = (a); i >= _a; i--)
#define REP(i, n) for (int i = 0, _n = n; i < n; i++)
#define ll long long
#define pii pair<int, int>
#define re return
#define vi vector<int>
#define pb push_back
#def... | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a), _b = (b); i <= _b; i++)
#define FORN(i, b, a) for (int i = (b); _a = (a); i >= _a; i--)
#define REP(i, n) for (int i = 0, _n = n; i < n; i++)
#define ll long long
#define pii pair<int, int>
#define re return
#define vi vector<int>
#define pb push_back
#def... | replace | 40 | 41 | 40 | 41 | 0 | |
p02888 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
using namespace std;
const int L = 1000;
int main() {
ios::sync_with_stdio(false);
int n;
cin >> n;
int cnt[L + 1] = {0};
for (int i = 0; i < n; i++) {
int l;
cin >> l;
cnt[l]++;
}
int ps[L + 1];
for (int i = 0; i <= L; i++) {
ps[i] = i == 0 ... | #include <algorithm>
#include <iostream>
using namespace std;
const int L = 1000;
int main() {
ios::sync_with_stdio(false);
int n;
cin >> n;
int cnt[L + 1] = {0};
for (int i = 0; i < n; i++) {
int l;
cin >> l;
cnt[l]++;
}
int ps[L + 1];
for (int i = 0; i <= L; i++) {
ps[i] = i == 0 ... | replace | 30 | 31 | 30 | 31 | 0 | |
p02888 | C++ | Runtime Error | /* Author: Dhruv Rastogi */
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define int long long
#define all(sdk) sdk.begin(), sdk.end()
#define mll map<int, int>
#define pb push_back
#define rep(i, a, b) for (int i = a; i < b; ++i)
#define repd(i, a, b) for (int i = a; i >= b; --i)
#define mp make_... | /* Author: Dhruv Rastogi */
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define int long long
#define all(sdk) sdk.begin(), sdk.end()
#define mll map<int, int>
#define pb push_back
#define rep(i, a, b) for (int i = a; i < b; ++i)
#define repd(i, a, b) for (int i = a; i >= b; --i)
#define mp make_... | replace | 23 | 24 | 23 | 24 | 0 | |
p02888 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
// define
#define int long long
#define vint vector<int>
#define rep(x, y) for (int i = x; i < y; i++)
#define REP(x, y) for (int j = x; j < y; j++)
#define all(x) x.begin(), x.end()
#define pb() push_back()
#define mod 100000007
#define elif else if
#define str string
// m... | #include <bits/stdc++.h>
using namespace std;
// define
#define int long long
#define vint vector<int>
#define rep(x, y) for (int i = x; i < y; i++)
#define REP(x, y) for (int j = x; j < y; j++)
#define all(x) x.begin(), x.end()
#define pb() push_back()
#define mod 100000007
#define elif else if
#define str string
// m... | replace | 23 | 24 | 23 | 24 | TLE | |
p02888 | C++ | Time Limit Exceeded | #include <stdio.h>
#include <stdlib.h>
int ascSort(const void *v1, const void *v2);
int ascSort(const void *v1, const void *v2) {
const int _v1 = *((const int *)v1);
const int _v2 = *((const int *)v2);
if (_v1 > _v2) {
return 1;
} else if (_v1 < _v2) {
return -1;
} else {
return 0;
}
}
int m... | #include <stdio.h>
#include <stdlib.h>
int ascSort(const void *v1, const void *v2);
int ascSort(const void *v1, const void *v2) {
const int _v1 = *((const int *)v1);
const int _v2 = *((const int *)v2);
if (_v1 > _v2) {
return 1;
} else if (_v1 < _v2) {
return -1;
} else {
return 0;
}
}
int m... | replace | 32 | 33 | 32 | 33 | TLE | |
p02888 | C++ | Runtime Error | // #pragma GCC optimize("Ofast")
#pragma GCC optimize("O3")
#pragma GCC target("avx,avx2,fma")
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#i... | // #pragma GCC optimize("Ofast")
// #pragma GCC optimize("O3")
#pragma GCC target("avx,avx2,fma")
#include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>... | replace | 2 | 3 | 2 | 3 | 0 | |
p02889 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <queue>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<P, ll> Pl;
const ll INF = 1000000000000000;
const int MAX = 310;
vector<pair<ll, ll>> G[MAX]; // （行き先,cost）
priority_queue<P... | #include <algorithm>
#include <iostream>
#include <queue>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<P, ll> Pl;
const ll INF = 1000000000000000;
const int MAX = 310;
vector<pair<ll, ll>> G[MAX]; // （行き先,cost）
priority_queue<P... | insert | 26 | 26 | 26 | 28 | TLE | |
p02889 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define ll int
#define ld long double
#define pii pair<int, int>
#define pld pair<ld, ld>
#define all(v) v.begin(), v.end()
#define F first
#define S second
#define mod 1000000007
#define pb push_back
#define MP make_pair
#define mset(x) memset(x, 0, sizeof(x));
#define ios... | #include <bits/stdc++.h>
using namespace std;
#define ll int
#define ld long double
#define pii pair<int, int>
#define pld pair<ld, ld>
#define all(v) v.begin(), v.end()
#define F first
#define S second
#define mod 1000000007
#define pb push_back
#define MP make_pair
#define mset(x) memset(x, 0, sizeof(x));
#define ios... | insert | 49 | 49 | 49 | 51 | TLE | |
p02889 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <forward_list>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <utility>
#include <vector>
#define rep(i, s, g) for ((i) = (s); (i) < (g); ++(i))
using namespace std;
using ll = long long;
us... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <forward_list>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <utility>
#include <vector>
#define rep(i, s, g) for ((i) = (s); (i) < (g); ++(i))
using namespace std;
using ll = long long;
us... | replace | 23 | 24 | 23 | 24 | 0 | |
p02889 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (long long i = 0; i < n; i++)
#define repr(i, n, m) for (long long i = m; i < n; i++)
#define mod 1000000007
#define sorti(x) sort(x.begin(), x.end())
#define sortd(x) sort(x.begin(), x.end(), std::greater<long long>())
#define de... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (long long i = 0; i < n; i++)
#define repr(i, n, m) for (long long i = m; i < n; i++)
#define mod 1000000007
#define sorti(x) sort(x.begin(), x.end())
#define sortd(x) sort(x.begin(), x.end(), std::greater<long long>())
#define de... | replace | 71 | 72 | 71 | 72 | 0 | |
p02889 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <numeric>
#include <queue>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int N, L;
int ans[300][300];
void func(vector<vector<pair<int, int>>> &E, int start) {
vector<vector<int>> maxF(N, vector<int>... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <numeric>
#include <queue>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int N, L;
int ans[300][300];
void func(vector<vector<pair<int, int>>> &E, int start) {
vector<vector<int>> maxF(N, vector<int>... | replace | 48 | 49 | 48 | 49 | TLE | |
p02889 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
int ri() {
int n;
scanf("%d", &n);
return n;
}
int main() {
int n = ri();
int m = ri();
int l = ri();
std::vector<std::pair<int, int>> hen[n];
for (int i = 0; i < m; i++) {
int a = ri() - 1, b = ri() - 1, c = ri();
hen[a].push_back({b, c});
hen[b].push_back({a, c})... | #include <bits/stdc++.h>
int ri() {
int n;
scanf("%d", &n);
return n;
}
int main() {
int n = ri();
int m = ri();
int l = ri();
std::vector<std::pair<int, int>> hen[n];
for (int i = 0; i < m; i++) {
int a = ri() - 1, b = ri() - 1, c = ri();
hen[a].push_back({b, c});
hen[b].push_back({a, c})... | insert | 28 | 28 | 28 | 30 | TLE | |
p02889 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long
using namespace std;
const ll INF = 1e11;
ll n, m, l, q;
ll graph[311][311];
ll graph2[311][311];
ll st[300 * 300 / 2][2];
ll abc[300 * 300 / 2][3];
void input() {
cin >> n >> m >> l;
for (int i = 0; i < m; i++) {
cin >> abc[i][0] >> abc[i][1] >> abc[i][2];
}
... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
const ll INF = 1e11;
ll n, m, l, q;
ll graph[311][311];
ll graph2[311][311];
ll st[300 * 300 + 10][2];
ll abc[300 * 300 + 10][3];
void input() {
cin >> n >> m >> l;
for (int i = 0; i < m; i++) {
cin >> abc[i][0] >> abc[i][1] >> abc[i][2];
}... | replace | 9 | 11 | 9 | 11 | 0 | |
p02889 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> Pii;
#define pb push_back
#define mp make_pair
#define MOD 1000000007
#define INF 1e17
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define fs first
#define ss second
inline int Scan() {
int x = ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> Pii;
#define pb push_back
#define mp make_pair
#define MOD 1000000007
#define INF 1e17
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define fs first
#define ss second
inline int Scan() {
int x = ... | replace | 76 | 78 | 76 | 78 | TLE | |
p02889 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <uno... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <uno... | insert | 69 | 69 | 69 | 70 | TLE | |
p02889 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
const int MAX = (int)(1e5 + 5);
const ll INF = (ll)(1e13 + 5);
using ql = pair<ll, ll>;
const int MAX_N = (int)(3e2 + 5);
int n, m;
ll l;
ll cost[MAX_N][MAX_N];
int q;
ql jump[MAX_N][MAX_N];
int main(void) {
// Here your code !
scanf("... | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
const int MAX = (int)(1e5 + 5);
const ll INF = (ll)(1e13 + 5);
using ql = pair<ll, ll>;
const int MAX_N = (int)(3e2 + 5);
int n, m;
ll l;
ll cost[MAX_N][MAX_N];
int q;
ql jump[MAX_N][MAX_N];
int main(void) {
// Here your code !
scanf("... | replace | 65 | 66 | 65 | 67 | TLE | |
p02889 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define endl '\n'
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {... | #include <bits/stdc++.h>
using namespace std;
#define endl '\n'
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {... | replace | 25 | 26 | 25 | 26 | 0 | |
p02889 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define lb lower_bound
#define ub upper_bound
typedef long long ll;
const ll INF = 100000000000ll;
const long INF64 = 1000000000000000ll;
const ll MOD = 100000000... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define lb lower_bound
#define ub upper_bound
typedef long long ll;
const ll INF = 100000000000ll;
const long INF64 = 1000000000000000ll;
const ll MOD = 100000000... | replace | 43 | 44 | 43 | 44 | TLE | |
p02889 | 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
#defin... | #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
#defin... | insert | 204 | 204 | 204 | 206 | 0 | |
p02889 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using Weight = int;
using Vertex = int;
struct Edge {
Vertex from, to;
Weight weight, charge;
};
using Graph = vector<vector<Edge>>;
int main() {
int N, M, L;
cin >> N >> M >> L;
Graph G(N);
for (auto i = 0; i < M; ++i) {
int A, B, C;
cin >> A >> B >>... | #include <bits/stdc++.h>
using namespace std;
using Weight = int;
using Vertex = int;
struct Edge {
Vertex from, to;
Weight weight, charge;
};
using Graph = vector<vector<Edge>>;
int main() {
int N, M, L;
cin >> N >> M >> L;
Graph G(N);
for (auto i = 0; i < M; ++i) {
int A, B, C;
cin >> A >> B >>... | replace | 28 | 30 | 28 | 30 | TLE | |
p02889 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
/// Welcome to Nasif's Code
#define bug printf("bug\n");
#define bug2(var) cout << #var << " " << var << endl;
#define co(q) cout << q << endl;
#define all(q) (q).begin(), (q).end()
#define pi acos(-1)
#define FastRead ... | #include <bits/stdc++.h>
using namespace std;
/// Welcome to Nasif's Code
#define bug printf("bug\n");
#define bug2(var) cout << #var << " " << var << endl;
#define co(q) cout << q << endl;
#define all(q) (q).begin(), (q).end()
#define pi acos(-1)
#define FastRead ... | replace | 24 | 25 | 24 | 25 | 0 | |
p02889 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll n, m, l;
int main() {
ios_base::sync_with_stdio(false);
cin >> n >> m >> l;
ll adj[n][n];
for (int i = 0; i <= n; i++)
for (int j = 0; j <= n; j++)
adj[i][j] = (i == j) ? 0 : 1e13;
for (int i = 0; i < m; i++) {
ll a, b, ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll n, m, l;
int main() {
ios_base::sync_with_stdio(false);
cin >> n >> m >> l;
ll adj[n][n];
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++)
adj[i][j] = (i == j) ? 0 : 1e13;
for (int i = 0; i < m; i++) {
ll a, b, c;... | replace | 12 | 14 | 12 | 14 | 0 | |
p02889 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define fi first
#define se second
#define all(v) v.begin(), v.end()
#define eb emplace_back
#define uqv(v) v.erase(unique(all(v)), v.end());
#define INF 1e9
#define LINF 1e18
#define gt(tp, x) get<x>(tp)
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, l... | #include <bits/stdc++.h>
#define fi first
#define se second
#define all(v) v.begin(), v.end()
#define eb emplace_back
#define uqv(v) v.erase(unique(all(v)), v.end());
#define INF 1e9
#define LINF 1e18
#define gt(tp, x) get<x>(tp)
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, l... | insert | 51 | 51 | 51 | 53 | TLE | |
p02889 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define arep(i, x, n) for (int i = int(x); i < (int)(n); i++)
#define rep(i, n) for (long long i = 0; i < n; ++i)
#define rrep(i, n) for (int i = int(n - 1); i >= 0; i--)
#define fs first
#define sc second
#define all(x) (x).begin(), (x).end()
#define pi 3.141592653589793
#... | #include <bits/stdc++.h>
using namespace std;
#define arep(i, x, n) for (int i = int(x); i < (int)(n); i++)
#define rep(i, n) for (long long i = 0; i < n; ++i)
#define rrep(i, n) for (int i = int(n - 1); i >= 0; i--)
#define fs first
#define sc second
#define all(x) (x).begin(), (x).end()
#define pi 3.141592653589793
#... | insert | 55 | 55 | 55 | 57 | -11 | |
p02889 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; i++)
#define RFOR(i, a, n) for (ll i = (ll)n - 1; i >= (ll)a; i--)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) RFOR(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define bra(x, y) '(' << x << ',' <<... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; i++)
#define RFOR(i, a, n) for (ll i = (ll)n - 1; i >= (ll)a; i--)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) RFOR(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define bra(x, y) '(' << x << ',' <<... | replace | 36 | 38 | 36 | 38 | TLE | |
p02889 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, j, n) for (int i = (int)(j); i < (int)(n); i++)
#define REP(i, j, n) for (int i = (int)(j); i <= (int)(n); i++)
#define MOD 1000000007
#define int long long
#define ALL(a) (a).begin(), (a).end()
#define vi vector<int>
#define vii vector<vi>
#define pii pair<i... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, j, n) for (int i = (int)(j); i < (int)(n); i++)
#define REP(i, j, n) for (int i = (int)(j); i <= (int)(n); i++)
#define MOD 1000000007
#define int long long
#define ALL(a) (a).begin(), (a).end()
#define vi vector<int>
#define vii vector<vi>
#define pii pair<i... | insert | 39 | 39 | 39 | 41 | TLE | |
p02889 | C++ | Time Limit Exceeded |
#include <algorithm>
#include <deque>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unordered_map>
#include <vector>
long long mod = 1e9 + 7;
class Mint {
public:
long long x;
Mint(){}; // ... |
#include <algorithm>
#include <deque>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unordered_map>
#include <vector>
long long mod = 1e9 + 7;
class Mint {
public:
long long x;
Mint(){}; // ... | replace | 161 | 163 | 161 | 164 | TLE | |
p02889 | C++ | Runtime Error | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author alireza_kaviani
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
template <class T>
using Tree =
tree<T, n... | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author alireza_kaviani
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
template <class T>
using Tree =
tree<T, n... | replace | 44 | 45 | 44 | 45 | 0 | |
p02889 | C++ | Runtime Error | #pragma GCC optimize(3, "Ofast", "inline")
#include <bits/stdc++.h>
#if __cplusplus >= 201103L
#include <chrono>
using namespace std::chrono;
#endif
using namespace std;
#define ll long long
#define ull unsigned long long
#define pii pair<int, int>
#define pb push_back
#define fi first
#define se second
#ifdef LOCAL
#d... | #pragma GCC optimize(3, "Ofast", "inline")
#include <bits/stdc++.h>
#if __cplusplus >= 201103L
#include <chrono>
using namespace std::chrono;
#endif
using namespace std;
#define ll long long
#define ull unsigned long long
#define pii pair<int, int>
#define pb push_back
#define fi first
#define se second
#ifdef LOCAL
#d... | replace | 60 | 62 | 60 | 62 | 0 | |
p02889 | C++ | Time Limit Exceeded | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> ... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> ... | insert | 62 | 62 | 62 | 63 | TLE | |
p02889 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define PI 3.1415926535897932384626433832795
#define MOD (1000000007)
#define EPS (1e-15)
#define rep(i, n... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define PI 3.1415926535897932384626433832795
#define MOD (1000000007)
#define EPS (1e-15)
#define rep(i, n... | insert | 73 | 73 | 73 | 76 | TLE | |
p02889 | C++ | Time Limit Exceeded | #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
#defin... | replace | 3 | 4 | 3 | 4 | TLE | |
p02889 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define reg register
#define ll long long
#define maxn 305
inline ll read() {
ll x = 0, w = 0;
char ch = getchar();
while (!isdigit(ch))
w |= ch == '-', ch = getchar();
while (isdigit(ch))
x = (x << 3) + (x << 1) + (ch ^ 48), ch = getchar();
return w ? -x ... | #include <bits/stdc++.h>
using namespace std;
#define reg register
#define ll long long
#define maxn 305
inline ll read() {
ll x = 0, w = 0;
char ch = getchar();
while (!isdigit(ch))
w |= ch == '-', ch = getchar();
while (isdigit(ch))
x = (x << 3) + (x << 1) + (ch ^ 48), ch = getchar();
return w ? -x ... | replace | 15 | 16 | 15 | 17 | 0 | |
p02889 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#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,... | #include <algorithm>
#include <bitset>
#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,... | insert | 84 | 84 | 84 | 86 | 0 | |
p02889 | C++ | Time Limit Exceeded | #pragma GCC optimize(3)
#include <bits/stdc++.h>
#define ll long long
#define F first
#define S second
#define P pair
#define FOR(i, a, b) for (int i = a; i <= b; i++)
#define V vector
#define RE return
#define ALL(a) a.begin(), a.end()
#define MP make_pair
#define PB push_back
#define PF push_front
#define FILL(a, b) ... | #pragma GCC optimize(3)
#include <bits/stdc++.h>
#define ll long long
#define F first
#define S second
#define P pair
#define FOR(i, a, b) for (int i = a; i <= b; i++)
#define V vector
#define RE return
#define ALL(a) a.begin(), a.end()
#define MP make_pair
#define PB push_back
#define PF push_front
#define FILL(a, b) ... | insert | 43 | 43 | 43 | 45 | TLE | |
p02889 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bits/stdc++.h>
#include <cassert>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#includ... | #include <algorithm>
#include <bits/stdc++.h>
#include <cassert>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#includ... | replace | 1,651 | 1,652 | 1,651 | 1,652 | TLE | |
p02889 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
using ULL = unsigned long long;
void solve() {
int AZ = 1000000001;
int n, m;
cin >> n >> m;
int L;
cin >> L;
queue<pair<int, int>> st;
int l[300][300];
rep(i, n) rep(j, n) l[i][j] = AZ;
rep(i, m) {
in... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
using ULL = unsigned long long;
void solve() {
int AZ = 1000000001;
int n, m;
cin >> n >> m;
int L;
cin >> L;
queue<pair<int, int>> st;
int l[300][300];
rep(i, n) rep(j, n) l[i][j] = AZ;
rep(i, m) {
in... | replace | 26 | 27 | 26 | 27 | TLE | |
p02889 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vb = vector<bool>;
using vs = vector<string>;
using vld = vector<ld>;
using vvld = vector<vld>;
typedef pair<ll, ll> P;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vb = vector<bool>;
using vs = vector<string>;
using vld = vector<ld>;
using vvld = vector<vld>;
typedef pair<ll, ll> P;
... | insert | 85 | 85 | 85 | 89 | TLE | |
p02889 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
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) {
... | #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
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) {
... | replace | 27 | 29 | 27 | 29 | TLE | |
p02889 | C++ | Time Limit Exceeded | /*~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=
*$* WRITER:kakitamasziru/OxOmisosiru *$*
~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=*/
#ifdef LOCAL_JUDGE
#define _GLIBCXX_DEBUG
#endif
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <cstdint> // int64_t, int*_t
#include <iomanip>
#include ... | /*~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=
*$* WRITER:kakitamasziru/OxOmisosiru *$*
~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=*/
#ifdef LOCAL_JUDGE
#define _GLIBCXX_DEBUG
#endif
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <cstdint> // int64_t, int*_t
#include <iomanip>
#include ... | replace | 93 | 94 | 93 | 96 | TLE | |
p02889 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define dup(x, y) (((x) + (y)-1) / (y))
#define ALL(x) (x).begin(), (x).end()
typedef long long ll;
typedef pair<int, int> pii;
const double EPS = 1e-10;
const int INF = 1e9;
const ll LINF = 1e15;
const int MOD = 1000000007;
c... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define dup(x, y) (((x) + (y)-1) / (y))
#define ALL(x) (x).begin(), (x).end()
typedef long long ll;
typedef pair<int, int> pii;
const double EPS = 1e-10;
const int INF = 1e9;
const ll LINF = 1e15;
const int MOD = 1000000007;
c... | replace | 35 | 36 | 35 | 36 | TLE | |
p02889 | C++ | Runtime Error | #include <bits/stdc++.h>
#define all(x) x.begin(), x.end()
using namespace std;
using ll = long long;
using pii = pair<int, int>;
const int MN = 300 + 5, LN = 17, MOD = 1e9 + 7, INF = 0x3f3f3f3f, BSZ = 320;
const ll INFLL = 1e17;
ll N, M, L, Q;
ll dis[MN][MN], f[MN][MN];
int main() {
ios_base::sync_with_stdio(0), c... | #include <bits/stdc++.h>
#define all(x) x.begin(), x.end()
using namespace std;
using ll = long long;
using pii = pair<int, int>;
const int MN = 300 + 5, LN = 17, MOD = 1e9 + 7, INF = 0x3f3f3f3f, BSZ = 320;
const ll INFLL = 1e17;
ll N, M, L, Q;
ll dis[MN][MN], f[MN][MN];
int main() {
ios_base::sync_with_stdio(0), c... | replace | 13 | 15 | 13 | 15 | 0 | |
p02889 | C++ | Runtime Error | /* _ _ _
| | | | ___ ___
| | | || . || _|
|_____||_ ||_| _____
|_| |_____| */
// Time : 19/10/20
#include <bits/stdc++.h>
#define inf 0x3f3f3f3f
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<int, int> pii;
const int nmax = 300 ... | /* _ _ _
| | | | ___ ___
| | | || . || _|
|_____||_ ||_| _____
|_| |_____| */
// Time : 19/10/20
#include <bits/stdc++.h>
#define inf 0x3f3f3f3f
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<int, int> pii;
const int nmax = 300 ... | replace | 30 | 32 | 30 | 33 | 0 | |
p02889 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// ll MOD=1000000007;
ll INF = 300000000000;
int main() {
ll N, M, L;
cin >> N >> M >> L;
vector<ll> A(N), B(N), C(N);
for (ll i = 0; i < M; i++) {
ll a, b, c;
cin >> a >> b >> c;
a--;
b--;
A[i] = a;
B[i] = b;
C[i] =... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// ll MOD=1000000007;
ll INF = 300000000000;
int main() {
ll N, M, L;
cin >> N >> M >> L;
vector<ll> A(M), B(M), C(M);
for (ll i = 0; i < M; i++) {
ll a, b, c;
cin >> a >> b >> c;
a--;
b--;
A[i] = a;
B[i] = b;
C[i] =... | replace | 8 | 9 | 8 | 9 | 0 | |
p02889 | C++ | Time Limit Exceeded | // 2020-07-24 07:52:55
#include <bits/stdc++.h>
#ifdef LOCAL
#include "lib/debug.hpp"
#else
#define debug(...) 1
#endif
#define ALL(a) (a).begin(), (a).end()
#define rep(i, n) REP(i, 0, (n))
#define repc(i, n) REPC(i, 0, (n))
#define REP(i, n, m) for (int i = (int)(n); i < (int)(m); i++)
#define REPC(i, n, m) for (int ... | // 2020-07-24 07:52:55
#include <bits/stdc++.h>
#ifdef LOCAL
#include "lib/debug.hpp"
#else
#define debug(...) 1
#endif
#define ALL(a) (a).begin(), (a).end()
#define rep(i, n) REP(i, 0, (n))
#define repc(i, n) REPC(i, 0, (n))
#define REP(i, n, m) for (int i = (int)(n); i < (int)(m); i++)
#define REPC(i, n, m) for (int ... | replace | 49 | 53 | 49 | 56 | TLE | |
p02889 | C++ | Runtime Error | // #include<bits/stdc++.h>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define MAX_N 100000000
#define INF 100000000000000
int main() {
int n, m... | // #include<bits/stdc++.h>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define MAX_N 100000000
#define INF 100000000000000
int main() {
int n, m... | replace | 21 | 22 | 21 | 22 | -11 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.