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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
p02850 | C++ | Runtime Error |
/**
* author : 𝒌𝒚𝒐𝒎𝒖𝒌𝒚𝒐𝒎𝒖𝒑𝒖𝒓𝒊𝒏
* created : 2019-12-07 22:21:13
**/
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#i... |
/**
* author : 𝒌𝒚𝒐𝒎𝒖𝒌𝒚𝒐𝒎𝒖𝒑𝒖𝒓𝒊𝒏
* created : 2019-12-07 22:21:13
**/
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#i... | replace | 50 | 51 | 50 | 51 | 0 | |
p02850 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL << 62
#define inf 1000000007
ll n, ans[100010], ans1;
vector<pair<ll, ll>> ch[100010];
void dep(ll p, ll c) {
ll cnt = 1;
if (ch[p].size() == 1 && p != 0) {
return;
}
for (ll i = 0; i < ch[p].size(); i++) {
ll next = ch... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL << 62
#define inf 1000000007
ll n, ans[100010], ans1;
vector<pair<ll, ll>> ch[100010];
void dep(ll p, ll c) {
ll cnt = 1;
if (ch[p].size() == 1 && p != 0) {
return;
}
for (ll i = 0; i < ch[p].size(); i++) {
ll next = ch... | replace | 22 | 23 | 22 | 23 | 0 | |
p02850 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
typedef long long ll;
class Edge;
class Node {
public:
vector<Edge *> con_edges;
vector<Node *> con_nodes;
};
class Edge {
public:
Node *a;
Node *b;
int color;
};
Edge *EDGE_NIL;
void Paint(Node *node, Edg... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
typedef long long ll;
class Edge;
class Node {
public:
vector<Edge *> con_edges;
vector<Node *> con_nodes;
};
class Edge {
public:
Node *a;
Node *b;
int color;
};
Edge *EDGE_NIL;
void Paint(Node *node, Edg... | replace | 34 | 36 | 34 | 38 | -11 | |
p02850 | C++ | Runtime Error | #include <iostream>
#include <vector>
using namespace std;
void nuri(int, int);
int N, a[100000], b[100000], cco[100000] = {0}, coun[100000] = {0},
col[100000] = {0}, maxN;
vector<vector<int>> to;
int main() {
maxN = 0;
cin >> N;
to.resize(N);
for (int i = 0; i < N - 1; i++) {
... | #include <iostream>
#include <vector>
using namespace std;
void nuri(int, int);
int N, a[100000], b[100000], cco[100000] = {0}, coun[100000] = {0},
col[100000] = {0}, maxN;
vector<vector<int>> to;
int main() {
maxN = 0;
cin >> N;
to.resize(N + 1);
for (int i = 0; i < N - 1; i++) {... | replace | 12 | 13 | 12 | 13 | -6 | terminate called after throwing an instance of 'std::bad_alloc'
what(): std::bad_alloc
|
p02850 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
long long MOD = 10000000000 + 7;
int main() {
cout << setprecision(10);
int N;
cin >> N;
vector<pii> edge(N - 1); // 枝が結んでいる頂点
vector<int> edge_col(N - 1, -1); // 色
vector<map<int, int>> node_col(... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
long long MOD = 10000000000 + 7;
int main() {
cout << setprecision(10);
int N;
cin >> N;
vector<pii> edge(N - 1); // 枝が結んでいる頂点
vector<int> edge_col(N - 1, -1); // 色
vector<map<int, int>> node_col(... | replace | 59 | 64 | 59 | 69 | TLE | |
p02850 | C++ | Time Limit Exceeded | // >>> TEMPLATES
#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++)
#define repR(i, n) for (int i = int(n) - 1; i >= 0; i--)
#define rep1R(i, n) for (int i = int(n); i >= 1; i--)
#define loop(i, a, B) for (int i = a; i B;... | // >>> TEMPLATES
#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++)
#define repR(i, n) for (int i = int(n) - 1; i >= 0; i--)
#define rep1R(i, n) for (int i = int(n); i >= 1; i--)
#define loop(i, a, B) for (int i = a; i B;... | replace | 136 | 137 | 136 | 142 | TLE | |
p02850 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<int, int> Pi;
typedef vector<ll> Vec;
typedef vector<int> Vi;
typedef vector<string> Vs;
typedef vector<vector<ll>> VV;
typedef vector<vector<int>> VVi;
#define REP(i, a, b) for (ll i = (a); i < (b); i++)
#define... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<int, int> Pi;
typedef vector<ll> Vec;
typedef vector<int> Vi;
typedef vector<string> Vs;
typedef vector<vector<ll>> VV;
typedef vector<vector<int>> VVi;
#define REP(i, a, b) for (ll i = (a); i < (b); i++)
#define... | replace | 80 | 82 | 80 | 82 | 0 | |
p02850 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
using namespace std;
const int N = 1e5 + 10;
int ans[N];
int to[N], nxt[N], id[N], lst[N];
inline void add(int u, int v, int i) {
static int cnt = 0;
++cnt, to[cnt] = v, nxt[cnt] = lst[u], lst[u] = cnt, id[cnt] = i, ++cnt,
to[cnt] = u, nxt[cnt] = lst[v], lst[v] = c... | #include <algorithm>
#include <cstdio>
using namespace std;
const int N = 2e5 + 10;
int ans[N];
int to[N], nxt[N], id[N], lst[N];
inline void add(int u, int v, int i) {
static int cnt = 0;
++cnt, to[cnt] = v, nxt[cnt] = lst[u], lst[u] = cnt, id[cnt] = i, ++cnt,
to[cnt] = u, nxt[cnt] = lst[v], lst[v] = c... | replace | 5 | 6 | 5 | 6 | 0 | |
p02850 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
const int INF = 1e9;
struct Edge {
int to, id;
};
vector<vector<Edge>> g;
vector<int> ans;
int main() {
int n;
cin >> n;
g.resize(n);
ans.resize(n - 1);
rep(i, n - 1) {
int a, b;
c... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
const int INF = 1e9;
struct Edge {
int to, id;
};
vector<vector<Edge>> g;
vector<int> ans;
int main() {
int n;
cin >> n;
g.resize(n);
ans.resize(n - 1);
rep(i, n - 1) {
int a, b;
c... | insert | 51 | 51 | 51 | 52 | TLE | |
p02850 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
long long mod = 1000000007;
const int INF = 1001001001;
int main() {
int n;
cin >> n;
vector<vector<int>> G(n, vector<int>(0));
vector<pair<int, int>> vp(n - 1);
for (int i = 0; i < n - 1; i++) {
int a, b;
cin >> a >> b;
a--;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
long long mod = 1000000007;
const int INF = 1001001001;
int main() {
int n;
cin >> n;
vector<vector<int>> G(n, vector<int>(0));
vector<pair<int, int>> vp(n - 1);
for (int i = 0; i < n - 1; i++) {
int a, b;
cin >> a >> b;
a--;
... | replace | 45 | 49 | 45 | 49 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): map::at
|
p02850 | C++ | Runtime Error | #include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
vector<int> edge[10010];
vector<int> n_edge[10010];
int color[100010];
int Max = 0;
void allocate(int a, int prev, int prev_color) {
int count = 0;
for (int i = 0; i < edge[a].size(); i++) {
if (e... | #include <iostream>
#include <math.h>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
vector<int> edge[100010];
vector<int> n_edge[100010];
int color[100010];
int Max = 0;
void allocate(int a, int prev, int prev_color) {
int count = 0;
for (int i = 0; i < edge[a].size(); i++) {
if ... | replace | 7 | 9 | 7 | 9 | 0 | |
p02850 | C++ | Runtime Error | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <q... | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <q... | replace | 29 | 30 | 29 | 30 | 0 | |
p02850 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#if __cplusplus >= 201103L
#include <unordered_map>
#include <unordered_set>
#endif
#inc... | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#if __cplusplus >= 201103L
#include <unordered_map>
#include <unordered_set>
#endif
#inc... | replace | 97 | 100 | 97 | 102 | TLE | |
p02850 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, m, n) for (ll i = (ll)(m); i < (ll)(n); i++)
long long mo = 1e9 + 7;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> Pii;
typedef pair<ll, ll> Pll;
template <class T, class S> void cmin(T &a, ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, m, n) for (ll i = (ll)(m); i < (ll)(n); i++)
long long mo = 1e9 + 7;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> Pii;
typedef pair<ll, ll> Pll;
template <class T, class S> void cmin(T &a, ... | insert | 47 | 47 | 47 | 48 | 0 | |
p02850 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;
using pll = pair<ll, ll>;
#define INF (1LL << 60)
#define MOD 1000000007
#define PI 3.14159265358979323846
#define REP(i, m, n) for (ll(i) = (m), (i_len) = (n); (i) < (i_len); ++(i))
#define FORR(i, v... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;
using pll = pair<ll, ll>;
#define INF (1LL << 60)
#define MOD 1000000007
#define PI 3.14159265358979323846
#define REP(i, m, n) for (ll(i) = (m), (i_len) = (n); (i) < (i_len); ++(i))
#define FORR(i, v... | replace | 42 | 44 | 42 | 44 | -6 | munmap_chunk(): invalid pointer
|
p02850 | C++ | Memory Limit Exceeded | #include <algorithm>
#include <bitset>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
using vll = vector<long lo... | #include <algorithm>
#include <bitset>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
using vll = vector<long lo... | replace | 75 | 76 | 75 | 76 | MLE | |
p02850 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstring>
#include <functional>
#include <iomanip>
#include <list>
#include <memory>
#include <queue>
#include <set>
#include <stack>
#include <vector>
// #include <boost/multiprecision/cpp_dec_float.hpp>
// #include <boost/multipre... | #include <bits/stdc++.h>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstring>
#include <functional>
#include <iomanip>
#include <list>
#include <memory>
#include <queue>
#include <set>
#include <stack>
#include <vector>
// #include <boost/multiprecision/cpp_dec_float.hpp>
// #include <boost/multipre... | replace | 70 | 71 | 70 | 71 | 0 | |
p02850 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
// def
#define debug(x) cout << #x << ": " << x << endl
#define out(x) cout << x << endl
#define repeat(i, a, b) for (int i = (a); i < (b); i++)
#define revrepeat(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define revre... | #include <bits/stdc++.h>
using namespace std;
// def
#define debug(x) cout << #x << ": " << x << endl
#define out(x) cout << x << endl
#define repeat(i, a, b) for (int i = (a); i < (b); i++)
#define revrepeat(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define revre... | replace | 33 | 34 | 33 | 34 | 0 | |
p02850 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
#define reps(i, s, n) for (int(i) = (s); (i) < (n); (i)++)
#define rep(i, n) reps(i, 0, n)
#define max(a, b) a < b ? b : a
using namespace std;
using ll = long long;
int main() {
int N;
... | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
#define reps(i, s, n) for (int(i) = (s); (i) < (n); (i)++)
#define rep(i, n) reps(i, 0, n)
#define max(a, b) a < b ? b : a
using namespace std;
using ll = long long;
int main() {
int N;
... | replace | 19 | 20 | 19 | 20 | 0 | |
p02850 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<vector<int>> G(N);
vector<pair<int, int>> vp;
for (int i = 0; i < N; i++) {
int a, b;
cin >> a >> b;
a--, b--;
G[a].emplace_back(b);
G[b].emplace_back(a);
vp.emplace_back(a, b);
}
int K = 0;
map<... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<vector<int>> G(N);
vector<pair<int, int>> vp;
for (int i = 1; i < N; i++) {
int a, b;
cin >> a >> b;
a--, b--;
G[a].emplace_back(b);
G[b].emplace_back(a);
vp.emplace_back(a, b);
}
int K = 0;
map<... | replace | 8 | 9 | 8 | 9 | 0 | |
p02850 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
#define ASC(vec) vec.begin(), vec.end() // 昇順ソート 例：sort(ASC(vec));
#define DESC(vec) vec.rbegin(), vec.rend() // 降順ソート 例:sort(DESC(vec));
#define rep(i, n) for (int i = 0; i < n; i++)
#define Rep(i, n) for (int i = 1; i < n; i++)
const int mod = 1000000007;
const int inf ... | #include "bits/stdc++.h"
using namespace std;
#define ASC(vec) vec.begin(), vec.end() // 昇順ソート 例：sort(ASC(vec));
#define DESC(vec) vec.rbegin(), vec.rend() // 降順ソート 例:sort(DESC(vec));
#define rep(i, n) for (int i = 0; i < n; i++)
#define Rep(i, n) for (int i = 1; i < n; i++)
const int mod = 1000000007;
const int inf ... | replace | 75 | 76 | 75 | 76 | 0 | |
p02850 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using int64 = long long;
#define int int64
#define rep(i, n) for (int i = 0; i < n; i++)
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define SORT(x) sort(x.begin(), x.end())
#define GSORT(x) sort(x.begin(), x.end(), greater<int>())
#define mk make_pair
#define fi first... | #include <bits/stdc++.h>
using namespace std;
using int64 = long long;
#define int int64
#define rep(i, n) for (int i = 0; i < n; i++)
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define SORT(x) sort(x.begin(), x.end())
#define GSORT(x) sort(x.begin(), x.end(), greater<int>())
#define mk make_pair
#define fi first... | replace | 31 | 32 | 31 | 32 | 0 | |
p02850 | C++ | Runtime Error |
#include <bits/stdc++.h>
using namespace std;
/* g++ -g -fsanitize=address -lasan -std=c++11 -Dfoo_ */
/* freopen("input.txt", "rt", stdin); */
/* freopen("output.txt", "wt", stdout); */
#define ALL(c) (c).begin(), (c).end()
#define ALLR(c) (c).rbegin(), (c).rend()
#define FOR(i, a, b) for (int i = (a); i < (b); +... |
#include <bits/stdc++.h>
using namespace std;
/* g++ -g -fsanitize=address -lasan -std=c++11 -Dfoo_ */
/* freopen("input.txt", "rt", stdin); */
/* freopen("output.txt", "wt", stdout); */
#define ALL(c) (c).begin(), (c).end()
#define ALLR(c) (c).rbegin(), (c).rend()
#define FOR(i, a, b) for (int i = (a); i < (b); +... | replace | 40 | 41 | 40 | 41 | 0 | |
p02850 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define rep2(i, a, b) for (ll i = (a); i < (b); i++)
typedef uint64_t ull;
typedef int64_t ll;
typedef std::pair<ll, ll> PLL;
using namespace std;
ll N;
ll color[100100];
vector<PLL> edges[10100]; // {nxt, ID}: 次の頂点nxt, その辺のID
void dfs(ll cur, ... | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define rep2(i, a, b) for (ll i = (a); i < (b); i++)
typedef uint64_t ull;
typedef int64_t ll;
typedef std::pair<ll, ll> PLL;
using namespace std;
ll N;
ll color[100100];
vector<PLL> edges[100100]; // {nxt, ID}: 次の頂点nxt, その辺のID
void dfs(ll cur,... | replace | 12 | 13 | 12 | 13 | 0 | |
p02850 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
vector<pair<int, int>> edges[100000];
int ans[100000];
void dfs(int i, int par, int pc) {
int c = 1;
for (auto p : edges[i]) {
int j = p.first, idx = p.second;
// if(j == par) continue;
if (c == pc)
c++;
ans[idx] = c;
dfs(j, i, c);
c++;
... | #include <bits/stdc++.h>
using namespace std;
vector<pair<int, int>> edges[100000];
int ans[100000];
void dfs(int i, int par, int pc) {
int c = 1;
for (auto p : edges[i]) {
int j = p.first, idx = p.second;
if (j == par)
continue;
if (c == pc)
c++;
ans[idx] = c;
dfs(j, i, c);
c+... | replace | 10 | 11 | 10 | 12 | -11 | |
p02851 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef pair<ll, ll> pll;
#define all(x) x.begin(), x.end()
#define kill(x) return cout << x << endl, 0;
#define X first
#define Y second
#define sep ' '
#define endl '\n'
#define fastio ... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef pair<ll, ll> pll;
#define all(x) x.begin(), x.end()
#define kill(x) return cout << x << endl, 0;
#define X first
#define Y second
#define sep ' '
#define endl '\n'
#define fastio ... | replace | 30 | 31 | 30 | 31 | 0 | |
p02851 | C++ | Runtime Error |
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); ++i)
typedef long long ll;
ll vs[100000 + 10];
ll cs[100000 + 10];
map<ll, queue<int>> table;
int main(void) {
int n;
ll... |
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); ++i)
typedef long long ll;
ll vs[200000 + 10];
ll cs[200000 + 10];
map<ll, queue<int>> table;
int main(void) {
int n;
ll... | replace | 13 | 15 | 13 | 15 | 0 | |
p02851 | C++ | Runtime Error | #include <bits/stdc++.h>
typedef long long LL;
typedef unsigned long long LONG;
const int N = 1e5 + 5;
using namespace std;
typedef pair<int, int> PII;
#define ft fisrt
#define sd second
#define eb emplace_back
template <class T> inline bool read(T &ret) {
char c;
int sgn;
if (static_cast<void>(c = getchar()), ... | #include <bits/stdc++.h>
typedef long long LL;
typedef unsigned long long LONG;
const int N = 1e5 + 5;
using namespace std;
typedef pair<int, int> PII;
#define ft fisrt
#define sd second
#define eb emplace_back
template <class T> inline bool read(T &ret) {
char c;
int sgn;
if (static_cast<void>(c = getchar()), ... | replace | 27 | 28 | 27 | 28 | 0 | |
p02851 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using int32 = int_fast32_t;
using int64 = int_fast64_t;
const int32 INF = 1e9;
const int32 MOD = 1e9 + 7;
const int64 LLINF = 1e18;
#define YES(n) cout << ((n) ? "YES\n" : "NO\n")
#define Yes(n) cout << ((n) ? "Yes\n" : "No\n")
#define ANS(n) cout << (n) << "\n"
#define ... | #include <bits/stdc++.h>
using namespace std;
using int32 = int_fast32_t;
using int64 = int_fast64_t;
const int32 INF = 1e9;
const int32 MOD = 1e9 + 7;
const int64 LLINF = 1e18;
#define YES(n) cout << ((n) ? "YES\n" : "NO\n")
#define Yes(n) cout << ((n) ? "Yes\n" : "No\n")
#define ANS(n) cout << (n) << "\n"
#define ... | replace | 37 | 38 | 37 | 39 | 0 | |
p02851 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
using namespace std;
typedef long long ll;
const int N = 2e5 + 4;
int n, a[N], mod, sum[N];
map<int, int> mp;
ll ans;
inline int read() {
int x = 0;
char c = getchar();
while (c < '0' || c > '9')
c = ... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
using namespace std;
typedef long long ll;
const int N = 2e5 + 4;
int n, a[N], mod, sum[N];
map<int, int> mp;
ll ans;
inline int read() {
int x = 0;
char c = getchar();
while (c < '0' || c > '9')
c = ... | insert | 28 | 28 | 28 | 32 | TLE | |
p02851 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
#ifdef _DEBUG
#include "dump.hpp"
#else
#define dump(...)
#endif
#define int long long
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define rrep(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define all(c) begin(c), end(c)
const int INF =
sizeof(int) == sizeof(lo... | #include "bits/stdc++.h"
using namespace std;
#ifdef _DEBUG
#include "dump.hpp"
#else
#define dump(...)
#endif
#define int long long
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define rrep(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define all(c) begin(c), end(c)
const int INF =
sizeof(int) == sizeof(lo... | replace | 79 | 80 | 79 | 80 | 0 | |
p02851 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 10;
set<int> f[N];
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n, k;
long long ans = 0, cur = 0;
cin >> n >> k;
f[0].insert(0);
for (int i = 1, a; i <= n; i++) {
cin >> a;
cur = (cur + a - 1) % k;
int er... | #include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 10;
map<int, set<int>> f;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n, k;
long long ans = 0, cur = 0;
cin >> n >> k;
f[0].insert(0);
for (int i = 1, a; i <= n; i++) {
cin >> a;
cur = (cur + a - 1) % k;
... | replace | 3 | 4 | 3 | 4 | 0 | |
p02851 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define MOD 1000000007
#define INF 800000000
#define MAX 1000
int main() {
int N, K;
cin >> N >> K;
vector<ll> A(N), sum(N + 1, 0);
for (int i = 0; i < N; i++) {
cin >> A.at(i);
sum.at(i + 1) = sum.at(i) + A.at(i);
}
for (int i = 0... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define MOD 1000000007
#define INF 800000000
#define MAX 1000
int main() {
int N, K;
cin >> N >> K;
vector<ll> A(N), sum(N + 1, 0);
for (int i = 0; i < N; i++) {
cin >> A.at(i);
sum.at(i + 1) = sum.at(i) + A.at(i);
}
for (int i = 0... | replace | 30 | 31 | 30 | 31 | 0 | |
p02851 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define REP(i, a, n) for (int i = (a); i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define FOR(it, c) \
for (__typeof((c).begin()) it = (c).begin(); it != (c).end(); ++it)
#define ALLOF(c) (c).begin(), (c).... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, a, n) for (int i = (a); i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define FOR(it, c) \
for (__typeof((c).begin()) it = (c).begin(); it != (c).end(); ++it)
#define ALLOF(c) (c).begin(), (c).... | replace | 31 | 32 | 31 | 32 | 0 | |
p02851 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define dump(x) cout << (x) << '\n';
#define all(x) x.begin(), x.end()
#define fi first
#define se second
typedef int64_t Int;
Int mod = 1e9 + 7;
Int INF = 1e9 + 7;
int main() {
Int n, k;
cin >> n >> k;
Int res = 0;
vector<Int> a(n);
for (Int i = 0; i < n; i++) {... | #include <bits/stdc++.h>
using namespace std;
#define dump(x) cout << (x) << '\n';
#define all(x) x.begin(), x.end()
#define fi first
#define se second
typedef int64_t Int;
Int mod = 1e9 + 7;
Int INF = 1e9 + 7;
int main() {
Int n, k;
cin >> n >> k;
Int res = 0;
vector<Int> a(n);
for (Int i = 0; i < n; i++) {... | replace | 22 | 23 | 22 | 23 | -6 | Fatal glibc error: malloc assertion failure in sysmalloc: (old_top == initial_top (av) && old_size == 0) || ((unsigned long) (old_size) >= MINSIZE && prev_inuse (old_top) && ((unsigned long) old_end & (pagesize - 1)) == 0)
|
p02851 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
// #define MOD 998244353
#define INF 1145141919810893364
// #define INF 810114514
#define PI 3.141592653589
typedef pair<int, int> PP;
typedef long long ll;
#define int ll
#define setdouble setprecision
#define REP(i, n) for (int i = 0; i < (n); ++i)
... | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
// #define MOD 998244353
#define INF 1145141919810893364
// #define INF 810114514
#define PI 3.141592653589
typedef pair<int, int> PP;
typedef long long ll;
#define int ll
#define setdouble setprecision
#define REP(i, n) for (int i = 0; i < (n); ++i)
... | replace | 62 | 63 | 62 | 63 | 0 | |
p02851 | C++ | Runtime Error | #include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define MOD 1000000007
#define pii pair<int, int>
#define LL long long
using namespace std;
LL k, a[200005];
int main() {
// clock_t start = clock();
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(... | #include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define MOD 1000000007
#define pii pair<int, int>
#define LL long long
using namespace std;
LL k, a[200005];
int main() {
// clock_t start = clock();
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(... | insert | 32 | 32 | 32 | 34 | 0 | |
p02851 | C++ | Runtime Error | #include <algorithm>
#include <complex>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
#define INF 1000000000
#define rep(i, a) for (int i = 0; i < (a); i++)
using... | #include <algorithm>
#include <complex>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
#define INF 1000000000
#define rep(i, a) for (int i = 0; i < (a); i++)
using... | replace | 234 | 236 | 234 | 238 | 0 | |
p02851 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define i64 long long int
#define ran 202202
int n, k;
int s[ran];
vector<int> v[ran];
int it[ran];
int main() {
scanf("%d%d", &n, &k);
i64 ans = 0LL;
s[0] = 0;
v[0].push_back(0);
for (int i = 1; i <= n; i++) {
int x;
scanf("%d", &x);
s[i] = (s[i ... | #include <bits/stdc++.h>
using namespace std;
#define i64 long long int
#define ran 202202
int n, k;
int s[ran];
map<int, vector<int>> v;
map<int, int> it;
int main() {
scanf("%d%d", &n, &k);
i64 ans = 0LL;
s[0] = 0;
v[0].push_back(0);
for (int i = 1; i <= n; i++) {
int x;
scanf("%d", &x);
s[... | replace | 8 | 10 | 8 | 10 | 0 | |
p02851 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define all(c) (c).begin(), (c).end()
#define pb push_back
#define dbg(...) \
do { \
cerr << __LINE__ <<... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define all(c) (c).begin(), (c).end()
#define pb push_back
#define dbg(...) \
do { \
cerr << __LINE__ <<... | replace | 68 | 69 | 68 | 70 | 0 | |
p02851 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 7;
int arr[N], pref[N];
map<int, int> lol;
int n, k;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n >> k;
for (int i = 0; i < n; ++i) {
cin >> arr[i];
arr[i] %= k;
if (arr[i] == 0) {
arr[i] = k - 1;... | #include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 7;
int arr[N], pref[N];
map<int, int> lol;
int n, k;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n >> k;
for (int i = 0; i < n; ++i) {
cin >> arr[i];
arr[i] %= k;
if (arr[i] == 0) {
arr[i] = k - 1;... | replace | 3 | 4 | 3 | 4 | 0 | |
p02851 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define all(a) a.begin(), a.end()
#define P pair<int, int>
#define F first
#define S second
#define mod 1000000007
#define INF 90000000000000000
int solve(vector<int> V, int k) {
int res = 0, l = 0, r = 0... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define all(a) a.begin(), a.end()
#define P pair<int, int>
#define F first
#define S second
#define mod 1000000007
#define INF 90000000000000000
int solve(vector<int> V, int k) {
int res = 0, l = 0, r = 0... | replace | 13 | 14 | 13 | 14 | 0 | |
p02851 | C++ | Runtime Error | #pragma GCC optimize("O3")
#include <algorithm>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unordered_map>
#include <unordered_set>
using namespace std;
using QWORD = uint64... | #pragma GCC optimize("O3")
#include <algorithm>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unordered_map>
#include <unordered_set>
using namespace std;
using QWORD = uint64... | replace | 264 | 265 | 264 | 265 | 0 | |
p02851 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
long long n, k;
cin >> n >> k;
long long a[n];
rep(i, n) cin >> a[i];
rep(i, n) a[i]--;
long long suma[n + 1];
suma[0] = 0;
rep(i, n) suma[i + 1] = (suma[i] + a[i]) % k;
map<long long, int> mp;
r... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int main() {
long long n, k;
cin >> n >> k;
long long a[n];
rep(i, n) cin >> a[i];
rep(i, n) a[i]--;
long long suma[n + 1];
suma[0] = 0;
rep(i, n) suma[i + 1] = (suma[i] + a[i]) % k;
map<long long, int> mp;
r... | replace | 13 | 15 | 13 | 14 | 0 | |
p02851 | C++ | Runtime Error | #include <set>
#include <stdio.h>
#include <utility>
using namespace std;
typedef long long ll;
int main(void) {
ll i, j, k, n, m, ans = 0;
scanf("%lld%lld", &n, &k);
if (k == 1) {
printf("0");
return 0;
}
ll sum[n + 1], a[n];
sum[0] = 0;
set<pair<ll, ll>> s;
set<pair<ll, ll>>::iterator it;
p... | #include <set>
#include <stdio.h>
#include <utility>
using namespace std;
typedef long long ll;
int main(void) {
ll i, j, k, n, m, ans = 0;
scanf("%lld%lld", &n, &k);
if (k == 1) {
printf("0");
return 0;
}
ll sum[n + 1], a[n];
sum[0] = 0;
set<pair<ll, ll>> s;
set<pair<ll, ll>>::iterator it;
p... | insert | 59 | 59 | 59 | 61 | 0 | |
p02851 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define fi first
#define se second
typedef pair<ll, ll> P;
using VP = vector<P>;
using VVP = vector<VP>;
using VI = vector<ll>;
using VVI = vector<VI>;
using VVVI = vector<VVI>;
const int inf = 1e9 + 7;
const ll INF = 1LL << 58;
co... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define fi first
#define se second
typedef pair<ll, ll> P;
using VP = vector<P>;
using VVP = vector<VP>;
using VI = vector<ll>;
using VVI = vector<VI>;
using VVVI = vector<VVI>;
const int inf = 1e9 + 7;
const ll INF = 1LL << 58;
co... | replace | 26 | 27 | 26 | 27 | 0 | |
p02851 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
map<int, int> Map;
int X[100100];
int main() {
int N, K, Sum = 0;
long long Ans = 0;
cin >> N >> K;
Map[0] = 1;
for (int i = 1; i <= N; i++) {
if (i >= K)
Map[X[i - K]]--;
int A;
cin >> A;
A--;
Sum = (Sum + A) % K;
Ans += Map[Sum];
... | #include <bits/stdc++.h>
using namespace std;
map<int, int> Map;
int X[200200];
int main() {
int N, K, Sum = 0;
long long Ans = 0;
cin >> N >> K;
Map[0] = 1;
for (int i = 1; i <= N; i++) {
if (i >= K)
Map[X[i - K]]--;
int A;
cin >> A;
A--;
Sum = (Sum + A) % K;
Ans += Map[Sum];
... | replace | 3 | 4 | 3 | 4 | 0 | |
p02851 | C++ | Runtime Error | #include "bits/stdc++.h"
#define rep(i, a) for (int i = 0; i < (a); ++i)
#define REP(i, a, b) for (int i = (a); i < (b); ++i)
#define FORV(a, A) for (auto &a : A)
using namespace std;
using ll = long long;
using P = pair<int, int>;
void Main() {
ll n, k;
cin >> n >> k;
vector<int> S(n + 1, 0);
S[0] = 0;
rep... | #include "bits/stdc++.h"
#define rep(i, a) for (int i = 0; i < (a); ++i)
#define REP(i, a, b) for (int i = (a); i < (b); ++i)
#define FORV(a, A) for (auto &a : A)
using namespace std;
using ll = long long;
using P = pair<int, int>;
void Main() {
ll n, k;
cin >> n >> k;
vector<int> S(n + 1, 0);
S[0] = 0;
rep... | replace | 24 | 25 | 24 | 25 | 0 | |
p02851 | C++ | Runtime Error | #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cassert>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <memory>
#include <queue>
#include <set>
#include <stack>
#include <utility>
#include <vector>
usin... | #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cassert>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <memory>
#include <queue>
#include <set>
#include <stack>
#include <utility>
#include <vector>
usin... | replace | 55 | 56 | 55 | 56 | 0 | |
p02851 | C++ | Runtime Error | #pragma GCC optimize "03"
#include "bits/stdc++.h"
using namespace std;
#define int long long int
#define ld long double
#define pi pair<int, int>
#define pb push_back
#define fi first
#define se second
#define IOS \
ios::sync_with_stdio(false); ... | #pragma GCC optimize "03"
#include "bits/stdc++.h"
using namespace std;
#define int long long int
#define ld long double
#define pi pair<int, int>
#define pb push_back
#define fi first
#define se second
#define IOS \
ios::sync_with_stdio(false); ... | replace | 18 | 19 | 18 | 19 | 0 | |
p02851 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; (i) < (int)(n); (i)++)
using namespace std;
int main() {
int n, k;
scanf("%d%d", &n, &k);
vector<int> a(n);
rep(i, n) { scanf("%d", &a[i]); }
n++;
vector<long long> acc(n);
rep(i, n) if (i) { acc[i] = acc[i - 1] + a[i - 1]; }
map<int, int> cnt;... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; (i) < (int)(n); (i)++)
using namespace std;
int main() {
int n, k;
scanf("%d%d", &n, &k);
vector<int> a(n);
rep(i, n) { scanf("%d", &a[i]); }
n++;
vector<long long> acc(n);
rep(i, n) if (i) { acc[i] = acc[i - 1] + a[i - 1]; }
map<int, int> cnt;... | replace | 16 | 17 | 16 | 17 | 0 | |
p02851 | C++ | Runtime Error | #include <iostream>
#include <map>
#include <vector>
using namespace std;
int main(void) {
int64_t N, K;
cin >> N >> K;
vector<int64_t> A(N + 1);
for (int i = 1; i <= N; i++) {
cin >> A[i];
}
for (int i = 1; i <= N; i++) {
A[i] = (A[i - 1] + A[i] - 1) % K;
}
map<int, int64_t> mp;
for (int ... | #include <iostream>
#include <map>
#include <vector>
using namespace std;
int main(void) {
int64_t N, K;
cin >> N >> K;
vector<int64_t> A(N + 1);
for (int i = 1; i <= N; i++) {
cin >> A[i];
}
for (int i = 1; i <= N; i++) {
A[i] = (A[i - 1] + A[i] - 1) % K;
}
map<int64_t, int64_t> mp;
for (... | replace | 18 | 20 | 18 | 20 | 0 | |
p02851 | C++ | Runtime Error | #include <bits/stdc++.h>
#define EPS (1e-10)
#define rep(i, a, b) for (int i = a; i < (int)(b); ++i)
#define rrep(i, a, b) for (int i = b - 1; i >= (int)(a); --i)
using namespace std;
using ll = long long;
using vi = vector<int>;
using vb = vector<bool>;
using vll = vector<ll>;
using vd = vector<double>;
using vvi = ... | #include <bits/stdc++.h>
#define EPS (1e-10)
#define rep(i, a, b) for (int i = a; i < (int)(b); ++i)
#define rrep(i, a, b) for (int i = b - 1; i >= (int)(a); --i)
using namespace std;
using ll = long long;
using vi = vector<int>;
using vb = vector<bool>;
using vll = vector<ll>;
using vd = vector<double>;
using vvi = ... | replace | 37 | 38 | 37 | 38 | 0 | |
p02851 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
ll n, k;
cin >> n >> k;
vector<ll> a(n + 1);
for (int i = 1; i <= n; i++)
cin >> a[i];
ll ans = 0;
vector<ll> p(n + 1, 0);
queue<ll> q;
map<ll, ll... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
ll n, k;
cin >> n >> k;
vector<ll> a(n + 1);
for (int i = 1; i <= n; i++)
cin >> a[i];
ll ans = 0;
vector<ll> p(n + 1, 0);
queue<ll> q;
map<ll, ll... | replace | 32 | 34 | 32 | 36 | 0 | |
p02851 | C++ | Runtime Error | #define _USE_MATH_DEFINES
#include <algorithm>
#include <array>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <array>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map... | replace | 46 | 47 | 46 | 47 | 0 | |
p02851 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define REP(i, n) for (long long i = 0; i < (n); i++)
#define FOR(i, m, n) for (long long i = (m); i < (n); ++i)
#define ALL(obj) (obj).begin(), (obj).end()
#define SPEED ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define REP(i, n) for (long long i = 0; i < (n); i++)
#define FOR(i, m, n) for (long long i = (m); i < (n); ++i)
#define ALL(obj) (obj).begin(), (obj).end()
#define SPEED ... | replace | 104 | 105 | 104 | 105 | 0 | |
p02851 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
const ull mod = 1e9 + 7;
#define REP(i, n) for (int i = 0; i < (int)n; ++i)
// debug
#define dump(x) cerr << #x << " = " << (x) <<... | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
const ull mod = 1e9 + 7;
#define REP(i, n) for (int i = 0; i < (int)n; ++i)
// debug
#define dump(x) cerr << #x << " = " << (x) <<... | replace | 59 | 60 | 59 | 60 | 0 | |
p02851 | C++ | Runtime Error | // includes {{{
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
// #include<deque>
// #include<multiset>
// #include<c... | // includes {{{
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
// #include<deque>
// #include<multiset>
// #include<c... | insert | 137 | 137 | 137 | 139 | 0 | |
p02851 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ld long double
#define fi first
#define se second
#define pb push_back
#define pii pair<int, int>
#define all(x) (x).begin(), (x).end()
const int MOD = 1e9 + 7;
int mpow(int a, int b, int p = MOD) {
a = a % p;
int res = 1;
while (b > 0) {... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ld long double
#define fi first
#define se second
#define pb push_back
#define pii pair<int, int>
#define all(x) (x).begin(), (x).end()
const int MOD = 1e9 + 7;
int mpow(int a, int b, int p = MOD) {
a = a % p;
int res = 1;
while (b > 0) {... | replace | 22 | 23 | 22 | 23 | 0 | |
p02851 | C++ | Runtime Error | #include <algorithm>
#include <cfloat>
#include <complex>
#include <functional>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#inc... | #include <algorithm>
#include <cfloat>
#include <complex>
#include <functional>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#inc... | replace | 43 | 44 | 43 | 44 | 0 | |
p02851 | C++ | Runtime Error |
// Problem : E - Rem of Sum is Num
// Contest : AtCoder - AtCoder Beginner Contest 146
// URL : https://atcoder.jp/contests/abc146/tasks/abc146_e
// Memory Limit : 1024 MB
// Time Limit : 2000 ms
// Powered by CP Editor (https://github.com/cpeditor/cpeditor)
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_containe... |
// Problem : E - Rem of Sum is Num
// Contest : AtCoder - AtCoder Beginner Contest 146
// URL : https://atcoder.jp/contests/abc146/tasks/abc146_e
// Memory Limit : 1024 MB
// Time Limit : 2000 ms
// Powered by CP Editor (https://github.com/cpeditor/cpeditor)
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_containe... | replace | 41 | 42 | 41 | 42 | 0 | |
p02851 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
int main() {
long long N, K;
cin >> N >> K;
vector<int> A(N);
vector<int> SUM(N + 1);
long long sum = 0;
SUM[0] = 0;
for (long long n = 0; n < N; ++n) {
cin >> A[n];
sum += A[n];
sum %= K;
SUM[n + 1] = (sum + (n + 1) * K - (n + 1)) % K;
}
... | #include "bits/stdc++.h"
using namespace std;
int main() {
long long N, K;
cin >> N >> K;
vector<int> A(N);
vector<int> SUM(N + 1);
long long sum = 0;
SUM[0] = 0;
for (long long n = 0; n < N; ++n) {
cin >> A[n];
sum += A[n];
sum %= K;
SUM[n + 1] = (sum + (n + 1) * K - (n + 1)) % K;
}
... | replace | 18 | 19 | 18 | 21 | 0 | |
p02851 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORR(i,... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORR(i,... | replace | 54 | 55 | 54 | 55 | TLE | |
p02851 | C++ | Runtime Error |
// E - Rem of Sum is Num
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// const int INF = 2147483647;
// const ll INF = 9223372036854775807;
// const ll MOD = 1e9 + 7;
ll A[200000];
ll cumA[200001];
ll M[200001];
int main() {
ll N, K;
cin >> N >> K;
for (int i = 0; i < N; i++) {
cin... |
// E - Rem of Sum is Num
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// const int INF = 2147483647;
// const ll INF = 9223372036854775807;
// const ll MOD = 1e9 + 7;
ll A[200000];
ll cumA[200001];
ll M[200001];
int main() {
ll N, K;
cin >> N >> K;
for (int i = 0; i < N; i++) {
cin... | replace | 42 | 43 | 42 | 43 | 0 | |
p02851 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long
using namespace std;
const int N = 1e5 + 5;
map<ll, int> mp;
ll sum[N], x[N], m, n, ans, dp[N];
int main() {
cin >> n >> m;
for (int i = 1; i <= n; i++)
cin >> x[i], dp[i] = dp[i - 1] + x[i];
for (int i = 0; i <= n; i++) {
if (i >= m)
mp[dp[i - m]]--;
... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
const int N = 2e5 + 5;
map<ll, int> mp;
ll sum[N], x[N], m, n, ans, dp[N];
int main() {
cin >> n >> m;
for (int i = 1; i <= n; i++)
cin >> x[i], dp[i] = dp[i - 1] + x[i];
for (int i = 0; i <= n; i++) {
if (i >= m)
mp[dp[i - m]]--;
... | replace | 3 | 4 | 3 | 4 | 0 | |
p02851 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define res register int
#define ll long long
// #define cccgift
// #define
// getchar()(p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
// char buf[1<<21],*p1=buf,*p2=buf;
template <typename T> inline void read(T &x) {
static char ch;
bool f = 1;
for... | #include <bits/stdc++.h>
using namespace std;
#define res register int
#define ll long long
// #define cccgift
// #define
// getchar()(p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
// char buf[1<<21],*p1=buf,*p2=buf;
template <typename T> inline void read(T &x) {
static char ch;
bool f = 1;
for... | replace | 38 | 39 | 38 | 39 | 0 | |
p02851 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int x;
vector<int> sum(n + 1, 0);
for (int i = 0; i < n; i++) {
cin >> x;
x %= k;
sum[i + 1] = (sum[i] + x) % k;
}
int res = 0;
for (int i = 0; i < n; i++) {
for (int l = 1; i + l <= n; l++) {
if ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int x;
vector<int> sum(n + 1, 0);
for (int i = 0; i < n; i++) {
cin >> x;
x %= k;
sum[i + 1] = (sum[i] + x) % k;
}
unordered_map<int, int> m;
long long res = 0;
for (int i = 0; i <= n; i++) {
sum[i] =... | replace | 14 | 20 | 14 | 22 | TLE | |
p02851 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bits/stdc++.h>
#include <cstdint>
#include <iostream>
#include <iterator>
#include <vector>
// lib/util.hpp
#ifndef UTIL_HPP
#define UTIL_HPP
typedef ::std::int_fast64_t i64;
typedef ::std::uint_fast64_t u64;
typedef ::std::int_fast32_t i32;
typedef ::std::uint_fast32_t u32;
namespace ... | #include <algorithm>
#include <bits/stdc++.h>
#include <cstdint>
#include <iostream>
#include <iterator>
#include <vector>
// lib/util.hpp
#ifndef UTIL_HPP
#define UTIL_HPP
typedef ::std::int_fast64_t i64;
typedef ::std::uint_fast64_t u64;
typedef ::std::int_fast32_t i32;
typedef ::std::uint_fast32_t u32;
namespace ... | delete | 58 | 61 | 58 | 58 | TLE | |
p02851 | Python | Time Limit Exceeded | n, k = map(int, input().split())
a = list(map(int, input().split()))
r = 0
s = {0: [0]}
for i in range(n):
r = (r + a[i] - 1) % k
s[r] = s.get(r, []) + [i + 1]
ret = 0
for key in s:
a = s[key]
en = 0
for st in range(len(a)):
while en < len(a) and a[en] - a[st] < k:
en += 1
... | n, k = map(int, input().split())
a = list(map(int, input().split()))
r = 0
s = {0: [0]}
for i in range(n):
r = (r + a[i] - 1) % k
if r in s:
s[r].append(i + 1)
else:
s[r] = [i + 1]
ret = 0
for key in s:
a = s[key]
en = 0
for st in range(len(a)):
while en < len(a) and a[en... | replace | 6 | 7 | 6 | 10 | TLE | |
p02851 | C++ | Runtime Error | #define DEBUG 1
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespac... | #define DEBUG 1
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespac... | replace | 170 | 171 | 170 | 171 | 0 | |
p02851 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using i64 = long long;
signed main() {
int n, k;
cin >> n >> k;
vector<int> a(n);
for (int i = 0; i < n; ++i)
cin >> a[i];
for (int i = 0; i < n; ++i) {
--a[i];
a[i] %= k;
}
vector<int> r(n + 1, 0);
for (int i = 0; i < n; ++i)
r[i + 1] = (... | #include <bits/stdc++.h>
using namespace std;
using i64 = long long;
signed main() {
int n, k;
cin >> n >> k;
vector<int> a(n);
for (int i = 0; i < n; ++i)
cin >> a[i];
for (int i = 0; i < n; ++i) {
--a[i];
a[i] %= k;
}
vector<int> r(n + 1, 0);
for (int i = 0; i < n; ++i)
r[i + 1] = (... | replace | 19 | 20 | 19 | 20 | 0 | |
p02851 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll n, k;
cin >> n >> k;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
map<ll, ll> m;
vector<ll> sum(n + 1, 0);
for (int i = 0; i < n; i++) {
sum[i + 1] = sum[i] + a[i];
}
for (int i = 0; i <= k ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
ll n, k;
cin >> n >> k;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
map<ll, ll> m;
vector<ll> sum(n + 1, 0);
for (int i = 0; i < n; i++) {
sum[i + 1] = sum[i] + a[i];
}
for (int i = 0; i <= mi... | replace | 15 | 16 | 15 | 16 | 0 | |
p02851 | 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, k;
cin >> n >> k;
vector<int> a(n);
for (int &i : a)
cin >> i, --i;
vector<int> s(n + 1, 0);
for (int i = 1; i <= n; ++i)
(s[i] += s[i - 1... | #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, k;
cin >> n >> k;
vector<int> a(n);
for (int &i : a)
cin >> i, --i;
vector<int> s(n + 1, 0);
for (int i = 1; i <= n; ++i)
(s[i] += s[i - 1... | replace | 15 | 17 | 15 | 17 | 0 | 0 0 3 0 2 2
|
p02851 | 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 < n; ++i)
#pragma region Debug
template <typename T> void view(const std::vector<T> &v) {
for (const auto &e : v) {
std::cout << e << " ";
}
std::cout << std::endl;
}
template <typ... | #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 < n; ++i)
#pragma region Debug
template <typename T> void view(const std::vector<T> &v) {
for (const auto &e : v) {
std::cout << e << " ";
}
std::cout << std::endl;
}
template <typ... | replace | 30 | 31 | 30 | 31 | 0 | |
p02851 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, k;
cin >> n >> k;
vector<long long int> a(n + 1);
for (int i = 1; i <= n; i++) {
cin >> a[i];
a[i] -= 1;
}
// cumulative sum
for (int i = 1; i <= n; i++) {
a[i] += a[i - 1];
a[i] %= k;
}
// solve
long lon... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long int n, k;
cin >> n >> k;
vector<long long int> a(n + 1);
for (int i = 1; i <= n; i++) {
cin >> a[i];
a[i] -= 1;
}
// cumulative sum
for (int i = 1; i <= n; i++) {
a[i] += a[i - 1];
a[i] %= k;
}
// solve
long lon... | replace | 21 | 22 | 21 | 22 | 0 | |
p02851 | C++ | Runtime Error | #include <algorithm>
#include <cassert>
#include <cmath>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string.h>
#include <string>
#include... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string.h>
#include <string>
#include... | replace | 112 | 113 | 112 | 113 | 0 | |
p02851 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
#define CHMAX(a, b) a = std::max(a, b)
#define CHMIN(a, b) a = std::min(a, b)
#define MAXMIN(a, b, c) std::max(a, min(b, c))
#define ... | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
#define CHMAX(a, b) a = std::max(a, b)
#define CHMIN(a, b) a = std::min(a, b)
#define MAXMIN(a, b, c) std::max(a, min(b, c))
#define ... | replace | 67 | 68 | 67 | 68 | 0 | |
p02851 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll N, K;
cin >> N >> K;
ll A[200005];
for (int i = 0; i < N; i++) {
cin >> A[i];
}
vector<ll> sum;
sum.push_back(A[0]);
for (int i = 1; i < N; ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll N, K;
cin >> N >> K;
ll A[200005];
for (int i = 0; i < N; i++) {
cin >> A[i];
}
vector<ll> sum;
sum.push_back(A[0]);
for (int i = 1; i < N; ... | replace | 36 | 37 | 36 | 37 | 0 | |
p02851 | C++ | Runtime Error | // clang-format off
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define stoi stoll
using pii = pair<int,int>;
using vi = vector<int>;
using vvi = vector<vi>;
#define all(c) begin(c), end(c)
#define rall(c) rbegin(c), rend(c)
#define fore(x, c) for(auto &&x : c)
#define rep(i, a, n) for(int i = a... | // clang-format off
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define stoi stoll
using pii = pair<int,int>;
using vi = vector<int>;
using vvi = vector<vi>;
#define all(c) begin(c), end(c)
#define rall(c) rbegin(c), rend(c)
#define fore(x, c) for(auto &&x : c)
#define rep(i, a, n) for(int i = a... | replace | 55 | 56 | 55 | 57 | 0 | |
p02851 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
map<ll, ll> m;
const int N = 1e5;
ll sum[N + 100];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n, k;
ll ans = 0;
cin >> n >> k;
m[0] = 1;
for (ll i = 1; i <= n; i++) {
ll a;
cin >> a;
sum[i] = (sum[i - 1] ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
map<ll, ll> m;
const int N = 2e5;
ll sum[N + 100];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll n, k;
ll ans = 0;
cin >> n >> k;
m[0] = 1;
for (ll i = 1; i <= n; i++) {
ll a;
cin >> a;
sum[i] = (sum[i - 1] ... | replace | 4 | 5 | 4 | 5 | 0 | |
p02851 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define pp pair<int, int>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define ll long long
#define ld long double
#define all(a) (a).begin(), (a).end()
#define mk make_pair
ll MOD = 1000000007;
ll mod = 998244353;
int inf = 1000001000;
ll INF = 1e18 + 5;
int main(... | #include <bits/stdc++.h>
using namespace std;
#define pp pair<int, int>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define ll long long
#define ld long double
#define all(a) (a).begin(), (a).end()
#define mk make_pair
ll MOD = 1000000007;
ll mod = 998244353;
int inf = 1000001000;
ll INF = 1e18 + 5;
int main(... | replace | 16 | 17 | 16 | 18 | 0 | |
p02851 | C++ | Runtime Error | /*input
5 4
1 4 2 3 5
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef tree<long long, null_type, less_equal<long long>, rb_tree_tag,
tree_order_statistics_node_update>
indexed_set;
#pragma... | /*input
5 4
1 4 2 3 5
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef tree<long long, null_type, less_equal<long long>, rb_tree_tag,
tree_order_statistics_node_update>
indexed_set;
#pragma... | replace | 26 | 27 | 26 | 27 | 0 | |
p02851 | C++ | Runtime Error | #pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <bits/stdc++.h>
#define int long long
using namespace std;
int a[200005];
map<int, int> mm;
int pre[200005];
signed main() {
ios_base::sync_with_stdio(false)... | #pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <bits/stdc++.h>
#define int long long
using namespace std;
int a[200005];
map<int, int> mm;
int pre[200005];
signed main() {
ios_base::sync_with_stdio(false)... | replace | 31 | 32 | 31 | 32 | 0 | Time: 0.000002
|
p02851 | C++ | Runtime Error | #pragma GCC optimize("O3")
#pragma GCC target("avx")
// #include<bits/stdc++.h>
#include <algorithm>
#include <cstdio>
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... | #pragma GCC optimize("O3")
#pragma GCC target("avx")
// #include<bits/stdc++.h>
#include <algorithm>
#include <cstdio>
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... | replace | 86 | 87 | 86 | 87 | 0 | |
p02851 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define pi 3.14159265359
#define int long long
#define pii pair<int, int>
const int mod = 1e9 + 7;
int dx[] = {-1, 0, 1, 0};
int dy[] = {0, -1, 0, 1};
int dp[100][2];
int32_t main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n, k;
cin >> n >> ... | #include <bits/stdc++.h>
using namespace std;
#define pi 3.14159265359
#define int long long
#define pii pair<int, int>
const int mod = 1e9 + 7;
int dx[] = {-1, 0, 1, 0};
int dy[] = {0, -1, 0, 1};
int dp[100][2];
int32_t main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n, k;
cin >> n >> ... | replace | 34 | 36 | 34 | 36 | TLE | |
p02851 | C++ | Runtime Error | #include <bits/stdc++.h>
#define VI vector<int>
#define pb push_back
#define LL long long
#define mp make_pair
#define pii pair<int, int>
using namespace std;
map<int, int> s;
const int MAXN = 2e5;
int n, k;
int A[MAXN + 10];
LL S[MAXN + 10];
int main() {
scanf("%d %d", &n, &k);
for (int i = 0; i < n; i++) {
sc... | #include <bits/stdc++.h>
#define VI vector<int>
#define pb push_back
#define LL long long
#define mp make_pair
#define pii pair<int, int>
using namespace std;
map<int, int> s;
const int MAXN = 2e5;
int n, k;
int A[MAXN + 10];
LL S[MAXN + 10];
int main() {
scanf("%d %d", &n, &k);
for (int i = 0; i < n; i++) {
sc... | replace | 24 | 25 | 24 | 25 | 0 | |
p02851 | C++ | Runtime Error | // #define STOPIT
#include <bits/stdc++.h>
#define rep(i, n, m) for (int i = (n); i < (m); i++)
#define rrep(i, n, m) for (int i = (n)-1; i >= (m); i--)
using namespace std;
using ll = long long;
void debug_impl() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_impl(Head head, Tail... tail) {
... | // #define STOPIT
#include <bits/stdc++.h>
#define rep(i, n, m) for (int i = (n); i < (m); i++)
#define rrep(i, n, m) for (int i = (n)-1; i >= (m); i--)
using namespace std;
using ll = long long;
void debug_impl() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_impl(Head head, Tail... tail) {
... | replace | 62 | 63 | 62 | 63 | 0 | |
p02851 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 10;
using ll = long long;
using pi = pair<ll, ll>;
int s[N];
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n, k;
cin >> n >> k;
unordered_map<int, deque<int>> a;
a[0].emplace_back(0);
ll ans = 0;
for (int i = 1; i <... | #include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 10;
using ll = long long;
using pi = pair<ll, ll>;
int s[N];
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n, k;
cin >> n >> k;
unordered_map<int, deque<int>> a;
a[0].emplace_back(0);
ll ans = 0;
for (int i = 1; i <... | replace | 20 | 23 | 20 | 21 | TLE | |
p02851 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define all(V) V.begin(), V.end()
#define ll long long
#define MOD 1000000007
vector<ll> num[100010];
int main() {
ll N, K;
cin >> N >> K;
vector<ll> A(N + 1, 0);
for (int i = 1; i <= N; i++) {
cin >> A[i];
A[i]--;
A[i] %= K;
}
for (int i = 1; i <... | #include <bits/stdc++.h>
using namespace std;
#define all(V) V.begin(), V.end()
#define ll long long
#define MOD 1000000007
vector<ll> num[200010];
int main() {
ll N, K;
cin >> N >> K;
vector<ll> A(N + 1, 0);
for (int i = 1; i <= N; i++) {
cin >> A[i];
A[i]--;
A[i] %= K;
}
for (int i = 1; i <... | replace | 6 | 7 | 6 | 7 | 0 | |
p02851 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long
int n, m, s[100100], res;
map<int, int> mp;
signed main() {
scanf("%lld%lld", &n, &m), mp[0]++;
for (int i = 1; i <= n; i++) {
if (i >= m)
mp[s[i - m]]--;
scanf("%lld", &s[i]), s[i]--, s[i] = (s[i] + s[i - 1]) % m, res += mp[s[i]],
... | #include <bits/stdc++.h>
using namespace std;
#define int long long
int n, m, s[200100], res;
map<int, int> mp;
signed main() {
scanf("%lld%lld", &n, &m), mp[0]++;
for (int i = 1; i <= n; i++) {
if (i >= m)
mp[s[i - m]]--;
scanf("%lld", &s[i]), s[i]--, s[i] = (s[i] + s[i - 1]) % m, res += mp[s[i]],
... | replace | 3 | 4 | 3 | 4 | 0 | |
p02851 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define REP(i, s, n) for (int i = s; i < n; i++)
#define NUM 2520
#define INF (1LL << 50)
#define DEBUG 0
#define mp(a, b) make_pair(a, b)
#define SORT(V) sort(V.begin(), V.end())
#define PI (3.141592653589794)
#define TO_STRING(VariableName) #Var... | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define REP(i, s, n) for (int i = s; i < n; i++)
#define NUM 2520
#define INF (1LL << 50)
#define DEBUG 0
#define mp(a, b) make_pair(a, b)
#define SORT(V) sort(V.begin(), V.end())
#define PI (3.141592653589794)
#define TO_STRING(VariableName) #Var... | replace | 53 | 54 | 53 | 54 | 0 | |
p02851 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<long long> a(n), s(n + 1, 0);
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
s[i + 1] = s[i] + a[i];
int ans = 0;
vector<int> v(k + 1, 0);
int l = 0;
for (int r = 0; r < n + 1; r+... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
vector<long long> a(n), s(n + 1, 0);
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 0; i < n; i++)
s[i + 1] = s[i] + a[i];
long long ans = 0;
map<int, int> v;
int l = 0;
for (int r = 0; r < n + 1; r++)... | replace | 12 | 14 | 12 | 14 | 0 | |
p02851 | C++ | Runtime Error | #include <map>
#include <stdio.h>
#define ll long long
#define MAXN 100005
#define MOD(x, m) (((x) % m + m) % m)
using namespace std;
ll N, K;
ll A[MAXN], psum[MAXN];
map<ll, ll> mp;
int main() {
int i, j;
scanf("%lld%lld", &N, &K);
for (i = 1; i <= N; ++i) {
scanf("%lld", &A[i]);
A[i] %= K;
psum[i] ... | #include <map>
#include <stdio.h>
#define ll long long
#define MAXN 200005
#define MOD(x, m) (((x) % m + m) % m)
using namespace std;
ll N, K;
ll A[MAXN], psum[MAXN];
map<ll, ll> mp;
int main() {
int i, j;
scanf("%lld%lld", &N, &K);
for (i = 1; i <= N; ++i) {
scanf("%lld", &A[i]);
A[i] %= K;
psum[i] ... | replace | 3 | 4 | 3 | 4 | 0 | |
p02851 | C++ | Runtime Error | // >>> TEMPLATES
#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++)
#define repR(i, n) for (int i = int(n) - 1; i >= 0; i--)
#define rep1R(i, n) for (int i = int(n); i >= 1; i--)
#define loop(i, a, B) for (int i = a; i B;... | // >>> TEMPLATES
#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++)
#define repR(i, n) for (int i = int(n) - 1; i >= 0; i--)
#define rep1R(i, n) for (int i = int(n); i >= 1; i--)
#define loop(i, a, B) for (int i = a; i B;... | replace | 137 | 139 | 137 | 139 | 0 | |
p02851 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <map>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rep1(i, n) for (int i = 1; i <= n; ++i)
using namespace std;
typedef long long ll;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
t... | #include <algorithm>
#include <iostream>
#include <map>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rep1(i, n) for (int i = 1; i <= n; ++i)
using namespace std;
typedef long long ll;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
t... | replace | 34 | 35 | 34 | 35 | 0 | |
p02851 | C++ | Runtime Error | // Nihal Mittal - nihal_47
// Strike First , Strike Hard , No Mercy !!
/**⠀⠀⠀⠀⠀⠀⣀⣤⣤⣄⣀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⣠⣾⣿⣿⣿⣿⣿⣿⣿⣿⣿⣦⣀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⣰⣿⣿⣿⣿⠿⠿⣿⣿⣿⣿⣿⣿⣿⣧⢀⠀⠀⠀⠀
⠀⠀⠀⣿⣿⣿⠋⠀⠀⠀⠀⠀⠙⠀⠙⣿⣿⣿⣷⢳⢀⠀⠀⠀
⠀⠀⣠⣿⣿⣿⢸⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⣿⣿⣿⣿⣿⢀
⠀⠀⣸⣿⣿⣿⠸⠀⠀⠀⠒⠒⠒⠐⠀⠀⢿⣿⣿⣿⣿⣿⠀⠀
⠀⣴⣿⣿⣿⡿⠀⠒⣋⣙⡒⢰⠀⠤⣖⠒⢾⣿⣿⣿⣿⣧⠀⠀
⢺⣿⣿⣿⣿⢀⠀⠀⠉⠉⠉⠸⠀⡇⠉⠉⠀⢿⣿⣿⣿⣄⠀⠀
⠀⠙⣿⣿⣧⢻⠀⠀⠀⠀⠀⠠⠀⠰⠀⠀⠀⣸⠸⣿⣿⠿⠰⠀
⠀⠀⠀⠹⣿⣿⣿⣷⠀⡠⠙⣲⣔⣅⢡⣰⣷⣿⣿⣿⣧⠀⠀⠀... | // Nihal Mittal - nihal_47
// Strike First , Strike Hard , No Mercy !!
/**⠀⠀⠀⠀⠀⠀⣀⣤⣤⣄⣀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⣠⣾⣿⣿⣿⣿⣿⣿⣿⣿⣿⣦⣀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⣰⣿⣿⣿⣿⠿⠿⣿⣿⣿⣿⣿⣿⣿⣧⢀⠀⠀⠀⠀
⠀⠀⠀⣿⣿⣿⠋⠀⠀⠀⠀⠀⠙⠀⠙⣿⣿⣿⣷⢳⢀⠀⠀⠀
⠀⠀⣠⣿⣿⣿⢸⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⣿⣿⣿⣿⣿⢀
⠀⠀⣸⣿⣿⣿⠸⠀⠀⠀⠒⠒⠒⠐⠀⠀⢿⣿⣿⣿⣿⣿⠀⠀
⠀⣴⣿⣿⣿⡿⠀⠒⣋⣙⡒⢰⠀⠤⣖⠒⢾⣿⣿⣿⣿⣧⠀⠀
⢺⣿⣿⣿⣿⢀⠀⠀⠉⠉⠉⠸⠀⡇⠉⠉⠀⢿⣿⣿⣿⣄⠀⠀
⠀⠙⣿⣿⣧⢻⠀⠀⠀⠀⠀⠠⠀⠰⠀⠀⠀⣸⠸⣿⣿⠿⠰⠀
⠀⠀⠀⠹⣿⣿⣿⣷⠀⡠⠙⣲⣔⣅⢡⣰⣷⣿⣿⣿⣧⠀⠀⠀... | replace | 38 | 39 | 38 | 39 | 0 | |
p02851 | C++ | Runtime Error | #include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <complex>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#include <casser... | #include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <complex>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#include <casser... | replace | 61 | 62 | 61 | 62 | 0 | |
p02851 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define PI 3.14159265358979
#define EPS 1e-8
#define mod 1000000007
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define endl "\n"
const ll INF = (ll)2e18;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NUL... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define PI 3.14159265358979
#define EPS 1e-8
#define mod 1000000007
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define endl "\n"
const ll INF = (ll)2e18;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NUL... | replace | 37 | 38 | 37 | 38 | 0 | |
p02851 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <chrono>
#define _USE_MATH_DEFINES
#include <cmath>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <chrono>
#define _USE_MATH_DEFINES
#include <cmath>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue... | replace | 67 | 68 | 67 | 69 | 0 | |
p02851 | C++ | Runtime Error | #include <bits/stdc++.h>
#define NMAX 500
#define zeros(x) (x ^ (x - 1)) & x
using namespace std;
typedef long long ll;
typedef long double ld;
ll n, k, x, V[200005], sp, tot, A[200005];
map<ll, ll> F;
int main() {
freopen("input.txt", "r", stdin);
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
... | #include <bits/stdc++.h>
#define NMAX 500
#define zeros(x) (x ^ (x - 1)) & x
using namespace std;
typedef long long ll;
typedef long double ld;
ll n, k, x, V[200005], sp, tot, A[200005];
map<ll, ll> F;
int main() {
// freopen("input.txt", "r", stdin);
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0... | replace | 13 | 14 | 13 | 14 | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.