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++ | Runtime Error | /**
* created: 13.06.2020 21:08:42
**/
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
using namespace std;
signed main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
int n, k;
cin >> n >> k;
vector<int> a(n);
... | /**
* created: 13.06.2020 21:08:42
**/
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
using namespace std;
signed main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
int n, k;
cin >> n >> k;
vector<int> a(n);
... | replace | 16 | 17 | 16 | 17 | 0 | |
p02647 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> inp(n + 1, 0);
for (int i = 1; i <= n; i++) {
cin >> inp.at(i);
// inp.at(i) = 0;
}
vector<int> data(n + 2, 0);
if (k >= 3000) {
k = 3000;
}
for (int j = 0; j < k; j++) {
for (int i = 1... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<int> inp(n + 1, 0);
for (int i = 1; i <= n; i++) {
cin >> inp.at(i);
// inp.at(i) = 0;
}
vector<int> data(n + 2, 0);
if (k >= 2000) {
k = 2000;
}
for (int j = 0; j < k; j++) {
for (int i = 1... | replace | 15 | 17 | 15 | 17 | TLE | |
p02647 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
typedef tree<ii, null_type, less<ii>, rb_tree_tag,
tree_order_statistics_node_update>
indexed_set;
bool done(vector<int> &A, int N) {
f... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
typedef tree<ii, null_type, less<ii>, rb_tree_tag,
tree_order_statistics_node_update>
indexed_set;
bool done(vector<int> &A, int N) {
f... | replace | 19 | 20 | 19 | 20 | TLE | |
p02647 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define li long long int
#define rep(i, to) for (li i = 0; i < ((li)(to)); i++)
#define repp(i, start, to) for (li i = (li)(start); i < ((li)(to)); i++)
#define pb push_back
#define sz(v) ((li)(v).size())
#define bgn(v) ((v).begin())
#define eend(v) ((v).end())
#define all... | #include <bits/stdc++.h>
using namespace std;
#define li long long int
#define rep(i, to) for (li i = 0; i < ((li)(to)); i++)
#define repp(i, start, to) for (li i = (li)(start); i < ((li)(to)); i++)
#define pb push_back
#define sz(v) ((li)(v).size())
#define bgn(v) ((v).begin())
#define eend(v) ((v).end())
#define all... | insert | 103 | 103 | 103 | 113 | TLE | |
p02647 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = (a), i##end = (b); i <= i##end; ++i)
#define per(i, a, b) for (int i = (a), i##end = (b); i >= i##end; --i)
mt19937 Rnd(chrono::high_resolution_clock::now().time_since_epoch().count());
template <typename T> inline void chkmax(T &x, T y)... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = (a), i##end = (b); i <= i##end; ++i)
#define per(i, a, b) for (int i = (a), i##end = (b); i >= i##end; --i)
mt19937 Rnd(chrono::high_resolution_clock::now().time_since_epoch().count());
template <typename T> inline void chkmax(T &x, T y)... | insert | 41 | 41 | 41 | 42 | 0 | |
p02647 | C++ | Time Limit Exceeded | #include <algorithm>
#include <complex>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define REP(i, m, n) for (int i... | #include <algorithm>
#include <complex>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define REP(i, m, n) for (int i... | insert | 83 | 83 | 83 | 90 | TLE | |
p02647 | Python | Time Limit Exceeded | from itertools import accumulate
def main():
number, operations = [int(x) for x in input().split()]
dists = [int(x) for x in input().split()]
for ope_count in range(operations):
temp = [0] * (number + 1)
for i, v in enumerate(dists):
left = max(i - v, 0)
right = mi... | from itertools import accumulate
def main():
number, operations = [int(x) for x in input().split()]
dists = [int(x) for x in input().split()]
for ope_count in range(operations):
temp = [0] * (number + 1)
for i, v in enumerate(dists):
left = max(i - v, 0)
right = mi... | delete | 16 | 17 | 16 | 16 | TLE | |
p02647 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep2(x, fr, to) for (int x = (fr); x < (to); x++)
#define rep(x, to) for (int x = 0; x < (to); x++)
#define repr(x, fr, to) for (int x = (fr); x >= (to); x--)
#define all(c) c.begin(), c.end()
#define sz(v) (int)v.size()
using namespace std;
typedef long long ll;
typedef vector<int> V... | #include <bits/stdc++.h>
#define rep2(x, fr, to) for (int x = (fr); x < (to); x++)
#define rep(x, to) for (int x = 0; x < (to); x++)
#define repr(x, fr, to) for (int x = (fr); x >= (to); x--)
#define all(c) c.begin(), c.end()
#define sz(v) (int)v.size()
using namespace std;
typedef long long ll;
typedef vector<int> V... | insert | 46 | 46 | 46 | 48 | TLE | |
p02647 | C++ | Time Limit Exceeded | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define pll pair<ll, ll>
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define ios ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#d... | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define pll pair<ll, ll>
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define ios ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#d... | replace | 52 | 53 | 52 | 53 | TLE | |
p02647 | C++ | Time Limit Exceeded | #include <algorithm>
#include <assert.h>
#include <climits>
#include <cmath>
#include <iostream>
#include <queue>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
constexpr int64_t MOD = 1e9 + 7;
int main() {
std::cin.tie(0);
std::ios::sync_with_stdio(false);
int32_t N, K... | #include <algorithm>
#include <assert.h>
#include <climits>
#include <cmath>
#include <iostream>
#include <queue>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
constexpr int64_t MOD = 1e9 + 7;
int main() {
std::cin.tie(0);
std::ios::sync_with_stdio(false);
int32_t N, K... | insert | 39 | 39 | 39 | 41 | TLE | |
p02647 | C++ | Runtime Error | #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define forn(i, a, b) for (int i = a; i < b; i++)
#define fi first
#define se second
#define fast ios_base::sync_with_stdio(false);
using namespace std;
typedef long long int ll;
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef pair<ll, ll> ... | #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define forn(i, a, b) for (int i = a; i < b; i++)
#define fi first
#define se second
#define fast ios_base::sync_with_stdio(false);
using namespace std;
typedef long long int ll;
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef pair<ll, ll> ... | replace | 21 | 22 | 21 | 22 | -6 | terminate called after throwing an instance of 'std::bad_alloc'
what(): std::bad_alloc
|
p02647 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <utility>
#include <vector>
#define INF 1e16
#define N (1000000007)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<ll, P> Q;
ll s... | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <utility>
#include <vector>
#define INF 1e16
#define N (1000000007)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<ll, P> Q;
ll s... | insert | 36 | 36 | 36 | 43 | TLE | |
p02647 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define m_p make_pair
#define all(x) (x).begin(), (x).end()
#define sz(x) ((int)(x).size())
#define fi first
#define se second
typedef long long ll;
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
mt19937 rnf(2106);
const int N = 200005;
int n, k;
int ... | #include <bits/stdc++.h>
using namespace std;
#define m_p make_pair
#define all(x) (x).begin(), (x).end()
#define sz(x) ((int)(x).size())
#define fi first
#define se second
typedef long long ll;
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
mt19937 rnf(2106);
const int N = 200005;
int n, k;
int ... | insert | 41 | 41 | 41 | 43 | TLE | |
p02647 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 200005;
ll n, k;
array<ll, N> old, nw;
bitset<N> used;
int main() {
cin.sync_with_stdio(0);
cin.tie(0);
cin >> n >> k;
vector<ll> a(n);
for (auto &i : a)
cin >> i;
for (int i = 0; i < n; ++i) {
old[max(0ll, i - a[i]... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 200005;
ll n, k;
array<ll, N> old, nw;
bitset<N> used;
int main() {
cin.sync_with_stdio(0);
cin.tie(0);
cin >> n >> k;
vector<ll> a(n);
for (auto &i : a)
cin >> i;
for (int i = 0; i < n; ++i) {
old[max(0ll, i - a[i]... | insert | 30 | 30 | 30 | 34 | 0 | |
p02647 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <stdio.h>
#include <string>
#include <unordered_map>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define repn(i, n) for (int i = 1; i <= n; i++)
#define repr(e, x) f... | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <stdio.h>
#include <string>
#include <unordered_map>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define repn(i, n) for (int i = 1; i <= n; i++)
#define repr(e, x) f... | insert | 35 | 35 | 35 | 39 | TLE | |
p02647 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int n, k;
int a[200010];
int cf[200010];
int fir;
int main() {
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> a[i];
if (a[i] >= i - 1) {
fir++;
}
if (i - a[i] >= 2) {
cf[i - a[i]]++;
}
if (i + a[i] + 1 <= n) {
cf[i + a[i] ... | #include <bits/stdc++.h>
using namespace std;
int n, k;
int a[200010];
int cf[200010];
int fir;
int main() {
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> a[i];
if (a[i] >= i - 1) {
fir++;
}
if (i - a[i] >= 2) {
cf[i - a[i]]++;
}
if (i + a[i] + 1 <= n) {
cf[i + a[i] ... | insert | 28 | 28 | 28 | 29 | TLE | |
p02647 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> P;
ll a[212345], b[212345];
int main() {
ll n, k;
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < k; i++) {
for (int m = 0; m < n + 1; m++) {
b[m] = 0;
}
for (... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> P;
ll a[212345], b[212345];
int main() {
ll n, k;
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
if (pow(2, k - 50) > n) {
for (int i = 0; i < n; i++) {
cout << n << " ";
}
return... | replace | 14 | 15 | 14 | 20 | TLE | |
p02647 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, k;
cin >> n >> k;
vector<int> a(n);
for (int i = 0; i < n; i++)
cin >> a.at(i);
// naive
for (int i = 1; i <= k; i++) {
vector<int> imos(n + 1, 0);
for (int j = 0; j < n; j++) {
int pp = max(0, j - a.a... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, k;
cin >> n >> k;
vector<int> a(n);
for (int i = 0; i < n; i++)
cin >> a.at(i);
// naive
for (int i = 1; i <= k; i++) {
vector<int> imos(n + 1, 0);
for (int j = 0; j < n; j++) {
int pp = max(0, j - a.a... | insert | 21 | 21 | 21 | 30 | TLE | |
p02647 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int sz = 1e5 + 5;
int a[sz], b[sz];
int main() {
int n, k;
cin >> n >> k;
for (int i = 0; i < n; i++)
scanf("%d", &a[i]);
while (k--) {
for (int i = 0; i < n; i++) {
int x = max(0, i - a[i]);
int y = min(n, i + a[i] ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int sz = 2e5 + 5;
int a[sz], b[sz];
int main() {
int n, k;
cin >> n >> k;
for (int i = 0; i < n; i++)
scanf("%d", &a[i]);
while (k--) {
for (int i = 0; i < n; i++) {
int x = max(0, i - a[i]);
int y = min(n, i + a[i] ... | replace | 3 | 4 | 3 | 4 | 0 | |
p02647 | C++ | Time Limit Exceeded | /*
* Since g++10 is released, some characters is not valid inside #if 0 :(
* So, why not using clang++? :D
* Date:
echo -n ' ' && date +%Y.%m.%d # Just Run this (Type !!sh in Vim).
* Solution:
To be updated after "Accept".
* Digression:
* CopyRight:
▁▃▄▄▄▃▃▃▃▄▶
▗▇▀▔ ▔▔▔▔
▄▛ ... | /*
* Since g++10 is released, some characters is not valid inside #if 0 :(
* So, why not using clang++? :D
* Date:
echo -n ' ' && date +%Y.%m.%d # Just Run this (Type !!sh in Vim).
* Solution:
To be updated after "Accept".
* Digression:
* CopyRight:
▁▃▄▄▄▃▃▃▃▄▶
▗▇▀▔ ▔▔▔▔
▄▛ ... | replace | 59 | 60 | 59 | 60 | TLE | |
p02647 | 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 | 47 | 51 | 47 | 53 | TLE | |
p02647 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
typedef long long lint;
using namespace std;
lint gcd(lint x, lint y) {
if (x == 0) {
return y;
} else {
return gcd(y % x, x);
}
}
lint lcm(lint x, lint y) { return x / gcd(x, y) * y; }
lint C(lint n, lint k) {
if (n == k) {
return 1;
} else if (n < k) {
return 0;
... | #include <bits/stdc++.h>
typedef long long lint;
using namespace std;
lint gcd(lint x, lint y) {
if (x == 0) {
return y;
} else {
return gcd(y % x, x);
}
}
lint lcm(lint x, lint y) { return x / gcd(x, y) * y; }
lint C(lint n, lint k) {
if (n == k) {
return 1;
} else if (n < k) {
return 0;
... | insert | 53 | 53 | 53 | 63 | TLE | |
p02647 | C++ | Runtime Error | #include <bits/stdc++.h>
#define int 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 F first
#define S second
using namespace std;
typedef pair<int, int> P;
const int MOD = 1000000007;
int INF = 100100100100100;
int a[100010];
int imos[... | #include <bits/stdc++.h>
#define int 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 F first
#define S second
using namespace std;
typedef pair<int, int> P;
const int MOD = 1000000007;
int INF = 100100100100100;
int a[200010];
int imos[... | replace | 13 | 15 | 13 | 15 | 0 | |
p02647 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define ull unsigned long long
#define ld long double
#define vi vector<int>
#define vll vector<ll>
#define vc vector<char>
#define vs vector<string>
#define vpii ve... | #include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define ull unsigned long long
#define ld long double
#define vi vector<int>
#define vll vector<ll>
#define vc vector<char>
#define vs vector<string>
#define vpii ve... | replace | 59 | 60 | 59 | 60 | TLE | |
p02647 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template <typename T1, typename T2> bool chmin(T1 &a, T2 b) {
if (a <= b)
return 0;
a = b;
return 1;
}
template <typename T1, typename T2> bool chmax(T1 &a, T2 b) {
if (a >= b)
return 0;
a = b;
return 1;
}
int dx[4] = {0, 1, 0, -1};... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template <typename T1, typename T2> bool chmin(T1 &a, T2 b) {
if (a <= b)
return 0;
a = b;
return 1;
}
template <typename T1, typename T2> bool chmax(T1 &a, T2 b) {
if (a >= b)
return 0;
a = b;
return 1;
}
int dx[4] = {0, 1, 0, -1};... | replace | 39 | 40 | 39 | 40 | TLE | |
p02647 | C++ | Time Limit Exceeded | #define rep(i, n) for (int i = 0; i < (int)(n); i++)
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N;
cin >> K;
vector<int> A(N);
vector<int> flash;
for (int i = 0; i < N; i++) {
cin >> A.at(i);
}
rep(iterate, K) {
flash = vector<int>(N, 0);
rep(i, N) {
i... | #define rep(i, n) for (int i = 0; i < (int)(n); i++)
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, K;
cin >> N;
cin >> K;
vector<int> A(N);
vector<int> flash;
for (int i = 0; i < N; i++) {
cin >> A.at(i);
}
rep(iterate, K) {
flash = vector<int>(N, 0);
rep(i, N) {
i... | insert | 32 | 32 | 32 | 35 | TLE | |
p02647 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#include <cassert>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define PI 3.14159265358979
using namespace std;
using ll = long long;
using P = pair<int, int>;
struct Edge {
int to;
int weight;
Edge(int t, int w) : to(t), weight(w) {}
};
// using Graph = vector<vector<Edge>>;
using Gr... | #include <bits/stdc++.h>
#include <cassert>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define PI 3.14159265358979
using namespace std;
using ll = long long;
using P = pair<int, int>;
struct Edge {
int to;
int weight;
Edge(int t, int w) : to(t), weight(w) {}
};
// using Graph = vector<vector<Edge>>;
using Gr... | replace | 47 | 48 | 47 | 48 | TLE | |
p02647 | C++ | Time Limit Exceeded | #include <algorithm>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define ll long long
using namespace std;
long long MOD = 1000000007;
template <typename T> void cout_vec(vector<T> &v... | #include <algorithm>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define ll long long
using namespace std;
long long MOD = 1000000007;
template <typename T> void cout_vec(vector<T> &v... | replace | 48 | 49 | 48 | 50 | TLE | |
p02647 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, s, n) for (int i = s; i < (int)(n); i++)
int main() {
int n, k;
cin >> n >> k;
vector<ll> a(n);
rep(i, 0, n) cin >> a[i];
rep(i, 0, k) {
vector<ll> imos(n, 0);
rep(j, 0, n) {
if (j - a[j] >= 0)
imos[j - a... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, s, n) for (int i = s; i < (int)(n); i++)
int main() {
int n, k;
cin >> n >> k;
vector<ll> a(n);
rep(i, 0, n) cin >> a[i];
rep(i, 0, k) {
vector<ll> imos(n, 0);
rep(j, 0, n) {
if (j - a[j] >= 0)
imos[j - a... | replace | 21 | 22 | 21 | 31 | TLE | |
p02647 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define pb push_back
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define ll long long
using namespace std;
const ll P = 1000000007;
const long long INF = 1LL << 60;
int gcd(in... | #include <bits/stdc++.h>
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define pb push_back
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define ll long long
using namespace std;
const ll P = 1000000007;
const long long INF = 1LL << 60;
int gcd(in... | replace | 43 | 44 | 43 | 44 | TLE | |
p02647 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define lvector vector<ll>
#define cvector vector<char>
#define svector vector<string>
#define lque queue<ll>
#define lpque priority_queue<ll>
#define dlpque priority_queue<ll, lvector, greater<ll>>
#define P pair<ll, ll>
#define ALL(a) a.begin(), a.end... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define lvector vector<ll>
#define cvector vector<char>
#define svector vector<string>
#define lque queue<ll>
#define lpque priority_queue<ll>
#define dlpque priority_queue<ll, lvector, greater<ll>>
#define P pair<ll, ll>
#define ALL(a) a.begin(), a.end... | replace | 36 | 37 | 36 | 37 | 0 | |
p02647 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
// typedef
// -----------------------------------------------------------------------------
typedef long long ll;
typedef long double ld;
// container util
// -----------------------------------------------------------------------------
#define ALL(c) (c).begin(), (c).end... | #include <bits/stdc++.h>
using namespace std;
// typedef
// -----------------------------------------------------------------------------
typedef long long ll;
typedef long double ld;
// container util
// -----------------------------------------------------------------------------
#define ALL(c) (c).begin(), (c).end... | insert | 38 | 38 | 38 | 39 | TLE | |
p02647 | C++ | Runtime Error | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, k;
cin >> n >> k;
auto upd = [](const vector<int> &v) {
vector<int> imos((int)v.size() + 2);
for (int i = 1; i <= (int)v.size(); i++) {
int l = max(0, i - v[i -... | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, k;
cin >> n >> k;
auto upd = [](const vector<int> &v) {
vector<int> imos((int)v.size() + 2);
for (int i = 1; i <= (int)v.size(); i++) {
int l = max(0, i - v[i -... | replace | 12 | 13 | 12 | 13 | 0 | |
p02647 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cstdio>
#include <memory.h>
using namespace std;
typedef long long ll;
ll bulb[300010];
ll bkt[300010];
ll operate(int n) {
memset(bkt, 0, sizeof bkt);
for (int i = 0; i < n; ++i) {
ll op1 = i - bulb[i];
ll op2 = i + bulb[i];
if (op1 < 0)
op1 = 0;
++bkt[op1];
... | #include <algorithm>
#include <cstdio>
#include <memory.h>
using namespace std;
typedef long long ll;
ll bulb[300010];
ll bkt[300010];
ll operate(int n) {
memset(bkt, 0, sizeof bkt);
for (int i = 0; i < n; ++i) {
ll op1 = i - bulb[i];
ll op2 = i + bulb[i];
if (op1 < 0)
op1 = 0;
++bkt[op1];
... | replace | 33 | 34 | 33 | 34 | TLE | |
p02647 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ls p << 1
#define rs p << 1 | 1
#define rgi register int
#define ll long long
#define pii pair<int, int>
#define mkp make_pair
#define fi first
#define se second
#define pb push_back
using namespace std;
const int maxn = 100005;
int n, m, a[maxn], b[maxn];
struct sgt {
int p, l, r;
... | #include <bits/stdc++.h>
#define ls p << 1
#define rs p << 1 | 1
#define rgi register int
#define ll long long
#define pii pair<int, int>
#define mkp make_pair
#define fi first
#define se second
#define pb push_back
using namespace std;
const int maxn = 200005;
int n, m, a[maxn], b[maxn];
struct sgt {
int p, l, r;
... | replace | 11 | 12 | 11 | 12 | 0 | |
p02647 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repA(i, n) for (int i = n; i >= 0; i--)
#define all(x) x.begin(), x.end()
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define sz(a) (ll)(a.size())
typedef long long ll;
typedef long dou... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repA(i, n) for (int i = n; i >= 0; i--)
#define all(x) x.begin(), x.end()
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define sz(a) (ll)(a.size())
typedef long long ll;
typedef long dou... | replace | 14 | 15 | 14 | 15 | -6 | terminate called after throwing an instance of 'std::bad_alloc'
what(): std::bad_alloc
|
p02647 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vl = vector<ll>;
using vi = vector<int>;
#define _GLIBCXX_DEBUG
#define IO_STREAM \
cin.tie(0); \
ios::sync_with_std... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vl = vector<ll>;
using vi = vector<int>;
#define _GLIBCXX_DEBUG
#define IO_STREAM \
cin.tie(0); \
ios::sync_with_std... | replace | 36 | 37 | 36 | 38 | TLE | |
p02647 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define MOD 1000000007LL
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int n, k;
int a[200005];
int sum[200005];
int main(void) {
scanf("%d%d", &n, &k);
for (int i = 0; i < n; i++) {
scanf("%lld", &a[i]);
}
for (int i = 0; i < k; i++) {
memset(sum, 0, si... | #include <bits/stdc++.h>
#define MOD 1000000007LL
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int n, k;
int a[200005];
int sum[200005];
int main(void) {
scanf("%d%d", &n, &k);
for (int i = 0; i < n; i++) {
scanf("%lld", &a[i]);
}
for (int i = 0; i < k; i++) {
memset(sum, 0, si... | insert | 23 | 23 | 23 | 25 | TLE | |
p02647 | C++ | Time Limit Exceeded | #include <cstdio>
#include <cstring>
#include <ctime>
#include <iostream>
#define re register
const int MAXN = 2e5 + 10;
int n, K, s[MAXN], a[MAXN], timee;
char fin[10010], *p1 = fin, *p2 = fin;
char getc() {
return p1 == p2 && (p2 = (p1 = fin) + fread(fin, 1, 10000, stdin), p1 == p2)
? EOF
... | #include <cstdio>
#include <cstring>
#include <ctime>
#include <iostream>
#define re register
const int MAXN = 2e5 + 10;
int n, K, s[MAXN], a[MAXN], timee;
char fin[10010], *p1 = fin, *p2 = fin;
char getc() {
return p1 == p2 && (p2 = (p1 = fin) + fread(fin, 1, 10000, stdin), p1 == p2)
? EOF
... | delete | 33 | 34 | 33 | 33 | TLE | |
p02647 | C++ | Time Limit Exceeded | #include <cstdio>
#include <cstring>
#include <ctime>
#include <iostream>
#define re register
const int MAXN = 2e5 + 10;
int n, K, s[MAXN], a[MAXN], timee;
char fin[10010], *p1 = fin, *p2 = fin;
char getc() {
return p1 == p2 && (p2 = (p1 = fin) + fread(fin, 1, 10000, stdin), p1 == p2)
? EOF
... | #include <cstdio>
#include <cstring>
#include <ctime>
#include <iostream>
#define re register
const int MAXN = 2e5 + 10;
int n, K, s[MAXN], a[MAXN], timee;
char fin[10010], *p1 = fin, *p2 = fin;
char getc() {
return p1 == p2 && (p2 = (p1 = fin) + fread(fin, 1, 10000, stdin), p1 == p2)
? EOF
... | delete | 33 | 34 | 33 | 33 | TLE | |
p02647 | C++ | Runtime Error | // #include<bits/stdc++.h>
#include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <vector>
/*
#include <boost/multiprecision/cpp_dec_float.hpp>
#include<boost/multiprecision/cpp_int.hpp>
#include <boost/rational.hpp>
namespace mp = boost::multiprecision;
using Real = mp::number<mp::cpp_dec... | // #include<bits/stdc++.h>
#include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <vector>
/*
#include <boost/multiprecision/cpp_dec_float.hpp>
#include<boost/multiprecision/cpp_int.hpp>
#include <boost/rational.hpp>
namespace mp = boost::multiprecision;
using Real = mp::number<mp::cpp_dec... | replace | 24 | 25 | 24 | 25 | 0 | |
p02647 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define FOR(i, start, end) for (int i = start; i <= end; i++)
const int INF = 1001001001;
typedef long long ll;
const ll MOD = 1000000007;
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define FOR(i, start, end) for (int i = start; i <= end; i++)
const int INF = 1001001001;
typedef long long ll;
const ll MOD = 1000000007;
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;... | replace | 61 | 62 | 61 | 62 | 0 | |
p02647 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#include <string>
typedef long long int ll;
typedef unsigned long long ull;
typedef long double ld;
#define F first
#define S second
#define pb push_back
#define pll pair<ll, ll>
#define pii pair<int, int>
#define len(s) s.length()
#define all(v) v.begin(), v.end()
const ll INF = LONG_MAX;
cons... | #include <bits/stdc++.h>
#include <string>
typedef long long int ll;
typedef unsigned long long ull;
typedef long double ld;
#define F first
#define S second
#define pb push_back
#define pll pair<ll, ll>
#define pii pair<int, int>
#define len(s) s.length()
#define all(v) v.begin(), v.end()
const ll INF = LONG_MAX;
cons... | insert | 67 | 67 | 67 | 68 | TLE | |
p02647 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr ll mod = 1e9 + 7;
int main() {
int n, k;
cin >> n >> k;
vector<int> a(n);
for (auto &&e : a) {
cin >> e;
}
for (int i = 0; i < k; ++i) {
vector<int> tmp(n, 0);
for (int j = 0; j < n; ++j) {
int l = max(0, j - a... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr ll mod = 1e9 + 7;
int main() {
int n, k;
cin >> n >> k;
vector<int> a(n);
for (auto &&e : a) {
cin >> e;
}
for (int i = 0; i < min(k, 100); ++i) {
vector<int> tmp(n, 0);
for (int j = 0; j < n; ++j) {
int l = ma... | replace | 13 | 14 | 13 | 14 | TLE | |
p02647 | C++ | Runtime Error | #include <algorithm>
#include <cassert>
#include <cfloat>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
... | #include <algorithm>
#include <cassert>
#include <cfloat>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
... | replace | 70 | 71 | 70 | 71 | 0 | |
p02647 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pa pair<int, int>
#define pal pair<long long, long long>
#define pali pair<long long, int>
#define pad pair<double, double>
#define pb push_back
#define mp make_pair
#define COUT(v) ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pa pair<int, int>
#define pal pair<long long, long long>
#define pali pair<long long, int>
#define pad pair<double, double>
#define pb push_back
#define mp make_pair
#define COUT(v) ... | replace | 197 | 199 | 197 | 199 | TLE | |
p02647 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define srep(i, n, m) for (int i = n; i < m; i++)
#define... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define srep(i, n, m) for (int i = n; i < m; i++)
#define... | replace | 36 | 37 | 36 | 37 | TLE | |
p02647 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define M_PI 3.14159265358979323846 // pi
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<ll> VI;
typedef pair<ll, ll> P;
typedef tuple<ll, ll, ll> t3;
typedef tuple<ll, ll, ll, ll> t4;
typedef tuple<ll, ll, ll, ll, ll> t5;
#define rep(a, n) for (ll ... | #include <bits/stdc++.h>
#define M_PI 3.14159265358979323846 // pi
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<ll> VI;
typedef pair<ll, ll> P;
typedef tuple<ll, ll, ll> t3;
typedef tuple<ll, ll, ll, ll> t4;
typedef tuple<ll, ll, ll, ll, ll> t5;
#define rep(a, n) for (ll ... | insert | 59 | 59 | 59 | 61 | TLE | |
p02647 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
// long long
using ll = long long;
// pair<int, int>
using PII = pair<int, int>;
// 最大値、mod
const int MOD = 1000000007;
const int mod = 998244353; // 1000000007;
const int INF = 1000000000;
const long long LINF = 1e18;
const int MAX = 510000;
// 出力系
#define print(x) cou... | #include <bits/stdc++.h>
using namespace std;
// long long
using ll = long long;
// pair<int, int>
using PII = pair<int, int>;
// 最大値、mod
const int MOD = 1000000007;
const int mod = 998244353; // 1000000007;
const int INF = 1000000000;
const long long LINF = 1e18;
const int MAX = 510000;
// 出力系
#define print(x) cou... | insert | 264 | 264 | 264 | 265 | TLE | |
p02647 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
const int N = 200010;
int n, m, minn = 1 << 30;
int a[N], sum[N];
int main() {
scanf("%d%d", &n, &m);
for (int k = 1; k <= n; k++)
scanf("%d", &a[k]), minn = min(minn, a[k]);
for (int k = 1; k <= m && minn < n; ... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
const int N = 200010;
int n, m, minn = 1 << 30;
int a[N], sum[N];
int main() {
scanf("%d%d", &n, &m);
for (int k = 1; k <= n; k++)
scanf("%d", &a[k]), minn = min(minn, a[k]);
for (int k = 1; k <= m && minn < n; ... | replace | 15 | 17 | 15 | 17 | 0 | |
p02647 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
typedef char SINT8;
typedef short SINT16;
typedef int SINT32;
typedef long long SINT64;
typedef double DOUBLE;
#define MAX(a, b) ((a) > (b) ? ... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
typedef char SINT8;
typedef short SINT16;
typedef int SINT32;
typedef long long SINT64;
typedef double DOUBLE;
#define MAX(a, b) ((a) > (b) ? ... | replace | 76 | 77 | 76 | 77 | 0 | |
p02647 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int64_t i = 0; i < (int64_t)(n); i++)
#define all(v) v.begin(), v.end()
// c
int main() {
int n, k;
cin >> n >> k;
vector<vector<int>> a(n, vector<int>(51));
rep(i, n) cin >> a[0][i];
rep(i, k) {
vector<int> memo(n + 1);
rep(j, n... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int64_t i = 0; i < (int64_t)(n); i++)
#define all(v) v.begin(), v.end()
// c
int main() {
int n, k;
cin >> n >> k;
vector<vector<int>> a(51, vector<int>(n));
rep(i, n) cin >> a[0][i];
rep(i, k) {
vector<int> memo(n + 1);
rep(j, n... | replace | 9 | 10 | 9 | 10 | 0 | |
p02647 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define LOCAL
using namespace std;
template <typename A, typename B>
ostream &operator<<(ostream &out, const pair<A, B> &a) {
out << "(" << a.first << "," << a.second << ")";
return out;
}
template <typename T, size_t N>
ostream &operator<<(ostream &out, const array<T, N> &a) {
out << "["... | #include <bits/stdc++.h>
#define LOCAL
using namespace std;
template <typename A, typename B>
ostream &operator<<(ostream &out, const pair<A, B> &a) {
out << "(" << a.first << "," << a.second << ")";
return out;
}
template <typename T, size_t N>
ostream &operator<<(ostream &out, const array<T, N> &a) {
out << "["... | replace | 82 | 83 | 82 | 83 | TLE | |
p02647 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
// #define MODE... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
// #define MODE... | replace | 76 | 77 | 76 | 77 | 0 | |
p02647 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
#define INF (1e9)
int main() {
int N, K;
cin >> N >> K;
vi A(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
}
while (K--) {
vi B(N + 1);
for (int i = 0; i < N; i++) {
B[max... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
#define INF (1e9)
int main() {
int N, K;
cin >> N >> K;
vi A(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
}
while (K--) {
vi B(N + 1);
for (int i = 0; i < N; i++) {
B[max... | replace | 19 | 20 | 19 | 20 | 0 | |
p02647 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
using namespace std;
typedef long long ll;
#define N 200005
int a[N], d[N];
int check(int n) {
int i;
for (i = 1; i <= n; i++) {
if (i != n)
return 0;
}
return 1;
}
int main() {
int n, k, i, l, r;
cin >> n >> k;
for (... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
using namespace std;
typedef long long ll;
#define N 200005
int a[N], d[N];
int check(int n) {
int i;
for (i = 1; i <= n; i++) {
if (a[i] != n)
return 0;
}
return 1;
}
int main() {
int n, k, i, l, r;
cin >> n >> k;
fo... | replace | 12 | 13 | 12 | 13 | TLE | |
p02647 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int A[100100], B[100100];
priority_queue<int, vector<int>, greater<int>> PQ1;
priority_queue<int, vector<int>, less<int>> PQ2;
int main() {
int N, K;
cin >> N >> K;
for (int i = 0; i < N; i++)
cin >> A[i];
while (K--) {
while (!PQ1.empty())
PQ1.pop();
... | #include <bits/stdc++.h>
using namespace std;
int A[200100], B[200100];
priority_queue<int, vector<int>, greater<int>> PQ1;
priority_queue<int, vector<int>, less<int>> PQ2;
int main() {
int N, K;
cin >> N >> K;
for (int i = 0; i < N; i++)
cin >> A[i];
while (K--) {
while (!PQ1.empty())
PQ1.pop();
... | replace | 2 | 3 | 2 | 3 | 0 | |
p02647 | C++ | Runtime Error | #define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
... | replace | 39 | 40 | 39 | 40 | 0 | |
p02647 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define mod 1e9 + 7
int main()
{
int n, k;
cin >> n >> k;
int a[n + 1], b[n + 1];
for (int i = 1; i <= n; i++)
{
cin >> a[i];
}
while (k--)
{
memset(b, 0, sizeof(b));
for (int i = 1; i <= n; i++)
{
if (a[i] + i < n)
... | #include <bits/stdc++.h>
using namespace std;
#define mod 1e9 + 7
int main()
{
int n, k;
cin >> n >> k;
int a[n + 1], b[n + 1];
for (int i = 1; i <= n; i++)
{
cin >> a[i];
}
while (k--)
{
memset(b, 0, sizeof(b));
for (int i = 1; i <= n; i++)
{
if (a[i] + i < n)
... | insert | 78 | 78 | 78 | 101 | TLE | |
p02647 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int n, k;
int a[200005], b[200005];
int main() {
cin >> n >> k;
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
for (int i = 0; i < k; ++i) {
memset(b, 0, sizeof(b));
for (int i = 0; i < n; ++i) {
int l = max(0, i - a[i]);
int r = min(n - 1, i +... | #include <bits/stdc++.h>
using namespace std;
int n, k;
int a[200005], b[200005];
int main() {
cin >> n >> k;
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
if (k > 50) {
for (int i = 0; i < n; ++i) {
cout << n << ' ';
}
cout << '\n';
return 0;
}
for (int i = 0; i < k; ++i) {
mem... | insert | 8 | 8 | 8 | 15 | TLE | |
p02647 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
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 tr... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
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 tr... | replace | 34 | 35 | 34 | 35 | TLE | |
p02647 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef int64_t llo;
#define mp make_pair
#define pb push_back
#define a first
#define b second
int n, k;
int it[200001];
int pre[200001];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> it[i];
... | #include <bits/stdc++.h>
using namespace std;
typedef int64_t llo;
#define mp make_pair
#define pb push_back
#define a first
#define b second
int n, k;
int it[200001];
int pre[200001];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> it[i];
... | replace | 30 | 31 | 30 | 31 | TLE | |
p02647 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int mod = 1e9 + 7;
struct mint {
ll x; // typedef long long ll;
mint(ll x = 0) : x((x % mod + mod) % mod) {}
mint operator-() const { return mint(-x); }
mint &operator+=(const mint a) {
if ((x += a.x) >= mod)
x -= mod;
r... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int mod = 1e9 + 7;
struct mint {
ll x; // typedef long long ll;
mint(ll x = 0) : x((x % mod + mod) % mod) {}
mint operator-() const { return mint(-x); }
mint &operator+=(const mint a) {
if ((x += a.x) >= mod)
x -= mod;
r... | replace | 193 | 194 | 193 | 194 | 0 | |
p02647 | C++ | Time Limit Exceeded | #include "bits/stdc++.h"
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define LL long long
const int MAXSSTN = 200010;
class StarrySkyTree {
public:
int size = 0;
int depth = 0; // the depth of the tree
int best = 0; // the index of maximum element
... | #include "bits/stdc++.h"
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define LL long long
const int MAXSSTN = 200010;
class StarrySkyTree {
public:
int size = 0;
int depth = 0; // the depth of the tree
int best = 0; // the index of maximum element
... | replace | 135 | 136 | 135 | 139 | TLE | |
p02647 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define MOD 1000000007LL
#define rep(i, n) for (ll(i) = 0LL; (i) < (ll)(n); (i)++)
#define rep2(i, s, e) for (ll(i) = (ll)(s); (i) < (ll)(e); (i)++)
#define repi(i, n) for (ll(i) = 0LL; (i) <= ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define MOD 1000000007LL
#define rep(i, n) for (ll(i) = 0LL; (i) < (ll)(n); (i)++)
#define rep2(i, s, e) for (ll(i) = (ll)(s); (i) < (ll)(e); (i)++)
#define repi(i, n) for (ll(i) = 0LL; (i) <= ... | replace | 55 | 56 | 55 | 56 | 0 | |
p02647 | 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 <=... | insert | 149 | 149 | 149 | 152 | TLE | |
p02647 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vl = vector<ll>;
using vll = vector<vl>;
using Pll = pair<ll, ll>;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define all(v) v.begin(), v.end()
#define sz(x) ((int)x.size())
#define pb push_back
#define mp make_pai... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vl = vector<ll>;
using vll = vector<vl>;
using Pll = pair<ll, ll>;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define all(v) v.begin(), v.end()
#define sz(x) ((int)x.size())
#define pb push_back
#define mp make_pai... | insert | 42 | 42 | 42 | 49 | TLE | |
p02647 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include ... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include ... | replace | 147 | 148 | 147 | 148 | TLE | |
p02647 | C++ | Time Limit Exceeded | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author NikuKyabe
*/
#include "bits/stdc++.h"
using namespace std;
#define int long long
#define FOR(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define REP(i, n) FOR(i, 0, (n))
typedef vector<int> vec;
class CLamps {... | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author NikuKyabe
*/
#include "bits/stdc++.h"
using namespace std;
#define int long long
#define FOR(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define REP(i, n) FOR(i, 0, (n))
typedef vector<int> vec;
class CLamps {... | replace | 22 | 23 | 22 | 23 | TLE | |
p02647 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, N) for (int(i) = 0; (i) < (N); (i)++)
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int mod = 1000000007;
int main() {
int n, k;
cin >> n >> k;
vector<int> a(n);
rep(i, n) ci... | #include <bits/stdc++.h>
#define rep(i, N) for (int(i) = 0; (i) < (N); (i)++)
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int mod = 1000000007;
int main() {
int n, k;
cin >> n >> k;
vector<int> a(n);
rep(i, n) ci... | replace | 19 | 20 | 19 | 20 | 0 | |
p02647 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define INF 100000000
#define YJ 1145141919
#define INF_INT_MAX 2147483647
#define INF_LL 9223372036854775
#define INF_LL_MAX 9223372036854775807
#define EPS 1e-10
#define MOD 1000000007
#define MOD9 998244353
#define Pi acos(-1)
#define LL long long
#define ULL unsigned ... | #include <bits/stdc++.h>
using namespace std;
#define INF 100000000
#define YJ 1145141919
#define INF_INT_MAX 2147483647
#define INF_LL 9223372036854775
#define INF_LL_MAX 9223372036854775807
#define EPS 1e-10
#define MOD 1000000007
#define MOD9 998244353
#define Pi acos(-1)
#define LL long long
#define ULL unsigned ... | replace | 53 | 54 | 53 | 56 | TLE | |
p02647 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int main(void) {
int n, k;
cin >> n >> k;
vector<int> v(n);
rep(i, n) cin >> v[i];
vector<int> imo(n + 1);
/*いもす法*/
rep(j, min(k, (int)log2(n) + 100)) {
imo = vector<int>(n + 1);
re... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
int main(void) {
int n, k;
cin >> n >> k;
vector<int> v(n);
rep(i, n) cin >> v[i];
vector<int> imo(n + 1);
/*いもす法*/
rep(j, min(k, (int)log2(n) + 100)) {
imo = vector<int>(n + 1);
re... | replace | 16 | 17 | 16 | 17 | 0 | |
p02647 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define vl vector<ll>
#define rep(i, n) for (ll i = 0; i < (n); ++i)
int main() {
ll N, K;
cin >> N >> K;
vl A(N);
rep(i, N) cin >> A[i];
ll n = 0;
while (n < K) {
vl B(N + 1, 0);
rep(i, N) {
if (i - A[i] <= 0)
B... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define vl vector<ll>
#define rep(i, n) for (ll i = 0; i < (n); ++i)
int main() {
ll N, K;
cin >> N >> K;
vl A(N);
rep(i, N) cin >> A[i];
ll n = 0;
while (n < K) {
vl B(N + 1, 0);
rep(i, N) {
if (i - A[i] <= 0)
B... | replace | 21 | 22 | 21 | 22 | 0 | |
p02647 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) (x).begin(), (x).end()
const long long MOD = 1e9 + 7;
// const long long MOD=998244353;
const int INF = 1e9;
const long long IINF = 1e18;
const int dx[4]... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) (x).begin(), (x).end()
const long long MOD = 1e9 + 7;
// const long long MOD=998244353;
const int INF = 1e9;
const long long IINF = 1e18;
const int dx[4]... | replace | 111 | 112 | 111 | 112 | TLE | |
p02647 | C++ | Runtime Error | // #include <tourist>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p;
const int INF = 1e9;
const ll LINF = ll(1e18);
const int MOD = 1000000007;
const int dx[4] = {0, 1, 0, -1}, dy[4] = {-1, 0, 1, 0};
const int Dx[8] = {0, 1, 1, 1, 0, -1, -1, -1},
Dy[8] = {-1, -1, 0... | // #include <tourist>
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p;
const int INF = 1e9;
const ll LINF = ll(1e18);
const int MOD = 1000000007;
const int dx[4] = {0, 1, 0, -1}, dy[4] = {-1, 0, 1, 0};
const int Dx[8] = {0, 1, 1, 1, 0, -1, -1, -1},
Dy[8] = {-1, -1, 0... | replace | 58 | 59 | 58 | 59 | 0 | |
p02647 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(X, N) for (ll X = 0LL; X < (N); X++)
#define PI (acos(-1.0))
#define MODN 1000000007
#define MODN2 998244353
#define ALL(V) (V).begin(), (V).end()
#define INT_MAX_HALF (INT_MAX / 2)
#define EPS (1e-10)
using namespace std;
typedef long long ll;
int main() {
ll n, k;
cin >> n... | #include <bits/stdc++.h>
#define rep(X, N) for (ll X = 0LL; X < (N); X++)
#define PI (acos(-1.0))
#define MODN 1000000007
#define MODN2 998244353
#define ALL(V) (V).begin(), (V).end()
#define INT_MAX_HALF (INT_MAX / 2)
#define EPS (1e-10)
using namespace std;
typedef long long ll;
int main() {
ll n, k;
cin >> n... | replace | 48 | 49 | 48 | 49 | TLE | |
p02647 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n, k;
cin >> n >> k;
vector<int> a(n, 0);
vector<pair<int, int>> x(n);
for (int i = 0; i < n; ++i) {
cin >> a[i];
int left = i - a[i];
int right = i + a[i];
if (left < 0)
left = 0;
if (right > n - 1... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n, k;
cin >> n >> k;
vector<int> a(n, 0);
vector<pair<int, int>> x(n);
for (int i = 0; i < n; ++i) {
cin >> a[i];
int left = i - a[i];
int right = i + a[i];
if (left < 0)
left = 0;
if (right > n - 1... | insert | 32 | 32 | 32 | 35 | 0 | |
p02647 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cctype>
#include <climits>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#incl... | #include <algorithm>
#include <cctype>
#include <climits>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#incl... | replace | 44 | 45 | 44 | 45 | TLE | |
p02647 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
using namespace std;
int a[200005] = {0}, b[200005] = {0};
int main() {
int n, k, l, r, cnt = 0;
cin >> n >> k;
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
b[i] = a[i];
}
for (int i... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
using namespace std;
int a[200005] = {0}, b[200005] = {0};
int main() {
int n, k, l, r, cnt = 0;
cin >> n >> k;
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
b[i] = a[i];
}
for (int i... | replace | 31 | 34 | 31 | 37 | TLE | |
p02647 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <iostream>
#include <numeric>
#include <queue>
#include <stack>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
using ULL = unsigned long long;
using LL = long long;
using String = std::string;
using Ints = std::vector<int>;
using Doubles =... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <numeric>
#include <queue>
#include <stack>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
using ULL = unsigned long long;
using LL = long long;
using String = std::string;
using Ints = std::vector<int>;
using Doubles =... | replace | 34 | 35 | 34 | 35 | TLE | |
p02647 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define REP(i, b) FOR(i, 0, b)
#define RFOR(i, a, b) for (ll i = a - 1; i >= b; i--)
#define RREP(i, a) RFOR(i, a, 0)
#define REPALL(i, x) for (ll i = 0; i < x.size(); i++)
#define RREPALL(i, x) for (ll i = x.size() - 1; i >= ... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define REP(i, b) FOR(i, 0, b)
#define RFOR(i, a, b) for (ll i = a - 1; i >= b; i--)
#define RREP(i, a) RFOR(i, a, 0)
#define REPALL(i, x) for (ll i = 0; i < x.size(); i++)
#define RREPALL(i, x) for (ll i = x.size() - 1; i >= ... | replace | 56 | 57 | 56 | 57 | TLE | |
p02647 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ALL(x) x.begin(), x.end()
#define rep(i, n) for (int i = 0; i < (n); i++)
#define debug(v) \
cout << #v << ":"; \
for (auto x : v) { ... | #include <bits/stdc++.h>
using namespace std;
#define ALL(x) x.begin(), x.end()
#define rep(i, n) for (int i = 0; i < (n); i++)
#define debug(v) \
cout << #v << ":"; \
for (auto x : v) { ... | replace | 47 | 48 | 47 | 48 | 0 | |
p02647 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
using P = pair<int, int>;
using pq = priority_queue<int>;
typedef long long ll;
int main() {
int n;
cin >> n;
int k;
cin >> k;
vector<int> a(n);
rep(i, n... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
using P = pair<int, int>;
using pq = priority_queue<int>;
typedef long long ll;
int main() {
int n;
cin >> n;
int k;
cin >> k;
vector<int> a(n);
rep(i, n... | insert | 26 | 26 | 26 | 28 | TLE | |
p02647 | C++ | Runtime Error | #include <bits/stdc++.h>
typedef long long int lld;
typedef unsigned long long int llu;
#define INF (lld)(9223372036854775807)
#define IINF (int)(2147483647)
using namespace std;
int main(void) {
int n, k;
cin >> n >> k;
vector<vector<int>> a;
a.push_back(vector<int>(n + 1));
for (int i = 0; i < n; i++) {
... | #include <bits/stdc++.h>
typedef long long int lld;
typedef unsigned long long int llu;
#define INF (lld)(9223372036854775807)
#define IINF (int)(2147483647)
using namespace std;
int main(void) {
int n, k;
cin >> n >> k;
vector<vector<int>> a;
a.push_back(vector<int>(n + 1));
for (int i = 0; i < n; i++) {
... | insert | 33 | 33 | 33 | 34 | 0 | |
p02647 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <sstream>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
int a[300001];
int B[600003];
int n, N = 1;
int right(int k) { return 2 * k + 2; }
int left(int k) { return 2 * k + 1; }
int parent(int k) { return ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <sstream>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
int a[300001];
int B[600003];
int n, N = 1;
int right(int k) { return 2 * k + 2; }
int left(int k) { return 2 * k + 1; }
int parent(int k) { return ... | replace | 55 | 56 | 55 | 57 | TLE | |
p02647 | C++ | Runtime Error | #include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define FOR... | #include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define FOR... | replace | 108 | 109 | 108 | 109 | 0 | |
p02647 | C++ | Time Limit Exceeded | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <ctime>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <tuple>
#include <vect... | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <ctime>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <tuple>
#include <vect... | replace | 69 | 70 | 69 | 70 | TLE | |
p02647 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int n, k;
cin >> n >> k;
vector<int> a(n);
vector<int> c(n, n);
rep(i, n) { cin >> a[i]; }
rep(j, k) {
vector<int> d(n + 1);
rep(i, n) {
d[max(i - a[i], 0)]++;
d[min(i + a[i] + 1, n)]... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
int n, k;
cin >> n >> k;
vector<int> a(n);
vector<int> c(n, n);
rep(i, n) { cin >> a[i]; }
rep(j, k) {
vector<int> d(n + 1);
rep(i, n) {
d[max(i - a[i], 0)]++;
d[min(i + a[i] + 1, n)]... | replace | 16 | 17 | 16 | 17 | 0 | |
p02647 | C++ | Runtime Error | #include <algorithm>
#include <array>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
#define int long long
void operation(vector<int> &a) {
vector<int> b(a.size(), 0);
for (int i = 0; i < (long long)a.size(); i++) {
... | #include <algorithm>
#include <array>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
#define int long long
void operation(vector<int> &a) {
vector<int> b(a.size(), 0);
for (int i = 0; i < (long long)a.size(); i++) {
... | replace | 20 | 21 | 20 | 21 | 0 | |
p02647 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9 + 7;
#define rep(i, n) for (int i = 0; i < n; ++i)
typedef long long int ll;
typedef unsigned long long ull;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inlin... | #include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9 + 7;
#define rep(i, n) for (int i = 0; i < n; ++i)
typedef long long int ll;
typedef unsigned long long ull;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inlin... | replace | 31 | 33 | 31 | 33 | TLE | |
p02647 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long... | replace | 108 | 109 | 108 | 109 | TLE | |
p02647 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <numeric>
const int MaxN = 100005;
int n, A[MaxN];
bool trans() {
static int B[MaxN];
std::fill(B, B + n, 0);
for (int i = 0; i < n; ++i) {
int l = std::max(0, i - A[i]);
int r = std::min(n - 1, i + A[i]);
B[l] += 1;
B[r + 1] -= 1;
}
bool flag... | #include <algorithm>
#include <cstdio>
#include <numeric>
const int MaxN = 200005;
int n, A[MaxN];
bool trans() {
static int B[MaxN];
std::fill(B, B + n, 0);
for (int i = 0; i < n; ++i) {
int l = std::max(0, i - A[i]);
int r = std::min(n - 1, i + A[i]);
B[l] += 1;
B[r + 1] -= 1;
}
bool flag... | replace | 4 | 5 | 4 | 5 | 0 | |
p02647 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define FOR(i, l, r) for (ll i = l; i < r; i++)
#define rep(i, N) FOR(i, 0, N)
#define MOD 1000000007
#define INF 1000000000
using ll = long long int;
using namespace std;
typedef pair<int, int> P;
typedef vector<int> vi;
typedef vector<vi> vvi;
int main() {
int N, K;
cin >> N >> K;
... | #include <bits/stdc++.h>
#define FOR(i, l, r) for (ll i = l; i < r; i++)
#define rep(i, N) FOR(i, 0, N)
#define MOD 1000000007
#define INF 1000000000
using ll = long long int;
using namespace std;
typedef pair<int, int> P;
typedef vector<int> vi;
typedef vector<vi> vvi;
int main() {
int N, K;
cin >> N >> K;
... | replace | 25 | 26 | 25 | 26 | TLE | |
p02647 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define TRACE(x) cerr << #x << " :: " << x << endl
#define _ << " " <<
#define SZ(x) (int)(x).size()
#define ALL(x) (x).begin(), (x).end()
#define FOR(i, a, b) for (int i = (a); i <= (b); ++i)
#define RFOR(i, a, b) for (int i = (a); i >= (b); --i)
const int mxN = 1e5 + 5;... | #include <bits/stdc++.h>
using namespace std;
#define TRACE(x) cerr << #x << " :: " << x << endl
#define _ << " " <<
#define SZ(x) (int)(x).size()
#define ALL(x) (x).begin(), (x).end()
#define FOR(i, a, b) for (int i = (a); i <= (b); ++i)
#define RFOR(i, a, b) for (int i = (a); i >= (b); --i)
const int mxN = 2e5 + 5;... | replace | 10 | 11 | 10 | 11 | 0 | |
p02647 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
const int MOD = 1e9 + 7;
const long double Pi = acos(-1);
using P = pair<ll, ll>;
ll gcd(ll a, ll b) { // aとbの最大公約数を返す//計算量は0(log(max(a,b))
if (a % b == 0) {
return b;
} else {
return gcd(b, a % b);
}
}
ll lcm(ll a, ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
const int MOD = 1e9 + 7;
const long double Pi = acos(-1);
using P = pair<ll, ll>;
ll gcd(ll a, ll b) { // aとbの最大公約数を返す//計算量は0(log(max(a,b))
if (a % b == 0) {
return b;
} else {
return gcd(b, a % b);
}
}
ll lcm(ll a, ... | replace | 212 | 214 | 212 | 214 | TLE | |
p02647 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 2e9
#define MOD 1000000007
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
using P = pair<int, int>;
int main(... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 2e9
#define MOD 1000000007
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
using P = pair<int, int>;
int main(... | insert | 27 | 27 | 27 | 36 | TLE | |
p02647 | C++ | Time Limit Exceeded | #include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <string>
#include <vector>
const int MOD = 1e9 + 7;
#define PI 3.14159265359
typedef long long ll;
using namespace std;
int main() {
int n, k;
cin >> n >> k;
ve... | #include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <string>
#include <vector>
const int MOD = 1e9 + 7;
#define PI 3.14159265359
typedef long long ll;
using namespace std;
int main() {
int n, k;
cin >> n >> k;
ve... | replace | 23 | 24 | 23 | 24 | TLE | |
p02647 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define endl "\n"
#define se second
#define ll long long
#define inf 0x3f3f3f3f
#define fast \
ios_base::sync_with_stdio(0); \
cin.tie(0); ... | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define endl "\n"
#define se second
#define ll long long
#define inf 0x3f3f3f3f
#define fast \
ios_base::sync_with_stdio(0); \
cin.tie(0); ... | replace | 19 | 20 | 19 | 25 | TLE | |
p02647 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
typedef pair<int, int> P;
#define SORT(a) sort((a).begin(), (a).end())
#define rSORT(a) reverse((a).begin(), (a).end())
#define For(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) For(i, 0, n)
#define debug(x) cerr << #x << " = " << (x) << ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
typedef pair<int, int> P;
#define SORT(a) sort((a).begin(), (a).end())
#define rSORT(a) reverse((a).begin(), (a).end())
#define For(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) For(i, 0, n)
#define debug(x) cerr << #x << " = " << (x) << ... | replace | 32 | 33 | 32 | 33 | TLE | |
p02647 | C++ | Runtime Error | #include <algorithm>
#include <bits/stdc++.h>
#include <functional>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define DEBUG
#define PI 3.141592653589793238462643383279
#define _GLIBCXX_DEBUG
#ifdef DEBUG
#define s(...) show(__VA_ARGS__);
#define sl(...) ... | #include <algorithm>
#include <bits/stdc++.h>
#include <functional>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define DEBUG
#define PI 3.141592653589793238462643383279
#define _GLIBCXX_DEBUG
#ifdef DEBUG
#define s(...) show(__VA_ARGS__);
#define sl(...) ... | insert | 117 | 117 | 117 | 118 | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.