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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
p02647 | C++ | Time Limit Exceeded | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep2(i, s, f) for (int i = s; i < f; i++)
#define INF 1000000000000000000
#define MOD 1000000007
#define endl "\n"
#define fcout cout << fixed << setprecision(15)
typedef p... | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep2(i, s, f) for (int i = s; i < f; i++)
#define INF 1000000000000000000
#define MOD 1000000007
#define endl "\n"
#define fcout cout << fixed << setprecision(15)
typedef p... | replace | 146 | 149 | 146 | 152 | TLE | |
p02647 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
ll N, K;
vector<ll> A;
vector<ll> B;
int main() {
cin >> N >> K;
A.resize(N);
B.resize(N + 1);
for (... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
ll N, K;
vector<ll> A;
vector<ll> B;
int main() {
cin >> N >> K;
A.resize(N);
B.resize(N + 1);
for (... | replace | 25 | 26 | 25 | 26 | TLE | |
p02647 | C++ | Runtime Error | #include <stdio.h>
int x[200010], s[200010];
int main() {
freopen("input.txt", "r", stdin);
int a, b;
scanf("%d%d", &a, &b);
for (int i = 1; i <= a; i++)
scanf("%d", &x[i]);
for (int j = 1; j <= 50 && j <= b; j++) {
for (int i = 1; i <= a; i++) {
int L = i - x[i];
int R = i + x[i];
... | #include <stdio.h>
int x[200010], s[200010];
int main() {
int a, b;
scanf("%d%d", &a, &b);
for (int i = 1; i <= a; i++)
scanf("%d", &x[i]);
for (int j = 1; j <= 50 && j <= b; j++) {
for (int i = 1; i <= a; i++) {
int L = i - x[i];
int R = i + x[i];
if (L < 1)
L = 1;
if ... | delete | 4 | 5 | 4 | 4 | 0 | |
p02647 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e5 + 10;
int N, K;
int A[MAXN];
int sum[MAXN];
int n_count = 0;
void do_operation() {
int cost = 0;
for (int i = 1; i <= N; ++i)
sum[i] = 0;
for (int i = 1; i <= N; ++i) {
sum[max(1, i - A[i])]++;
sum[min(N + 1, i + A[i] + 1)]--;
}
... | #include <bits/stdc++.h>
using namespace std;
const int MAXN = 2e5 + 10;
int N, K;
int A[MAXN];
int sum[MAXN];
int n_count = 0;
void do_operation() {
int cost = 0;
for (int i = 1; i <= N; ++i)
sum[i] = 0;
for (int i = 1; i <= N; ++i) {
sum[max(1, i - A[i])]++;
sum[min(N + 1, i + A[i] + 1)]--;
}
... | replace | 3 | 4 | 3 | 4 | 0 | |
p02647 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#include <cctype>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(v) (v).begin(), (v).end()
typedef long long int ll;
#define pi 3.1415926535897932384
#define E9 1000000000
#define eps 1e-4
#define pii pair<int, int>
int main() {
int N, K;
cin >> N >> K;
... | #include <bits/stdc++.h>
#include <cctype>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(v) (v).begin(), (v).end()
typedef long long int ll;
#define pi 3.1415926535897932384
#define E9 1000000000
#define eps 1e-4
#define pii pair<int, int>
int main() {
int N, K;
cin >> N >> K;
... | replace | 17 | 18 | 17 | 18 | TLE | |
p02647 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
#define int int64_t
int ar[(int)2e5 + 10];
int br[(int)2e5 + 10];
int32_t main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
int count = 0;
int n, k;
cin >> n >> k;
int mini = n;
for (int i = 1; i <= n; i++) {
cin >> ar[i];
mini = min(mini, ar[i]);
... | #include "bits/stdc++.h"
using namespace std;
#define int int64_t
int ar[(int)2e5 + 10];
int br[(int)2e5 + 10];
int32_t main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
int count = 0;
int n, k;
cin >> n >> k;
int mini = n;
for (int i = 1; i <= n; i++) {
cin >> ar[i];
mini = min(mini, ar[i]);
... | replace | 31 | 32 | 31 | 32 | 0 | |
p02647 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < n; ++i)
typedef long long ll;
using namespace std;
const int INF = 1e9;
int main() {
int n, k;
cin >> n >> k;
vector<ll> a(n);
rep(i, n) cin >> a[i];
vector<ll> imos(n + 1);
rep(_, k) {
imos.assign(n + 1, 0);
rep(i, n) {
if (i - ... | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < n; ++i)
typedef long long ll;
using namespace std;
const int INF = 1e9;
int main() {
int n, k;
cin >> n >> k;
vector<ll> a(n);
rep(i, n) cin >> a[i];
vector<ll> imos(n + 1);
rep(_, min(k, 100)) {
imos.assign(n + 1, 0);
rep(i, n) {
... | replace | 14 | 15 | 14 | 15 | TLE | |
p02647 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define VI vector<int>
#define VLL vector<ll>
#define PII pair<int, int>
#define mp make_pair
#define pb push_back
#define PI acos(-1)
#define ld long double
const int MxN = 100001;
#define FOR(i, a, b) for (int i = a; i < b; ++i)
#define RFOR(i, a, b)... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define VI vector<int>
#define VLL vector<ll>
#define PII pair<int, int>
#define mp make_pair
#define pb push_back
#define PI acos(-1)
#define ld long double
const int MxN = 200001;
#define FOR(i, a, b) for (int i = a; i < b; ++i)
#define RFOR(i, a, b)... | replace | 11 | 12 | 11 | 12 | 0 | |
p02647 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <numeric>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
#define REP(i, a, b) for (int i = int(a); i < int(b); i++)
using namespace std;
using ll = long long int;
using P = pair<ll, ll>;
// clang-format off
#ifdef _DEBUG_
#define dump(...) do{... | #include <algorithm>
#include <iostream>
#include <numeric>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
#define REP(i, a, b) for (int i = int(a); i < int(b); i++)
using namespace std;
using ll = long long int;
using P = pair<ll, ll>;
// clang-format off
#ifdef _DEBUG_
#define dump(...) do{... | insert | 49 | 49 | 49 | 58 | TLE | |
p02647 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, k;
cin >> n >> k;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int it = max(k, (int)floor(log(k)));
for (int i = 0; i < it; i++) {
vector<int> b(n + 1);
for (int j ... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, k;
cin >> n >> k;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
k = min(k, 100);
for (int i = 0; i < k; i++) {
vector<int> b(n + 1);
for (int j = 0; j < n; j++) {
... | replace | 12 | 14 | 12 | 14 | TLE | |
p02647 | C++ | Time Limit Exceeded | // #include<cstdio>
// #include<cassert>
// #include<iostream>
// #include<cstring>
// #include<algorithm>
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define MAX ((int)1e6 + 5)
#define MAXL ((ll)1e18 + 5)
#define MAX_X ((ll)1e5 + 2)
#define pi (2.0 * acos(0))
... | // #include<cstdio>
// #include<cassert>
// #include<iostream>
// #include<cstring>
// #include<algorithm>
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define MAX ((int)1e6 + 5)
#define MAXL ((ll)1e18 + 5)
#define MAX_X ((ll)1e5 + 2)
#define pi (2.0 * acos(0))
... | insert | 60 | 60 | 60 | 62 | TLE | |
p02647 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define int long long
void solve() {
int n, m, k, i, j, count = 0, sum = 0, maxi = 0, mini = 1e18, flag = 0;
cin >> n >> k;
vector<int> a(n + 1);
for (i = 1; i <= n; i++) {
cin >> a[i];
}
for (i = 1; i <= k; i++) {
vector<int> freq(n + 1, 0);
for ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
void solve() {
int n, m, k, i, j, count = 0, sum = 0, maxi = 0, mini = 1e18, flag = 0;
cin >> n >> k;
vector<int> a(n + 1);
for (i = 1; i <= n; i++) {
cin >> a[i];
}
for (i = 1; i <= k; i++) {
vector<int> freq(n + 1, 0);
flag... | insert | 15 | 15 | 15 | 16 | TLE | |
p02647 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
using ll = long long;
const ll MOD = 1000000007; // 998244353;
int dp[200001][500];
void solve() {
int n, k;
cin >> n >> k;
rep(i, n) cin >> dp[0][i];
int j = 0;
while (k--) {
rep(i, n) {
dp[j + 1][max(i - dp... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
using ll = long long;
const ll MOD = 1000000007; // 998244353;
int dp[400][200001];
void solve() {
int n, k;
cin >> n >> k;
rep(i, n) cin >> dp[0][i];
int j = 0;
while (k--) {
rep(i, n) {
dp[j + 1][max(i - dp... | replace | 5 | 6 | 5 | 6 | -11 | |
p02647 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
// #define int long long
#define rep(i, n) for (long long i = (long long)(0); i < (long long)(n); ++i)
#define reps(i, n) for (long long i = (long long)(1); i <= (long long)(n); ++i)
#define rrep(i, n) for (long long i = ((long long)(n)-1); i >= 0; i--)
#define rreps(i, n)... | #include <bits/stdc++.h>
using namespace std;
// #define int long long
#define rep(i, n) for (long long i = (long long)(0); i < (long long)(n); ++i)
#define reps(i, n) for (long long i = (long long)(1); i <= (long long)(n); ++i)
#define rrep(i, n) for (long long i = ((long long)(n)-1); i >= 0; i--)
#define rreps(i, n)... | replace | 69 | 70 | 69 | 70 | 0 | |
p02647 | C++ | Time Limit Exceeded | // while (clock()<=69*CLOCKS_PER_SEC)
// #pragma comment(linker, "/stack:200000000")
// #pragma GCC optimize("O3")
// #pragma GCC optimize("Ofast")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
// #pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_... | // while (clock()<=69*CLOCKS_PER_SEC)
// #pragma comment(linker, "/stack:200000000")
// #pragma GCC optimize("O3")
// #pragma GCC optimize("Ofast")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
// #pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_... | insert | 108 | 108 | 108 | 110 | TLE | |
p02647 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
using namespace std;
typedef long long ll;
ll n, k;
ll a[200005];
ll b[200005] = {0};
int main(void) {
scanf("%ll... | #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
using namespace std;
typedef long long ll;
ll n, k;
ll a[200005];
ll b[200005] = {0};
int main(void) {
scanf("%ll... | replace | 36 | 37 | 36 | 37 | TLE | |
p02647 | C++ | Runtime Error | #include <bits/stdc++.h>
#define taskname ""
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define for0(i, n) for (int i = 0; i < (int)(n); ++i)
#define for1(i, n) for (int i = 1; i <= (int)(n); ++i)
#defin... | #include <bits/stdc++.h>
#define taskname ""
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define for0(i, n) for (int i = 0; i < (int)(n); ++i)
#define for1(i, n) for (int i = 1; i <= (int)(n); ++i)
#defin... | replace | 28 | 29 | 28 | 29 | 0 | |
p02647 | C++ | Runtime Error | #include <bits/stdc++.h>
#define int long long
using namespace std;
int a[100010], c[100010];
int max(int a, int b) { return a > b ? a : b; }
inline int read() {
int X = 0, w = 0;
char ch = 0;
while (!isdigit(ch)) {
w |= ch == '-';
ch = getchar();
}
while (isdigit(ch))
X = (X << 3) + (X << 1) +... | #include <bits/stdc++.h>
#define int long long
using namespace std;
int a[200010], c[200010];
int max(int a, int b) { return a > b ? a : b; }
inline int read() {
int X = 0, w = 0;
char ch = 0;
while (!isdigit(ch)) {
w |= ch == '-';
ch = getchar();
}
while (isdigit(ch))
X = (X << 3) + (X << 1) +... | replace | 4 | 5 | 4 | 5 | 0 | |
p02647 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> intensity(n);
for (int i = 0; i < n; i++) {
cin >> intensity[i];
}
for (int j = 0; j < k; j++) {
vector<int> power(n + 1);
for (int i = 0; i < n; i++) {
int start = i - intensity[i];
int... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> intensity(n);
for (int i = 0; i < n; i++) {
cin >> intensity[i];
}
for (int j = 0; j < min(k, 50); j++) {
vector<int> power(n + 1);
for (int i = 0; i < n; i++) {
int start = i - intensity[i];
... | replace | 11 | 12 | 11 | 12 | TLE | |
p02647 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define bug(x) cout << "zdongdebug1: " << x << endl;
#define bug2(x, y) co... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define bug(x) cout << "zdongdebug1: " << x << endl;
#define bug2(x, y) co... | replace | 20 | 21 | 20 | 21 | 0 | |
p02647 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, n) for (int i = 1; i <= (int)(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 cdiv(a, b) (((a... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, n) for (int i = 1; i <= (int)(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 cdiv(a, b) (((a... | replace | 112 | 113 | 112 | 113 | TLE | |
p02647 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repI(i, d, n) for (int i = (d); i < (n); ++i)
#define reps1(i, n) for (int i = 1; i < (n); ++i)
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <clas... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repI(i, d, n) for (int i = (d); i < (n); ++i)
#define reps1(i, n) for (int i = 1; i < (n); ++i)
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <clas... | insert | 49 | 49 | 49 | 59 | TLE | |
p02647 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
if (log10(N) * 8 - 2 <= K) {
for (int i = 0; i < N; i++) {
cout << N;
if (i == N - 1)
cout << endl;
else
cout << ' ';
}
return 0;
}
vector<vector<int>> A(K + 1, vector<int>(N, 0))... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N >> K;
if (log10(N) * 8 - 2 <= K) {
for (int i = 0; i < N; i++) {
cout << N;
if (i == N - 1)
cout << endl;
else
cout << ' ';
}
return 0;
}
vector<vector<int>> A(K + 1, vector<int>(N, 0))... | replace | 20 | 25 | 20 | 26 | TLE | |
p02647 | C++ | Time Limit Exceeded | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cstring>
#include <float.h>
#include <fstream>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <map>
#include <numeric>
#include <queue>
#include... | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cstring>
#include <float.h>
#include <fstream>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <map>
#include <numeric>
#include <queue>
#include... | insert | 178 | 178 | 178 | 179 | TLE | |
p02647 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(a) (a).begin(), (a).end()
using namespace std;
using ll = long long int;
using vec = vector<int>;
using P = pair<int, int>;
const int INF = 1e9 + 7;
int main() {
int n, k;
cin >> n >> k;
vec a(n);
rep(i, n) { cin >> a[i]; }
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(a) (a).begin(), (a).end()
using namespace std;
using ll = long long int;
using vec = vector<int>;
using P = pair<int, int>;
const int INF = 1e9 + 7;
int main() {
int n, k;
cin >> n >> k;
vec a(n);
rep(i, n) { cin >> a[i]; }
... | replace | 25 | 26 | 25 | 26 | 0 | |
p02647 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <math.h>
#include <numeric>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
ll N, K;
cin >> N >> ... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <math.h>
#include <numeric>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
ll N, K;
cin >> N >> ... | replace | 27 | 28 | 27 | 35 | TLE | |
p02647 | C++ | Time Limit Exceeded | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long int lli;
typedef unsigned long long int ulli;
#define vec(s) vector<s>;
#define vvec(s) vector<vector<s>>;
typedef vector<lli> vi;
typedef vector<vi> vvi;
typedef pair<lli, lli> pii;
#define rep(i, n) for (int i = 0; i < (int)(n); i+... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long int lli;
typedef unsigned long long int ulli;
#define vec(s) vector<s>;
#define vvec(s) vector<vector<s>>;
typedef vector<lli> vi;
typedef vector<vi> vvi;
typedef pair<lli, lli> pii;
#define rep(i, n) for (int i = 0; i < (int)(n); i+... | replace | 27 | 28 | 27 | 28 | TLE | |
p02647 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL_DEBUG
#include "LOCAL_DEBUG.hpp"
#endif
#define int long long
const int INF = 1LL << 60;
template <class T> vector<T> make_vec(size_t a) { return vector<T>(a); }
template <class T, class... Ts> auto make_vec(size_t a, Ts... ts) {
return vector<decltype(make_... | #include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL_DEBUG
#include "LOCAL_DEBUG.hpp"
#endif
#define int long long
const int INF = 1LL << 60;
template <class T> vector<T> make_vec(size_t a) { return vector<T>(a); }
template <class T, class... Ts> auto make_vec(size_t a, Ts... ts) {
return vector<decltype(make_... | insert | 45 | 45 | 45 | 46 | 0 | |
p02647 | C++ | Runtime Error | // khodaya khodet komak kon
#include <bits/stdc++.h>
#define F first
#define S second
#define pb push_back
#define all(x) x.begin(), x.end()
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
const in... | // khodaya khodet komak kon
#include <bits/stdc++.h>
#define F first
#define S second
#define pb push_back
#define all(x) x.begin(), x.end()
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
const in... | replace | 33 | 35 | 33 | 35 | 0 | |
p02647 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n, k;
cin >> n >> k;
vector<int> a(n);
rep(i, n) cin >> a[i];
rep(ki, k) {
vector<int> b(n + 1);
rep(i, n) {
int l = max(0, i - a[... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n, k;
cin >> n >> k;
vector<int> a(n);
rep(i, n) cin >> a[i];
rep(ki, k) {
vector<int> b(n + 1);
rep(i, n) {
int l = max(0, i - a[... | replace | 16 | 17 | 16 | 17 | 0 | |
p02647 | C++ | Runtime Error | #pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
using namespace std;
#define F first
#define S second
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define SZ(x) (int)(x).size()
// #define int ll
const int N = 1e5 + ... | #pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
using namespace std;
#define F first
#define S second
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define SZ(x) (int)(x).size()
// #define int ll
const int N = 2e5 + ... | replace | 13 | 14 | 13 | 14 | 0 | |
p02647 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef vector<vector<vector<ll>>> vvvll;
typedef vector<bool> vb;
typedef vector<vector<bool>> vvb;
typedef vector<vector<vector<bool>>> vvvb;
typedef pair<ll, ll> pll;
typedef vector<pll> vpll... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef vector<vector<vector<ll>>> vvvll;
typedef vector<bool> vb;
typedef vector<vector<bool>> vvb;
typedef vector<vector<vector<bool>>> vvvb;
typedef pair<ll, ll> pll;
typedef vector<pll> vpll... | replace | 295 | 296 | 295 | 296 | -6 | munmap_chunk(): invalid pointer
|
p02647 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 10;
int n, k, a[maxn], d[maxn];
int main() {
scanf("%d%d", &n, &k);
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
while (k--) {
for (int i = 0; i <= n + 1; i++)
d[i] = 0;
for (int i = 1; i <= n; i++) {
int l = max(i - ... | #include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 10;
int n, k, a[maxn], d[maxn];
int main() {
scanf("%d%d", &n, &k);
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
while (k--) {
bool f = true;
for (int i = 1; i <= n; i++)
if (a[i] != n)
f = false;
if (f)
b... | insert | 9 | 9 | 9 | 15 | TLE | |
p02647 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
long long num, k;
long long tmp1, tmp2;
long long Min = 0;
cin >> num >> k;
// vector<long long> vec(num,0);
vector<long long> d(num, 0);
for (int i = 0; i < num; i++)
cin >> d.at(i);
for (int i = 0; i < k; i++) {
vector<long long> v... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long num, k;
long long tmp1, tmp2;
long long Min = 0;
cin >> num >> k;
// vector<long long> vec(num,0);
vector<long long> d(num, 0);
for (int i = 0; i < num; i++)
cin >> d.at(i);
for (int i = 0; i < k; i++) {
vector<long long> v... | insert | 28 | 28 | 28 | 32 | TLE | |
p02647 | C++ | Time Limit Exceeded | #define rep(i, n) for (int i = 0; i < (int)(n); i++)
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> v, vmin, vmax;
rep(i, n) {
int a;
cin >> a;
v.push_back(a);
}
vector<int> org(n, 0);
vector<... | #define rep(i, n) for (int i = 0; i < (int)(n); i++)
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> v, vmin, vmax;
rep(i, n) {
int a;
cin >> a;
v.push_back(a);
}
vector<int> org(n, 0);
vector<... | replace | 19 | 20 | 19 | 20 | TLE | |
p02647 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep1(i, n) for (int i = 1; i < (n); ++i)
using namespace std;
typedef long long ll;
#define SEG_LEN (1 << 18)
int seg[SEG_LEN * 2];
// one point
long long int get(int ind) {
ind += SEG_LEN;
long long int sum =... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep1(i, n) for (int i = 1; i < (n); ++i)
using namespace std;
typedef long long ll;
#define SEG_LEN (1 << 18)
int seg[SEG_LEN * 2];
// one point
long long int get(int ind) {
ind += SEG_LEN;
long long int sum =... | insert | 75 | 75 | 75 | 85 | TLE | |
p02647 | C++ | Time Limit Exceeded | // teja349
#include <algorithm>
#include <bits/stdc++.h>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <iomanip>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <u... | // teja349
#include <algorithm>
#include <bits/stdc++.h>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <iomanip>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <u... | replace | 73 | 74 | 73 | 74 | TLE | |
p02647 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll N1097 = 1000000007LL;
ll N, K;
ll A[1000000];
ll d[1000000];
int main() {
cin >> N >> K;
for (ll i = 0; i < N; i++) {
scanf("%ld", &A[i]);
}
//
for (ll l = 0; l < K; l++) {
for (ll i = 0; i <= N; i++) {
d[i] = 0LL;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll N1097 = 1000000007LL;
ll N, K;
ll A[1000000];
ll d[1000000];
int main() {
cin >> N >> K;
for (ll i = 0; i < N; i++) {
scanf("%ld", &A[i]);
}
//
for (ll l = 0; l < K; l++) {
for (ll i = 0; i <= N; i++) {
d[i] = 0LL;
... | insert | 29 | 29 | 29 | 39 | TLE | |
p02647 | C++ | Runtime Error | // includes
#include <bits/stdc++.h>
using namespace std;
// macros
#define pb emplace_back
#define mk make_pair
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define irep(itr, st) for (auto itr = (st).begin(); itr != (st)... | // includes
#include <bits/stdc++.h>
using namespace std;
// macros
#define pb emplace_back
#define mk make_pair
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define irep(itr, st) for (auto itr = (st).begin(); itr != (st)... | replace | 146 | 147 | 146 | 147 | 0 | |
p02647 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std::literals::string_literals;
using i64 = std::int_fast64_t;
using std::cerr;
using std::cin;
using std::cout;
using std::endl;
template <typename T> std::vector<T> make_v(size_t a) {
return std::vector<T>(a);
}
template <typename T, typename... Ts> auto make_v(size_t a, T... | #include <bits/stdc++.h>
using namespace std::literals::string_literals;
using i64 = std::int_fast64_t;
using std::cerr;
using std::cin;
using std::cout;
using std::endl;
template <typename T> std::vector<T> make_v(size_t a) {
return std::vector<T>(a);
}
template <typename T, typename... Ts> auto make_v(size_t a, T... | insert | 29 | 29 | 29 | 30 | 0 | |
p02647 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define all(v) v.begin(), v.end()
int main() {
int n, k;
cin >> n >> k;
vector<int> A(n);
rep(i, n) cin >> A[i];
if (n == 1) {
cout << min(n, k) << endl;
}
else {
for (int l = 1; l <= min(k, 50); l++) {
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define all(v) v.begin(), v.end()
int main() {
int n, k;
cin >> n >> k;
vector<int> A(n);
rep(i, n) cin >> A[i];
if (n == 1) {
cout << min(n, k) << endl;
}
else {
for (int l = 1; l <= min(k, 50); l++) {
... | replace | 22 | 23 | 22 | 23 | 0 | |
p02647 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define INF 2e9
#define rep(i, n, m) for (int i = n; i < m; i++)
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<in... | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define INF 2e9
#define rep(i, n, m) for (int i = n; i < m; i++)
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<in... | insert | 22 | 22 | 22 | 24 | TLE | |
p02648 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, n, m) for (int i = (int)(n); i <= (int)(m); i++)
#define RFOR(i, n, m) for (int i = (int)(n); i >= (int)(m); i--)
#define ITR(x, c) for (__typeof(c.begin()) x = c.begin(); x != c.end(); x++)
#define RITR(x, c) for (__typeof(c.... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, n, m) for (int i = (int)(n); i <= (int)(m); i++)
#define RFOR(i, n, m) for (int i = (int)(n); i >= (int)(m); i--)
#define ITR(x, c) for (__typeof(c.begin()) x = c.begin(); x != c.end(); x++)
#define RITR(x, c) for (__typeof(c.... | replace | 41 | 42 | 41 | 42 | TLE | |
p02648 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>... | replace | 68 | 69 | 68 | 69 | TLE | |
p02648 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
const int maxN = (1 << 18) + 10;
const int MAX = 1e5;
typedef long long ll;
int n, q;
#define pii pair<int, int>
pii a[maxN];
#define V first
#define W second
ll pre[maxN];
ll dp[512][MAX + 1];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
/... | #include <bits/stdc++.h>
using namespace std;
const int maxN = (1 << 18) + 10;
const int MAX = 1e5;
typedef long long ll;
int n, q;
#define pii pair<int, int>
pii a[maxN];
#define V first
#define W second
ll pre[maxN];
ll dp[512][MAX + 1];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
/... | replace | 53 | 54 | 53 | 54 | TLE | |
p02648 | C++ | Runtime Error | #include <algorithm>
#include <cfloat>
#include <complex>
#include <functional>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#inc... | #include <algorithm>
#include <cfloat>
#include <complex>
#include <functional>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#inc... | insert | 37 | 37 | 37 | 50 | 0 | |
p02648 | C++ | Time Limit Exceeded |
#include <algorithm>
#include <chrono>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#i... |
#include <algorithm>
#include <chrono>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#i... | replace | 111 | 112 | 111 | 113 | TLE | |
p02648 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define REP(i, m, n) for (int i = (m); i < (int)(n); i++)
#define RREP(i, m, n) for (int i = (int)(n - 1); i >= m; i--)
#define rep(i, n) REP(i, 0, n)
#define rrep(i, n) RREP(i, 0, n)
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define fi... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, m, n) for (int i = (m); i < (int)(n); i++)
#define RREP(i, m, n) for (int i = (int)(n - 1); i >= m; i--)
#define rep(i, n) REP(i, 0, n)
#define rrep(i, n) RREP(i, 0, n)
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define fi... | replace | 81 | 82 | 81 | 82 | TLE | |
p02648 | C++ | Runtime Error | #define _CRT_SECURE_NO_WARNINGS
#pragma target("avx")
#pragma optimize("O3")
#pragma optimize("unroll-loops")
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#inc... | #define _CRT_SECURE_NO_WARNINGS
#pragma target("avx")
#pragma optimize("O3")
#pragma optimize("unroll-loops")
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#inc... | replace | 121 | 123 | 121 | 123 | -11 | |
p02648 | C++ | Time Limit Exceeded | #include <iostream>
#include <vector>
using namespace std;
using VP = vector<pair<int, int>>;
void merge(const VP &v1, const VP &v2, VP &result) {
auto it1 = v1.begin(), it2 = v2.begin();
int vmax = 0;
while (it1 != v1.end() || it2 != v2.end()) {
if (it1 == v1.end()) {
result.push_back(*it2);
it... | #include <iostream>
#include <vector>
using namespace std;
using VP = vector<pair<int, int>>;
void merge(const VP &v1, const VP &v2, VP &result) {
auto it1 = v1.begin(), it2 = v2.begin();
int vmax = 0;
while (it1 != v1.end() || it2 != v2.end()) {
if (it1 == v1.end()) {
result.push_back(*it2);
it... | replace | 53 | 54 | 53 | 54 | TLE | |
p02648 | C++ | Runtime Error | #include <algorithm>
#include <ctime>
#include <iostream>
#include <utility>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> V(N + 1);
vector<int> W(N + 1);
for (int i = 1; i <= N; i++)
cin >> V[i] >> W[i];
int Q;
cin >> Q;
vector<int> v(Q);
vector<int> L(Q);
f... | #include <algorithm>
#include <ctime>
#include <iostream>
#include <utility>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> V(N + 1);
vector<int> W(N + 1);
for (int i = 1; i <= N; i++)
cin >> V[i] >> W[i];
int Q;
cin >> Q;
vector<int> v(Q);
vector<int> L(Q);
f... | insert | 26 | 26 | 26 | 28 | 0 | |
p02648 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define ris return *this
#define tmplt template <class T
#define dbgo debug &operator<<
tmplt > struct rge {
T b, e;
};
tmplt > rge<T> range(T i, T j) { return rge<T>{i, j}; }
struct debug {
#ifdef LOCAL
~debug() { cerr << endl; }
tmplt > dbgo(T x) {
cerr << bool... | #include <bits/stdc++.h>
using namespace std;
#define ris return *this
#define tmplt template <class T
#define dbgo debug &operator<<
tmplt > struct rge {
T b, e;
};
tmplt > rge<T> range(T i, T j) { return rge<T>{i, j}; }
struct debug {
#ifdef LOCAL
~debug() { cerr << endl; }
tmplt > dbgo(T x) {
cerr << bool... | insert | 71 | 71 | 71 | 74 | TLE | |
p02648 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define ALL(v) (v).begin(), (v).end()
using ll = long long;
using P = pair<int, int>;
constexpr int INF = 1e9;
constexpr long long LINF = 1e18;
constexpr long long MOD = 1e9 + 7;
#define MAX 100000
ll dp[(1 << 9) + 1][2][MAX... | #pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define ALL(v) (v).begin(), (v).end()
using ll = long long;
using P = pair<int, int>;
constexpr int INF = 1e9;
constexpr long long LINF... | insert | 0 | 0 | 0 | 3 | TLE | |
p02648 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep2(i, m, n) for (int i = (m); i < (n); ++i)
#define rep(i, n) rep2(i, 0, n)
#define all(a) (a).begin(), (a).end()
struct fast_ios {
fast_ios() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
};
} fast_ios_;
templ... | #include <bits/stdc++.h>
using namespace std;
#define rep2(i, m, n) for (int i = (m); i < (n); ++i)
#define rep(i, n) rep2(i, 0, n)
#define all(a) (a).begin(), (a).end()
struct fast_ios {
fast_ios() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
};
} fast_ios_;
templ... | replace | 91 | 92 | 91 | 92 | 0 | |
p02648 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
// ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
// clock_t start=clock();clock_t
// end=clock();cout<<(double)(end-start)/CLOCKS_PER_SEC<<endl;
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned int ui;
typedef pair<int, int> pii;
typedef pair<pii... | #include <bits/stdc++.h>
// ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
// clock_t start=clock();clock_t
// end=clock();cout<<(double)(end-start)/CLOCKS_PER_SEC<<endl;
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned int ui;
typedef pair<int, int> pii;
typedef pair<pii... | replace | 132 | 133 | 132 | 133 | TLE | |
p02648 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rng(i, a, b) for (int i = int(a); i < int(b); i++)
#define rep(i, b) rng(i, 0, b)
#define gnr(i, a, b) for (int i = int(b) - 1; i >= int(a); i--)
#define per(i, b) gnr(i, 0, b)
#define pb push_back
#define eb emplace_back
#define bg begin()
#... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rng(i, a, b) for (int i = int(a); i < int(b); i++)
#define rep(i, b) rng(i, 0, b)
#define gnr(i, a, b) for (int i = int(b) - 1; i >= int(a); i--)
#define per(i, b) gnr(i, 0, b)
#define pb push_back
#define eb emplace_back
#define bg begin()
#... | replace | 34 | 35 | 34 | 35 | TLE | |
p02648 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(), a.end()
#define sz(x) (int)(x).size()
#define uni(x) x.erase(unique(rng(x)), x.end()... | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(), a.end()
#define sz(x) (int)(x).size()
#define uni(x) x.erase(unique(rng(x)), x.end()... | replace | 57 | 58 | 57 | 58 | TLE | |
p02648 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define sz(x) (int)((x).size())
#define forn(i, n) for (int i = 0; i < n; i++)
#define forse(i, s, e) for (int i = s; i < e; i++)
#define pb push_back
#define fi first
#define se second
#define all(vec) vec.begin(), vec.end()
#define time() ((double)clock() / CLOCKS_PER_S... | #include <bits/stdc++.h>
using namespace std;
#define sz(x) (int)((x).size())
#define forn(i, n) for (int i = 0; i < n; i++)
#define forse(i, s, e) for (int i = s; i < e; i++)
#define pb push_back
#define fi first
#define se second
#define all(vec) vec.begin(), vec.end()
#define time() ((double)clock() / CLOCKS_PER_S... | replace | 53 | 54 | 53 | 54 | TLE | |
p02648 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
using WGraph = vector<vector<pair<int, ll>>>;
template <class T> inline bool chmax(T &a, const T &b) {
if (b > a) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, cons... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
using WGraph = vector<vector<pair<int, ll>>>;
template <class T> inline bool chmax(T &a, const T &b) {
if (b > a) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, cons... | replace | 36 | 42 | 36 | 37 | 0 | |
p02648 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define ll long long
#define ull unsigned long long
#define db long double
#define pb push_back
#define ppb pop_back
#define F first
#define S second
#define mp make_p... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define ll long long
#define ull unsigned long long
#define db long double
#define pb push_back
#define ppb pop_back
#define F first
#define S second
#define mp make_p... | replace | 24 | 25 | 24 | 25 | -11 | |
p02648 | C++ | Time Limit Exceeded | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cstring>
#include <float.h>
#include <fstream>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <map>
#include <numeric>
#include <queue>
#include... | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cstring>
#include <float.h>
#include <fstream>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <map>
#include <numeric>
#include <queue>
#include... | replace | 168 | 169 | 168 | 169 | TLE | |
p02648 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using uint = unsigned int;
#define rep(i, n) for (int i = 0; i < int(n); i++)
#define rep1(i, n) for (int i = 1; i <= int(n); i++)
#define per(i, n) for (int i = int(n) - 1; i >= 0; i--)
#define per1(i, n) for (int i = int(n); i > 0; i--)
#define all(c... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using uint = unsigned int;
#define rep(i, n) for (int i = 0; i < int(n); i++)
#define rep1(i, n) for (int i = 1; i <= int(n); i++)
#define per(i, n) for (int i = int(n) - 1; i >= 0; i--)
#define per1(i, n) for (int i = int(n); i > 0; i--)
#define all(c... | insert | 90 | 90 | 90 | 91 | TLE | |
p02648 | C++ | Time Limit Exceeded |
// #pragma GCC optimize ("-O3")
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <re... |
// #pragma GCC optimize ("-O3")
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <re... | replace | 680 | 681 | 680 | 681 | TLE | |
p02648 | C++ | Memory Limit Exceeded | #include "bits/stdc++.h"
using namespace std;
#define REP(i, n) for (ll i = 0; i < n; i++)
#define ll long long
#define MOD 1000000007LL
#define llMAX 9223372036854775807LL
#define llMIN -9223372036854775808LL
using vi = vector<ll>; // llの1次元の型に vi という別名をつける
using vvi = vector<vi>; // llの2次元の型に vvi という別名をつける
ll n;
ll... | #include "bits/stdc++.h"
using namespace std;
#define REP(i, n) for (ll i = 0; i < n; i++)
#define ll long long
#define MOD 1000000007LL
#define llMAX 9223372036854775807LL
#define llMIN -9223372036854775808LL
using vi = vector<ll>; // llの1次元の型に vi という別名をつける
using vvi = vector<vi>; // llの2次元の型に vvi という別名をつける
ll n;
ll... | replace | 39 | 40 | 39 | 40 | MLE | |
p02648 | C++ | Runtime Error | #include <bits/stdc++.h>
#define REP(i, x, y) for (ll i = x; i <= y; i++)
#define BIT(t) (1ll << t)
#define PER(i, y, x) for (ll i = y; i >= x; i--)
#define vll vector<ll>
#define vvll vector<vector<ll>>
#define pll pair<ll, ll>
#define SIZE(v) ll(v.size())
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())... | #include <bits/stdc++.h>
#define REP(i, x, y) for (ll i = x; i <= y; i++)
#define BIT(t) (1ll << t)
#define PER(i, y, x) for (ll i = y; i >= x; i--)
#define vll vector<ll>
#define vvll vector<vector<ll>>
#define pll pair<ll, ll>
#define SIZE(v) ll(v.size())
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())... | replace | 41 | 42 | 41 | 42 | 0 | |
p02648 | C++ | Runtime Error | // Template
#include <bits/stdc++.h>
#define rep_override(x, y, z, name, ...) name
#define rep2(i, n) for (int i = 0; i < (n); ++i)
#define rep3(i, l, r) for (int i = (l); i < (r); ++i)
#define rep(...) rep_override(__VA_ARGS__, rep3, rep2)(__VA_ARGS__)
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size(... | // Template
#include <bits/stdc++.h>
#define rep_override(x, y, z, name, ...) name
#define rep2(i, n) for (int i = 0; i < (n); ++i)
#define rep3(i, l, r) for (int i = (l); i < (r); ++i)
#define rep(...) rep_override(__VA_ARGS__, rep3, rep2)(__VA_ARGS__)
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size(... | replace | 71 | 72 | 71 | 72 | 0 | |
p02648 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define _repargs(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#defi... | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define _repargs(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#defi... | replace | 42 | 43 | 42 | 43 | TLE | |
p02648 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long n;
cin >> n;
vector<int> vs(n);
vector<int> ws(n);
for (int i = 0; i < n; i++) {
cin >> vs[i] >> ws[i];
}
int q;
cin >> q;
vector<vector<pair<int, int>>> rek(n);
int han ... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
long long n;
cin >> n;
vector<int> vs(n);
vector<int> ws(n);
for (int i = 0; i < n; i++) {
cin >> vs[i] >> ws[i];
}
int q;
cin >> q;
vector<vector<pair<int, int>>> rek(n);
int han ... | replace | 19 | 20 | 19 | 20 | TLE | |
p02648 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll N;
vector<ll> V, W;
ll Q;
const ll K = 9, L = 100000;
ll I;
vector<vector<ll>> Dp;
vector<pair<ll, ll>> C;
ll solve(ll i, ll l) {
C.clear();
C.push_back({l, 0});
while (i > I) {
ll n = C.size();
for (ll k = 0; k < n; ++k) {
ll... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll N;
vector<ll> V, W;
ll Q;
const ll K = 9, L = 100000;
ll I;
vector<vector<ll>> Dp;
vector<pair<ll, ll>> C;
ll solve(ll i, ll l) {
C.clear();
C.push_back({l, 0});
while (i > I) {
ll n = C.size();
for (ll k = 0; k < n; ++k) {
ll... | replace | 22 | 23 | 22 | 23 | 0 | |
p02648 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
// #include <atcoder/all>
#define For(i, a, b) for (int(i) = (int)(a); (i) < (int)(b); ++(i))
#define rFor(i, a, b) for (int(i) = (int)(a)-1; (i) >= (int)(b); --(i))
#define rep(i, n) For((i), 0, (n))
#define rrep(i, n) rFor((i), (n), 0)
#define fi first
#define se second
using namespace std;
... | #include <bits/stdc++.h>
// #include <atcoder/all>
#define For(i, a, b) for (int(i) = (int)(a); (i) < (int)(b); ++(i))
#define rFor(i, a, b) for (int(i) = (int)(a)-1; (i) >= (int)(b); --(i))
#define rep(i, n) For((i), 0, (n))
#define rrep(i, n) rFor((i), (n), 0)
#define fi first
#define se second
using namespace std;
... | replace | 43 | 44 | 43 | 44 | TLE | |
p02648 | C++ | Runtime Error | #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define SZ(x) ((int)x.size())
#define FOR(i, a, b) for (int i = a; i <= b; ++i)
#define FORD(i, a, b) for (int i = a; i >= b; --i)
using namespace std;
typedef long long LL;
typedef pair<int, int> pa;
typedef vector<in... | #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define SZ(x) ((int)x.size())
#define FOR(i, a, b) for (int i = a; i <= b; ++i)
#define FORD(i, a, b) for (int i = a; i >= b; --i)
using namespace std;
typedef long long LL;
typedef pair<int, int> pa;
typedef vector<in... | insert | 36 | 36 | 36 | 37 | -11 | |
p02648 | C++ | Memory Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>... | replace | 29 | 30 | 29 | 30 | MLE | |
p02648 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
using item = pair<int, int>;
constexpr int Wmax = 100'000;
constexpr int Dmax = 18;
constexpr int Dhalf = Dmax / 2;
ios_base::sync_with_stdio(false);
cin.tie(0);
int N;
cin >> N;
vector<item> data(N + 1);
for (int v = 1; v <= N; v++) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
using item = pair<int, int>;
constexpr int Wmax = 100'000;
constexpr int Dmax = 18;
constexpr int Dhalf = 10;
ios_base::sync_with_stdio(false);
cin.tie(0);
int N;
cin >> N;
vector<item> data(N + 1);
for (int v = 1; v <= N; v++) {
cin... | replace | 7 | 8 | 7 | 8 | TLE | |
p02648 | C++ | Runtime Error | #include <cstdio>
#include <cstring>
#include <iostream>
#include <vector>
#define MAXN 515
#define MAXL 100005
using namespace std;
int dp[MAXN][MAXL];
int main() {
int n;
scanf("%d", &n);
vector<int> v(n + 1), w(n + 1);
for (int i = 1; i <= n; ++i)
scanf("%d%d", &v[i], &w[i]);
memset(dp, 0, sizeof(dp))... | #include <cstdio>
#include <cstring>
#include <iostream>
#include <vector>
#define MAXN 515
#define MAXL 100005
using namespace std;
int dp[MAXN][MAXL];
int main() {
int n;
scanf("%d", &n);
vector<int> v(n + 1), w(n + 1);
for (int i = 1; i <= n; ++i)
scanf("%d%d", &v[i], &w[i]);
memset(dp, 0, sizeof(dp))... | replace | 42 | 44 | 42 | 44 | -11 | |
p02648 | C++ | Runtime Error | // clang-format off
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(int i=0;i<(int)(n);++i)
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define fi first
#define se second
#define dbg(x) cout<<#x" = "<<((x))<<endl
template<class T,class U> ostream& operator<<(ostrea... | // clang-format off
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(int i=0;i<(int)(n);++i)
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define fi first
#define se second
#define dbg(x) cout<<#x" = "<<((x))<<endl
template<class T,class U> ostream& operator<<(ostrea... | replace | 14 | 15 | 14 | 15 | 0 | |
p02648 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, n) for (int i = 1; i < (int)(n); i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define vout(x) rep(i, x.size()) cout << x[i] << " "
template <class T> bool chmin(T &a, T b) {
if (a > b) {
a =... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, n) for (int i = 1; i < (int)(n); i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define vout(x) rep(i, x.size()) cout << x[i] << " "
template <class T> bool chmin(T &a, T b) {
if (a > b) {
a =... | replace | 31 | 32 | 31 | 32 | TLE | |
p02648 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
typedef long long ll;
int n, Q;
#define Maxn 100010
int V[Maxn * 10], W[Maxn * 10];
int f[512][100010];
int seq1[Maxn], seq2[Maxn], cnt;
int to[Maxn];
int val1[Maxn], val2[Maxn];
void dfs(int u) {
if (u >= 512)
retu... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
typedef long long ll;
int n, Q;
#define Maxn 100010
int V[Maxn * 10], W[Maxn * 10];
int f[512][100010];
int seq1[Maxn], seq2[Maxn], cnt;
int to[Maxn];
int val1[Maxn], val2[Maxn];
void dfs(int u) {
if (u >= 512)
retu... | replace | 46 | 47 | 46 | 47 | TLE | |
p02648 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, n) for (int i = 1; i < (int)(n); i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define vout(x) rep(i, x.size()) cout << x[i] << " "
template <class T> bool chmin(T &a, T b) {
if (a > b) {
a =... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, n) for (int i = 1; i < (int)(n); i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define vout(x) rep(i, x.size()) cout << x[i] << " "
template <class T> bool chmin(T &a, T b) {
if (a > b) {
a =... | replace | 31 | 32 | 31 | 32 | TLE | |
p02648 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vl = vector<ll>;
template <class T> using vc = vector<T>;
template <class T> using vvc = vector<vector<T>>;
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (ll i = 0; i < (n); i++)
#def... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vl = vector<ll>;
template <class T> using vc = vector<T>;
template <class T> using vvc = vector<vector<T>>;
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (ll i = 0; i < (n); i++)
#def... | replace | 71 | 72 | 71 | 72 | 0 | |
p02648 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int N = 2e5 + 10, mod = 1e9 + 7, M = 1e5;
vector<pii> Q[N], vals, vals2;
int w[N], val[N], n;
ll dp[M + 10], ans[N];
void dfs(int v, int h) {
int num = 0;
if (h < 9) {
int n = vals.size();
vals.push_bac... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int N = 3e5 + 10, mod = 1e9 + 7, M = 1e5;
vector<pii> Q[N], vals, vals2;
int w[N], val[N], n;
ll dp[M + 10], ans[N];
void dfs(int v, int h) {
int num = 0;
if (h < 9) {
int n = vals.size();
vals.push_bac... | replace | 6 | 7 | 6 | 7 | 0 | |
p02648 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int MAXN = 3e5 + 5;
const int MAXV = 1e5 + 5;
const int MAXM = 1 << 9;
typedef long long ll;
template <typename T> void chkmax(T &x, T y) { x = max(x, y); }
template <typename T> void chkmin(T &x, T y) { x = min(x, y); }
template <typename T> void read(T &x) {
x = 0... | #include <bits/stdc++.h>
using namespace std;
const int MAXN = 3e5 + 5;
const int MAXV = 1e5 + 5;
const int MAXM = 1 << 9;
typedef long long ll;
template <typename T> void chkmax(T &x, T y) { x = max(x, y); }
template <typename T> void chkmin(T &x, T y) { x = min(x, y); }
template <typename T> void read(T &x) {
x = 0... | replace | 32 | 33 | 32 | 33 | -11 | |
p02648 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using lint = long long;
const lint inf = 1LL << 60;
const lint mod = 1000000007;
template <class T> bool chmax(T &a, const T &b) {
return (a < b) ? (a = b, 1) : 0;
}
template <class T> bool chmin(T &a, const T &b) {
return (b < a) ? (a = b, 1) : 0;
}
int main() {
ci... | #include <bits/stdc++.h>
using namespace std;
using lint = long long;
const lint inf = 1LL << 60;
const lint mod = 1000000007;
template <class T> bool chmax(T &a, const T &b) {
return (a < b) ? (a = b, 1) : 0;
}
template <class T> bool chmin(T &a, const T &b) {
return (b < a) ? (a = b, 1) : 0;
}
int main() {
ci... | replace | 68 | 69 | 68 | 69 | TLE | |
p02648 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using int64 = long long;
constexpr int DEBUG = 0;
constexpr int MAX_W = 100000;
constexpr int MAX_D = 9;
template <typename T>
vector<vector<T>> Make2DVector(int d1, int d2, T default_value) {
return vector<vector<T>>(d1, vector<T>(d2, default_value));
}
template <cla... | #include <bits/stdc++.h>
using namespace std;
using int64 = long long;
constexpr int DEBUG = 0;
constexpr int MAX_W = 100000;
constexpr int MAX_D = 12;
template <typename T>
vector<vector<T>> Make2DVector(int d1, int d2, T default_value) {
return vector<vector<T>>(d1, vector<T>(d2, default_value));
}
template <cl... | replace | 7 | 8 | 7 | 8 | TLE | |
p02648 | 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;
typedef pair<int, int> P;
const int MOD = 1000000007;
const int INF = 0x3f3f3f3f;
const ll INFL = 0x3f3f3f3f3f3f3f3f;
int V[1 << 18], W[1 << 18];
vector<P> vv[1 << 18];
int dep(int v) {
int cnt = 0;
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int MOD = 1000000007;
const int INF = 0x3f3f3f3f;
const ll INFL = 0x3f3f3f3f3f3f3f3f;
int V[1 << 18], W[1 << 18];
vector<P> vv[1 << 18];
int dep(int v) {
int cnt = 0;
... | replace | 26 | 27 | 26 | 27 | TLE | |
p02648 | C++ | Time Limit Exceeded | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#incl... | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#incl... | replace | 68 | 69 | 68 | 69 | TLE | |
p02648 | C++ | Time Limit Exceeded | #define _USE_MATH_DEFIMES
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cctype>
#include <climits>
#include <clocale>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <ioman... | #define _USE_MATH_DEFIMES
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cctype>
#include <climits>
#include <clocale>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <ioman... | replace | 91 | 93 | 91 | 92 | TLE | |
p02648 | C++ | Time Limit Exceeded | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
const int L = 101010;
int n, q;
vector<vector<pair<int, int>>> query;
vector<int> ans, v, w;
vector<vector<int>> dp;
vector<int> vals, weights;
void dfs(int cur, int d) {
if (cur > n)
return;
if (d <= 8) {
vector<int> nxt(L);
for (i... | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
const int L = 101010;
int n, q;
vector<vector<pair<int, int>>> query;
vector<int> ans, v, w;
vector<vector<int>> dp;
vector<int> vals, weights;
void dfs(int cur, int d) {
if (cur > n)
return;
if (d <= 9) {
vector<int> nxt(L);
for (i... | replace | 12 | 13 | 12 | 13 | TLE | |
p02648 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, m, n) for (int(i) = (int)(m); i < (int)(n); ++i)
#define rep2(i, m, n) for (int(i) = (int)(n)-1; i >= (int)(m); --i)
#define REP(i, n) rep(i, 0, n)
#define REP2(i, n) rep2(i, 0, n)
#define all(hoge) (hoge).begin(), (hoge).end()
#define en '\n'
using ll = lon... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, m, n) for (int(i) = (int)(m); i < (int)(n); ++i)
#define rep2(i, m, n) for (int(i) = (int)(n)-1; i >= (int)(m); --i)
#define REP(i, n) rep(i, 0, n)
#define REP2(i, n) rep2(i, 0, n)
#define all(hoge) (hoge).begin(), (hoge).end()
#define en '\n'
using ll = lon... | replace | 67 | 68 | 67 | 69 | -11 | |
p02648 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
// #define ll long long
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
// #define ll long long
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1... | replace | 57 | 58 | 57 | 58 | -6 | terminate called after throwing an instance of 'std::bad_alloc'
what(): std::bad_alloc
|
p02648 | C++ | Runtime Error | #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 <valarray>
#include <vector>... | #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 <valarray>
#include <vector>... | replace | 251 | 252 | 251 | 252 | 0 | |
p02648 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define SELECTER(_1, _2, _3, SELECT, ...) SELECT
#define REP1(i, n) for (int i = 0; (i) < (n); (i)++)
#define REP2(i, a, b) for (int i = (a); (i) < (b); (i)++)
#define REP(...) SELECTER(__VA_ARGS__, REP2, REP1, )(__VA_ARGS__)
template <class T> ostream &operator<<(ostream ... | #include <bits/stdc++.h>
using namespace std;
#define SELECTER(_1, _2, _3, SELECT, ...) SELECT
#define REP1(i, n) for (int i = 0; (i) < (n); (i)++)
#define REP2(i, a, b) for (int i = (a); (i) < (b); (i)++)
#define REP(...) SELECTER(__VA_ARGS__, REP2, REP1, )(__VA_ARGS__)
template <class T> ostream &operator<<(ostream ... | replace | 30 | 31 | 30 | 31 | -11 | |
p02648 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
const int MX = 1e5 + 5;
vector<vector<int>> dp(512, vector<int>(MX));
int main() {
ios::sync_with_stdio(false);
cin.tie(0), cout.tie(0);
int n, q;
cin >> n;
vecto... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
const int MX = 1e5 + 5;
vector<vector<int>> dp(512, vector<int>(MX));
int main() {
ios::sync_with_stdio(false);
cin.tie(0), cout.tie(0);
int n, q;
cin >> n;
vecto... | replace | 30 | 31 | 30 | 31 | TLE | |
p02648 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
#define N (1 << 19)
#define M 100005
#define K (1 << 8)
LL n, m, q, a[N], b[N], c[N], f[K + 5][M];
int main() {
scanf("%lld", &n);
for (LL i = 1; i <= n; ++i) {
scanf("%lld%lld", a + i, b + i);
}
m = 100000;
for (LL i = 1; i <= K && i... | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
#define N (1 << 19)
#define M 100005
#define K (1 << 9)
LL n, m, q, a[N], b[N], c[N], f[K + 5][M];
int main() {
scanf("%lld", &n);
for (LL i = 1; i <= n; ++i) {
scanf("%lld%lld", a + i, b + i);
}
m = 100000;
for (LL i = 1; i <= K && i... | replace | 7 | 8 | 7 | 8 | TLE | |
p02648 | C++ | Runtime Error | #include <bits/stdc++.h>
// #include <boost/multiprecision/cpp_int.hpp>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
#pragma GCC optimize("O3")
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPP(i, n) for (int i = 1; i <= n; i++)
#define ALL(obj) (obj).begin(), (obj).end()... | #include <bits/stdc++.h>
// #include <boost/multiprecision/cpp_int.hpp>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
#pragma GCC optimize("O3")
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPP(i, n) for (int i = 1; i <= n; i++)
#define ALL(obj) (obj).begin(), (obj).end()... | replace | 79 | 80 | 79 | 83 | -11 | |
p02648 | C++ | Time Limit Exceeded | // >>> TEMPLATES
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using i32 = int32_t;
using i64 = int64_t;
using u32 = uint32_t;
using u64 = uint64_t;
#define int ll
#define double ld
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <=... | // >>> TEMPLATES
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using i32 = int32_t;
using i64 = int64_t;
using u32 = uint32_t;
using u64 = uint64_t;
#define int ll
#define double ld
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <=... | replace | 149 | 150 | 149 | 150 | TLE | |
p02648 | C++ | Runtime Error | #pragma GCC target("sse,sse2,sse3,sse4,sse4.1,sse4.2,avx,avx2")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define all(x) x.begin(), x.end()
template <typename T1, typename T2> inline void chkmin(T1 &x, const T2 &y) {
if (x > y)
x ... | #pragma GCC target("sse,sse2,sse3,sse4,sse4.1,sse4.2,avx,avx2")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define all(x) x.begin(), x.end()
template <typename T1, typename T2> inline void chkmin(T1 &x, const T2 &y) {
if (x > y)
x ... | replace | 191 | 192 | 191 | 192 | 0 | |
p02648 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define Sz(a) ((int)(a).size())
const int maxn = 200009;
const int MOD = 1e9 + 7;
int V[maxn], W[maxn], n, q, dp[555][100009];
int main() {
#ifdef DEBUG
freopen("a.in", "r", stdin);
#endif
ios_base::sync_with_stdio(false);
cout.tie(0);
cin.tie(0);
cin >> n;
for ... | #include <bits/stdc++.h>
using namespace std;
#define Sz(a) ((int)(a).size())
const int maxn = 1 << 19;
const int MOD = 1e9 + 7;
int V[maxn], W[maxn], n, q, dp[555][100009];
int main() {
#ifdef DEBUG
freopen("a.in", "r", stdin);
#endif
ios_base::sync_with_stdio(false);
cout.tie(0);
cin.tie(0);
cin >> n;
for... | replace | 3 | 4 | 3 | 4 | -11 | |
p02648 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using vi = vector<int>;
using vl = vector<long>;
using vvl = vector<vector<long>>;
using pll = pair<long, long>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
long K = 9;
long D = 512;
vvl dp(D + 1, vl(100010, 0));
vector<long> V(262144, 0), W(262144, 1e6);
void d... | #include <bits/stdc++.h>
using namespace std;
using vi = vector<int>;
using vl = vector<long>;
using vvl = vector<vector<long>>;
using pll = pair<long, long>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
long K = 9;
long D = 512;
vvl dp(D + 1, vl(100010, 0));
vector<long> V(262144, 0), W(262144, 1e6);
void d... | insert | 42 | 42 | 42 | 44 | TLE | |
p02648 | C++ | Time Limit Exceeded | #include "bits/stdc++.h"
#include "ext/pb_ds/assoc_container.hpp"
#include "ext/pb_ds/tree_policy.hpp"
#include "ext/rope"
using namespace std;
using namespace chrono;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
mt19937 rng(high_resolution_clock::now().time_since_epoch().count());
mt19937_64 rngll(high_resol... | #include "bits/stdc++.h"
#include "ext/pb_ds/assoc_container.hpp"
#include "ext/pb_ds/tree_policy.hpp"
#include "ext/rope"
using namespace std;
using namespace chrono;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
mt19937 rng(high_resolution_clock::now().time_since_epoch().count());
mt19937_64 rngll(high_resol... | replace | 32 | 33 | 32 | 33 | TLE | |
p02648 | C++ | Time Limit Exceeded | #include "bits/stdc++.h"
#include "ext/pb_ds/assoc_container.hpp"
#include "ext/pb_ds/tree_policy.hpp"
#include "ext/rope"
using namespace std;
using namespace chrono;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
mt19937 rng(high_resolution_clock::now().time_since_epoch().count());
mt19937_64 rngll(high_resol... | #include "bits/stdc++.h"
#include "ext/pb_ds/assoc_container.hpp"
#include "ext/pb_ds/tree_policy.hpp"
#include "ext/rope"
using namespace std;
using namespace chrono;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
mt19937 rng(high_resolution_clock::now().time_since_epoch().count());
mt19937_64 rngll(high_resol... | replace | 33 | 34 | 33 | 34 | TLE |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.