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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
p02691 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base ::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
const int MAXN = 1e5;
int n, h[MAXN];
cin >> n;
map<int, int> cnt;
for (int i = 1; i <= n; ++i) {
cin >> h[i - 1];
++cnt[i - h[i - 1]];
}
long long ans = 0;
for (int i = 1... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base ::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
const int MAXN = 2e5;
int n, h[MAXN];
cin >> n;
map<int, int> cnt;
for (int i = 1; i <= n; ++i) {
cin >> h[i - 1];
++cnt[i - h[i - 1]];
}
long long ans = 0;
for (int i = 1... | replace | 6 | 7 | 6 | 7 | 0 | |
p02691 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
#define LL long long
int N, A[222222], mi[555555] = {};
LL ans = 0ll;
int main... | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
#define LL long long
int N, A[222222], mi[555555] = {};
LL ans = 0ll;
int main... | replace | 28 | 29 | 28 | 30 | 0 | |
p02691 | C++ | Time Limit Exceeded | /*input
32
3 1 4 1 5 9 2 6 5 3 5 8 9 7 9 3 2 3 8 4 6 2 6 4 3 3 8 3 2 7 9 5
*/
#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
using namespace std;
#define ll long long
#define pb push_back
#define pii pair<long, long>
#define vi... | /*input
32
3 1 4 1 5 9 2 6 5 3 5 8 9 7 9 3 2 3 8 4 6 2 6 4 3 3 8 3 2 7 9 5
*/
#include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
using namespace std;
#define ll long long
#define pb push_back
#define pii pair<long, long>
#define vi... | replace | 77 | 85 | 77 | 86 | TLE | |
p02691 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#define int long long
#define lowbit(x) ((x) & (-x))
#define hh putchar('\n')
#define kg putchar(' ')
using namespace std;
... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#define int long long
#define lowbit(x) ((x) & (-x))
#define hh putchar('\n')
#define kg putchar(' ')
using namespace std;
... | replace | 17 | 18 | 17 | 19 | 0 | |
p02691 | 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)... | insert | 74 | 74 | 74 | 76 | 0 | |
p02691 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <unordered_map>
#include <vector>
#define INCANT ... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <unordered_map>
#include <vector>
#define INCANT ... | replace | 24 | 25 | 24 | 25 | 0 | |
p02691 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(begin, end) for (i = begin; i < end; i++)
#define repj(begin, end) for (j = begin; j < end; j++)
#define init(arr, end, val) \
for (i = 0; i < end; i++) \
arr[i] = val;
#defin... | #include <bits/stdc++.h>
#define rep(begin, end) for (i = begin; i < end; i++)
#define repj(begin, end) for (j = begin; j < end; j++)
#define init(arr, end, val) \
for (i = 0; i < end; i++) \
arr[i] = val;
#defin... | replace | 41 | 45 | 41 | 42 | TLE | |
p02691 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <ctype.h>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
#define pie 3.1415926535897... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <ctype.h>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
#define pie 3.1415926535897... | replace | 55 | 56 | 55 | 56 | 0 | |
p02691 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <queue>
#include <set>
#include <stdlib.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long int ll;
typedef long double ld;
template ... | #include <algorithm>
#include <bitset>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <queue>
#include <set>
#include <stdlib.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long int ll;
typedef long double ld;
template ... | replace | 112 | 113 | 112 | 113 | 0 | |
p02691 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using lint = long long;
signed main() {
lint N;
cin >> N;
vector<lint> a(N), b(500000, 0), c(500000, 0);
for (lint i = 0; i < N; i++) {
cin >> a[i];
b[i + a[i]]++;
if (i - a[i] >= 0)
c[i - a[i]]++;
}
lint ans = 0;
for (lint i = 0; i < b.size... | #include <bits/stdc++.h>
using namespace std;
using lint = long long;
signed main() {
lint N;
cin >> N;
vector<lint> a(N), b(500000, 0), c(500000, 0);
for (lint i = 0; i < N; i++) {
cin >> a[i];
if (i + a[i] <= N)
b[i + a[i]]++;
if (i - a[i] >= 0)
c[i - a[i]]++;
}
lint ans = 0;
fo... | replace | 10 | 11 | 10 | 12 | 0 | |
p02691 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int a[4100000];
int main() {
int n;
long long ans = 0;
cin >> n;
for (int i = 1; i <= n; i++) {
int x;
scanf("%d", &x);
if (i >= x)
ans += a[i - x];
a[i + x]++;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int a[4100000];
int main() {
int n;
long long ans = 0;
cin >> n;
for (int i = 1; i <= n; i++) {
int x;
scanf("%d", &x);
if (i >= x)
ans += a[i - x];
if (i + x < 2 * n)
a[i + x]++;
}
cout << ans << endl;
return 0;
} | replace | 14 | 15 | 14 | 16 | 0 | |
p02691 | C++ | Runtime Error | #include <bits/stdc++.h>
#define all(x) x.begin(), x.end()
#define lc (i << 1)
#define rc (i << 1 | 1)
using namespace std;
using ll = long long;
using pii = pair<int, int>;
const int MN = 1e5 + 5, LN = 17, MOD = 1e9 + 7, INF = 0x3f3f3f3f;
int N, a[MN];
map<ll, int> mp;
int main() {
ios_base::sync_with_stdio(false)... | #include <bits/stdc++.h>
#define all(x) x.begin(), x.end()
#define lc (i << 1)
#define rc (i << 1 | 1)
using namespace std;
using ll = long long;
using pii = pair<int, int>;
const int MN = 2e5 + 5, LN = 17, MOD = 1e9 + 7, INF = 0x3f3f3f3f;
int N, a[MN];
map<ll, int> mp;
int main() {
ios_base::sync_with_stdio(false)... | replace | 8 | 9 | 8 | 9 | 0 | |
p02691 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n;
cin >> n;
ll an[n];
rep(i, n) cin >> an[i];
ll pn[n];
rep(i, n) pn[i] = i - an[i] + 1;
ll qn[n];
rep(i, n) qn[i] = i + an[i] + 1;
ll pdp[n];
rep(i, n) pdp[i] ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n;
cin >> n;
ll an[n];
rep(i, n) cin >> an[i];
ll pn[n];
rep(i, n) pn[i] = i - an[i] + 1;
ll qn[n];
rep(i, n) qn[i] = i + an[i] + 1;
ll pdp[n];
rep(i, n) pdp[i] ... | replace | 16 | 17 | 16 | 17 | 0 | |
p02691 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
map<long long int, long long int> m;
long long int n;
cin >> n;
long long int c = 0;
vector<long long int> a(n);
for (long long int i = 1; i <= n; i++) {
cin >> a[i];
}
a[0] = 0;
for (... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
map<long long int, long long int> m;
long long int n;
cin >> n;
long long int c = 0;
vector<long long int> a(n + 1);
for (long long int i = 1; i <= n; i++) {
cin >> a[i];
}
a[0] = 0;
f... | replace | 11 | 12 | 11 | 12 | 0 | |
p02691 | C++ | Runtime Error | #include <iostream>
#include <string>
using namespace std;
long long a[100005];
long long a_plus_i[100005];
int main() {
long long n;
cin >> n;
for (long long i = 1; i <= n; i++) {
cin >> a[i];
if (a[i] + i <= n && a[i] + i >= 1) {
a_plus_i[a[i] + i] += 1;
}
}
long long pairs = 0;
for (... | #include <iostream>
#include <string>
using namespace std;
long long a[200005];
long long a_plus_i[200005];
int main() {
long long n;
cin >> n;
for (long long i = 1; i <= n; i++) {
cin >> a[i];
if (a[i] + i <= n && a[i] + i >= 1) {
a_plus_i[a[i] + i] += 1;
}
}
long long pairs = 0;
for (... | replace | 5 | 7 | 5 | 7 | 0 | |
p02691 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
map<int, int> ct;
map<int, int> ct2;
int main() {
int n;
scanf("%d", &n);
long long ans = 0;
for (int i = 1, x; i <= n; i++) {
scanf("%d", &x);
// ans += ct[i - x];
// ct[i + x]++;
ct[i - x]++;
ct2[i + x]++;
}
for (int i = 1; i... | #include <bits/stdc++.h>
using namespace std;
map<int, int> ct;
map<int, int> ct2;
int main() {
int n;
scanf("%d", &n);
long long ans = 0;
for (int i = 1, x; i <= n; i++) {
scanf("%d", &x);
// ans += ct[i - x];
// ct[i + x]++;
ct[i - x]++;
ct2[i + x]++;
}
for (int i = 1; i... | replace | 16 | 18 | 16 | 18 | TLE | |
p02691 | C++ | Runtime Error | #include <algorithm>
#include <cstdint>
#include <cstdlib>
#include <iomanip>
#include <iostream>
template <typename T> void fin(T const &t) {
std::cout << t << std::endl;
exit(0);
}
int const MAXN = 2e5;
int cnt[MAXN];
int main() {
int N;
std::cin >> N;
std::fill_n(cnt, 0, N + 1);
int64_t ans = 0;
int... | #include <algorithm>
#include <cstdint>
#include <cstdlib>
#include <iomanip>
#include <iostream>
template <typename T> void fin(T const &t) {
std::cout << t << std::endl;
exit(0);
}
int const MAXN = 2e5;
int cnt[MAXN];
int main() {
int N;
std::cin >> N;
std::fill_n(cnt, 0, N + 1);
int64_t ans = 0;
int... | replace | 27 | 28 | 27 | 29 | 0 | |
p02691 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
const int maxn = 1e5 + 5;
map<int, int> mp;
int a[maxn];
int n;
ll ans;
int main() {
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int i = 1; i <= n; i++)
if (i - a[i] > 0)
mp[i - a[i]]++;
for (int i = 1; i <= n; i++)
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
const int maxn = 2e5 + 5;
map<int, int> mp;
int a[maxn];
int n;
ll ans;
int main() {
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i];
for (int i = 1; i <= n; i++)
if (i - a[i] > 0)
mp[i - a[i]]++;
for (int i = 1; i <= n; i++)
... | replace | 3 | 4 | 3 | 4 | 0 | |
p02691 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll N;
ll A[100010];
map<ll, ll> mp;
int main() {
cin >> N;
for (ll i = 0; i < N; i++) {
cin >> A[i];
mp[A[i] - i]++;
}
ll ans = 0;
for (ll i = 0; i < N; i++) {
ll num = -A[i] - i;
mp[A[i] - i]--;
ans += mp[num];
}
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll N;
ll A[200010];
map<ll, ll> mp;
int main() {
cin >> N;
for (ll i = 0; i < N; i++) {
cin >> A[i];
mp[A[i] - i]++;
}
ll ans = 0;
for (ll i = 0; i < N; i++) {
ll num = -A[i] - i;
mp[A[i] - i]--;
ans += mp[num];
}
... | replace | 6 | 7 | 6 | 7 | 0 | |
p02691 | C++ | Runtime Error | #include <cstring>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef long long int64;
int P[200000];
int M[200000];
int main() {
memset(P, 0, sizeof(P));
memset(P, 0, sizeof(M));
int N;
cin >> N;
int tmp;
int64 ans = 0;
for (... | #include <cstring>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef long long int64;
int P[400000];
int M[200000];
int main() {
memset(P, 0, sizeof(P));
memset(P, 0, sizeof(M));
int N;
cin >> N;
int tmp;
int64 ans = 0;
for (... | replace | 7 | 8 | 7 | 8 | 0 | |
p02691 | C++ | Runtime Error | #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... | replace | 42 | 44 | 42 | 49 | -11 | |
p02691 | C++ | Runtime Error | #include <iostream>
long long ckc[1000000], ckt[1000000], res;
int main() {
long long n;
std::cin >> n;
long long a[n];
for (long long i = 1; i <= n; i++) {
std::cin >> a[i];
if ((a[i] + i >= 0) && (a[i] + i <= 2 * 100000))
ckc[a[i] + i]++;
if ((i - a[i] >= 0) && (i - a[i] <= 2 * 100000))
... | #include <iostream>
long long ckc[1000000], ckt[1000000], res;
int main() {
long long n;
std::cin >> n;
long long a[n + 1];
for (long long i = 1; i <= n; i++) {
std::cin >> a[i];
if ((a[i] + i >= 0) && (a[i] + i <= 2 * 100000))
ckc[a[i] + i]++;
if ((i - a[i] >= 0) && (i - a[i] <= 2 * 100000)... | replace | 7 | 8 | 7 | 8 | 0 | |
p02691 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include... | replace | 52 | 53 | 52 | 53 | 0 | |
p02691 | C++ | Time Limit Exceeded | // https://atcoder.jp/contests/abc166/tasks/abc166_e
#include <bits/stdc++.h>
#if LOCAL
#include "dump.hpp"
#else
#define dump(...)
#endif
using namespace std;
using ll = long long;
const ll LINF = 0x1fffffffffffffff;
#define FOR(i, a, b) for (ll i = (a); i < static_cast<ll>(b); ++i)
#define REP(i, n) FOR(i, 0, n)
temp... | // https://atcoder.jp/contests/abc166/tasks/abc166_e
#include <bits/stdc++.h>
#if LOCAL
#include "dump.hpp"
#else
#define dump(...)
#endif
using namespace std;
using ll = long long;
const ll LINF = 0x1fffffffffffffff;
#define FOR(i, a, b) for (ll i = (a); i < static_cast<ll>(b); ++i)
#define REP(i, n) FOR(i, 0, n)
temp... | insert | 27 | 27 | 27 | 68 | TLE | |
p02691 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define pi 3.14159265359
#define inf 2147483647
#define INF 9223372036854775807
#define mod 1000000007
#define mod2 998244353
int main() {
int N;
cin >> N;
vector<ll> A(N);
for (int i = 0; i < N; i++) {
cin >> A.at... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define pi 3.14159265359
#define inf 2147483647
#define INF 9223372036854775807
#define mod 1000000007
#define mod2 998244353
int main() {
int N;
cin >> N;
vector<ll> A(N);
for (int i = 0; i < N; i++) {
cin >> A.at... | replace | 19 | 24 | 19 | 37 | TLE | |
p02691 | C++ | Time Limit Exceeded |
// Problem : E - This Message Will Self-Destruct in 5s
// Contest : AtCoder - AtCoder Beginner Contest 166
// URL : https://atcoder.jp/contests/abc166/tasks/abc166_e
// Memory Limit : 1024 MB
// Time Limit : 2000 ms
// Powered by CP Editor (https://github.com/cpeditor/cpeditor)
#include <bits/stdc++.h>
#define int lo... |
// Problem : E - This Message Will Self-Destruct in 5s
// Contest : AtCoder - AtCoder Beginner Contest 166
// URL : https://atcoder.jp/contests/abc166/tasks/abc166_e
// Memory Limit : 1024 MB
// Time Limit : 2000 ms
// Powered by CP Editor (https://github.com/cpeditor/cpeditor)
#include <bits/stdc++.h>
#define int lo... | replace | 204 | 206 | 204 | 208 | TLE | |
p02691 | C++ | Runtime Error | // #pragma GCC optimize(3,"Ofast","inline")
// #pragma GCC optimize(2)
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack... | // #pragma GCC optimize(3,"Ofast","inline")
// #pragma GCC optimize(2)
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack... | replace | 55 | 56 | 55 | 56 | 0 | |
p02691 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <queue>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define REP(i, n) for (ll i = 0; i < n; i++)
#define REPR(i, n) for (ll i = n - 1; i >= 0; i--)
typede... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <queue>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define REP(i, n) for (ll i = 0; i < n; i++)
#define REPR(i, n) for (ll i = n - 1; i >= 0; i--)
typede... | delete | 37 | 41 | 37 | 37 | TLE | |
p02691 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long
#define N 100123
#define endl '\n'
using namespace std;
ll v[N], foward[N], ans, n;
int main() {
ios_base::sync_with_stdio(0);
cin >> n;
for (int i = 1; i <= n; ++i) {
cin >> v[i];
}
for (int i = 1; i <= n; ++i) {
if (i + v[i] <= n)
foward[i + ... | #include <bits/stdc++.h>
#define ll long long
#define N 200123
#define endl '\n'
using namespace std;
ll v[N], foward[N], ans, n;
int main() {
ios_base::sync_with_stdio(0);
cin >> n;
for (int i = 1; i <= n; ++i) {
cin >> v[i];
}
for (int i = 1; i <= n; ++i) {
if (i + v[i] <= n)
foward[i + ... | replace | 2 | 3 | 2 | 3 | 0 | |
p02691 | C++ | Runtime Error | // #define _CRT_SECURE_NO_WARNINGS
// #define _USE_MATH_DEFINES // M_PI=3.1415...
#include <algorithm>
#include <bitset> // bitset<8> bs1(131uL); // 10000011 bs1[0]は1 01stringからビット集合生成可
#include <cctype>
#include <climits> // A/Bを計算するときA==LLONG_MIN && B==-1のみ(1ull<<63)で代用
#include <cmath>
#include <cstdio>
#include <cs... | // #define _CRT_SECURE_NO_WARNINGS
// #define _USE_MATH_DEFINES // M_PI=3.1415...
#include <algorithm>
#include <bitset> // bitset<8> bs1(131uL); // 10000011 bs1[0]は1 01stringからビット集合生成可
#include <cctype>
#include <climits> // A/Bを計算するときA==LLONG_MIN && B==-1のみ(1ull<<63)で代用
#include <cmath>
#include <cstdio>
#include <cs... | replace | 150 | 151 | 150 | 153 | 0 | |
p02691 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define pii pair<int, int>
#define vi vector<int>
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define x first
#define y second
#define sz(x) (x).size()
#define all(x) (x).begin(), (x).end() // Forward traversal
#define rall(x) (x).rbegin, (x).rend() ... | #include <bits/stdc++.h>
using namespace std;
#define pii pair<int, int>
#define vi vector<int>
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define x first
#define y second
#define sz(x) (x).size()
#define all(x) (x).begin(), (x).end() // Forward traversal
#define rall(x) (x).rbegin, (x).rend() ... | replace | 134 | 135 | 134 | 135 | TLE | |
p02691 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define m1(x) memset(x, -1, sizeof(x))
const int INF = 1e9 + 1;
const ll MOD = 1e9 + 7;
const double PI =
3.14159265358979323846264... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define m1(x) memset(x, -1, sizeof(x))
const int INF = 1e9 + 1;
const ll MOD = 1e9 + 7;
const double PI =
3.14159265358979323846264... | replace | 16 | 17 | 16 | 17 | 0 | |
p02691 | C++ | Time Limit Exceeded | #include <algorithm>
#include <array>
#include <cctype>
#include <climits>
#include <cmath>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long... | #include <algorithm>
#include <array>
#include <cctype>
#include <climits>
#include <cmath>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long... | replace | 164 | 170 | 164 | 166 | TLE | |
p02691 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll n, a[100001], ans;
map<ll, ll> mp;
int main() {
cin >> n;
for (ll i = 1; i <= n; i++) {
cin >> a[i];
mp[i + a[i]]++;
ans += mp[i - a[i]];
}
cout << ans;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll n, a[200001], ans;
map<ll, ll> mp;
int main() {
cin >> n;
for (ll i = 1; i <= n; i++) {
cin >> a[i];
mp[i + a[i]]++;
ans += mp[i - a[i]];
}
cout << ans;
}
| replace | 4 | 5 | 4 | 5 | 0 | |
p02691 | C++ | Runtime Error | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <complex>
#include <cstdint>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#incl... | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <complex>
#include <cstdint>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#incl... | replace | 55 | 56 | 55 | 56 | 0 | |
p02691 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define INF (1 << 30)
#define EPS 1e-10
#define MOD 1000000007
#define rep(i, n) FOR(i, 0, n)
#define FOR(i, x, n) for (int i = (x); i < (n); ++i)
#define all(v) (v).begin(), (v).end()
using ll = long long;
template <class T> void chmax(T &a, T b) { a > b ?: a = b; }
t... | #include <bits/stdc++.h>
using namespace std;
#define INF (1 << 30)
#define EPS 1e-10
#define MOD 1000000007
#define rep(i, n) FOR(i, 0, n)
#define FOR(i, x, n) for (int i = (x); i < (n); ++i)
#define all(v) (v).begin(), (v).end()
using ll = long long;
template <class T> void chmax(T &a, T b) { a > b ?: a = b; }
t... | replace | 17 | 18 | 17 | 18 | 0 | |
p02691 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
const int MAXN = 1e5 + 5;
const int MOD = 1e9 + 7;
const int INF = 0x3f3f3f3f;
const long long int LLINF = 0x3f3f3f3f3f3f3f3f;
const double EPS = 1e-9;
#define NMAX ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
const int MAXN = 1e5 + 5;
const int MOD = 1e9 + 7;
const int INF = 0x3f3f3f3f;
const long long int LLINF = 0x3f3f3f3f3f3f3f3f;
const double EPS = 1e-9;
#define NMAX ... | replace | 12 | 13 | 12 | 13 | 0 | |
p02691 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define RREP(i, n) for (int i... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define RREP(i, n) for (int i... | replace | 37 | 38 | 37 | 38 | 0 | |
p02691 | C++ | Runtime Error | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ... | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ... | replace | 17 | 18 | 17 | 18 | 0 | |
p02691 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
ll ans;
int main() {
ll n, a[100005];
cin >> n;
map<ll, ll> m;
for (ll i = 1; i <= n; i++) {
cin >> a[i];
m[i - a[i]]++;
}
for (ll i = 1; i <= n; i++) {
ll x = a[i] + i;
ans = ans + m[x];
}
cout << ans;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
ll ans;
int main() {
ll n, a[200005];
cin >> n;
map<ll, ll> m;
for (ll i = 1; i <= n; i++) {
cin >> a[i];
m[i - a[i]]++;
}
for (ll i = 1; i <= n; i++) {
ll x = a[i] + i;
ans = ans + m[x];
}
cout << ans;
return 0;
}
| replace | 5 | 6 | 5 | 6 | 0 | |
p02691 | C++ | Runtime Error | #include <bits/stdc++.h>
typedef long long int ll;
typedef long double ld;
using namespace std;
const long long int INF = 1e18;
const long long int MOD = 1e9 + 7;
typedef pair<ll, ll> pairs;
typedef vector<pairs> p;
struct edge {
ll to, cost;
};
ll gcd(ll a, ll b) {
if (b == 0) {
return a;
} else {
ret... | #include <bits/stdc++.h>
typedef long long int ll;
typedef long double ld;
using namespace std;
const long long int INF = 1e18;
const long long int MOD = 1e9 + 7;
typedef pair<ll, ll> pairs;
typedef vector<pairs> p;
struct edge {
ll to, cost;
};
ll gcd(ll a, ll b) {
if (b == 0) {
return a;
} else {
ret... | replace | 82 | 83 | 82 | 83 | 0 | |
p02691 | C++ | Runtime Error | #include <stdio.h>
#include <stdlib.h>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <sstream>
#include <stdint.h>
#include <string.h>
#define _USE_MATH_DEFINES
#include <math.h>
#include <deque>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#i... | #include <stdio.h>
#include <stdlib.h>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <sstream>
#include <stdint.h>
#include <string.h>
#define _USE_MATH_DEFINES
#include <math.h>
#include <deque>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#i... | replace | 55 | 56 | 55 | 56 | 0 | |
p02691 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define ll long long
using namespace std;
#define Mod 1000000007
int main() {
ll n;
cin >> n;
ll h[n];
for (int i = 0; i < n; ++i) {
cin >> h[i];
}
vector<ll> sa;
for (ll j = 0; j < n; ++j) {
sa.push_back(j - h[j]);
}
ll ans = 0;
sort(sa.begin(), sa.end());
for (l... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
#define Mod 1000000007
int main() {
ll n;
cin >> n;
ll h[n];
for (int i = 0; i < n; ++i) {
cin >> h[i];
}
vector<ll> sa;
for (ll j = 0; j < n; ++j) {
sa.push_back(j - h[j]);
}
ll ans = 0;
sort(sa.begin(), sa.end());
for (l... | delete | 21 | 22 | 21 | 21 | TLE | |
p02691 | C++ | Runtime Error | #include <bits/stdc++.h>
#define int long long
#define ld long double
#define inf 0x7f7f7f7f7f7f7f7f
#define maxn 1000010
#define ri register int
#define il inline
#define mk make_pair
#define pb push_back
#define fi first
#define se second
#define mod 998244353
#define db(x) cout << x << endl;
#define eps 0.0001
using... | #include <bits/stdc++.h>
#define int long long
#define ld long double
#define inf 0x7f7f7f7f7f7f7f7f
#define maxn 1000010
#define ri register int
#define il inline
#define mk make_pair
#define pb push_back
#define fi first
#define se second
#define mod 998244353
#define db(x) cout << x << endl;
#define eps 0.0001
using... | replace | 23 | 24 | 23 | 25 | 0 | |
p02691 | C++ | Time Limit Exceeded | /* Manish Pant - insider_pants, hello_my_friend */
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define F first
#define S second
#define endl "\n"
#define pb push_back
typedef long long ll;
typedef long double... | /* Manish Pant - insider_pants, hello_my_friend */
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define F first
#define S second
#define endl "\n"
#define pb push_back
typedef long long ll;
typedef long double... | replace | 75 | 76 | 75 | 79 | TLE | |
p02691 | C++ | Runtime Error | /*input
32
3 1 4 1 5 9 2 6 5 3 5 8 9 7 9 3 2 3 8 4 6 2 6 4 3 3 8 3 2 7 9 5
*/
#include "bits/stdc++.h"
using namespace std;
#define pb push_back
#define mod 998244353
#define int long long
#define N 100005
int H[N];
map<int, int> ok;
signed main() {
int n, m, ans = 0;
cin >> n; //>>m;
// memset(ok,1,sizeof(ok));... | /*input
32
3 1 4 1 5 9 2 6 5 3 5 8 9 7 9 3 2 3 8 4 6 2 6 4 3 3 8 3 2 7 9 5
*/
#include "bits/stdc++.h"
using namespace std;
#define pb push_back
#define mod 998244353
#define int long long
#define N 200005
int H[N];
map<int, int> ok;
signed main() {
int n, m, ans = 0;
cin >> n; //>>m;
// memset(ok,1,sizeof(ok));... | replace | 9 | 10 | 9 | 10 | 0 | |
p02691 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string.h>
#include <string>
#include <u... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string.h>
#include <string>
#include <u... | replace | 25 | 26 | 25 | 26 | 0 | |
p02691 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll N;
cin >> N;
vector<ll> data(N);
for (ll i = 0; i < N; i++) {
cin >> data[i];
}
vector<vector<int>> fi(N, vector<int>(N, 0));
ll count = 0;
for (ll i = 0; i < N; i++) {
for (ll j = i + 1; j < N; j++) {
if (... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll N;
cin >> N;
vector<ll> T(N);
for (int i = 0; i < N; i++)
cin >> T[i];
map<ll, ll> mp;
for (ll i = 0; i < N; i++)
mp[i + T[i]]++;
ll res = 0;
for (ll i = 0; i < N; i++)
res += mp[i - T[i]];
cout << res << e... | replace | 6 | 19 | 6 | 16 | 0 | |
p02691 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int Nmax = 2e5 + 10;
const int Mod = 1e9 + 7;
const int oo = 1e9;
int n, m;
int vf[Nmax];
int main() {
/**
#ifndef ONLINE_JUDGE
ifstream cin("test.in");
#endif // ONLINE_JUDGE
*/
cin >> n;
long long ans = 0, x;
for (int i = 1; i... | #include <bits/stdc++.h>
using namespace std;
const int Nmax = 2e5 + 10;
const int Mod = 1e9 + 7;
const int oo = 1e9;
int n, m;
map<int, int> vf;
int main() {
/**
#ifndef ONLINE_JUDGE
ifstream cin("test.in");
#endif // ONLINE_JUDGE
*/
cin >> n;
long long ans = 0, x;
for (int i = ... | replace | 9 | 10 | 9 | 10 | 0 | |
p02691 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 100;
int n;
int a[maxn];
map<int, int> b;
// Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools (tips: You
// use the default template now. You can remove this line by using your custom
// template)
int main() {
// Failed to predict... | #include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 100;
int n;
int a[maxn];
map<int, int> b;
// Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools (tips: You
// use the default template now. You can remove this line by using your custom
// template)
int main() {
// Failed to predict... | replace | 3 | 4 | 3 | 4 | 0 | |
p02691 | C++ | Runtime Error | #include <iostream>
#include <math.h>
#include <stdio.h>
using namespace std;
int64_t b[200000000] = {0};
int64_t a[2000000];
int main() {
int64_t n;
scanf("%lld", &n);
int64_t i;
int64_t sum = 0;
for (i = 1; i <= n; i++) {
scanf("%lld", &a[i]);
if (a[i] <= i)
b[(i - a[i])]++;
}
for (i = 1... | #include <iostream>
#include <math.h>
#include <stdio.h>
using namespace std;
int64_t b[200000000] = {0};
int64_t a[2000000];
int main() {
int64_t n;
scanf("%lld", &n);
int64_t i;
int64_t sum = 0;
for (i = 1; i <= n; i++) {
scanf("%lld", &a[i]);
if (a[i] <= i)
b[(i - a[i])]++;
}
for (i = 1... | replace | 19 | 20 | 19 | 21 | -11 | |
p02691 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define rep(i, x, n) for (int i = x; i <= n; i++)
#define per(i, n, x... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define rep(i, x, n) for (int i = x; i <= n; i++)
#define per(i, n, x... | replace | 28 | 29 | 28 | 29 | 0 | |
p02691 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
///////////////////////////////////////////
const long long int INF = 1LL << 60;
const long long int Mod = 1000000007;
using ll = long long int;
using ci = const int;
using vi = vector<int>;
using Vi = vector<long long int>;
using P = pair<int, int>;
using PLL = pair<ll, ll... | #include <bits/stdc++.h>
using namespace std;
///////////////////////////////////////////
const long long int INF = 1LL << 60;
const long long int Mod = 1000000007;
using ll = long long int;
using ci = const int;
using vi = vector<int>;
using Vi = vector<long long int>;
using P = pair<int, int>;
using PLL = pair<ll, ll... | replace | 63 | 64 | 63 | 65 | 0 | |
p02691 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep_ll(i, n) for (ll i = 0; i < (ll)(n); i++)
using namespace std;
typedef long long ll;
typedef unsigned long long u_ll;
typedef pair<int, int> pair_;
const long double PI = (acos(-1));
const int INF = 1001001001;
const int dx[] = {-... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep_ll(i, n) for (ll i = 0; i < (ll)(n); i++)
using namespace std;
typedef long long ll;
typedef unsigned long long u_ll;
typedef pair<int, int> pair_;
const long double PI = (acos(-1));
const int INF = 1001001001;
const int dx[] = {-... | replace | 18 | 24 | 18 | 24 | TLE | |
p02691 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 1e5 + 5;
vector<ll> V;
int pre[maxn], a[maxn], b[maxn];
map<ll, ll> M;
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; i++)
cin >> pre[i];
ll ans = 0;
for (int i = 1; i <= n; i++) {
ans += M[i - pre[i]];
M[p... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 2e5 + 5;
vector<ll> V;
int pre[maxn], a[maxn], b[maxn];
map<ll, ll> M;
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; i++)
cin >> pre[i];
ll ans = 0;
for (int i = 1; i <= n; i++) {
ans += M[i - pre[i]];
M[p... | replace | 3 | 4 | 3 | 4 | 0 | |
p02691 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
vector<int> l(n), r(n);
vector<int> d(n, 0);
rep(i, n) {
l[i] = i + a[i];
r[i] = i -... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
vector<int> l(n), r(n);
vector<int> d(n, 0);
rep(i, n) {
l[i] = i + a[i];
r[i] = i -... | replace | 19 | 21 | 19 | 24 | 0 | |
p02691 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
#define ll long long int
const ll mod = 20123;
us... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
#define ll long long int
const ll mod = 20123;
us... | replace | 20 | 21 | 20 | 21 | 0 | |
p02691 | C++ | Runtime Error | #include <bits/stdc++.h>
// int n=132;
// bitset<16>binar(n);
// int a = bitset<16>(binar).to_ulong();
// cout<<a;
#define int long long
#define pb push_back
#define rep(i, b) for (int i = 0; i < b; i++)
#define all(c) (c).begin(), (c).end()
using namespace std;
signed main() {
int n;
cin >> n;
ve... | #include <bits/stdc++.h>
// int n=132;
// bitset<16>binar(n);
// int a = bitset<16>(binar).to_ulong();
// cout<<a;
#define int long long
#define pb push_back
#define rep(i, b) for (int i = 0; i < b; i++)
#define all(c) (c).begin(), (c).end()
using namespace std;
signed main() {
int n;
cin >> n;
ve... | replace | 17 | 18 | 17 | 18 | -11 | |
p02691 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
#define rep(N) for (int i = 0; i < N; i++)
#define rep2(N1, N2) \
for (int i = 0; i < N1; i++) ... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
#define rep(N) for (int i = 0; i < N; i++)
#define rep2(N1, N2) \
for (int i = 0; i < N1; i++) ... | replace | 61 | 63 | 61 | 63 | TLE | |
p02691 | C++ | Runtime Error | // JavaProgram.cpp
// Author : Priydarshi Singh (@dryairship)
// One cat just leads to another. One bug leads to two others.
#include <bits/stdc++.h>
using namespace std;
// I like my types defined.
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pii> vii;
typedef set<int> si;... | // JavaProgram.cpp
// Author : Priydarshi Singh (@dryairship)
// One cat just leads to another. One bug leads to two others.
#include <bits/stdc++.h>
using namespace std;
// I like my types defined.
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pii> vii;
typedef set<int> si;... | replace | 78 | 79 | 78 | 79 | 0 | |
p02691 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i < b; i++)
#define Rep(i, a, b) for (int i = a; i <= b; i++)
#define _GLIBCXX_DEBUG
#define Vl vector<ll>
#define Vs vector<string>
#define Vp vector<pair<ll, ll>>
#define ll long long
#define ALL(v) (v).begin(), (v).end()
#define endl "\n"
using namespace ... | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i < b; i++)
#define Rep(i, a, b) for (int i = a; i <= b; i++)
#define _GLIBCXX_DEBUG
#define Vl vector<ll>
#define Vs vector<string>
#define Vp vector<pair<ll, ll>>
#define ll long long
#define ALL(v) (v).begin(), (v).end()
#define endl "\n"
using namespace ... | replace | 23 | 24 | 23 | 25 | 0 | |
p02691 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define int 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 true;
}
return false;
}
#define rep(i, n) for... | #include <bits/stdc++.h>
using namespace std;
#define int 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 true;
}
return false;
}
#define rep(i, n) for... | replace | 40 | 45 | 40 | 47 | TLE | |
p02691 | Python | Time Limit Exceeded | def main():
_ = input()
lst_a = [int(a) for a in input().strip().split(" ")]
# build hash table
hash_tbl = {}
for i, a_i in enumerate(lst_a):
n_i = i + 1
tmp = int(n_i - a_i)
if tmp > 0:
if tmp in hash_tbl.keys():
hash_tbl[tmp].append(n_i)
... | def main():
_ = input()
lst_a = [int(a) for a in input().strip().split(" ")]
# build hash table
hash_tbl = {}
for i, a_i in enumerate(lst_a):
n_i = i + 1
tmp = int(n_i - a_i)
if tmp > 0:
if tmp in hash_tbl.keys():
hash_tbl[tmp].append(n_i)
... | replace | 20 | 21 | 20 | 22 | TLE | |
p02691 | Python | Time Limit Exceeded | n = int(input())
a = list(map(int, input().split()))
ans = 0
for i in range(n - 1):
for j in range(i + 1, n):
if j - i == a[i] + a[j]:
ans += 1
print(ans)
| n = int(input())
a = list(map(int, input().split()))
ans = 0
dic1 = {}
dic2 = {}
for i in range(n):
tmp1 = a[i] + (i + 1)
tmp2 = -a[i] + (i + 1)
if tmp1 in dic1:
dic1[tmp1] += 1
else:
dic1[tmp1] = 1
if tmp2 in dic2:
dic2[tmp2] += 1
else:
dic2[tmp2] = 1
for key in... | replace | 4 | 8 | 4 | 20 | TLE | |
p02691 | Python | Time Limit Exceeded | N = int(input())
As = list(map(int, input().split()))
i_plus_Ai = [0 for i in range(N)]
dict = {}
for i in range(N):
i_plus_Ai[i] = i + As[i]
tmp = i - As[i]
if tmp not in dict:
dict[tmp] = [i]
else:
dict[tmp].append(i)
dict[tmp].sort()
count = 0
for i in range(N):
if i_plus_Ai... | N = int(input())
As = list(map(int, input().split()))
i_plus_Ai = [0 for i in range(N)]
dict = {}
for i in range(N):
i_plus_Ai[i] = i + As[i]
tmp = i - As[i]
if tmp not in dict:
dict[tmp] = [i]
else:
dict[tmp].append(i)
count = 0
for i in range(N):
if i_plus_Ai[i] in dict:
... | delete | 12 | 13 | 12 | 12 | TLE | |
p02691 | Python | Runtime Error | from collections import defaultdict
n = int(input())
a = list(map(int, input().split()))
memo = defaultdict(int)
ans = 0
for i, x in enumerate(a, 1):
print(memo)
ans += memo[i - x]
memo[x + i] += 1
print(ans)
| from collections import defaultdict
n = int(input())
a = list(map(int, input().split()))
memo = defaultdict(int)
ans = 0
for i, x in enumerate(a, 1):
ans += memo[i - x]
memo[x + i] += 1
print(ans)
| delete | 9 | 10 | 9 | 9 | 0 | |
p02691 | Python | Runtime Error | # class Map(dict):
# def __missing__(self, key):
# # この割当てなしのほうが速い。
# # self[key] = 0
# return 0
def main():
int(input())
d = {}
ans = 0
for i, height in enumerate(input().split()):
height = int(height)
# 引き算のほうの i は足し算のよりも大きい。
# 従って，このように順番に見ていく必要が... | # class Map(dict):
# def __missing__(self, key):
# # この割当てなしのほうが速い。
# # self[key] = 0
# return 0
def main():
int(input())
d = {}
ans = 0
for i, height in enumerate(input().split()):
height = int(height)
# 引き算のほうの i は足し算のよりも大きい。
# 従って，このように順番に見ていく必要が... | replace | 17 | 18 | 17 | 18 | KeyError: 2 | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02691/Python/s728441168.py", line 25, in <module>
print(main())
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02691/Python/s728441168.py", line 18, in main
d[i + height] += got + 1
... |
p02691 | Python | Time Limit Exceeded | N = int(input())
A = list(map(int, input().split()))
ans = 0
for i in range(N):
a = A[i]
for j in range(min(A[i] + i, N), N):
if a + A[j] == j - i:
ans += 1
print(ans)
| N = int(input())
A = list(map(int, input().split()))
ans = 0
d = {}
for i, a in enumerate(A):
tmp = i + 1 - a
if tmp in d.keys():
d[tmp] += 1
else:
d[tmp] = 1
# print(d)
for i, a in enumerate(A):
tmp = a + i + 1
tmptmp = i + 1 - a
if tmp in d.keys():
ans += d[tmp]
... | replace | 3 | 8 | 3 | 22 | TLE | |
p02691 | Python | Time Limit Exceeded | n = int(input())
a = list(map(int, input().split(" ")))
b = [j - i for i, j in enumerate(a, start=1)]
c = [-j - i for i, j in enumerate(a, start=1)]
result = sum([c.count(i) for i in b])
print(result)
| n = int(input())
a = list(map(int, input().split(" ")))
b = [j - i for i, j in enumerate(a, start=1)]
# c = [-j - i for i, j in enumerate(a, start=1)]
count = {}
for i, j in enumerate(a, start=1):
num = -i - j
if num not in count:
count[num] = 0
count[num] += 1
result = sum([count.get(i, 0) for i i... | replace | 4 | 6 | 4 | 12 | TLE | |
p02691 | Python | Runtime Error | def main():
n = int(input())
a = list(map(int, input().split()))
d = [0] * n
ans = 0
for i in range(n):
ai = a[i]
l, r = i + ai, i - ai
if 0 <= l < n:
d[l] += 1
if 0 <= r < n:
ans += d[r]
print(d)
print(ans)
if __name__ == "__main... | def main():
n = int(input())
a = list(map(int, input().split()))
d = [0] * n
ans = 0
for i in range(n):
ai = a[i]
l, r = i + ai, i - ai
if 0 <= l < n:
d[l] += 1
if 0 <= r < n:
ans += d[r]
print(ans)
if __name__ == "__main__":
main()
| delete | 12 | 13 | 12 | 12 | 0 | |
p02691 | Python | Runtime Error | N = int(input())
A = [int(i) for i in input().split()]
dp = [0] * 10**7
ans = 0
for i in range(N):
x = i + 1 - A[i]
if x >= 0:
ans += dp[x]
if x < 10**7:
dp[i + 1 + A[i]] += 1
print(ans)
| N = int(input())
A = [int(i) for i in input().split()]
dp = [0] * 10**7
ans = 0
for i in range(N):
x = i + 1 - A[i]
if x >= 0:
ans += dp[x]
y = i + 1 + A[i]
if y < 10**7:
dp[y] += 1
print(ans)
| replace | 8 | 10 | 8 | 11 | 1 | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02691/Python/s408503825.py", line 3, in <module>
dp = [0] * 10 ** 7
MemoryError
|
p02691 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 100;
int arr[maxn];
int pre[maxn];
int suf[maxn];
int main() {
int n;
cin >> n;
for (int i = 0; i < n; ++i)
cin >> arr[i];
for (int i = 0; i < n; ++i) {
++pre[i + arr[i]];
if (i - arr[i] >= 0)
++suf[i - arr[i]];
}
long lo... | #include <bits/stdc++.h>
using namespace std;
const int maxn = 2e5 + 100;
int arr[maxn];
int pre[maxn];
int suf[maxn];
int main() {
int n;
cin >> n;
for (int i = 0; i < n; ++i)
cin >> arr[i];
for (int i = 0; i < n; ++i) {
if (i + arr[i] < n)
++pre[i + arr[i]];
if (i - arr[i] >= 0)
++suf[... | replace | 12 | 13 | 12 | 14 | 0 | |
p02691 | C++ | Runtime Error | #include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
ll n;
cin >> n;
vector<ll> a(n), b(n);
ll aa, bb;
rep(i, n) {
cin >> aa;
a[i] = i + aa + 1;
b[i] = i - aa + 1;
}
sort(a.begin(), a.end()... | #include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
ll n;
cin >> n;
vector<ll> a(n), b(n);
ll aa, bb;
rep(i, n) {
cin >> aa;
a[i] = i + aa + 1;
b[i] = i - aa + 1;
}
sort(a.begin(), a.end()... | insert | 30 | 30 | 30 | 33 | 0 | |
p02691 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll mod = 1000000007;
ll r(ll x, ll y) {
if (y == 0)
return 1;
else if (y % 2 == 0)
return r(x, y / 2) * r(x, y / 2) % mod;
else
return x * r(x, (y - 1) / 2) % mod * r(x, (y - 1) / 2) % mod;
}
int main() {
int n;
cin >> n;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll mod = 1000000007;
ll r(ll x, ll y) {
if (y == 0)
return 1;
else if (y % 2 == 0)
return r(x, y / 2) * r(x, y / 2) % mod;
else
return x * r(x, (y - 1) / 2) % mod * r(x, (y - 1) / 2) % mod;
}
int main() {
int n;
cin >> n;
... | replace | 18 | 19 | 18 | 19 | 0 | |
p02691 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
ll ans = 0;
vector<pair<ll, ll>> A(N);
for (int i = 0; i < N; i++) {
ll a;
cin >> a;
A[i].first = i + 1 + a;
A[i].second = i + 1 - a;
}
vector<int> B(N + 1, 0);
for (int i = N - 1; i >= 0; i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
ll ans = 0;
vector<pair<ll, ll>> A(N);
for (int i = 0; i < N; i++) {
ll a;
cin >> a;
A[i].first = i + 1 + a;
A[i].second = i + 1 - a;
}
vector<int> B(N + 1, 0);
for (int i = N - 1; i >= 0; i... | replace | 16 | 17 | 16 | 19 | 0 | |
p02691 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
// Begin Header {{{
#define all(x) (x).begin(), (x).end()
#define lli long long int
#define rep(i, n) for (lli i = 0; i < n; i++)
#define loop(i, j, n) for (lli i = j; i < n; i++)
#define Max(a, b) ((a) > (b) ? (a) : (b))
#define Min(a, b) ((a) < (b) ? (a) : (b))
constexpr int INF = 0x3f3f3f3f;... | #include <bits/stdc++.h>
// Begin Header {{{
#define all(x) (x).begin(), (x).end()
#define lli long long int
#define rep(i, n) for (lli i = 0; i < n; i++)
#define loop(i, j, n) for (lli i = j; i < n; i++)
#define Max(a, b) ((a) > (b) ? (a) : (b))
#define Min(a, b) ((a) < (b) ? (a) : (b))
constexpr int INF = 0x3f3f3f3f;... | replace | 27 | 34 | 27 | 35 | TLE | |
p02691 | Python | Time Limit Exceeded | import sys
from bisect import bisect_right, bisect_left
sys.setrecursionlimit(10**6)
INF = float("inf")
MOD = 10**9 + 7
def input():
return sys.stdin.readline().strip()
def main():
N = int(input())
A = list(map(int, input().split()))
T = [i + 1 - A[i] for i in range(N)]
idx = sorted(range(N), k... | import sys
from bisect import bisect_right, bisect_left
sys.setrecursionlimit(10**6)
INF = float("inf")
MOD = 10**9 + 7
def input():
return sys.stdin.readline().strip()
def main():
N = int(input())
A = list(map(int, input().split()))
T = [i + 1 - A[i] for i in range(N)]
idx = sorted(range(N), k... | replace | 29 | 33 | 29 | 30 | TLE | |
p02691 | C++ | Runtime Error | #include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define N_MAX 200000
#define MODVAL 1000000007
int main(void) {
int n;
int a[200000];
int i, j;
long long int ret = 0;
int b[2000000] = {};
int bias = 1000000;
int diff;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf... | #include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define N_MAX 200000
#define MODVAL 1000000007
int main(void) {
int n;
int a[200000];
int i, j;
long long int ret = 0;
int b[2000000] = {};
int bias = 1000000;
int diff;
scanf("%d", &n);
for (i = 0; i < n; i++) {
scanf... | replace | 26 | 27 | 26 | 29 | -11 | |
p02691 | C++ | Runtime Error | #include <bits/stdc++.h>
#define IO ios::sync_with_stdio(false), cin.tie(0)
#define INF 0x3f3f3f3f
typedef long long ll;
using namespace std;
const int maxn = 1e5 + 10;
ll a[maxn];
ll l[maxn], r[maxn];
int main() {
IO;
ll n;
cin >> n;
memset(l, 0, sizeof(l));
memset(r, 0, sizeof(r));
for (int i = 1; i <= n;... | #include <bits/stdc++.h>
#define IO ios::sync_with_stdio(false), cin.tie(0)
#define INF 0x3f3f3f3f
typedef long long ll;
using namespace std;
const int maxn = 2e5 + 10;
ll a[maxn];
ll l[maxn], r[maxn];
int main() {
IO;
ll n;
cin >> n;
memset(l, 0, sizeof(l));
memset(r, 0, sizeof(r));
for (int i = 1; i <= n;... | replace | 5 | 6 | 5 | 6 | 0 | |
p02691 | C++ | Runtime Error | #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define ll long long
#define ll_MAX LONG_LONG_MAX
#define ll_MIN LONG_LONG_MIN
#define pi pair<ll, ll>
#define endl "\n"
#define MAXN 100005
using namespace std;
ll n, arr[MAXN];
map<ll, ll> m, m1;
void solve() {
c... | #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define ll long long
#define ll_MAX LONG_LONG_MAX
#define ll_MIN LONG_LONG_MIN
#define pi pair<ll, ll>
#define endl "\n"
#define MAXN 200005
using namespace std;
ll n, arr[MAXN];
map<ll, ll> m, m1;
void solve() {
c... | replace | 10 | 11 | 10 | 11 | 0 | |
p02691 | C++ | Runtime Error | /*
Author: Alam Khan
AUST CSE 40th Batch
*/
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef vector<... | /*
Author: Alam Khan
AUST CSE 40th Batch
*/
#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef vector<... | replace | 52 | 53 | 52 | 53 | 0 | |
p02691 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define sc(x) scanf("%lld", &x);
#define int long long
#define fi first
#define se second
#define endl '\n'
#define P pair<int, int>
#define fi first
#define se second
int A[100004];
int B[100005];
map<int, int> mp;
signed main() {
int n;
sc(n) for... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define sc(x) scanf("%lld", &x);
#define int long long
#define fi first
#define se second
#define endl '\n'
#define P pair<int, int>
#define fi first
#define se second
int A[200004];
int B[200005];
map<int, int> mp;
signed main() {
int n;
sc(n) for... | replace | 12 | 14 | 12 | 14 | 0 | |
p02691 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
int main() {
int n;
cin >> n;
vi a(n + 1);
rep(i, n) cin >> a[i + 1];
int ans = 0;
for (int i = 1; i <= n - 1; i++) {
for (int j = i +... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
int main() {
int n;
cin >> n;
vi a(n + 1);
rep(i, n) cin >> a[i + 1];
map<int, int> mp;
ll ans = 0;
for (int i = 1; i <= n; i++) {
i... | replace | 12 | 18 | 12 | 19 | TLE | |
p02691 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
using P = pair<ll, ll>;
const ll mod = 1e9 + 7;
#define ALL(x) (x).begin(), (x).end()
#define REP(i, n) for (ll(i) = 0; (i) < (n); (i)++)
#define REPS(i, n) for (ll(i) = 1; (i) <= (n); (i)++)
#define RREP(i, n) for (ll(i) = (n -... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
using P = pair<ll, ll>;
const ll mod = 1e9 + 7;
#define ALL(x) (x).begin(), (x).end()
#define REP(i, n) for (ll(i) = 0; (i) < (n); (i)++)
#define REPS(i, n) for (ll(i) = 1; (i) <= (n); (i)++)
#define RREP(i, n) for (ll(i) = (n -... | replace | 51 | 52 | 51 | 52 | 0 | |
p02691 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll mod = 1000000007;
// j-i=a[j]+a[i]
// j-a[j]=i+a[i]
int main() {
ll n;
cin >> n;
vector<ll> wa(200000), sa(20000);
for (int i = 0; i < n; i++) {
ll a;
cin >> a;
if (a + i + 1 < 200000)
wa[a + i + 1]++;
if (i + 1 ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll mod = 1000000007;
// j-i=a[j]+a[i]
// j-a[j]=i+a[i]
int main() {
ll n;
cin >> n;
vector<ll> wa(200000), sa(200000);
for (int i = 0; i < n; i++) {
ll a;
cin >> a;
if (a + i + 1 < 200000)
wa[a + i + 1]++;
if (i + 1... | replace | 10 | 11 | 10 | 11 | -11 | |
p02691 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
int e() {
int n;
std::cin >> n;
std::vector<long long> ha_a(n, 0);
std::vector<long long> hb_b(n, 0);
for (int i = 0; i < n; i++) {
long long temp;
std::cin >> temp;
ha_a[i] = i + 1 - temp;
hb_b[i] = i + 1 + temp;
}
std::sort(hb_b.begin(), hb_b.end());
long l... | #include <bits/stdc++.h>
int e() {
int n;
std::cin >> n;
std::vector<long long> ha_a(n, 0);
std::vector<long long> hb_b(n, 0);
for (int i = 0; i < n; i++) {
long long temp;
std::cin >> temp;
ha_a[i] = i + 1 - temp;
hb_b[i] = i + 1 + temp;
}
std::sort(hb_b.begin(), hb_b.end());
long l... | replace | 21 | 27 | 21 | 25 | TLE | |
p02691 | C++ | Runtime Error | // #pragma GCC optimize ("O3")
// #pragma GCC target ("avx2")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr << (... | // #pragma GCC optimize ("O3")
// #pragma GCC target ("avx2")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr << (... | replace | 26 | 27 | 26 | 27 | 0 | |
p02691 | C++ | Time Limit Exceeded |
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define endl "\n"
#define F first
#define S second
#define def(x) cerr << #x << " is " << x << endl;
#define mod 1000000007
#define pb push_back
#define FOR(i, a, n) for (ll i = a; i < n; i++)
#define ios ... |
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define endl "\n"
#define F first
#define S second
#define def(x) cerr << #x << " is " << x << endl;
#define mod 1000000007
#define pb push_back
#define FOR(i, a, n) for (ll i = a; i < n; i++)
#define ios ... | replace | 38 | 47 | 38 | 47 | TLE | |
p02691 | C++ | Runtime Error | #pragma GCC optimize(3, "Ofast", "inline")
#pragma GCC target("avx")
#include <bits/stdc++.h>
using namespace std;
#ifdef ONLINE_JUDGE
#define getchar gc
inline char gc() {
static char buf[1 << 16], *p1 = buf, *p2 = buf;
if (p1 == p2) {
p2 = (p1 = buf) + fread(buf, 1, 1 << 16, stdin);
if (p2 == p1)
re... | #pragma GCC optimize(3, "Ofast", "inline")
#pragma GCC target("avx")
#include <bits/stdc++.h>
using namespace std;
#ifdef ONLINE_JUDGE
#define getchar gc
inline char gc() {
static char buf[1 << 16], *p1 = buf, *p2 = buf;
if (p1 == p2) {
p2 = (p1 = buf) + fread(buf, 1, 1 << 16, stdin);
if (p2 == p1)
re... | replace | 38 | 39 | 38 | 39 | 0 | |
p02691 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
long long int N;
cin >> N;
long long int A[N];
for (long long int i = 0; i < N; i++)
cin >> A[i];
long long int help[N], help2[N];
for (long long int i = 0; i < N; i++) {
help[i] = i + 1 - A[i];
help2[i] = i + 1 + A[i];
}
long long int... | #include <iostream>
using namespace std;
int main() {
long long int N;
cin >> N;
long long int A[N];
for (long long int i = 0; i < N; i++)
cin >> A[i];
long long int help[N], help2[N];
for (long long int i = 0; i < N; i++) {
help[i] = i + 1 - A[i];
help2[i] = i + 1 + A[i];
}
long long int... | insert | 24 | 24 | 24 | 28 | -11 | |
p02691 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 5e5 + 5;
ll a[maxn], ans[maxn];
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; ++i) {
cin >> a[i];
ans[i + a[i]]++;
}
ll x = 0;
for (int i = n; i >= 1; --i) {
if (i - a[i] >= 200000 || i - a[i] <= 0)
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 5e5 + 5;
ll a[maxn], ans[maxn];
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; ++i) {
cin >> a[i];
if (i + a[i] < 200000)
ans[i + a[i]]++;
}
ll x = 0;
for (int i = n; i >= 1; --i) {
if (i - a[i] >= ... | replace | 10 | 11 | 10 | 12 | 0 | |
p02691 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long
int a[100010];
signed main() {
int n;
cin >> n;
int ans = 0;
map<int, int> mt;
for (int i = 1; i <= n; ++i) {
cin >> a[i];
int t2 = i + a[i];
if (t2 <= n && t2 > 0) {
++mt[t2];
}
}
for (int i = 1; i <= n; ++i) {
... | #include <bits/stdc++.h>
using namespace std;
#define int long long
int a[200010];
signed main() {
int n;
cin >> n;
int ans = 0;
map<int, int> mt;
for (int i = 1; i <= n; ++i) {
cin >> a[i];
int t2 = i + a[i];
if (t2 <= n && t2 > 0) {
++mt[t2];
}
}
for (int i = 1; i <= n; ++i) {
... | replace | 4 | 5 | 4 | 5 | 0 | |
p02691 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <vector>
#define lowbit(i) (i & (-i))
typedef long long LL;
using namespace std;
const int maxn = 1e5 + 5;
int readint() {
int x = 0, f = 1;
char s = getchar();
#define sc (s = getchar())
while (s < '0' || s > '9')... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <vector>
#define lowbit(i) (i & (-i))
typedef long long LL;
using namespace std;
const int maxn = 2e5 + 5;
int readint() {
int x = 0, f = 1;
char s = getchar();
#define sc (s = getchar())
while (s < '0' || s > '9')... | replace | 9 | 10 | 9 | 10 | 0 | |
p02691 | C++ | Runtime Error | #include <iostream>
#include <map>
using namespace std;
typedef long long int lli;
const int MaxN = 100005;
map<lli, lli> mapi;
lli arr[MaxN];
int main() {
lli N, M, i, j, p, q, res = 0;
cin >> N;
for (i = 1; i <= N; i++) {
cin >> arr[i];
}
for (i = 1; i <= N; i++) {
p = i - arr[i];
q = i + arr[i]... | #include <iostream>
#include <map>
using namespace std;
typedef long long int lli;
const int MaxN = 200005;
map<lli, lli> mapi;
lli arr[MaxN];
int main() {
lli N, M, i, j, p, q, res = 0;
cin >> N;
for (i = 1; i <= N; i++) {
cin >> arr[i];
}
for (i = 1; i <= N; i++) {
p = i - arr[i];
q = i + arr[i]... | replace | 4 | 5 | 4 | 5 | 0 | |
p02691 | C++ | Runtime Error | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <complex>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include ... | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <complex>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include ... | insert | 561 | 561 | 561 | 563 | 0 | |
p02691 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define repr(i, n) for (int i = n - 1; i >= 0; i--)
#define MAX(a, b) a = a > b ? a : b
#define MIN(a, b) a = a < b ? a : b
#define REP(i, x, n) for (int i = x; i < n; i++)
#define REPR(i, x, n) for (int i = n - 1; i >= x; i--)
#define pb push_back
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define repr(i, n) for (int i = n - 1; i >= 0; i--)
#define MAX(a, b) a = a > b ? a : b
#define MIN(a, b) a = a < b ? a : b
#define REP(i, x, n) for (int i = x; i < n; i++)
#define REPR(i, x, n) for (int i = n - 1; i >= x; i--)
#define pb push_back
... | replace | 26 | 27 | 26 | 28 | 0 | |
p02691 | C++ | Runtime Error | #include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
typedef long long ll;
#define pb push_back
#define mp make_pair
#define all(a) (a).begin(), (a).end()
#define clr(a, h) memset(a, (h), sizeof(a))
#define mem(a, h) memset(a, (h), sizeof(a))
#define fi first
#def... | #include <bits/stdc++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
typedef long long ll;
#define pb push_back
#define mp make_pair
#define all(a) (a).begin(), (a).end()
#define clr(a, h) memset(a, (h), sizeof(a))
#define mem(a, h) memset(a, (h), sizeof(a))
#define fi first
#def... | replace | 29 | 30 | 29 | 30 | 0 | |
p02691 | C++ | Runtime Error | #include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
uint64_t N;
uint64_t Ai[200000];
uint64_t difAN[200000];
cin >> N;
for (uint64_t i = 0; i < N; i++) {
difAN[i] = 0;
}
for (uint64_t i = 0; i < N; i++) {
uint64_t temp;
cin >> temp;
Ai[i] = temp + i... | #include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
uint64_t N;
uint64_t Ai[200000];
uint64_t difAN[200000];
cin >> N;
for (uint64_t i = 0; i < N; i++) {
difAN[i] = 0;
}
for (uint64_t i = 0; i < N; i++) {
uint64_t temp;
cin >> temp;
Ai[i] = temp + i... | replace | 27 | 28 | 27 | 30 | 0 | |
p02691 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long
#define inf 0x3f3f3f3f
#define pi acos(-1.0)
using namespace std;
const int maxn = 1e5 + 5;
ll a[maxn];
map<ll, ll> mp;
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
mp[-(a[i] + i)]++;
}
ll ans = 0;
for (int i = 1; i <= n; i+... | #include <bits/stdc++.h>
#define ll long long
#define inf 0x3f3f3f3f
#define pi acos(-1.0)
using namespace std;
const int maxn = 2e5 + 5;
ll a[maxn];
map<ll, ll> mp;
int main() {
int n;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
mp[-(a[i] + i)]++;
}
ll ans = 0;
for (int i = 1; i <= n; i+... | replace | 5 | 6 | 5 | 6 | 0 | |
p02691 | C++ | Runtime Error | /*
, -- 、
/;;;;;;',
i二二二i
, ' ヽ ???
i ﾉﾉﾉﾉﾉﾍ .',
〉ﾘi' ﾟ ヮﾟﾉﾚく WAyon..........
○⊂}〈lﾄ--ｲl〉{つ●
,ｒ/ー i-ヽヽ
｀｀i_ﾗi_ﾗ
*/
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define int long long
const int INF =... | /*
, -- 、
/;;;;;;',
i二二二i
, ' ヽ ???
i ﾉﾉﾉﾉﾉﾍ .',
〉ﾘi' ﾟ ヮﾟﾉﾚく WAyon..........
○⊂}〈lﾄ--ｲl〉{つ●
,ｒ/ー i-ヽヽ
｀｀i_ﾗi_ﾗ
*/
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define int long long
const int INF =... | replace | 68 | 69 | 68 | 70 | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.