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>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using int64 = long long;
#define debug(_) cerr << #_ << ": " << (_) << '\n'
template <class T> ostream &operator<<(ostream &os, vector<T> &_) {
os << '{';
for (T &x : _) {
os << x;
if (&x != &_.back())
os << ',';
}
os << '}';
return os;
}
template <class T, class U> ostream &operator<<(ostream &os, pair<T, U> &p) {
return os << '{' << p.first << " " << p.second << '}';
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int n;
cin >> n;
vector<vector<int>> graph(n, vector<int>(n));
vector<int> cnt(n, 0);
vector<pair<int, int>> in(n);
for (int i = 0; i < n - 1; ++i) {
int a, b;
cin >> a >> b;
--a;
--b;
++cnt[a];
++cnt[b];
graph[a].emplace_back(b);
graph[b].emplace_back(a);
in[i] = {a, b};
}
// cerr << '\n';
cout << *max_element(cnt.begin(), cnt.end()) << '\n';
map<pair<int, int>, int> mp;
vector<int> color(n, -1);
vector<bool> visited(n, false);
queue<int> q;
q.push(0);
visited[0] = true;
while (!q.empty()) {
int cur = q.front();
q.pop();
int num = 1;
for (int next : graph[cur]) {
if (visited[next])
continue;
if (num == color[cur])
++num;
color[next] = num;
mp[{cur, next}] = mp[{next, cur}] = num;
++num;
visited[next] = true;
q.push(next);
}
}
for (int i = 0; i < n - 1; ++i) {
cout << mp[in[i]] << '\n';
}
return 0;
} |
/**
* 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>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using int64 = long long;
#define debug(_) cerr << #_ << ": " << (_) << '\n'
template <class T> ostream &operator<<(ostream &os, vector<T> &_) {
os << '{';
for (T &x : _) {
os << x;
if (&x != &_.back())
os << ',';
}
os << '}';
return os;
}
template <class T, class U> ostream &operator<<(ostream &os, pair<T, U> &p) {
return os << '{' << p.first << " " << p.second << '}';
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int n;
cin >> n;
vector<vector<int>> graph(n);
vector<int> cnt(n, 0);
vector<pair<int, int>> in(n);
for (int i = 0; i < n - 1; ++i) {
int a, b;
cin >> a >> b;
--a;
--b;
++cnt[a];
++cnt[b];
graph[a].emplace_back(b);
graph[b].emplace_back(a);
in[i] = {a, b};
}
// cerr << '\n';
cout << *max_element(cnt.begin(), cnt.end()) << '\n';
map<pair<int, int>, int> mp;
vector<int> color(n, -1);
vector<bool> visited(n, false);
queue<int> q;
q.push(0);
visited[0] = true;
while (!q.empty()) {
int cur = q.front();
q.pop();
int num = 1;
for (int next : graph[cur]) {
if (visited[next])
continue;
if (num == color[cur])
++num;
color[next] = num;
mp[{cur, next}] = mp[{next, cur}] = num;
++num;
visited[next] = true;
q.push(next);
}
}
for (int i = 0; i < n - 1; ++i) {
cout << mp[in[i]] << '\n';
}
return 0;
} | 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[p][i].first;
ll noi = ch[p][i].second;
if (ans[noi] != 0) {
continue;
}
if (cnt == c) {
cnt++;
}
ans[next] = cnt;
ans1 = max(ans1, cnt);
dep(next, cnt);
cnt++;
}
}
int main() {
cin >> n;
for (ll i = 0; i < n - 1; i++) {
ll x, y;
cin >> x >> y;
x--;
y--;
ch[x].push_back(make_pair(y, i));
ch[y].push_back(make_pair(x, i));
}
dep(0, 0);
cout << ans1 << endl;
for (ll i = 0; i < n - 1; i++) {
cout << ans[i] << endl;
}
// your code goes here
return 0;
} | #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[p][i].first;
ll noi = ch[p][i].second;
if (ans[noi] != 0) {
continue;
}
if (cnt == c) {
cnt++;
}
ans[noi] = cnt;
ans1 = max(ans1, cnt);
dep(next, cnt);
cnt++;
}
}
int main() {
cin >> n;
for (ll i = 0; i < n - 1; i++) {
ll x, y;
cin >> x >> y;
x--;
y--;
ch[x].push_back(make_pair(y, i));
ch[y].push_back(make_pair(x, i));
}
dep(0, 0);
cout << ans1 << endl;
for (ll i = 0; i < n - 1; i++) {
cout << ans[i] << endl;
}
// your code goes here
return 0;
} | 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, Edge *parent_edge = EDGE_NIL) {
int color = 1;
FOR(i, 0, node->con_edges.size()) {
if (node->con_edges[i] == parent_edge) {
continue;
}
Node *child = node->con_edges[i]->a;
if (child == node)
child = node->con_edges[i]->b;
// color
if (parent_edge->color == color)
color += 1;
node->con_edges[i]->color = color;
color++;
Paint(child, node->con_edges[i]);
}
}
int main() {
int n;
cin >> n;
vector<Node> nodes(n);
vector<Edge> edges(n - 1);
FOR(i, 0, n - 1) {
int a, b;
cin >> a >> b;
edges[i].a = &nodes[a - 1];
edges[i].b = &nodes[b - 1];
nodes[a - 1].con_edges.push_back(&edges[i]);
nodes[b - 1].con_edges.push_back(&edges[i]);
nodes[b - 1].con_nodes.push_back(&nodes[a - 1]);
nodes[a - 1].con_nodes.push_back(&nodes[b - 1]);
}
int k = 0;
FOR(i, 0, n) { k = max(k, (int)nodes[i].con_edges.size()); }
// Node *seek = &nodes[0];
// while (true) {
// if (seek->con_nodes.size() == 1) break;
// Node *other = seek->con_nodes[0];
// if (other == seek) other = seek->con_nodes[1];
// seek = other;
// }
// Node *root = seek;
// seek->con_edges[0]->color = 1;
// Paint(seek->con_nodes[0]);
Node *root = &nodes[0];
Paint(root);
cout << k << endl;
FOR(i, 0, n - 1) { cout << edges[i].color << endl; }
return 0;
}
| #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, Edge *parent_edge = EDGE_NIL) {
int color = 1;
FOR(i, 0, node->con_edges.size()) {
if (node->con_edges[i] == parent_edge) {
continue;
}
Node *child = node->con_edges[i]->a;
if (child == node)
child = node->con_edges[i]->b;
// color
if (parent_edge != EDGE_NIL) {
if (parent_edge->color == color)
color += 1;
}
node->con_edges[i]->color = color;
color++;
Paint(child, node->con_edges[i]);
}
}
int main() {
int n;
cin >> n;
vector<Node> nodes(n);
vector<Edge> edges(n - 1);
FOR(i, 0, n - 1) {
int a, b;
cin >> a >> b;
edges[i].a = &nodes[a - 1];
edges[i].b = &nodes[b - 1];
nodes[a - 1].con_edges.push_back(&edges[i]);
nodes[b - 1].con_edges.push_back(&edges[i]);
nodes[b - 1].con_nodes.push_back(&nodes[a - 1]);
nodes[a - 1].con_nodes.push_back(&nodes[b - 1]);
}
int k = 0;
FOR(i, 0, n) { k = max(k, (int)nodes[i].con_edges.size()); }
// Node *seek = &nodes[0];
// while (true) {
// if (seek->con_nodes.size() == 1) break;
// Node *other = seek->con_nodes[0];
// if (other == seek) other = seek->con_nodes[1];
// seek = other;
// }
// Node *root = seek;
// seek->con_edges[0]->color = 1;
// Paint(seek->con_nodes[0]);
Node *root = &nodes[0];
Paint(root);
cout << k << endl;
FOR(i, 0, n - 1) { cout << edges[i].color << endl; }
return 0;
}
| 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++) {
cin >> a[i] >> b[i];
to[a[i]].push_back(i);
to[b[i]].push_back(i);
coun[a[i]]++;
coun[b[i]]++;
if (coun[a[i]] > maxN)
maxN = coun[a[i]];
if (coun[b[i]] > maxN)
maxN = coun[b[i]];
}
cout << maxN << endl;
nuri(1, -1);
for (int i = 0; i < N - 1; i++)
cout << col[i] << endl;
return 0;
}
void nuri(int start, int nuse) {
int j = 1, k;
for (int i = 0; i < to[start].size(); i++) {
k = to[start][i];
if (j == nuse)
j++;
if (col[k] == 0) {
col[k] = j;
if (start == a[k])
nuri(b[k], j);
else
nuri(a[k], j);
j++;
}
}
} | #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++) {
cin >> a[i] >> b[i];
to[a[i]].push_back(i);
to[b[i]].push_back(i);
coun[a[i]]++;
coun[b[i]]++;
if (coun[a[i]] > maxN)
maxN = coun[a[i]];
if (coun[b[i]] > maxN)
maxN = coun[b[i]];
}
cout << maxN << endl;
nuri(1, -1);
for (int i = 0; i < N - 1; i++)
cout << col[i] << endl;
return 0;
}
void nuri(int start, int nuse) {
int j = 1, k;
for (int i = 0; i < to[start].size(); i++) {
k = to[start][i];
if (j == nuse)
j++;
if (col[k] == 0) {
col[k] = j;
if (start == a[k])
nuri(b[k], j);
else
nuri(a[k], j);
j++;
}
}
} | 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(N); // 各頂点で使われた色
vector<vector<int>> node_edge(N); // 各頂点が持つ枝
queue<int> q;
for (int i = 0; i < N - 1; i++) {
int tmp1, tmp2;
cin >> tmp1 >> tmp2;
tmp1--;
tmp2--;
edge[i] = make_pair(tmp1, tmp2);
node_edge[tmp1].push_back(i);
node_edge[tmp2].push_back(i);
}
int max_deg = 0;
int max_deg_node;
for (int i = 0; i < N; i++) {
int deg = node_edge[i].size();
if (deg > max_deg) {
max_deg_node = i;
max_deg = deg;
}
}
q.push(max_deg_node);
while (!q.empty()) {
int now = q.front();
q.pop();
for (int e : node_edge[now]) {
if (edge_col[e] != -1) {
continue;
}
int node_1 = edge[e].first;
int node_2 = edge[e].second;
int next = (node_1 == now ? node_2 : node_1);
q.push(next);
// cerr << now << " " << next << endl;
for (int c = 0; c < max_deg; c++) {
if (node_col[now][c] == 0 && node_col[next][c] == 0) {
node_col[now][c] = 1;
node_col[next][c] = 1;
edge_col[e] = c;
break;
}
}
}
}
cout << max_deg << endl;
for (int i = 0; i < N - 1; i++) {
cout << edge_col[i] + 1 << endl;
}
}
| #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(N); // 各頂点で使われた色
vector<vector<int>> node_edge(N); // 各頂点が持つ枝
queue<int> q;
for (int i = 0; i < N - 1; i++) {
int tmp1, tmp2;
cin >> tmp1 >> tmp2;
tmp1--;
tmp2--;
edge[i] = make_pair(tmp1, tmp2);
node_edge[tmp1].push_back(i);
node_edge[tmp2].push_back(i);
}
int max_deg = 0;
int max_deg_node;
for (int i = 0; i < N; i++) {
int deg = node_edge[i].size();
if (deg > max_deg) {
max_deg_node = i;
max_deg = deg;
}
}
q.push(max_deg_node);
while (!q.empty()) {
int now = q.front();
q.pop();
for (int e : node_edge[now]) {
if (edge_col[e] != -1) {
continue;
}
int node_1 = edge[e].first;
int node_2 = edge[e].second;
int next = (node_1 == now ? node_2 : node_1);
q.push(next);
// cerr << now << " " << next << endl;
int index = node_col[now].size();
// 最悪max_deg回探索する
for (int time = 0; time < max_deg; time++) {
index += time;
index %= max_deg;
if (node_col[now][index] == 0 && node_col[next][index] == 0) {
node_col[now][index] = 1;
node_col[next][index] = 1;
edge_col[e] = index;
break;
}
}
}
}
cout << max_deg << endl;
for (int i = 0; i < N - 1; i++) {
cout << edge_col[i] + 1 << endl;
}
}
| 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; i++)
#define loopR(i, a, B) for (int i = a; i B; i--)
#define all(x) (x).begin(), (x).end()
#define allR(x) (x).rbegin(), (x).rend()
#define eb emplace_back
#define mp make_pair
#define fst first
#define snd second
#ifdef LOCAL
#define dump(...) \
cerr << "[" << __LINE__ << ":" << __FUNCTION__ << "] ", \
dump_impl(#__VA_ARGS__, __VA_ARGS__)
#define say(x) \
cerr << "[" << __LINE__ << ":" << __FUNCTION__ << "] " << x << endl;
#define debug if (1)
void dump_impl(const char *) { cerr << endl; }
template <class T, class... U>
void dump_impl(const char *s, T const &x, U const &...y) {
const char *o = "({[", *e = "]})";
for (int i = 0; *s != '\0'; cerr << *s++) {
if (count(o, o + 3, *s))
i++;
if (count(e, e + 3, *s))
i--;
if (!i && *s == ',')
break;
}
cerr << " = " << x;
if (*s == ',')
cerr << ", ", s++;
dump_impl(s, y...);
}
#else
#define dump(...)
#define say(x)
#define debug if (0)
#endif
using ll = long long;
using ld = long double;
#define int ll
#define double ld
template <class T> using pque_max = priority_queue<T>;
template <class T> using pque_min = priority_queue<T, vector<T>, greater<T>>;
template <class T, class = typename T::iterator,
class = typename enable_if<!is_same<T, string>::value>::type>
ostream &operator<<(ostream &os, T const &v) {
os << "{";
for (auto const &x : v)
os << " " << x;
return os << " }";
}
template <class T> istream &operator>>(istream &is, vector<T> &v) {
for (auto &x : v)
is >> x;
return is;
}
template <class T, class S>
ostream &operator<<(ostream &os, pair<T, S> const &p) {
return os << "(" << p.first << ", " << p.second << ")";
}
template <class T, class S> istream &operator>>(istream &is, pair<T, S> &p) {
return is >> p.first >> p.second;
}
template <size_t i, class T>
typename enable_if<i >= tuple_size<T>::value>::type output_tuple(ostream &,
T const &) {}
template <size_t i = 0, class T>
typename enable_if <
i<tuple_size<T>::value>::type output_tuple(ostream &os, T const &t) {
os << (i ? " " : "") << get<i>(t);
output_tuple<i + 1, T>(os, t);
}
template <class... T> ostream &operator<<(ostream &os, tuple<T...> const &t) {
return output_tuple(os, t), os;
}
struct IOSetup {
IOSetup() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
}
} iosetup;
template <class T, size_t d> struct vec_impl {
using type = vector<typename vec_impl<T, d - 1>::type>;
template <class... U> static type make_v(size_t n, U &&...x) {
return type(n, vec_impl<T, d - 1>::make_v(forward<U>(x)...));
}
};
template <class T> struct vec_impl<T, 0> {
using type = T;
static type make_v(T const &x = {}) { return x; }
};
template <class T, size_t d = 1> using vec = typename vec_impl<T, d>::type;
template <class T, size_t d = 1, class... Args> auto make_v(Args &&...args) {
return vec_impl<T, d>::make_v(forward<Args>(args)...);
}
template <class T> void quit(T const &x) {
cout << x << endl;
exit(0);
}
template <class T> constexpr bool chmin(T &x, T const &y) {
if (x > y) {
x = y;
return true;
}
return false;
}
template <class T> constexpr bool chmax(T &x, T const &y) {
if (x < y) {
x = y;
return true;
}
return false;
}
template <class It> constexpr auto sumof(It b, It e) {
return accumulate(b, e, typename iterator_traits<It>::value_type{});
}
const ll INF = (1LL << 62) - 1; // ~ 4.6e18
// <<<
int n;
struct edge {
int id, to;
};
vec<edge, 2> g;
vector<int> c;
int k;
void dfs(int x, int p = -1, int pc = -1) {
queue<int> cs;
rep(i, k) if (i != pc) cs.push(i);
for (auto e : g[x]) {
if (e.to == p)
continue;
c[e.id] = cs.front();
cs.pop();
dfs(e.to, x, c[e.id]);
}
}
int32_t main() {
cin >> n;
g.resize(n);
rep(i, n - 1) {
int a, b;
cin >> a >> b;
a--, b--;
g[a].eb(edge{i, b});
g[b].eb(edge{i, a});
}
k = 0;
rep(i, n) chmax(k, (int)g[i].size());
c.resize(n - 1, -1);
dfs(0);
cout << k << "\n";
rep(i, n - 1) cout << c[i] + 1 << "\n";
}
| // >>> 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; i++)
#define loopR(i, a, B) for (int i = a; i B; i--)
#define all(x) (x).begin(), (x).end()
#define allR(x) (x).rbegin(), (x).rend()
#define eb emplace_back
#define mp make_pair
#define fst first
#define snd second
#ifdef LOCAL
#define dump(...) \
cerr << "[" << __LINE__ << ":" << __FUNCTION__ << "] ", \
dump_impl(#__VA_ARGS__, __VA_ARGS__)
#define say(x) \
cerr << "[" << __LINE__ << ":" << __FUNCTION__ << "] " << x << endl;
#define debug if (1)
void dump_impl(const char *) { cerr << endl; }
template <class T, class... U>
void dump_impl(const char *s, T const &x, U const &...y) {
const char *o = "({[", *e = "]})";
for (int i = 0; *s != '\0'; cerr << *s++) {
if (count(o, o + 3, *s))
i++;
if (count(e, e + 3, *s))
i--;
if (!i && *s == ',')
break;
}
cerr << " = " << x;
if (*s == ',')
cerr << ", ", s++;
dump_impl(s, y...);
}
#else
#define dump(...)
#define say(x)
#define debug if (0)
#endif
using ll = long long;
using ld = long double;
#define int ll
#define double ld
template <class T> using pque_max = priority_queue<T>;
template <class T> using pque_min = priority_queue<T, vector<T>, greater<T>>;
template <class T, class = typename T::iterator,
class = typename enable_if<!is_same<T, string>::value>::type>
ostream &operator<<(ostream &os, T const &v) {
os << "{";
for (auto const &x : v)
os << " " << x;
return os << " }";
}
template <class T> istream &operator>>(istream &is, vector<T> &v) {
for (auto &x : v)
is >> x;
return is;
}
template <class T, class S>
ostream &operator<<(ostream &os, pair<T, S> const &p) {
return os << "(" << p.first << ", " << p.second << ")";
}
template <class T, class S> istream &operator>>(istream &is, pair<T, S> &p) {
return is >> p.first >> p.second;
}
template <size_t i, class T>
typename enable_if<i >= tuple_size<T>::value>::type output_tuple(ostream &,
T const &) {}
template <size_t i = 0, class T>
typename enable_if <
i<tuple_size<T>::value>::type output_tuple(ostream &os, T const &t) {
os << (i ? " " : "") << get<i>(t);
output_tuple<i + 1, T>(os, t);
}
template <class... T> ostream &operator<<(ostream &os, tuple<T...> const &t) {
return output_tuple(os, t), os;
}
struct IOSetup {
IOSetup() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
}
} iosetup;
template <class T, size_t d> struct vec_impl {
using type = vector<typename vec_impl<T, d - 1>::type>;
template <class... U> static type make_v(size_t n, U &&...x) {
return type(n, vec_impl<T, d - 1>::make_v(forward<U>(x)...));
}
};
template <class T> struct vec_impl<T, 0> {
using type = T;
static type make_v(T const &x = {}) { return x; }
};
template <class T, size_t d = 1> using vec = typename vec_impl<T, d>::type;
template <class T, size_t d = 1, class... Args> auto make_v(Args &&...args) {
return vec_impl<T, d>::make_v(forward<Args>(args)...);
}
template <class T> void quit(T const &x) {
cout << x << endl;
exit(0);
}
template <class T> constexpr bool chmin(T &x, T const &y) {
if (x > y) {
x = y;
return true;
}
return false;
}
template <class T> constexpr bool chmax(T &x, T const &y) {
if (x < y) {
x = y;
return true;
}
return false;
}
template <class It> constexpr auto sumof(It b, It e) {
return accumulate(b, e, typename iterator_traits<It>::value_type{});
}
const ll INF = (1LL << 62) - 1; // ~ 4.6e18
// <<<
int n;
struct edge {
int id, to;
};
vec<edge, 2> g;
vector<int> c;
int k;
void dfs(int x, int p = -1, int pc = -1) {
queue<int> cs;
rep(i, k) {
if (i != pc)
cs.push(i);
if (cs.size() >= g[x].size())
break;
}
for (auto e : g[x]) {
if (e.to == p)
continue;
c[e.id] = cs.front();
cs.pop();
dfs(e.to, x, c[e.id]);
}
}
int32_t main() {
cin >> n;
g.resize(n);
rep(i, n - 1) {
int a, b;
cin >> a >> b;
a--, b--;
g[a].eb(edge{i, b});
g[b].eb(edge{i, a});
}
k = 0;
rep(i, n) chmax(k, (int)g[i].size());
c.resize(n - 1, -1);
dfs(0);
cout << k << "\n";
rep(i, n - 1) cout << c[i] + 1 << "\n";
}
| 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 PER(i, a, b) for (ll i = (a); i >= (b); i--)
#define rep(i, n) REP(i, 0, n)
#define per(i, n) PER(i, n, 0)
const ll INF = 1e16 + 18;
const ll MAX = 100005;
const ll MOD = 1000000007;
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl;
#define YES(n) cout << ((n) ? "YES" : "NO") << endl;
#define ALL(v) v.begin(), v.end()
#define pb(x) push_back(x)
#define mp(a, b) make_pair(a, b)
#define Each(a, b) for (auto &a : b)
#define REPM(i, mp) for (auto i = mp.begin(); i != mp.end(); ++i)
#define dbg(x_) cerr << #x_ << ":" << x_ << endl;
#define dbgmap(mp) \
cerr << #mp << ":" << endl; \
for (auto i = mp.begin(); i != mp.end(); ++i) { \
cerr << i->first << ":" << i->second << endl; \
}
#define dbgarr(n, m, arr) \
rep(i, n) { \
rep(j, m) { cerr << arr[i][j] << " "; } \
cerr << endl; \
}
#define dbgdp(n, arr) \
rep(i, n) { cerr << arr[i] << " "; } \
cerr << endl;
#define sum(v) accumulate(ALL(v), 0)
#define fi first
#define se second
template <typename T1, typename T2>
ostream &operator<<(ostream &s, const pair<T1, T2> &p) {
return s << "(" << p.first << ", " << p.second << ")";
}
// vector
template <typename T> ostream &operator<<(ostream &s, const vector<T> &v) {
int len = v.size();
for (int i = 0; i < len; ++i) {
s << v[i];
if (i < len - 1)
s << " ";
}
return s;
}
// 2 dimentional vector
template <typename T>
ostream &operator<<(ostream &s, const vector<vector<T>> &vv) {
int len = vv.size();
for (int i = 0; i < len; ++i) {
s << vv[i] << endl;
}
return s;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << std::setprecision(10);
ll n;
cin >> n;
VVi to(n);
VVi color(n, Vi(n, 0));
vector<Pi> edge;
ll a, b;
rep(i, n - 1) {
cin >> a >> b;
a--;
b--;
to[a].pb(b);
to[b].pb(a);
edge.emplace_back(a, b);
}
Vi par(n);
stack<int> q;
q.push(0);
int k = 0;
while (!q.empty()) {
int now = q.top();
q.pop();
int c = 0;
Each(nx, to[now]) {
if (nx == par[now])
continue;
int &parc = color[now][par[now]];
c++;
if (c == parc) {
c++;
}
par[nx] = now;
color[now][nx] = c;
color[nx][now] = c;
q.push(nx);
k = max(k, c);
}
}
cout << k << endl;
rep(i, n - 1) { cout << color[edge[i].fi][edge[i].se] << endl; }
return 0;
}
| #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 PER(i, a, b) for (ll i = (a); i >= (b); i--)
#define rep(i, n) REP(i, 0, n)
#define per(i, n) PER(i, n, 0)
const ll INF = 1e16 + 18;
const ll MAX = 100005;
const ll MOD = 1000000007;
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl;
#define YES(n) cout << ((n) ? "YES" : "NO") << endl;
#define ALL(v) v.begin(), v.end()
#define pb(x) push_back(x)
#define mp(a, b) make_pair(a, b)
#define Each(a, b) for (auto &a : b)
#define REPM(i, mp) for (auto i = mp.begin(); i != mp.end(); ++i)
#define dbg(x_) cerr << #x_ << ":" << x_ << endl;
#define dbgmap(mp) \
cerr << #mp << ":" << endl; \
for (auto i = mp.begin(); i != mp.end(); ++i) { \
cerr << i->first << ":" << i->second << endl; \
}
#define dbgarr(n, m, arr) \
rep(i, n) { \
rep(j, m) { cerr << arr[i][j] << " "; } \
cerr << endl; \
}
#define dbgdp(n, arr) \
rep(i, n) { cerr << arr[i] << " "; } \
cerr << endl;
#define sum(v) accumulate(ALL(v), 0)
#define fi first
#define se second
template <typename T1, typename T2>
ostream &operator<<(ostream &s, const pair<T1, T2> &p) {
return s << "(" << p.first << ", " << p.second << ")";
}
// vector
template <typename T> ostream &operator<<(ostream &s, const vector<T> &v) {
int len = v.size();
for (int i = 0; i < len; ++i) {
s << v[i];
if (i < len - 1)
s << " ";
}
return s;
}
// 2 dimentional vector
template <typename T>
ostream &operator<<(ostream &s, const vector<vector<T>> &vv) {
int len = vv.size();
for (int i = 0; i < len; ++i) {
s << vv[i] << endl;
}
return s;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << std::setprecision(10);
ll n;
cin >> n;
VVi to(n);
// VVi color(n,Vi(n,0));
vector<map<int, int>> color(n);
vector<Pi> edge;
ll a, b;
rep(i, n - 1) {
cin >> a >> b;
a--;
b--;
to[a].pb(b);
to[b].pb(a);
edge.emplace_back(a, b);
}
Vi par(n);
stack<int> q;
q.push(0);
int k = 0;
while (!q.empty()) {
int now = q.top();
q.pop();
int c = 0;
Each(nx, to[now]) {
if (nx == par[now])
continue;
int &parc = color[now][par[now]];
c++;
if (c == parc) {
c++;
}
par[nx] = now;
color[now][nx] = c;
color[nx][now] = c;
q.push(nx);
k = max(k, c);
}
}
cout << k << endl;
rep(i, n - 1) { cout << color[edge[i].fi][edge[i].se] << endl; }
return 0;
}
| 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] = cnt, id[cnt] = i;
}
int n;
int deg[N];
inline void dfs(int x, int f, int c) {
int i, y, nc = 0;
for (i = lst[x], y = to[i]; i; i = nxt[i], y = to[i])
if (y ^ f)
nc = (nc + 1 == c ? c + 1 : nc + 1), ans[id[i]] = nc, dfs(y, x, nc);
return;
}
int main() {
int i, u, v;
scanf("%d", &n);
for (i = 1; i < n; i++)
scanf("%d%d", &u, &v), add(u, v, i), deg[u]++, deg[v]++;
int num = 0;
for (i = 1; i <= n; i++)
num = max(num, deg[i]);
printf("%d\n", num);
dfs(1, 1, 0);
for (i = 1; i < n; i++)
printf("%d\n", ans[i]);
return 0;
}
| #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] = cnt, id[cnt] = i;
}
int n;
int deg[N];
inline void dfs(int x, int f, int c) {
int i, y, nc = 0;
for (i = lst[x], y = to[i]; i; i = nxt[i], y = to[i])
if (y ^ f)
nc = (nc + 1 == c ? c + 1 : nc + 1), ans[id[i]] = nc, dfs(y, x, nc);
return;
}
int main() {
int i, u, v;
scanf("%d", &n);
for (i = 1; i < n; i++)
scanf("%d%d", &u, &v), add(u, v, i), deg[u]++, deg[v]++;
int num = 0;
for (i = 1; i <= n; i++)
num = max(num, deg[i]);
printf("%d\n", num);
dfs(1, 1, 0);
for (i = 1; i < n; i++)
printf("%d\n", ans[i]);
return 0;
}
| 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;
cin >> a >> b;
--a, --b;
g[a].emplace_back((Edge){b, i});
g[b].emplace_back((Edge){a, i});
}
queue<int> q;
q.push(0);
vector<int> used(n);
used[0] = 1;
while (q.size()) {
int v = q.front();
q.pop();
int c = -1;
rep(i, g[v].size()) {
int u = g[v][i].to, ei = g[v][i].id;
if (used[u])
c = ans[ei];
}
int k = 1;
rep(i, g[v].size()) {
int u = g[v][i].to, ei = g[v][i].id;
if (used[u])
continue;
if (k == c)
k++;
ans[ei] = k;
k++;
q.push(u);
}
}
int mx = 0;
rep(i, n) mx = max(mx, int(g[i].size()));
cout << mx << endl;
rep(i, n - 1) cout << ans[i] << endl;
return 0;
}
| #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;
cin >> a >> b;
--a, --b;
g[a].emplace_back((Edge){b, i});
g[b].emplace_back((Edge){a, i});
}
queue<int> q;
q.push(0);
vector<int> used(n);
used[0] = 1;
while (q.size()) {
int v = q.front();
q.pop();
int c = -1;
rep(i, g[v].size()) {
int u = g[v][i].to, ei = g[v][i].id;
if (used[u])
c = ans[ei];
}
int k = 1;
rep(i, g[v].size()) {
int u = g[v][i].to, ei = g[v][i].id;
if (used[u])
continue;
if (k == c)
k++;
ans[ei] = k;
k++;
q.push(u);
used[u] = 1;
}
}
int mx = 0;
rep(i, n) mx = max(mx, int(g[i].size()));
cout << mx << endl;
rep(i, n - 1) cout << ans[i] << endl;
return 0;
}
| 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--;
b--;
G.at(a).push_back(b);
G.at(b).push_back(a);
vp.at(i) = make_pair(a, b);
}
int K = 0;
map<pair<int, int>, int> I; // 辺のラベルを管理
vector<int> cs(n, -1); // 親との辺が何番になっているか？初期値は-1
vector<bool> flag(n, false); // 頂点をcheckしたか
queue<int> q; // BFS用
q.push(0);
flag.at(0) = true;
while (!q.empty()) {
// v->uの辺を考える
int v = q.front();
q.pop();
int label = 1;
K = max(K, (int)G.at(v).size());
for (auto u : G.at(v)) { // vの行先を全て調査
if (flag.at(u) == true)
continue;
if (cs.at(v) == label)
label++;
cs.at(u) = label;
I[make_pair(v, u)] = label;
I[make_pair(u, v)] = label;
label++;
q.push(u);
flag.at(u) = true;
}
cout << K << endl;
for (auto p : vp) {
cout << I.at(p) << endl;
}
}
} | #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--;
b--;
G.at(a).push_back(b);
G.at(b).push_back(a);
vp.at(i) = make_pair(a, b);
}
int K = 0;
map<pair<int, int>, int> I; // 辺のラベルを管理
vector<int> cs(n, -1); // 親との辺が何番になっているか？初期値は-1
vector<bool> flag(n, false); // 頂点をcheckしたか
queue<int> q; // BFS用
q.push(0);
flag.at(0) = true;
while (!q.empty()) {
// v->uの辺を考える
int v = q.front();
q.pop();
int label = 1;
K = max(K, (int)G.at(v).size());
for (auto u : G.at(v)) { // vの行先を全て調査
if (flag.at(u) == true)
continue;
if (cs.at(v) == label)
label++;
cs.at(u) = label;
I[make_pair(v, u)] = label;
I[make_pair(u, v)] = label;
label++;
q.push(u);
flag.at(u) = true;
}
}
cout << K << endl;
for (auto p : vp) {
cout << I.at(p) << endl;
}
} | 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 (edge[a][i] != prev) {
count++;
if (count == prev_color)
count++;
color[n_edge[a][i]] = count;
allocate(edge[a][i], a, count);
}
}
if (count > Max)
Max = count;
}
int main(void) {
int N;
cin >> N;
int a, b;
for (int i = 0; i < N - 1; i++) {
cin >> a >> b;
edge[a].push_back(b);
edge[b].push_back(a);
n_edge[a].push_back(i);
n_edge[b].push_back(i);
}
allocate(1, 0, N);
cout << Max << endl;
for (int i = 0; i < N - 1; i++) {
cout << color[i] << endl;
}
return 0;
} | #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 (edge[a][i] != prev) {
count++;
if (count == prev_color)
count++;
color[n_edge[a][i]] = count;
allocate(edge[a][i], a, count);
}
}
if (count > Max)
Max = count;
}
int main(void) {
int N;
cin >> N;
int a, b;
for (int i = 0; i < N - 1; i++) {
cin >> a >> b;
edge[a].push_back(b);
edge[b].push_back(a);
n_edge[a].push_back(i);
n_edge[b].push_back(i);
}
allocate(1, 0, N);
cout << Max << endl;
for (int i = 0; i < N - 1; i++) {
cout << color[i] << endl;
}
return 0;
} | 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 <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
typedef long long LL;
typedef pair<int, int> P;
const int L = 1e5;
vector<P> ps[L];
int cs[L];
int m = 0;
void f(int r, int p, int c) {
m = max(m, c);
int k = 1;
for (auto n : ps[r]) {
if (n.first == p)
continue;
if (k == c) {
k++;
}
cs[n.second] = k;
f(n.first, r, k);
k++;
}
}
int main() {
int N;
cin >> N;
for (int i = 0; i < N - 1; i++) {
int a, b;
cin >> a >> b;
ps[a].push_back(P(b, i));
ps[b].push_back(P(a, i));
}
f(1, 0, 0);
cout << m << endl;
for (int i = 0; i < N - 1; i++) {
cout << cs[i] << endl;
}
return 0;
}
| #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 <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
typedef long long LL;
typedef pair<int, int> P;
const int L = 1e5 + 1;
vector<P> ps[L];
int cs[L];
int m = 0;
void f(int r, int p, int c) {
m = max(m, c);
int k = 1;
for (auto n : ps[r]) {
if (n.first == p)
continue;
if (k == c) {
k++;
}
cs[n.second] = k;
f(n.first, r, k);
k++;
}
}
int main() {
int N;
cin >> N;
for (int i = 0; i < N - 1; i++) {
int a, b;
cin >> a >> b;
ps[a].push_back(P(b, i));
ps[b].push_back(P(a, i));
}
f(1, 0, 0);
cout << m << endl;
for (int i = 0; i < N - 1; i++) {
cout << cs[i] << endl;
}
return 0;
}
| 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
#include <vector>
#define lson rt << 1, l, mid
#define rson rt << 1 | 1, mid + 1, r
#define LONG_LONG_MAX 9223372036854775807LL
#define pblank putchar(' ')
#define ll LL
#define fastIO ios::sync_with_stdio(false), cin.tie(0), cout.tie(0)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef pair<int, int> P;
int n, m, k;
const int maxn = 1e5 + 10;
template <class T> inline T read() {
int f = 1;
T ret = 0;
char ch = getchar();
while (!isdigit(ch)) {
if (ch == '-')
f = -1;
ch = getchar();
}
while (isdigit(ch)) {
ret = (ret << 1) + (ret << 3) + ch - '0';
ch = getchar();
}
ret *= f;
return ret;
}
template <class T> inline void write(T n) {
if (n < 0) {
putchar('-');
n = -n;
}
if (n >= 10) {
write(n / 10);
}
putchar(n % 10 + '0');
}
template <class T> inline void writeln(const T &n) {
write(n);
puts("");
}
template <typename T> void _write(const T &t) { write(t); }
template <typename T, typename... Args> void _write(const T &t, Args... args) {
write(t), pblank;
_write(args...);
}
template <typename T, typename... Args>
inline void write_line(const T &t, const Args &...data) {
_write(t, data...);
puts("");
}
struct Node {
int idx, to, nxt;
} edg[maxn << 1];
int head[maxn], son[maxn];
int tot, rt, maxx = 0;
void add(int x, int y, int idx) {
edg[tot].idx = idx;
edg[tot].to = y;
edg[tot].nxt = head[x];
head[x] = tot++;
}
int col[maxn];
void dfs(int u, int pre) {
for (int i = head[u]; ~i; i = edg[i].nxt) {
int v = edg[i].to;
if (v == pre)
continue;
dfs(v, u);
++son[u];
}
if (son[u] + (u != 1) > maxx) {
maxx = son[u] + (u != 1);
rt = u;
}
}
void dfs2(int u, int fa, int pre) {
int x = rand() % maxx + 1;
while (x == pre)
x = rand() % maxx + 1;
for (int i = head[u]; ~i; i = edg[i].nxt) {
int v = edg[i].to;
int num = edg[i].idx;
if (col[num] || v == fa)
continue;
col[num] = x;
++x;
if (x > maxx)
x = 1;
if (x == pre)
++x;
if (x > maxx)
x = 1;
}
for (int i = head[u]; ~i; i = edg[i].nxt) {
int v = edg[i].to;
int num = edg[i].idx;
if (v != fa)
dfs2(v, u, col[num]);
}
}
int main(int argc, char const *argv[]) {
#ifndef ONLINE_JUDGE
// freopen("in.txt", "r", stdin);
// freopen("out.txt", "w", stdout);
#endif
srand(time(nullptr));
n = read<int>();
memset(head, -1, sizeof(int) * (n + 1));
for (int i = 0; i < n - 1; i++) {
int x = read<int>(), y = read<int>();
add(x, y, i);
add(y, x, i);
}
dfs(1, 0);
writeln(maxx);
dfs2(rt, 0, 0);
for (int i = 0; i < n - 1; i++)
writeln(col[i]);
return 0;
} | #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
#include <vector>
#define lson rt << 1, l, mid
#define rson rt << 1 | 1, mid + 1, r
#define LONG_LONG_MAX 9223372036854775807LL
#define pblank putchar(' ')
#define ll LL
#define fastIO ios::sync_with_stdio(false), cin.tie(0), cout.tie(0)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef pair<int, int> P;
int n, m, k;
const int maxn = 1e5 + 10;
template <class T> inline T read() {
int f = 1;
T ret = 0;
char ch = getchar();
while (!isdigit(ch)) {
if (ch == '-')
f = -1;
ch = getchar();
}
while (isdigit(ch)) {
ret = (ret << 1) + (ret << 3) + ch - '0';
ch = getchar();
}
ret *= f;
return ret;
}
template <class T> inline void write(T n) {
if (n < 0) {
putchar('-');
n = -n;
}
if (n >= 10) {
write(n / 10);
}
putchar(n % 10 + '0');
}
template <class T> inline void writeln(const T &n) {
write(n);
puts("");
}
template <typename T> void _write(const T &t) { write(t); }
template <typename T, typename... Args> void _write(const T &t, Args... args) {
write(t), pblank;
_write(args...);
}
template <typename T, typename... Args>
inline void write_line(const T &t, const Args &...data) {
_write(t, data...);
puts("");
}
struct Node {
int idx, to, nxt;
} edg[maxn << 1];
int head[maxn], son[maxn];
int tot, rt, maxx = 0;
void add(int x, int y, int idx) {
edg[tot].idx = idx;
edg[tot].to = y;
edg[tot].nxt = head[x];
head[x] = tot++;
}
int col[maxn];
void dfs(int u, int pre) {
for (int i = head[u]; ~i; i = edg[i].nxt) {
int v = edg[i].to;
if (v == pre)
continue;
dfs(v, u);
++son[u];
}
if (son[u] + (u != 1) > maxx) {
maxx = son[u] + (u != 1);
rt = u;
}
}
void dfs2(int u, int fa, int pre) {
int x = 1;
if (x == pre)
++x;
if (x > maxx)
x = 1;
for (int i = head[u]; ~i; i = edg[i].nxt) {
int v = edg[i].to;
int num = edg[i].idx;
if (col[num] || v == fa)
continue;
col[num] = x;
++x;
if (x > maxx)
x = 1;
if (x == pre)
++x;
if (x > maxx)
x = 1;
}
for (int i = head[u]; ~i; i = edg[i].nxt) {
int v = edg[i].to;
int num = edg[i].idx;
if (v != fa)
dfs2(v, u, col[num]);
}
}
int main(int argc, char const *argv[]) {
#ifndef ONLINE_JUDGE
// freopen("in.txt", "r", stdin);
// freopen("out.txt", "w", stdout);
#endif
srand(time(nullptr));
n = read<int>();
memset(head, -1, sizeof(int) * (n + 1));
for (int i = 0; i < n - 1; i++) {
int x = read<int>(), y = read<int>();
add(x, y, i);
add(y, x, i);
}
dfs(1, 0);
writeln(maxx);
dfs2(rt, 0, 0);
for (int i = 0; i < n - 1; i++)
writeln(col[i]);
return 0;
} | 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, const S &b) {
if (a > b)
a = b;
}
template <class T, class S> void cmax(T &a, const S &b) {
if (a < b)
a = b;
}
template <class A> void PR(A a, ll n) {
rep(i, n) {
if (i)
cout << ' ';
cout << a[i];
}
cout << "\n";
}
ld PI = 3.14159265358979323846;
ll N;
vector<vector<ll>> G(100010);
vector<ll> memo(100010);
map<Pll, ll> mp;
ll K = 1;
ll dfs(ll v, ll c) {
ll cc = 1;
for (auto &u : G[v]) {
if (memo[u] != 0)
continue;
memo[u] = 1;
if (cc == c)
cc++;
cmax(K, cc);
mp[Pll(v, u)] = cc;
mp[Pll(u, v)] = cc;
dfs(u, cc);
cc++;
}
}
int main() {
cin >> N;
ll a, b;
vector<Pll> v;
rep(i, N - 1) {
cin >> a >> b;
a--;
b--;
v.push_back(Pll(a, b));
G[a].push_back(b);
G[b].push_back(a);
}
memo[0] = 1;
dfs(0, 0);
cout << K << endl;
rep(i, N - 1) { cout << mp[v[i]] << endl; }
} | #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, const S &b) {
if (a > b)
a = b;
}
template <class T, class S> void cmax(T &a, const S &b) {
if (a < b)
a = b;
}
template <class A> void PR(A a, ll n) {
rep(i, n) {
if (i)
cout << ' ';
cout << a[i];
}
cout << "\n";
}
ld PI = 3.14159265358979323846;
ll N;
vector<vector<ll>> G(100010);
vector<ll> memo(100010);
map<Pll, ll> mp;
ll K = 1;
ll dfs(ll v, ll c) {
ll cc = 1;
for (auto &u : G[v]) {
if (memo[u] != 0)
continue;
memo[u] = 1;
if (cc == c)
cc++;
cmax(K, cc);
mp[Pll(v, u)] = cc;
mp[Pll(u, v)] = cc;
dfs(u, cc);
cc++;
}
return 0;
}
int main() {
cin >> N;
ll a, b;
vector<Pll> v;
rep(i, N - 1) {
cin >> a >> b;
a--;
b--;
v.push_back(Pll(a, b));
G[a].push_back(b);
G[b].push_back(a);
}
memo[0] = 1;
dfs(0, 0);
cout << K << endl;
rep(i, N - 1) { cout << mp[v[i]] << endl; }
} | 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) for (auto(i) : v)
#define ALL(x) (x).begin(), (x).end()
#define PR(x) cout << (x) << endl
#define PS(x) cout << (x) << " "
#define SZ(x) ((ll)(x).size())
#define MAX(a, b) (((a) > (b)) ? (a) : (b))
#define MIN(a, b) (((a) < (b)) ? (a) : (b))
#define REV(x) reverse(ALL((x)))
#define ASC(x) sort(ALL((x)))
#define DESC(x) \
ASC((x)); \
REV((x))
#define pb push_back
#define eb emplace_back
int main() {
ll N;
cin >> N;
vec A(N - 1), B(N - 1);
vector<vector<ll>> G(N + 1);
REP(i, 0, N - 1) {
cin >> A[i] >> B[i];
G[A[i]].pb(B[i]);
G[B[i]].pb(A[i]);
}
G[0].pb(1);
G[1].pb(0);
queue<ll> Q;
vector<bool> F(N, false);
vec P(N);
map<pll, ll> E;
ll K = 0;
Q.push(1);
F[0] = true;
F[1] = true;
P[1] = 0;
while (!Q.empty()) {
ll v = Q.front();
Q.pop();
ll c = 1, pc = E[{P[v], v}];
FORR(nv, G[v]) {
if (!F[nv]) {
if (c == pc)
++c;
E[{v, nv}] = c;
E[{nv, v}] = c;
K = MAX(K, c);
Q.push(nv);
F[nv] = true;
P[nv] = v;
++c;
}
}
}
PR(K);
REP(i, 0, N - 1) cout << E[{A[i], B[i]}] << endl;
return 0;
}
/*
*/ | #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) for (auto(i) : v)
#define ALL(x) (x).begin(), (x).end()
#define PR(x) cout << (x) << endl
#define PS(x) cout << (x) << " "
#define SZ(x) ((ll)(x).size())
#define MAX(a, b) (((a) > (b)) ? (a) : (b))
#define MIN(a, b) (((a) < (b)) ? (a) : (b))
#define REV(x) reverse(ALL((x)))
#define ASC(x) sort(ALL((x)))
#define DESC(x) \
ASC((x)); \
REV((x))
#define pb push_back
#define eb emplace_back
int main() {
ll N;
cin >> N;
vec A(N - 1), B(N - 1);
vector<vector<ll>> G(N + 1);
REP(i, 0, N - 1) {
cin >> A[i] >> B[i];
G[A[i]].pb(B[i]);
G[B[i]].pb(A[i]);
}
G[0].pb(1);
G[1].pb(0);
queue<ll> Q;
vector<bool> F(N + 1, false);
vec P(N + 1);
map<pll, ll> E;
ll K = 0;
Q.push(1);
F[0] = true;
F[1] = true;
P[1] = 0;
while (!Q.empty()) {
ll v = Q.front();
Q.pop();
ll c = 1, pc = E[{P[v], v}];
FORR(nv, G[v]) {
if (!F[nv]) {
if (c == pc)
++c;
E[{v, nv}] = c;
E[{nv, v}] = c;
K = MAX(K, c);
Q.push(nv);
F[nv] = true;
P[nv] = v;
++c;
}
}
}
PR(K);
REP(i, 0, N - 1) cout << E[{A[i], B[i]}] << endl;
return 0;
}
/*
*/ | 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 long>;
using sll = set<long long>;
template <typename T> T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }
template <typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
template <typename T> map<T, T> getPrimeFactor(T n) {
map<T, T> res;
for (T i = 2; i * i <= n; ++i) {
while (n % i == 0) {
res[i]++;
n /= i;
}
}
if (n != 1)
res[n] = 1;
return res;
}
template <typename T> bool IsPrimeNumber(T num) {
if (num <= 2)
return true;
else if (num % 2 == 0)
return false;
double sqrtNum = sqrt(num);
for (int i = 3; i <= sqrtNum; i += 2) {
if (num % i == 0) {
return false;
}
}
return true;
}
long long modinv(long long a, long long m) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
#define rep(i, s, e) for (ll i = s; i < e; i++)
#define repeq(i, s, e) for (ll i = s; i <= e; i++)
int main() {
ll N;
std::cin >> N;
vector<map<ll, ll>> e(N);
vector<vector<bool>> flg(N, vector<bool>(N, false));
rep(i, 0, N - 1) {
ll a, b;
std::cin >> a >> b;
a--;
b--;
e[a][b] = i;
e[b][a] = i;
}
stack<ll> st;
st.push(0);
vll col(N - 1, -1);
ll cnt = 0;
while (!st.empty()) {
ll cur = st.top();
st.pop();
ll tmp = 1;
for (auto itr = e[cur].begin(); itr != e[cur].end(); itr++) {
if (col[itr->second] < 0) {
while (flg[cur][tmp]) {
tmp++;
}
col[itr->second] = tmp;
flg[cur][tmp] = true;
flg[itr->first][tmp] = true;
st.push(itr->first);
}
}
cnt = max(cnt, tmp);
}
std::cout << cnt << endl;
rep(i, 0, N - 1) { std::cout << col[i] << endl; }
return 0;
}
| #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 long>;
using sll = set<long long>;
template <typename T> T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }
template <typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
template <typename T> map<T, T> getPrimeFactor(T n) {
map<T, T> res;
for (T i = 2; i * i <= n; ++i) {
while (n % i == 0) {
res[i]++;
n /= i;
}
}
if (n != 1)
res[n] = 1;
return res;
}
template <typename T> bool IsPrimeNumber(T num) {
if (num <= 2)
return true;
else if (num % 2 == 0)
return false;
double sqrtNum = sqrt(num);
for (int i = 3; i <= sqrtNum; i += 2) {
if (num % i == 0) {
return false;
}
}
return true;
}
long long modinv(long long a, long long m) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
#define rep(i, s, e) for (ll i = s; i < e; i++)
#define repeq(i, s, e) for (ll i = s; i <= e; i++)
int main() {
ll N;
std::cin >> N;
vector<map<ll, ll>> e(N);
vector<map<ll, bool>> flg(N);
rep(i, 0, N - 1) {
ll a, b;
std::cin >> a >> b;
a--;
b--;
e[a][b] = i;
e[b][a] = i;
}
stack<ll> st;
st.push(0);
vll col(N - 1, -1);
ll cnt = 0;
while (!st.empty()) {
ll cur = st.top();
st.pop();
ll tmp = 1;
for (auto itr = e[cur].begin(); itr != e[cur].end(); itr++) {
if (col[itr->second] < 0) {
while (flg[cur][tmp]) {
tmp++;
}
col[itr->second] = tmp;
flg[cur][tmp] = true;
flg[itr->first][tmp] = true;
st.push(itr->first);
}
}
cnt = max(cnt, tmp);
}
std::cout << cnt << endl;
rep(i, 0, N - 1) { std::cout << col[i] << endl; }
return 0;
}
| 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/multiprecision/cpp_int.hpp>
using namespace std;
#define REP(i, n) for (int64_t i = 0; i < (int64_t)n; i++)
#define REP_FOR(i, a, b) for (int64_t i = (int64_t)a; i < (int64_t)b; i++)
#define REP_REV(i, a, b) for (int64_t i = (int64_t)a; i > (int64_t)b; i--)
#define FORALL(v) (v).begin(), (v).end()
#define mp(a, b) make_pair(a, b)
#define eb(x) emplace_back(x)
#define F first
#define S second
typedef long long ll;
typedef long double ld;
typedef pair<int64_t, int64_t> pii;
typedef pair<ll, ll> pll;
typedef pair<ld, ld> pdd;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<int64_t> vii;
typedef vector<vii> vvii;
const ll mod = 1e9 + 7;
const int64_t infi = 1147483600;
const ll infl = 4e18 + 5;
const char EOL = '\n';
// cout << fixed << setprecision(17) << res << endl;
// const ll MOD = 1000000009;
int main() {
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
cout << std::fixed << setprecision(15);
auto unit_r = 180.0 / M_PI;
int64_t n;
cin >> n;
vector<tuple<ll, ll, ll, ll>> ab(n - 1);
for (ll i = 0; i < n - 1; ++i) {
ll a, b;
cin >> a >> b;
ab[i] = make_tuple(i, a, b, 0);
}
sort(ab.begin(), ab.end(), [](const auto &x, const auto &y) {
return get<1>(x) != get<1>(y) ? get<1>(x) < get<1>(y)
: get<2>(x) < get<2>(y);
});
// for (ll i = 0; i < n-1; ++i) {
// cerr << "ab[" << i << "] == " << get<1>(ab[i]) << ", " << get<2>(ab[i])
// << endl;
// }
ll m = 0;
ll curVertex = 0;
ll curColor = 0;
vector<ll> color(n, 1);
color[1] = 0;
for (ll i = 0; i < n - 1; ++i) {
auto v = get<1>(ab[i]);
if (v != curVertex) {
curColor = 1;
curVertex = v;
} else {
curColor = curColor + 1;
}
if (color[v] == curColor)
curColor++;
m = max(m, curColor);
get<3>(ab[i]) = curColor;
color[get<2>(ab[i])] = curColor;
}
sort(ab.begin(), ab.end());
cout << m << endl;
for (ll i = 0; i < n - 1; ++i) {
cout << get<3>(ab[i]) << endl;
}
}
| #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/multiprecision/cpp_int.hpp>
using namespace std;
#define REP(i, n) for (int64_t i = 0; i < (int64_t)n; i++)
#define REP_FOR(i, a, b) for (int64_t i = (int64_t)a; i < (int64_t)b; i++)
#define REP_REV(i, a, b) for (int64_t i = (int64_t)a; i > (int64_t)b; i--)
#define FORALL(v) (v).begin(), (v).end()
#define mp(a, b) make_pair(a, b)
#define eb(x) emplace_back(x)
#define F first
#define S second
typedef long long ll;
typedef long double ld;
typedef pair<int64_t, int64_t> pii;
typedef pair<ll, ll> pll;
typedef pair<ld, ld> pdd;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<int64_t> vii;
typedef vector<vii> vvii;
const ll mod = 1e9 + 7;
const int64_t infi = 1147483600;
const ll infl = 4e18 + 5;
const char EOL = '\n';
// cout << fixed << setprecision(17) << res << endl;
// const ll MOD = 1000000009;
int main() {
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
cout << std::fixed << setprecision(15);
auto unit_r = 180.0 / M_PI;
int64_t n;
cin >> n;
vector<tuple<ll, ll, ll, ll>> ab(n - 1);
for (ll i = 0; i < n - 1; ++i) {
ll a, b;
cin >> a >> b;
ab[i] = make_tuple(i, a, b, 0);
}
sort(ab.begin(), ab.end(), [](const auto &x, const auto &y) {
return get<1>(x) != get<1>(y) ? get<1>(x) < get<1>(y)
: get<2>(x) < get<2>(y);
});
// for (ll i = 0; i < n-1; ++i) {
// cerr << "ab[" << i << "] == " << get<1>(ab[i]) << ", " << get<2>(ab[i])
// << endl;
// }
ll m = 0;
ll curVertex = 0;
ll curColor = 0;
vector<ll> color(n + 10, 1);
color[1] = 0;
for (ll i = 0; i < n - 1; ++i) {
auto v = get<1>(ab[i]);
if (v != curVertex) {
curColor = 1;
curVertex = v;
} else {
curColor = curColor + 1;
}
if (color[v] == curColor)
curColor++;
m = max(m, curColor);
get<3>(ab[i]) = curColor;
color[get<2>(ab[i])] = curColor;
}
sort(ab.begin(), ab.end());
cout << m << endl;
for (ll i = 0; i < n - 1; ++i) {
cout << get<3>(ab[i]) << endl;
}
}
| 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 revrep(i, n) for (int i = (n)-1; i >= 0; i--)
typedef long long ll;
typedef pair<int, int> P;
const int M = 1e9 + 7;
const int INF = 1e9;
const int MAX_V = 1000 + 5;
const int MAX_N = 1e5 + 5;
bool seen[100020];
int main() {
int n;
cin >> n;
vector<vector<int>> v(n);
map<P, int> edge_color_map;
vector<P> edges;
rep(i, n - 1) {
int a, b;
cin >> a >> b;
a--;
b--;
v[a].push_back(b);
edges.emplace_back(a, b);
}
vector<int> color(n - 1, 0);
queue<int> que;
seen[0] = true;
que.push(0);
int max_degree = 0;
while (!que.empty()) {
int top = que.front();
que.pop();
vector<int> next_vertexes = v[top];
int curr = 1;
for (int e : next_vertexes) {
if (seen[e])
continue;
que.push(e);
if (curr == color[top])
curr++;
edge_color_map[make_pair(top, e)] = curr;
color[e] = curr;
max_degree = max(max_degree, curr);
curr++;
}
seen[top] = true;
}
cout << max_degree << endl;
for (auto e : edges) {
cout << edge_color_map[e] << endl;
}
}
| #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 revrep(i, n) for (int i = (n)-1; i >= 0; i--)
typedef long long ll;
typedef pair<int, int> P;
const int M = 1e9 + 7;
const int INF = 1e9;
const int MAX_V = 1000 + 5;
const int MAX_N = 1e5 + 5;
bool seen[100020];
int main() {
int n;
cin >> n;
vector<vector<int>> v(n);
map<P, int> edge_color_map;
vector<P> edges;
rep(i, n - 1) {
int a, b;
cin >> a >> b;
a--;
b--;
v[a].push_back(b);
edges.emplace_back(a, b);
}
vector<int> color(n, 0);
queue<int> que;
seen[0] = true;
que.push(0);
int max_degree = 0;
while (!que.empty()) {
int top = que.front();
que.pop();
vector<int> next_vertexes = v[top];
int curr = 1;
for (int e : next_vertexes) {
if (seen[e])
continue;
que.push(e);
if (curr == color[top])
curr++;
edge_color_map[make_pair(top, e)] = curr;
color[e] = curr;
max_degree = max(max_degree, curr);
curr++;
}
seen[top] = true;
}
cout << max_degree << endl;
for (auto e : edges) {
cout << edge_color_map[e] << endl;
}
}
| 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;
cin >> N;
vector<vector<int>> G(N);
vector<pair<int, int>> vp;
rep(i, N) {
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<pair<int, int>, int> I;
vector<int> cs(N, 0);
vector<int> used(N, 0);
queue<int> que;
used[0] = 1;
que.emplace(0);
while (!que.empty()) {
int v = que.front();
que.pop();
if (K < (int)G[v].size())
K = G[v].size();
int cur = 1;
for (int u : G[v]) {
if (used[u])
continue;
if (cur == cs[v])
cur++;
cs[u] = I[make_pair(u, v)] = I[make_pair(v, u)] = cur;
cur++;
used[u] = 1;
que.emplace(u);
}
}
cout << K << endl;
for (auto p : vp)
cout << I[p] << endl;
return 0;
} | #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;
cin >> N;
vector<vector<int>> G(N);
vector<pair<int, int>> vp;
rep(i, N - 1) {
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<pair<int, int>, int> I;
vector<int> cs(N, 0);
vector<int> used(N, 0);
queue<int> que;
used[0] = 1;
que.emplace(0);
while (!que.empty()) {
int v = que.front();
que.pop();
if (K < (int)G[v].size())
K = G[v].size();
int cur = 1;
for (int u : G[v]) {
if (used[u])
continue;
if (cur == cs[v])
cur++;
cs[u] = I[make_pair(u, v)] = I[make_pair(v, u)] = cur;
cur++;
used[u] = 1;
que.emplace(u);
}
}
cout << K << endl;
for (auto p : vp)
cout << I[p] << endl;
return 0;
} | 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<pair<int, int>, int> I;
vector<int> cs(N, 0); // color of edge between its parent
vector<int> used(N, 0);
queue<int> que;
used[0] = 1;
que.emplace(0);
while (!que.empty()) {
int v = que.front();
que.pop();
if (K < (int)G[v].size())
K = G[v].size();
int cur = 1;
for (int u : G[v]) {
if (used[u])
continue;
if (cur == cs[v])
cur++; // 親の色と同じだったら
cs[u] = I[make_pair(u, v)] = I[make_pair(v, u)] = cur++;
used[u] = 1;
que.emplace(u);
}
}
cout << K << endl;
for (auto p : vp) {
cout << I[p] << endl;
}
}
| #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<pair<int, int>, int> I;
vector<int> cs(N, 0); // color of edge between its parent
vector<int> used(N, 0);
queue<int> que;
used[0] = 1;
que.emplace(0);
while (!que.empty()) {
int v = que.front();
que.pop();
if (K < (int)G[v].size())
K = G[v].size();
int cur = 1;
for (int u : G[v]) {
if (used[u])
continue;
if (cur == cs[v])
cur++; // 親の色と同じだったら
cs[u] = I[make_pair(u, v)] = I[make_pair(v, u)] = cur++;
used[u] = 1;
que.emplace(u);
}
}
cout << K << endl;
for (auto p : vp) {
cout << I[p] << endl;
}
}
| 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 = (int)1e9 + 7;
const long long INF = 1LL << 60;
using ii = pair<int, int>;
using ll = long long;
using vi = vector<int>;
using vd = vector<double>;
using vb = vector<bool>;
using vl = vector<ll>;
using vs = vector<string>;
using vvi = vector<vector<int>>;
using vvl = vector<vector<ll>>;
using vii = vector<pair<int, int>>;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
ll GCD(ll a, ll b) { return b ? GCD(b, a % b) : a; }
ll LCM(ll a, ll b) { return (a * b) / GCD(a, b); }
int round_int(int a, int b) { return (a + (b - 1)) / b; }
// 素因数分解; 返り値は(素数, 乗数)のvector配列
vector<pair<ll, int>> factorize(ll n) {
vector<pair<ll, int>> res;
for (ll i = 2; i * i <= n; ++i) {
if (n % i)
continue;
res.emplace_back(i, 0);
while (n % i == 0) {
n /= i;
res.back().second++;
}
}
if (n != 1)
res.emplace_back(n, 1);
return res;
}
constexpr array<int, 9> dx = {0, 1, 0, -1, -1, 1, 1, -1, 0};
constexpr array<int, 9> dy = {1, 0, -1, 0, 1, 1, -1, -1, 0};
constexpr auto MAX = 100010;
// ──────────────────────────────────────────────────────────────────────────────
struct Edge {
int to, id;
};
vector<vector<Edge>> g;
vector<int> ans;
void dfs(int v, int c = -1, int p = -1) {
int k = 1;
rep(i, g[v].size()) {
int u = g[v][i].id, ei = g[v][i].id;
if (u == p)
continue;
if (k == c)
++k;
ans[ei] = k;
++k;
dfs(u, ans[ei], v);
}
}
int main() {
int n;
cin >> n;
g.resize(n);
ans = vi(n - 1);
rep(i, n - 1) {
int a, b;
cin >> a >> b;
--a, --b;
Edge tmp1 = {b, i};
Edge tmp2 = {a, i};
g[a].push_back(tmp1);
g[b].push_back(tmp2);
}
dfs(0);
int mx = 0;
rep(i, n) mx = max(mx, int(g[i].size()));
cout << mx << endl;
rep(i, n - 1) { cout << ans[i] << endl; }
return 0;
} | #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 = (int)1e9 + 7;
const long long INF = 1LL << 60;
using ii = pair<int, int>;
using ll = long long;
using vi = vector<int>;
using vd = vector<double>;
using vb = vector<bool>;
using vl = vector<ll>;
using vs = vector<string>;
using vvi = vector<vector<int>>;
using vvl = vector<vector<ll>>;
using vii = vector<pair<int, int>>;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
ll GCD(ll a, ll b) { return b ? GCD(b, a % b) : a; }
ll LCM(ll a, ll b) { return (a * b) / GCD(a, b); }
int round_int(int a, int b) { return (a + (b - 1)) / b; }
// 素因数分解; 返り値は(素数, 乗数)のvector配列
vector<pair<ll, int>> factorize(ll n) {
vector<pair<ll, int>> res;
for (ll i = 2; i * i <= n; ++i) {
if (n % i)
continue;
res.emplace_back(i, 0);
while (n % i == 0) {
n /= i;
res.back().second++;
}
}
if (n != 1)
res.emplace_back(n, 1);
return res;
}
constexpr array<int, 9> dx = {0, 1, 0, -1, -1, 1, 1, -1, 0};
constexpr array<int, 9> dy = {1, 0, -1, 0, 1, 1, -1, -1, 0};
constexpr auto MAX = 100010;
// ──────────────────────────────────────────────────────────────────────────────
struct Edge {
int to, id;
};
vector<vector<Edge>> g;
vector<int> ans;
void dfs(int v, int c = -1, int p = -1) {
int k = 1;
rep(i, g[v].size()) {
int u = g[v][i].to, ei = g[v][i].id;
if (u == p)
continue;
if (k == c)
++k;
ans[ei] = k;
++k;
dfs(u, ans[ei], v);
}
}
int main() {
int n;
cin >> n;
g.resize(n);
ans = vi(n - 1);
rep(i, n - 1) {
int a, b;
cin >> a >> b;
--a, --b;
Edge tmp1 = {b, i};
Edge tmp2 = {a, i};
g[a].push_back(tmp1);
g[b].push_back(tmp2);
}
dfs(0);
int mx = 0;
rep(i, n) mx = max(mx, int(g[i].size()));
cout << mx << endl;
rep(i, n - 1) { cout << ans[i] << endl; }
return 0;
} | 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
#define se second
#define pb push_back
#define ALL(x) x.begin(), x.end()
#define V(T) vector<T>
typedef pair<int, int> P;
typedef pair<P, P> PP;
typedef vector<int> vi;
typedef vector<vi> vvi;
int max(int a, int b) {
if (b > a)
return b;
else
return a;
}
int min(int a, int b) {
if (b < a)
return b;
else
return a;
}
const int MAX_N = 10050;
vvi nx(MAX_N);
vi ans(MAX_N, 0);
void dfs(int s) {
// 新たな頂点なので、色番号をリセットする
int cnt = 0;
// 頂点sからのびる全ての辺に色を付けていく。
// ただし、色番号は幅優先で付けられるが、頂点sのたどり方は深さ優先である。
// すると、頂点sにたどり着くときに通った直前の辺の色がans[s]となり、
// 新たな辺に色を付ける際は、ans[s]だけをスキップすればよい。
rep(i, nx[s].size()) {
// 頂点sからのびる辺に、1から順に数えて色番号を付けていく
cnt++;
// 直前の辺の色番号はスキップ
if (cnt == ans[s])
cnt++;
// 確定した色番号を保存
ans[nx[s][i]] = cnt;
// 色が確定したら、その辺をたどった先の頂点について同様の操作を始める
dfs(nx[s][i]);
}
}
signed main() {
int N;
cin >> N;
vi a(N), b(N);
rep(i, N - 1) {
cin >> a[i] >> b[i];
nx[a[i]].pb(b[i]);
}
ans[1] = 0;
dfs(1);
int mx = 0;
rep(i, N) { mx = max(mx, ans[i + 1]); }
cout << mx << endl;
rep(i, N - 1) { cout << ans[b[i]] << endl; }
return 0;
} | #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
#define se second
#define pb push_back
#define ALL(x) x.begin(), x.end()
#define V(T) vector<T>
typedef pair<int, int> P;
typedef pair<P, P> PP;
typedef vector<int> vi;
typedef vector<vi> vvi;
int max(int a, int b) {
if (b > a)
return b;
else
return a;
}
int min(int a, int b) {
if (b < a)
return b;
else
return a;
}
const int MAX_N = 100050;
vvi nx(MAX_N);
vi ans(MAX_N, 0);
void dfs(int s) {
// 新たな頂点なので、色番号をリセットする
int cnt = 0;
// 頂点sからのびる全ての辺に色を付けていく。
// ただし、色番号は幅優先で付けられるが、頂点sのたどり方は深さ優先である。
// すると、頂点sにたどり着くときに通った直前の辺の色がans[s]となり、
// 新たな辺に色を付ける際は、ans[s]だけをスキップすればよい。
rep(i, nx[s].size()) {
// 頂点sからのびる辺に、1から順に数えて色番号を付けていく
cnt++;
// 直前の辺の色番号はスキップ
if (cnt == ans[s])
cnt++;
// 確定した色番号を保存
ans[nx[s][i]] = cnt;
// 色が確定したら、その辺をたどった先の頂点について同様の操作を始める
dfs(nx[s][i]);
}
}
signed main() {
int N;
cin >> N;
vi a(N), b(N);
rep(i, N - 1) {
cin >> a[i] >> b[i];
nx[a[i]].pb(b[i]);
}
ans[1] = 0;
dfs(1);
int mx = 0;
rep(i, N) { mx = max(mx, ans[i + 1]); }
cout << mx << endl;
rep(i, N - 1) { cout << ans[b[i]] << endl; }
return 0;
} | 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); ++i)
#define FORR(i, a, b) for (int i = (a); i > (b); --i)
#define FOR_ALL(i, c) \
for (__typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define FOR_ALLR(i, c) \
for (__typeof((c).rbegin()) i = (c).rbegin(); i != (c).rend(); ++i)
#define SZ(array) (sizeof(array) / sizeof(array[0]))
#define lc(x) (x << 1) /* 2*x */
#define rc(x) (x << 1 | 1) /* 2*x+1 */
#define lowbit(x) (x & (-x)) /* 0b10100 -> 0b100 */
typedef long long LL;
typedef map<int, int> MII;
typedef pair<int, int> PII;
typedef set<int> SI;
typedef vector<bool> VB;
typedef vector<double> VD;
typedef vector<int> VI;
typedef vector<string> VS;
/* check if a key is in container C */
template <class C> inline bool in_(const typename C::key_type &k, const C &A) {
return A.find(k) != A.end();
}
inline bool in_(const string &s, const string &S) {
return S.find(s) != string::npos;
}
const int maxn = 1e2 + 5;
struct Edge {
int u, v, c;
} E[maxn * 2];
set<int> colr[maxn];
VI G[maxn];
void dfs(const int u, const int p) {
int c = 1;
FOR_ALL(e, G[u]) {
const int v = E[*e].v;
if (v != p) {
while (in_(c, colr[u]))
c++;
colr[u].insert(c);
colr[v].insert(c);
E[*e].c = c;
dfs(v, u);
}
}
}
int main() {
#ifdef foo_
freopen("foo", "rt", stdin);
#endif
ios::sync_with_stdio(false);
int n;
while (cin >> n) {
FOR(i, 0, n + 1)
colr[i].clear(), G[i].clear();
int j = 0;
FOR(_, 0, n - 1) {
int u, v;
cin >> u >> v;
E[j].u = u;
E[j].v = v;
E[j].c = 0;
G[u].push_back(j);
j++;
E[j].u = v;
E[j].v = u;
E[j].c = 0;
G[v].push_back(j);
j++;
}
dfs(1, 1);
VI ans;
FOR(i, 0, j) if (E[i].c) ans.push_back(E[i].c);
set<int> S(ALL(ans));
cout << S.size() << endl;
FOR_ALL(a, ans)
cout << *a << endl;
}
return 0;
}
|
#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); ++i)
#define FORR(i, a, b) for (int i = (a); i > (b); --i)
#define FOR_ALL(i, c) \
for (__typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define FOR_ALLR(i, c) \
for (__typeof((c).rbegin()) i = (c).rbegin(); i != (c).rend(); ++i)
#define SZ(array) (sizeof(array) / sizeof(array[0]))
#define lc(x) (x << 1) /* 2*x */
#define rc(x) (x << 1 | 1) /* 2*x+1 */
#define lowbit(x) (x & (-x)) /* 0b10100 -> 0b100 */
typedef long long LL;
typedef map<int, int> MII;
typedef pair<int, int> PII;
typedef set<int> SI;
typedef vector<bool> VB;
typedef vector<double> VD;
typedef vector<int> VI;
typedef vector<string> VS;
/* check if a key is in container C */
template <class C> inline bool in_(const typename C::key_type &k, const C &A) {
return A.find(k) != A.end();
}
inline bool in_(const string &s, const string &S) {
return S.find(s) != string::npos;
}
const int maxn = 1e5 + 5;
struct Edge {
int u, v, c;
} E[maxn * 2];
set<int> colr[maxn];
VI G[maxn];
void dfs(const int u, const int p) {
int c = 1;
FOR_ALL(e, G[u]) {
const int v = E[*e].v;
if (v != p) {
while (in_(c, colr[u]))
c++;
colr[u].insert(c);
colr[v].insert(c);
E[*e].c = c;
dfs(v, u);
}
}
}
int main() {
#ifdef foo_
freopen("foo", "rt", stdin);
#endif
ios::sync_with_stdio(false);
int n;
while (cin >> n) {
FOR(i, 0, n + 1)
colr[i].clear(), G[i].clear();
int j = 0;
FOR(_, 0, n - 1) {
int u, v;
cin >> u >> v;
E[j].u = u;
E[j].v = v;
E[j].c = 0;
G[u].push_back(j);
j++;
E[j].u = v;
E[j].v = u;
E[j].c = 0;
G[v].push_back(j);
j++;
}
dfs(1, 1);
VI ans;
FOR(i, 0, j) if (E[i].c) ans.push_back(E[i].c);
set<int> S(ALL(ans));
cout << S.size() << endl;
FOR_ALL(a, ans)
cout << *a << endl;
}
return 0;
}
| 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, ll par, ll col) {
ll i = 0;
for (auto e : edges[cur]) {
ll nxt = e.first, id = e.second;
if (nxt == par) {
continue;
}
while (i == col) {
i++;
}
color[id] = i;
dfs(nxt, cur, i);
i++;
}
}
signed main() {
cin >> N;
rep(i, N - 1) {
ll a, b;
cin >> a >> b;
a--;
b--;
edges[a].push_back({b, i});
edges[b].push_back({a, i});
}
dfs(0, -1, -1);
ll _max = 0;
rep(i, N - 1) { _max = max(_max, color[i] + 1); }
cout << _max << endl;
rep(i, N - 1) { cout << color[i] + 1 << endl; }
}
| #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, ll par, ll col) {
ll i = 0;
for (auto e : edges[cur]) {
ll nxt = e.first, id = e.second;
if (nxt == par) {
continue;
}
while (i == col) {
i++;
}
color[id] = i;
dfs(nxt, cur, i);
i++;
}
}
signed main() {
cin >> N;
rep(i, N - 1) {
ll a, b;
cin >> a >> b;
a--;
b--;
edges[a].push_back({b, i});
edges[b].push_back({a, i});
}
dfs(0, -1, -1);
ll _max = 0;
rep(i, N - 1) { _max = max(_max, color[i] + 1); }
cout << _max << endl;
rep(i, N - 1) { cout << color[i] + 1 << endl; }
}
| 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++;
}
}
int main() {
int N;
cin >> N;
for (int i = 0; i < N - 1; i++) {
int a, b;
cin >> a >> b;
a--;
b--;
edges[a].emplace_back(b, i);
edges[b].emplace_back(a, i);
}
dfs(0, -1, -1);
cout << *max_element(ans, ans + N - 1) << endl;
for (int i = 0; i < N - 1; i++)
cout << ans[i] << endl;
return 0;
}
| #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++;
}
}
int main() {
int N;
cin >> N;
for (int i = 0; i < N - 1; i++) {
int a, b;
cin >> a >> b;
a--;
b--;
edges[a].emplace_back(b, i);
edges[b].emplace_back(a, i);
}
dfs(0, -1, -1);
cout << *max_element(ans, ans + N - 1) << endl;
for (int i = 0; i < N - 1; i++)
cout << ans[i] << endl;
return 0;
}
| 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 \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define file_io \
freopen("in.txt", "r", stdin); \
freopen("out.txt", "w", stdout);
#define ld_io cout << setprecision(10) << fixed;
ll pw(ll a, ll b, ll mod) {
if (!b)
return 1;
if (b & 1)
return a * pw(a * a % mod, b / 2, mod) % mod;
return pw(a * a % mod, b / 2, mod) % mod;
}
const ll MAXN = 1e5 + 10;
const ll INF = 8e18;
const ll MOD = 1e9 + 7; // 998244353;
const ll LOG = 32; // log2(1e9)
const ll BLOCK = 320; // sqrt(1e5)
ll n, k, a[MAXN], ps[MAXN], ans;
map<ll, vector<ll>> v;
int main() {
fastio ps[0] = 0;
v[0].push_back(0);
cin >> n >> k;
for (ll i = 1; i <= n; i++) {
cin >> a[i];
a[i]--;
ps[i] = ps[i - 1] + a[i];
v[ps[i] % k].push_back(i);
}
for (auto &i : v) {
for (ll j = 0; j < i.Y.size(); j++) {
ans += lower_bound(all(i.Y), i.Y[j] + k) - i.Y.begin() - j - 1;
}
}
cout << ans << endl;
return 0;
}
| #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 \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define file_io \
freopen("in.txt", "r", stdin); \
freopen("out.txt", "w", stdout);
#define ld_io cout << setprecision(10) << fixed;
ll pw(ll a, ll b, ll mod) {
if (!b)
return 1;
if (b & 1)
return a * pw(a * a % mod, b / 2, mod) % mod;
return pw(a * a % mod, b / 2, mod) % mod;
}
const ll MAXN = 1e6 + 10;
const ll INF = 8e18;
const ll MOD = 1e9 + 7; // 998244353;
const ll LOG = 32; // log2(1e9)
const ll BLOCK = 320; // sqrt(1e5)
ll n, k, a[MAXN], ps[MAXN], ans;
map<ll, vector<ll>> v;
int main() {
fastio ps[0] = 0;
v[0].push_back(0);
cin >> n >> k;
for (ll i = 1; i <= n; i++) {
cin >> a[i];
a[i]--;
ps[i] = ps[i - 1] + a[i];
v[ps[i] % k].push_back(i);
}
for (auto &i : v) {
for (ll j = 0; j < i.Y.size(); j++) {
ans += lower_bound(all(i.Y), i.Y[j] + k) - i.Y.begin() - j - 1;
}
}
cout << ans << endl;
return 0;
}
| 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 k;
scanf("%d%lld", &n, &k);
cs[0] = 0;
REP(i, n) {
scanf("%lld", &vs[i]);
vs[i] = (vs[i] + k - 1) % k;
cs[i + 1] = (cs[i] + vs[i]) % k;
}
ll res = 0;
// REP(i, n) {
// cerr << i << " : " << vs[i] << endl;
// }
// cerr << endl;
// REP(i, n+1) {
// cerr << i << " : " << cs[i] << endl;
// }
for (int i = n; i >= 0; --i) {
ll cur = cs[i];
ll opp = cur;
while (!table[opp].empty() && table[opp].front() >= i + k) {
table[opp].pop();
}
// if(table[opp].size() > 0) {
// cerr << i << " " << table[opp].size() << endl;
// }
res += table[opp].size();
table[cur].push(i);
}
cout << res << endl;
return 0;
}
|
#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 k;
scanf("%d%lld", &n, &k);
cs[0] = 0;
REP(i, n) {
scanf("%lld", &vs[i]);
vs[i] = (vs[i] + k - 1) % k;
cs[i + 1] = (cs[i] + vs[i]) % k;
}
ll res = 0;
// REP(i, n) {
// cerr << i << " : " << vs[i] << endl;
// }
// cerr << endl;
// REP(i, n+1) {
// cerr << i << " : " << cs[i] << endl;
// }
for (int i = n; i >= 0; --i) {
ll cur = cs[i];
ll opp = cur;
while (!table[opp].empty() && table[opp].front() >= i + k) {
table[opp].pop();
}
// if(table[opp].size() > 0) {
// cerr << i << " " << table[opp].size() << endl;
// }
res += table[opp].size();
table[cur].push(i);
}
cout << res << endl;
return 0;
}
| 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()), c == EOF)
return 0;
while (c != '-' && (c < '0' || c > '9'))
c = getchar();
sgn = (c == '-') ? -1 : 1;
ret = (c == '-') ? 0 : (c - '0');
while (static_cast<void>(c = getchar()), c >= '0' && c <= '9')
ret = ret * 10 + (c - '0');
ret *= sgn;
return 1;
}
LL a[N * 5], k, n;
LL ans = 0, sum[N] = {0};
map<unsigned int, LL> num;
int main() {
cin >> n >> k;
for (int i = 1; i <= n; ++i) {
read(a[i]);
sum[i] = sum[i - 1] + a[i];
}
num[0] = 1;
for (int i = 1; i <= n; ++i) {
if (i - k >= 0) {
num[(sum[i - k] - (i - k)) % k]--;
}
if (num.count((sum[i] - i) % k)) {
ans += num[(sum[i] - i) % k];
}
num[(sum[i] - i) % k]++;
}
cout << ans;
return 0;
} | #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()), c == EOF)
return 0;
while (c != '-' && (c < '0' || c > '9'))
c = getchar();
sgn = (c == '-') ? -1 : 1;
ret = (c == '-') ? 0 : (c - '0');
while (static_cast<void>(c = getchar()), c >= '0' && c <= '9')
ret = ret * 10 + (c - '0');
ret *= sgn;
return 1;
}
LL a[N * 5], k, n;
LL ans = 0, sum[N * 5] = {0};
map<unsigned int, LL> num;
int main() {
cin >> n >> k;
for (int i = 1; i <= n; ++i) {
read(a[i]);
sum[i] = sum[i - 1] + a[i];
}
num[0] = 1;
for (int i = 1; i <= n; ++i) {
if (i - k >= 0) {
num[(sum[i - k] - (i - k)) % k]--;
}
if (num.count((sum[i] - i) % k)) {
ans += num[(sum[i] - i) % k];
}
num[(sum[i] - i) % k]++;
}
cout << ans;
return 0;
} | 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 REP(i, n) for (int64 i = 0; i < (n); ++i)
#define FOR(i, a, b) for (int64 i = (a); i < (b); i++)
#define FORR(i, a, b) for (int64 i = (a); i >= (b); i--)
#define ALL(obj) (obj).begin(), (obj).end()
#define pii pair<int32, int32>
#define pll pair<int64, int64>
#define pb(a) push_back(a)
#define mp make_pair
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int32 n, k;
cin >> n >> k;
// vector<int32> a(n);
// REP(i,n)cin >> a[i];
// vector<int32> asum(n+1,0);
// REP(i,n)asum[i+1] = (asum[i] + a[i] - 1 + k) % k;
vector<int32> asum(n + 1, 0);
REP(i, n) {
int32 a;
cin >> a;
asum[i + 1] = (asum[i] + a - 1 + k) % k;
}
vector<int32> cnt(k, 0);
int64 ans = 0;
REP(i, n + 1) {
ans += cnt[asum[i]];
cnt[asum[i]]++;
if (i - k + 1 >= 0)
cnt[asum[i - k + 1]]--;
}
ANS(ans);
return 0;
} | #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 REP(i, n) for (int64 i = 0; i < (n); ++i)
#define FOR(i, a, b) for (int64 i = (a); i < (b); i++)
#define FORR(i, a, b) for (int64 i = (a); i >= (b); i--)
#define ALL(obj) (obj).begin(), (obj).end()
#define pii pair<int32, int32>
#define pll pair<int64, int64>
#define pb(a) push_back(a)
#define mp make_pair
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int32 n, k;
cin >> n >> k;
// vector<int32> a(n);
// REP(i,n)cin >> a[i];
// vector<int32> asum(n+1,0);
// REP(i,n)asum[i+1] = (asum[i] + a[i] - 1 + k) % k;
vector<int32> asum(n + 1, 0);
REP(i, n) {
int32 a;
cin >> a;
asum[i + 1] = (asum[i] + a - 1 + k) % k;
}
// vector<int32> cnt(k,0);
map<int32, int32> cnt;
int64 ans = 0;
REP(i, n + 1) {
ans += cnt[asum[i]];
cnt[asum[i]]++;
if (i - k + 1 >= 0)
cnt[asum[i - k + 1]]--;
}
ANS(ans);
return 0;
} | 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 = getchar();
while (c >= '0' && c <= '9')
x = x * 10 + c - '0', c = getchar();
return x;
}
struct Node {
int pos, val;
friend bool operator<(const Node &a, const Node &b) { return a.pos > b.pos; }
};
priority_queue<Node> q;
int main() {
n = read(), mod = read();
for (register int i = 1; i <= n; ++i) {
a[i] = read() - 1;
sum[i] = (sum[i - 1] + a[i]) % mod;
}
mp[0] = 1;
q.push((Node){0, 0});
for (register int i = 1; i <= n; ++i) {
while (i - q.top().pos >= mod) {
Node cur = q.top();
--mp[cur.val];
q.pop();
}
ans += mp[sum[i]];
++mp[sum[i]];
q.push((Node){i, sum[i]});
}
printf("%lld\n", ans);
return 0;
} | #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 = getchar();
while (c >= '0' && c <= '9')
x = x * 10 + c - '0', c = getchar();
return x;
}
struct Node {
int pos, val;
friend bool operator<(const Node &a, const Node &b) { return a.pos > b.pos; }
};
priority_queue<Node> q;
int main() {
n = read(), mod = read();
if (mod == 1) {
puts("0");
return 0;
}
for (register int i = 1; i <= n; ++i) {
a[i] = read() - 1;
sum[i] = (sum[i - 1] + a[i]) % mod;
}
mp[0] = 1;
q.push((Node){0, 0});
for (register int i = 1; i <= n; ++i) {
while (i - q.top().pos >= mod) {
Node cur = q.top();
--mp[cur.val];
q.pop();
}
ans += mp[sum[i]];
++mp[sum[i]];
q.push((Node){i, sum[i]});
}
printf("%lld\n", ans);
return 0;
} | 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(long long) ? 0x3f3f3f3f3f3f3f3fLL : 0x3f3f3f3f;
const int MOD = 1000000007;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return true;
}
return false;
}
template <typename T> vector<T> gen_v(size_t a) { return vector<T>(a); }
template <typename T, typename... Ts> auto gen_v(size_t a, Ts... ts) {
return vector<decltype(gen_v<T>(ts...))>(a, gen_v<T>(ts...));
}
template <typename T, typename V>
typename enable_if<is_class<T>::value == 0>::type fill_v(T &t, const V &v) {
t = v;
}
template <typename T, typename V>
typename enable_if<is_class<T>::value != 0>::type fill_v(T &t, const V &v) {
for (auto &e : t)
fill_v(e, v);
}
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, K;
cin >> N >> K;
vector<int> A(N);
rep(i, 0, N) { cin >> A[i]; }
vector<int> B = A;
rep(i, 0, N - 1) {
B[i] %= K;
B[i + 1] += B[i];
}
B.back() %= K;
dump(B);
auto f = [&](int x) {
if (x < 0) {
int k = abs(x) / K;
x += (k + 1) * K;
x %= K;
}
x %= K;
return x;
};
rep(i, 0, N) {
B[i] = i + 1 - B[i];
B[i] = f(B[i]);
}
dump(B);
int ans = 0;
map<int, int> mp;
rep(i, 0, K - 1) { mp[B[i]]++; }
int x = 0;
rep(i, 0, N) {
dump(mp);
dump(x, mp[x]);
ans += mp[x];
dump(ans);
x++;
x -= A[i];
x = f(x);
dump(x);
mp[B[i]]--;
if (i + K - 1 < N)
mp[B[i + K - 1]]++;
}
cout << ans << endl;
return 0;
} | #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(long long) ? 0x3f3f3f3f3f3f3f3fLL : 0x3f3f3f3f;
const int MOD = 1000000007;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return true;
}
return false;
}
template <typename T> vector<T> gen_v(size_t a) { return vector<T>(a); }
template <typename T, typename... Ts> auto gen_v(size_t a, Ts... ts) {
return vector<decltype(gen_v<T>(ts...))>(a, gen_v<T>(ts...));
}
template <typename T, typename V>
typename enable_if<is_class<T>::value == 0>::type fill_v(T &t, const V &v) {
t = v;
}
template <typename T, typename V>
typename enable_if<is_class<T>::value != 0>::type fill_v(T &t, const V &v) {
for (auto &e : t)
fill_v(e, v);
}
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N, K;
cin >> N >> K;
vector<int> A(N);
rep(i, 0, N) { cin >> A[i]; }
vector<int> B = A;
rep(i, 0, N - 1) {
B[i] %= K;
B[i + 1] += B[i];
}
B.back() %= K;
dump(B);
auto f = [&](int x) {
if (x < 0) {
int k = abs(x) / K;
x += (k + 1) * K;
x %= K;
}
x %= K;
return x;
};
rep(i, 0, N) {
B[i] = i + 1 - B[i];
B[i] = f(B[i]);
}
dump(B);
int ans = 0;
map<int, int> mp;
rep(i, 0, min(N, K - 1)) { mp[B[i]]++; }
int x = 0;
rep(i, 0, N) {
dump(mp);
dump(x, mp[x]);
ans += mp[x];
dump(ans);
x++;
x -= A[i];
x = f(x);
dump(x);
mp[B[i]]--;
if (i + K - 1 < N)
mp[B[i + K - 1]]++;
}
cout << ans << endl;
return 0;
} | 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 = i - k;
while (f[cur].size() && *f[cur].begin() <= er) {
f[cur].erase(f[cur].begin());
}
ans += f[cur].size();
f[cur].insert(i);
}
cout << ans << endl;
} | #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;
int er = i - k;
while (f[cur].size() && *f[cur].begin() <= er) {
f[cur].erase(f[cur].begin());
}
ans += f[cur].size();
f[cur].insert(i);
}
cout << ans << endl;
} | 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; i <= N; i++) {
sum.at(i) -= i;
sum.at(i) %= K;
}
map<int, ll> m;
for (int i = 0; i <= N; i++) {
if (m.count(sum.at(i)) == 0) {
m[sum.at(i)] = 0;
}
m[sum.at(i)]++;
}
map<int, ll> count;
for (auto x : m) {
count[x.first] = 0;
}
for (int i = 0; i < K - 1; i++) {
count[sum.at(i)]++;
}
ll ans = 0;
for (int i = 0; i <= N; i++) {
if (i + K - 1 <= N) {
count[sum.at(i + K - 1)]++;
}
ans += count[sum.at(i)] - 1;
count[sum.at(i)]--;
}
cout << ans << endl;
}
| #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; i <= N; i++) {
sum.at(i) -= i;
sum.at(i) %= K;
}
map<int, ll> m;
for (int i = 0; i <= N; i++) {
if (m.count(sum.at(i)) == 0) {
m[sum.at(i)] = 0;
}
m[sum.at(i)]++;
}
map<int, ll> count;
for (auto x : m) {
count[x.first] = 0;
}
for (int i = 0; i <= min(K - 2, N); i++) {
count[sum.at(i)]++;
}
ll ans = 0;
for (int i = 0; i <= N; i++) {
if (i + K - 1 <= N) {
count[sum.at(i + K - 1)]++;
}
ans += count[sum.at(i)] - 1;
count[sum.at(i)]--;
}
cout << ans << endl;
}
| 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).end()
typedef long long ll;
typedef unsigned long long ull;
int main() {
int N, K;
cin >> N >> K;
vector<int> v;
rep(i, N) {
int a;
cin >> a;
v.push_back(a);
}
vector<int> S;
S.push_back(0);
int b = 0;
rep(i, N) {
b += v[i];
b %= K;
S.push_back(b);
}
rep(i, S.size()) { S[i] = (S[i] - (i % K) + K) % K; }
map<int, int> memo;
rep(i, K) { memo[S[i]]++; }
ll ret = 0;
rep(i, N) {
memo[S[i]]--;
ret += memo[S[i]];
// cout << i << " " << S[i] << " " << memo[S[i]] << endl;
if (i + K < N + 1)
memo[S[i + K]]++;
}
cout << ret << endl;
return 0;
}
| #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).end()
typedef long long ll;
typedef unsigned long long ull;
int main() {
int N, K;
cin >> N >> K;
vector<int> v;
rep(i, N) {
int a;
cin >> a;
v.push_back(a);
}
vector<int> S;
S.push_back(0);
int b = 0;
rep(i, N) {
b += v[i];
b %= K;
S.push_back(b);
}
rep(i, S.size()) { S[i] = (S[i] - (i % K) + K) % K; }
map<int, int> memo;
rep(i, min(K, (int)S.size())) { memo[S[i]]++; }
ll ret = 0;
rep(i, N) {
memo[S[i]]--;
ret += memo[S[i]];
// cout << i << " " << S[i] << " " << memo[S[i]] << endl;
if (i + K < N + 1)
memo[S[i + K]]++;
}
cout << ret << endl;
return 0;
}
| 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++) {
cin >> a[i];
a[i]--;
}
for (Int i = 0; i < n - 1; i++) {
a[i + 1] += a[i];
}
for (Int i = 0; i <= n; i++) {
a[i] %= k;
// cout << a[i] <<" ";
}
// cout << endl;
map<Int, Int> mp;
for (Int i = 0; i < min(n, k - 1); i++) {
mp[a[i]]++;
}
mp[0]++;
for (auto i : mp) {
res += i.se * (i.se - 1) / 2;
}
mp[0]--;
// dump(res);
for (Int i = k - 1; i < n; i++) {
if (k <= i) {
mp[a[i - k]]--;
}
// cout << mp[a[i]] << " ";
res += mp[a[i]];
// dump(res);
mp[a[i]]++;
}
dump(res);
return 0;
} | #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++) {
cin >> a[i];
a[i]--;
}
for (Int i = 0; i < n - 1; i++) {
a[i + 1] += a[i];
}
for (Int i = 0; i < n; i++) {
a[i] %= k;
// cout << a[i] <<" ";
}
// cout << endl;
map<Int, Int> mp;
for (Int i = 0; i < min(n, k - 1); i++) {
mp[a[i]]++;
}
mp[0]++;
for (auto i : mp) {
res += i.se * (i.se - 1) / 2;
}
mp[0]--;
// dump(res);
for (Int i = k - 1; i < n; i++) {
if (k <= i) {
mp[a[i - k]]--;
}
// cout << mp[a[i]] << " ";
res += mp[a[i]];
// dump(res);
mp[a[i]]++;
}
dump(res);
return 0;
} | 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)
#define OREP(i, n) for (int i = 1; i <= (n); ++i)
#define RREP(i, n) for (int i = (n)-1; i >= 0; --i)
#define GOODBYE \
do { \
cout << "0" << endl; \
return 0; \
} while (false)
#define MM << " " <<
#define Endl endl
vector<int> compress(vector<int> D) {
map<int, int> G;
vector<int> E, r;
int s = D.size();
for (int i = 0; i < s; i++) {
E.push_back(D[i]);
}
sort(E.begin(), E.end());
int t = 0;
for (int i = 0; i < s; i++) {
if (i != 0 && E[i] != E[i - 1]) {
t++;
}
G[E[i]] = t;
}
for (int i = 0; i < s; i++) {
r.push_back(G[D[i]]);
}
return r;
}
signed main(void) {
int N, K;
int A[214514], B[214514] = {};
cin >> N >> K;
REP(i, N) { cin >> A[i]; }
B[0] = 0;
REP(i, N) {
B[i + 1] = B[i] + A[i];
B[i + 1] %= K;
}
REP(i, N + 1) {
B[i] += (K - (i % K));
// B[i]++;
B[i] %= K;
}
// REP(i,N+1){cout << B[i] << " ";}cout << endl;
vector<int> D;
REP(i, N + 1) { D.push_back(B[i]); }
D = compress(D);
vector<int> G[10];
int Dmx = 0;
REP(i, D.size()) {
G[D[i]].push_back(i);
Dmx = max(Dmx, D[i]);
}
int Ans = 0;
REP(j, Dmx + 1) {
int l = 0, r = 1;
int num = 0;
while (l < G[j].size()) {
if (G[j][r] - G[j][l] < K && r != G[j].size()) {
r++;
} else {
num += (r - l - 1);
l++;
}
}
Ans += num;
}
cout << Ans << endl;
return 0;
}
| #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)
#define OREP(i, n) for (int i = 1; i <= (n); ++i)
#define RREP(i, n) for (int i = (n)-1; i >= 0; --i)
#define GOODBYE \
do { \
cout << "0" << endl; \
return 0; \
} while (false)
#define MM << " " <<
#define Endl endl
vector<int> compress(vector<int> D) {
map<int, int> G;
vector<int> E, r;
int s = D.size();
for (int i = 0; i < s; i++) {
E.push_back(D[i]);
}
sort(E.begin(), E.end());
int t = 0;
for (int i = 0; i < s; i++) {
if (i != 0 && E[i] != E[i - 1]) {
t++;
}
G[E[i]] = t;
}
for (int i = 0; i < s; i++) {
r.push_back(G[D[i]]);
}
return r;
}
signed main(void) {
int N, K;
int A[214514], B[214514] = {};
cin >> N >> K;
REP(i, N) { cin >> A[i]; }
B[0] = 0;
REP(i, N) {
B[i + 1] = B[i] + A[i];
B[i + 1] %= K;
}
REP(i, N + 1) {
B[i] += (K - (i % K));
// B[i]++;
B[i] %= K;
}
// REP(i,N+1){cout << B[i] << " ";}cout << endl;
vector<int> D;
REP(i, N + 1) { D.push_back(B[i]); }
D = compress(D);
vector<int> G[214514];
int Dmx = 0;
REP(i, D.size()) {
G[D[i]].push_back(i);
Dmx = max(Dmx, D[i]);
}
int Ans = 0;
REP(j, Dmx + 1) {
int l = 0, r = 1;
int num = 0;
while (l < G[j].size()) {
if (G[j][r] - G[j][l] < K && r != G[j].size()) {
r++;
} else {
num += (r - l - 1);
l++;
}
}
Ans += num;
}
cout << Ans << endl;
return 0;
}
| 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(NULL);
int n;
cin >> n >> k;
for (int i = 1; i <= n; i++)
cin >> a[i];
a[0] = 0;
for (int i = 1; i <= n; i++) {
a[i] += a[i - 1];
}
for (int i = 1; i <= n; i++) {
a[i] -= i;
a[i] %= k;
}
LL ans = 0;
map<LL, int> c;
c[a[0]]++;
for (int i = 1; i < k; i++) {
ans += c[a[i]];
c[a[i]]++;
}
for (int i = k; i <= n; i++) {
c[a[i - k]]--;
ans += c[a[i]];
c[a[i]]++;
}
cout << ans << endl;
// cerr << fixed << setprecision(3) << (clock()-start)*1./CLOCKS_PER_SEC <<
// endl;
return 0;
} | #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(NULL);
int n;
cin >> n >> k;
for (int i = 1; i <= n; i++)
cin >> a[i];
a[0] = 0;
for (int i = 1; i <= n; i++) {
a[i] += a[i - 1];
}
for (int i = 1; i <= n; i++) {
a[i] -= i;
a[i] %= k;
}
LL ans = 0;
map<LL, int> c;
c[a[0]]++;
if (k > n)
k = n + 1;
for (int i = 1; i < k; i++) {
ans += c[a[i]];
c[a[i]]++;
}
for (int i = k; i <= n; i++) {
c[a[i - k]]--;
ans += c[a[i]];
c[a[i]]++;
}
cout << ans << endl;
// cerr << fixed << setprecision(3) << (clock()-start)*1./CLOCKS_PER_SEC <<
// endl;
return 0;
} | 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 namespace std;
using P = pair<long, long>;
const int MAX = 1000000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルの前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
// そのまま計算すると負の値になるのでMODを足す
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
// 二分累乗法
long long modpow(long long a, long long n, long long mod) {
long long res = 1;
while (n > 0) {
if (n & 1)
res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
/*
//UnionFind木
struct UnionFind{
vector<long long int> par; //par[i] : iの親の番号
vector<long long int> rnk; //root[i] : iの木のサイズ
//コンストラクタ
UnionFind(long long int n): par(n), rnk(n){
//木の初期化
for(long long int i = 0; i < n; i++){
par[i] = i;
rnk[i] = 1;
}
}
//データxが属する木の根を再帰で取得
long long int root(long long int x){
if(par[x] == x){
return x;
}else{
return par[x] = root(par[x]);
}
}
//xとyが同じ木に属しているかを判定
bool same(long long int x, long long int y){
return root(x) == root(y);
}
//xとyの木を併合
void unite(long long int x, long long int y){
long long int rx = root(x); //xの根
long long int ry = root(y); //yの根
if(rx == ry) return; //根が同じならそのまま
//併合するときにサイズを足し合わせる
if(rnk[rx] < rnk[ry]){
par[rx] = ry;
rnk[ry] += rnk[rx];
}else{
par[ry] = rx;
rnk[rx] += rnk[ry];
}
}
//属している木のサイズを取得
long long int size(long long int x){
return rnk[root(x)];
}
};
*/
/*
//重み付きUnionFind
template<class Abel> struct UnionFind {
vector<int> par;
vector<int> rank;
vector<Abel> diff_weight;
UnionFind(int n = 1, Abel SUM_UNITY = 0) {
init(n, SUM_UNITY);
}
void init(int n = 1, Abel SUM_UNITY = 0) {
par.resize(n); rank.resize(n); diff_weight.resize(n);
for (int i = 0; i < n; ++i) par[i] = i, rank[i] = 0, diff_weight[i] =
SUM_UNITY;
}
int root(int x) {
if (par[x] == x) {
return x;
}
else {
int r = root(par[x]);
diff_weight[x] += diff_weight[par[x]];
return par[x] = r;
}
}
Abel weight(int x) {
root(x);
return diff_weight[x];
}
bool issame(int x, int y) {
return root(x) == root(y);
}
bool merge(int x, int y, Abel w) {
w += weight(x); w -= weight(y);
x = root(x); y = root(y);
if (x == y) return false;
if (rank[x] < rank[y]) swap(x, y), w = -w;
if (rank[x] == rank[y]) ++rank[x];
par[y] = x;
diff_weight[y] = w;
return true;
}
Abel diff(int x, int y) {
return weight(y) - weight(x);
}
};
*/
/*
//ダイクストラ
typedef struct edge{
int to;
int cost;
} edge;
vector<edge> graph[2010];
long long int d[2010];
void dijkstra(int s){
priority_queue<P, vector<P>, greater<P> > que;
for(int i = 0; i < 2010; i++){
d[i] = INF;
}
d[s] = 0;
que.push(P(s, 0));
while (!que.empty()) {
P p = que.top();
que.pop();
int v = p.first;
if (d[v] < p.second) continue;
for (int i=0; i<graph[v].size(); ++i) {
edge e = graph[v][i];
if (d[e.to] > d[v] + e.cost) {
d[e.to] = d[v] + e.cost;
que.push(P(e.to, d[e.to]));
}
}
}
}
*/
/*
//素因数分解
map<long long, long long> prime_factor(long long n) {
map<long long, long long> ret;
for(long long i = 2; i * i <= n; i++) {
while(n % i == 0) {
ret[i]++;
n /= i;
}
}
if(n != 1) ret[n] = 1;
return ret;
}
*/
int main() {
long long n, k;
cin >> n >> k;
vector<long long> s;
s.push_back(0);
long long i;
for (i = 0; i < n; i++) {
long long a;
cin >> a;
s.push_back(s[s.size() - 1] + a);
}
for (i = 0; i < n + 1; i++) {
s[i] -= i;
s[i] %= k;
}
map<long long, long long> m;
for (i = 0; i < k; i++)
m[s[i]]++;
long long cnt = 0;
for (i = 0; i <= n; i++) {
cnt += m[s[i]] - 1;
m[s[i]]--;
if (i + k <= n) {
m[s[i + k]]++;
}
}
cout << cnt << endl;
} | #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 namespace std;
using P = pair<long, long>;
const int MAX = 1000000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルの前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
// そのまま計算すると負の値になるのでMODを足す
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
// 二分累乗法
long long modpow(long long a, long long n, long long mod) {
long long res = 1;
while (n > 0) {
if (n & 1)
res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
/*
//UnionFind木
struct UnionFind{
vector<long long int> par; //par[i] : iの親の番号
vector<long long int> rnk; //root[i] : iの木のサイズ
//コンストラクタ
UnionFind(long long int n): par(n), rnk(n){
//木の初期化
for(long long int i = 0; i < n; i++){
par[i] = i;
rnk[i] = 1;
}
}
//データxが属する木の根を再帰で取得
long long int root(long long int x){
if(par[x] == x){
return x;
}else{
return par[x] = root(par[x]);
}
}
//xとyが同じ木に属しているかを判定
bool same(long long int x, long long int y){
return root(x) == root(y);
}
//xとyの木を併合
void unite(long long int x, long long int y){
long long int rx = root(x); //xの根
long long int ry = root(y); //yの根
if(rx == ry) return; //根が同じならそのまま
//併合するときにサイズを足し合わせる
if(rnk[rx] < rnk[ry]){
par[rx] = ry;
rnk[ry] += rnk[rx];
}else{
par[ry] = rx;
rnk[rx] += rnk[ry];
}
}
//属している木のサイズを取得
long long int size(long long int x){
return rnk[root(x)];
}
};
*/
/*
//重み付きUnionFind
template<class Abel> struct UnionFind {
vector<int> par;
vector<int> rank;
vector<Abel> diff_weight;
UnionFind(int n = 1, Abel SUM_UNITY = 0) {
init(n, SUM_UNITY);
}
void init(int n = 1, Abel SUM_UNITY = 0) {
par.resize(n); rank.resize(n); diff_weight.resize(n);
for (int i = 0; i < n; ++i) par[i] = i, rank[i] = 0, diff_weight[i] =
SUM_UNITY;
}
int root(int x) {
if (par[x] == x) {
return x;
}
else {
int r = root(par[x]);
diff_weight[x] += diff_weight[par[x]];
return par[x] = r;
}
}
Abel weight(int x) {
root(x);
return diff_weight[x];
}
bool issame(int x, int y) {
return root(x) == root(y);
}
bool merge(int x, int y, Abel w) {
w += weight(x); w -= weight(y);
x = root(x); y = root(y);
if (x == y) return false;
if (rank[x] < rank[y]) swap(x, y), w = -w;
if (rank[x] == rank[y]) ++rank[x];
par[y] = x;
diff_weight[y] = w;
return true;
}
Abel diff(int x, int y) {
return weight(y) - weight(x);
}
};
*/
/*
//ダイクストラ
typedef struct edge{
int to;
int cost;
} edge;
vector<edge> graph[2010];
long long int d[2010];
void dijkstra(int s){
priority_queue<P, vector<P>, greater<P> > que;
for(int i = 0; i < 2010; i++){
d[i] = INF;
}
d[s] = 0;
que.push(P(s, 0));
while (!que.empty()) {
P p = que.top();
que.pop();
int v = p.first;
if (d[v] < p.second) continue;
for (int i=0; i<graph[v].size(); ++i) {
edge e = graph[v][i];
if (d[e.to] > d[v] + e.cost) {
d[e.to] = d[v] + e.cost;
que.push(P(e.to, d[e.to]));
}
}
}
}
*/
/*
//素因数分解
map<long long, long long> prime_factor(long long n) {
map<long long, long long> ret;
for(long long i = 2; i * i <= n; i++) {
while(n % i == 0) {
ret[i]++;
n /= i;
}
}
if(n != 1) ret[n] = 1;
return ret;
}
*/
int main() {
long long n, k;
cin >> n >> k;
vector<long long> s;
s.push_back(0);
long long i;
for (i = 0; i < n; i++) {
long long a;
cin >> a;
s.push_back(s[s.size() - 1] + a);
}
for (i = 0; i < n + 1; i++) {
s[i] -= i;
s[i] %= k;
}
map<long long, long long> m;
for (i = 0; i < k; i++) {
if (i < n + 1)
m[s[i]]++;
}
long long cnt = 0;
for (i = 0; i <= n; i++) {
cnt += m[s[i]] - 1;
m[s[i]]--;
if (i + k <= n) {
m[s[i + k]]++;
}
}
cout << cnt << endl;
} | 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 - 1] + x - 1) % k;
int cur = s[i];
v[cur].push_back(i);
while (v[cur][it[cur]] < i - (k - 1))
it[cur]++;
ans += (int)v[cur].size() - it[cur] - 1;
}
cout << ans << endl;
return 0;
} | #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[i] = (s[i - 1] + x - 1) % k;
int cur = s[i];
v[cur].push_back(i);
while (v[cur][it[cur]] < i - (k - 1))
it[cur]++;
ans += (int)v[cur].size() - it[cur] - 1;
}
cout << ans << endl;
return 0;
} | 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__ << ": "; \
dbgprint(#__VA_ARGS__, __VA_ARGS__); \
} while (0);
using namespace std;
namespace std {
template <class S, class T> struct hash<pair<S, T>> {
size_t operator()(const pair<S, T> &p) const {
return ((size_t)1e9 + 7) * hash<S>()(p.first) + hash<T>()(p.second);
}
};
template <class T> struct hash<vector<T>> {
size_t operator()(const vector<T> &v) const {
size_t h = 0;
for (auto i : v)
h = h * ((size_t)1e9 + 7) + hash<T>()(i) + 1;
return h;
}
};
} // namespace std
template <class T> ostream &operator<<(ostream &os, const vector<T> &v) {
os << "[ ";
rep(i, v.size()) os << v[i] << (i == v.size() - 1 ? " ]" : ", ");
return os;
}
template <class T> ostream &operator<<(ostream &os, const set<T> &v) {
os << "{ ";
for (const auto &i : v)
os << i << ", ";
return os << "}";
}
template <class T, class U>
ostream &operator<<(ostream &os, const map<T, U> &v) {
os << "{";
for (const auto &i : v)
os << " " << i.first << ": " << i.second << ",";
return os << "}";
}
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
return os << "(" << p.first << ", " << p.second << ")";
}
void dbgprint(const string &fmt) { cerr << endl; }
template <class H, class... T>
void dbgprint(const string &fmt, const H &h, const T &...r) {
cerr << fmt.substr(0, fmt.find(",")) << "= " << h << " ";
dbgprint(fmt.substr(fmt.find(",") + 1), r...);
}
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pi;
const int inf = (int)1e9;
const double INF = 1e12, EPS = 1e-9;
int main() {
cin.tie(0);
cin.sync_with_stdio(0);
int n, k;
cin >> n >> k;
ll ans = 0;
vi a(n), cnt(k);
vi sum(n + 1);
cnt[0] = 1;
rep(i, n) {
cin >> a[i];
a[i] = (a[i] + k - 1) % k;
sum[i + 1] = (sum[i] + a[i]) % k;
if (i >= k - 1)
cnt[sum[i - k + 1]]--;
ans += cnt[sum[i + 1]]++;
}
cout << ans << endl;
return 0;
} | #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__ << ": "; \
dbgprint(#__VA_ARGS__, __VA_ARGS__); \
} while (0);
using namespace std;
namespace std {
template <class S, class T> struct hash<pair<S, T>> {
size_t operator()(const pair<S, T> &p) const {
return ((size_t)1e9 + 7) * hash<S>()(p.first) + hash<T>()(p.second);
}
};
template <class T> struct hash<vector<T>> {
size_t operator()(const vector<T> &v) const {
size_t h = 0;
for (auto i : v)
h = h * ((size_t)1e9 + 7) + hash<T>()(i) + 1;
return h;
}
};
} // namespace std
template <class T> ostream &operator<<(ostream &os, const vector<T> &v) {
os << "[ ";
rep(i, v.size()) os << v[i] << (i == v.size() - 1 ? " ]" : ", ");
return os;
}
template <class T> ostream &operator<<(ostream &os, const set<T> &v) {
os << "{ ";
for (const auto &i : v)
os << i << ", ";
return os << "}";
}
template <class T, class U>
ostream &operator<<(ostream &os, const map<T, U> &v) {
os << "{";
for (const auto &i : v)
os << " " << i.first << ": " << i.second << ",";
return os << "}";
}
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
return os << "(" << p.first << ", " << p.second << ")";
}
void dbgprint(const string &fmt) { cerr << endl; }
template <class H, class... T>
void dbgprint(const string &fmt, const H &h, const T &...r) {
cerr << fmt.substr(0, fmt.find(",")) << "= " << h << " ";
dbgprint(fmt.substr(fmt.find(",") + 1), r...);
}
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pi;
const int inf = (int)1e9;
const double INF = 1e12, EPS = 1e-9;
int main() {
cin.tie(0);
cin.sync_with_stdio(0);
int n, k;
cin >> n >> k;
ll ans = 0;
vi a(n);
map<ll, int> cnt;
vi sum(n + 1);
cnt[0] = 1;
rep(i, n) {
cin >> a[i];
a[i] = (a[i] + k - 1) % k;
sum[i + 1] = (sum[i] + a[i]) % k;
if (i >= k - 1)
cnt[sum[i - k + 1]]--;
ans += cnt[sum[i + 1]]++;
}
cout << ans << endl;
return 0;
} | 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;
} else {
arr[i]--;
}
}
for (int i = 1; i <= n; ++i) {
pref[i] = pref[i - 1] + arr[i - 1];
if (pref[i] >= k) {
pref[i] -= k;
}
}
long long res = 0;
for (int i = 0; i < n; ++i) {
if (i >= k - 1) {
lol[pref[i - k + 1]]--;
}
lol[pref[i]]++;
res += lol[pref[i + 1]];
}
cout << res << "\n";
return 0;
}
| #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;
} else {
arr[i]--;
}
}
for (int i = 1; i <= n; ++i) {
pref[i] = pref[i - 1] + arr[i - 1];
if (pref[i] >= k) {
pref[i] -= k;
}
}
long long res = 0;
for (int i = 0; i < n; ++i) {
if (i >= k - 1) {
lol[pref[i - k + 1]]--;
}
lol[pref[i]]++;
res += lol[pref[i + 1]];
}
cout << res << "\n";
return 0;
}
| 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, s = V.size();
while (true) {
while (V[r + 1] - V[l] < k)
r++;
r = min(r, s - 1);
res += r - l;
// cout<<V[l]<<':'<<V[r]<<endl;
l++;
if (l == s)
break;
}
return res;
}
signed main(void) {
int n, k;
cin >> n >> k;
int V[200010];
V[0] = 0;
rep(i, n) {
int a;
cin >> a;
V[i + 1] = V[i] + a;
}
rep(i, n + 1) V[i] = (V[i] - i + k * 100000) % k;
// rep(i,n+1)cout<<V[i]<<' ';
// cout<<endl;
vector<P> G(n + 1);
rep(i, n + 1) G[i] = make_pair(V[i], i);
sort(all(G));
int now = 0, ans = 0;
while (now < n + 1) {
vector<int> V0;
while (now < n + 1) {
V0.push_back(G[now].S);
if (G[now].F != G[min(n, now + 1)].F)
break;
now++;
}
// for(auto x:V0)cout<<x<<' ';
// cout<<endl;
now++;
ans += solve(V0, k);
}
cout << ans << endl;
}
| #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, s = V.size();
while (true) {
while (r < s - 1 && V[r + 1] - V[l] < k)
r++;
r = min(r, s - 1);
res += r - l;
// cout<<V[l]<<':'<<V[r]<<endl;
l++;
if (l == s)
break;
}
return res;
}
signed main(void) {
int n, k;
cin >> n >> k;
int V[200010];
V[0] = 0;
rep(i, n) {
int a;
cin >> a;
V[i + 1] = V[i] + a;
}
rep(i, n + 1) V[i] = (V[i] - i + k * 100000) % k;
// rep(i,n+1)cout<<V[i]<<' ';
// cout<<endl;
vector<P> G(n + 1);
rep(i, n + 1) G[i] = make_pair(V[i], i);
sort(all(G));
int now = 0, ans = 0;
while (now < n + 1) {
vector<int> V0;
while (now < n + 1) {
V0.push_back(G[now].S);
if (G[now].F != G[min(n, now + 1)].F)
break;
now++;
}
// for(auto x:V0)cout<<x<<' ';
// cout<<endl;
now++;
ans += solve(V0, k);
}
cout << ans << endl;
}
| 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_t;
using SQWORD = int64_t;
using DWORD = uint32_t;
using SDWORD = int32_t;
using WORD = uint16_t;
using SWORD = int16_t;
using BYTE = uint8_t;
using SBYTE = int8_t;
using DOUBLE = double;
using FLOAT = float;
#define MIN_SDWORD (-2147483648)
#define MAX_SDWORD (2147483647)
#define MIN_SBYTE (-128)
#define MAX_SBYTE (127)
#define MIN_SQWORD (0x8000000000000000)
#define MAX_SQWORD (0x7FFFFFFFFFFFFFFF)
#define MAX_QWORD (0xFFFFFFFFFFFFFFFF)
#define MAX_DWORD (0xFFFFFFFF)
#define MAX_WORD (0xFFFF)
#define MAX_BYTE (0xFF)
#define MAX_DOUBLE (1.0e+308)
#define DOUBLE_EPS (1.0e-12)
#define MIN_DOUBLE_N (-1.0e+308)
#define ArrayLength(a) (sizeof(a) / sizeof(a[0]))
static inline DOUBLE MAX(DOUBLE a, DOUBLE b) { return a > b ? a : b; }
static inline QWORD MAX(QWORD a, QWORD b) { return a > b ? a : b; }
static inline DWORD MAX(DWORD a, DWORD b) { return a > b ? a : b; }
static inline SDWORD MAX(SDWORD a, SDWORD b) { return a > b ? a : b; }
static inline DOUBLE MIN(DOUBLE a, DOUBLE b) { return a < b ? a : b; }
static inline QWORD MIN(QWORD a, QWORD b) { return a < b ? a : b; }
static inline DWORD MIN(DWORD a, DWORD b) { return a < b ? a : b; }
static inline SDWORD MIN(SDWORD a, SDWORD b) { return a < b ? a : b; }
#define BYTE_BITS (8)
#define WORD_BITS (16)
#define DWORD_BITS (32)
#define QWORD_BITS (64)
static inline void inputStringSpSeparated(char *pcStr) {
char *pcCur = pcStr;
for (;;) {
char c = getchar();
if (('\n' == c) || (EOF == c) || (' ' == c)) {
break;
}
*pcCur = c;
pcCur++;
}
*pcCur = '\0';
}
static inline void inputString(char *pcStr) {
char *pcCur = pcStr;
for (;;) {
char c = getchar();
if (('\n' == c) || (EOF == c)) {
break;
}
*pcCur = c;
pcCur++;
}
*pcCur = '\0';
}
static inline SQWORD inputSQWORD(void) {
SQWORD sqNumber = 0;
SQWORD sqMultiplier = 1;
bool bRead = false;
for (;;) {
char c = getchar();
if (!bRead) {
if ('-' == c) {
sqMultiplier = -1;
}
}
if (('0' <= c) && (c <= '9')) {
sqNumber *= 10LL;
sqNumber += (SQWORD)(c - '0');
bRead = true;
} else {
if (bRead) {
return sqNumber * sqMultiplier;
}
}
}
}
static inline SDWORD inputSDWORD(void) {
SDWORD lNumber = 0;
SDWORD lMultiplier = 1;
bool bRead = false;
for (;;) {
char c = getchar();
if (!bRead) {
if ('-' == c) {
lMultiplier = -1;
}
}
if (('0' <= c) && (c <= '9')) {
lNumber *= 10;
lNumber += (c - '0');
bRead = true;
} else {
if (bRead) {
return lNumber * lMultiplier;
}
}
}
}
static inline DOUBLE inputFP(void) {
DOUBLE dInt = 0.0;
DOUBLE dFrac = 0.0;
DOUBLE dMultiplier = 1.0;
DWORD dwFpCnt = 0;
DOUBLE *pdCur = &dInt;
bool bRead = false;
for (;;) {
char c = getchar();
if (!bRead) {
if ('-' == c) {
dMultiplier = -1;
}
}
if ('.' == c) {
pdCur = &dFrac;
} else if (('0' <= c) && (c <= '9')) {
(*pdCur) *= 10;
(*pdCur) += (DOUBLE)(c - '0');
bRead = true;
if (pdCur == &dFrac) {
dwFpCnt++;
}
} else {
if (bRead) {
return dMultiplier *
(dInt + dFrac / (pow((DOUBLE)10.0, (DOUBLE)dwFpCnt)));
}
}
}
}
/*----------------------------------------------*/
/**
* mod による操作ライブラリ
*/
#define ANS_MOD (1000000007)
class MODINT {
static SQWORD MOD;
SQWORD m_x;
public:
MODINT(SQWORD val) { m_x = (val % MOD + MOD) % MOD; };
MODINT() { m_x = 0; }
static void Init(SQWORD sqMod) { MOD = sqMod; }
MODINT &operator+=(const MODINT a) {
m_x = (m_x + a.m_x) % MOD;
return *this;
};
MODINT &operator-=(const MODINT a) {
m_x = (m_x - a.m_x + MOD) % MOD;
return *this;
};
MODINT &operator*=(const MODINT a) {
m_x = (m_x * a.m_x) % MOD;
return *this;
};
MODINT pow(SQWORD t) const {
if (!t)
return 1;
MODINT a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
MODINT operator+(const MODINT a) const {
MODINT res(*this);
return (res += a);
}
MODINT operator-(const MODINT a) const {
MODINT res(*this);
return (res -= a);
}
MODINT operator*(const MODINT a) const {
MODINT res(*this);
return (res *= a);
}
MODINT operator/(const MODINT a) const {
MODINT res(*this);
return (res /= a);
}
/* 逆元 */
MODINT inv() const { return pow(MOD - 2); }
/* 除算 */
MODINT &operator/=(const MODINT a) { return (*this) *= a.inv(); }
/* 整数版 */
MODINT &operator+=(const SQWORD a) {
*this += MODINT(a);
return *this;
};
MODINT &operator-=(const SQWORD a) {
*this -= MODINT(a);
return *this;
};
MODINT &operator*=(const SQWORD a) {
*this *= MODINT(a);
return *this;
};
MODINT &operator/=(const SQWORD a) {
*this /= MODINT(a);
return *this;
};
SQWORD getVal() { return m_x; };
};
SQWORD MODINT::MOD = ANS_MOD;
/*----------------------------------------------*/
/*----------------------------------------------*/
int main(void) {
SQWORD sqN = inputSQWORD();
SQWORD sqK = inputSQWORD();
MODINT::Init(sqK);
vector<MODINT> vsqRemSum;
MODINT sqSum = 0;
map<SQWORD, SQWORD> mapRem;
for (SQWORD sqIdx = 1; sqIdx <= sqN; sqIdx++) {
SQWORD sqA = inputSQWORD();
sqSum += (MODINT(sqA) - 1);
// printf("----%lld\n", sqSum);
vsqRemSum.emplace_back(sqSum);
}
for (SQWORD sqIdx = 0; sqIdx < sqK - 1; sqIdx++) {
mapRem[vsqRemSum[sqIdx].getVal()]++;
}
MODINT sqPrevFront = 0;
MODINT sqSearch = 0;
SQWORD sqAns = 0;
for (SQWORD sqIdx = 0; sqIdx < sqN; sqIdx++) {
MODINT sqFront = vsqRemSum[sqIdx] - sqPrevFront;
if (0 < mapRem.count(sqSearch.getVal())) {
sqAns += mapRem[sqSearch.getVal()];
}
// printf("f : %lld search %lld, cnt%lld rem %lld\n", sqFront,
// sqSearch, mapRem[sqSearch.getVal()], vsqRemSum[sqIdx]);
// printf("%lld %lld %lld %lld\n", mapRem[0], mapRem[1], mapRem[2],
// mapRem[3]);
sqSearch += sqFront;
sqPrevFront = vsqRemSum[sqIdx];
mapRem[vsqRemSum[sqIdx].getVal()]--;
if (sqIdx + sqK - 1 < sqN) {
mapRem[vsqRemSum[sqIdx + sqK - 1].getVal()]++;
}
}
printf("%lld\n", sqAns);
return 0;
}
| #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_t;
using SQWORD = int64_t;
using DWORD = uint32_t;
using SDWORD = int32_t;
using WORD = uint16_t;
using SWORD = int16_t;
using BYTE = uint8_t;
using SBYTE = int8_t;
using DOUBLE = double;
using FLOAT = float;
#define MIN_SDWORD (-2147483648)
#define MAX_SDWORD (2147483647)
#define MIN_SBYTE (-128)
#define MAX_SBYTE (127)
#define MIN_SQWORD (0x8000000000000000)
#define MAX_SQWORD (0x7FFFFFFFFFFFFFFF)
#define MAX_QWORD (0xFFFFFFFFFFFFFFFF)
#define MAX_DWORD (0xFFFFFFFF)
#define MAX_WORD (0xFFFF)
#define MAX_BYTE (0xFF)
#define MAX_DOUBLE (1.0e+308)
#define DOUBLE_EPS (1.0e-12)
#define MIN_DOUBLE_N (-1.0e+308)
#define ArrayLength(a) (sizeof(a) / sizeof(a[0]))
static inline DOUBLE MAX(DOUBLE a, DOUBLE b) { return a > b ? a : b; }
static inline QWORD MAX(QWORD a, QWORD b) { return a > b ? a : b; }
static inline DWORD MAX(DWORD a, DWORD b) { return a > b ? a : b; }
static inline SDWORD MAX(SDWORD a, SDWORD b) { return a > b ? a : b; }
static inline DOUBLE MIN(DOUBLE a, DOUBLE b) { return a < b ? a : b; }
static inline QWORD MIN(QWORD a, QWORD b) { return a < b ? a : b; }
static inline DWORD MIN(DWORD a, DWORD b) { return a < b ? a : b; }
static inline SDWORD MIN(SDWORD a, SDWORD b) { return a < b ? a : b; }
#define BYTE_BITS (8)
#define WORD_BITS (16)
#define DWORD_BITS (32)
#define QWORD_BITS (64)
static inline void inputStringSpSeparated(char *pcStr) {
char *pcCur = pcStr;
for (;;) {
char c = getchar();
if (('\n' == c) || (EOF == c) || (' ' == c)) {
break;
}
*pcCur = c;
pcCur++;
}
*pcCur = '\0';
}
static inline void inputString(char *pcStr) {
char *pcCur = pcStr;
for (;;) {
char c = getchar();
if (('\n' == c) || (EOF == c)) {
break;
}
*pcCur = c;
pcCur++;
}
*pcCur = '\0';
}
static inline SQWORD inputSQWORD(void) {
SQWORD sqNumber = 0;
SQWORD sqMultiplier = 1;
bool bRead = false;
for (;;) {
char c = getchar();
if (!bRead) {
if ('-' == c) {
sqMultiplier = -1;
}
}
if (('0' <= c) && (c <= '9')) {
sqNumber *= 10LL;
sqNumber += (SQWORD)(c - '0');
bRead = true;
} else {
if (bRead) {
return sqNumber * sqMultiplier;
}
}
}
}
static inline SDWORD inputSDWORD(void) {
SDWORD lNumber = 0;
SDWORD lMultiplier = 1;
bool bRead = false;
for (;;) {
char c = getchar();
if (!bRead) {
if ('-' == c) {
lMultiplier = -1;
}
}
if (('0' <= c) && (c <= '9')) {
lNumber *= 10;
lNumber += (c - '0');
bRead = true;
} else {
if (bRead) {
return lNumber * lMultiplier;
}
}
}
}
static inline DOUBLE inputFP(void) {
DOUBLE dInt = 0.0;
DOUBLE dFrac = 0.0;
DOUBLE dMultiplier = 1.0;
DWORD dwFpCnt = 0;
DOUBLE *pdCur = &dInt;
bool bRead = false;
for (;;) {
char c = getchar();
if (!bRead) {
if ('-' == c) {
dMultiplier = -1;
}
}
if ('.' == c) {
pdCur = &dFrac;
} else if (('0' <= c) && (c <= '9')) {
(*pdCur) *= 10;
(*pdCur) += (DOUBLE)(c - '0');
bRead = true;
if (pdCur == &dFrac) {
dwFpCnt++;
}
} else {
if (bRead) {
return dMultiplier *
(dInt + dFrac / (pow((DOUBLE)10.0, (DOUBLE)dwFpCnt)));
}
}
}
}
/*----------------------------------------------*/
/**
* mod による操作ライブラリ
*/
#define ANS_MOD (1000000007)
class MODINT {
static SQWORD MOD;
SQWORD m_x;
public:
MODINT(SQWORD val) { m_x = (val % MOD + MOD) % MOD; };
MODINT() { m_x = 0; }
static void Init(SQWORD sqMod) { MOD = sqMod; }
MODINT &operator+=(const MODINT a) {
m_x = (m_x + a.m_x) % MOD;
return *this;
};
MODINT &operator-=(const MODINT a) {
m_x = (m_x - a.m_x + MOD) % MOD;
return *this;
};
MODINT &operator*=(const MODINT a) {
m_x = (m_x * a.m_x) % MOD;
return *this;
};
MODINT pow(SQWORD t) const {
if (!t)
return 1;
MODINT a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
MODINT operator+(const MODINT a) const {
MODINT res(*this);
return (res += a);
}
MODINT operator-(const MODINT a) const {
MODINT res(*this);
return (res -= a);
}
MODINT operator*(const MODINT a) const {
MODINT res(*this);
return (res *= a);
}
MODINT operator/(const MODINT a) const {
MODINT res(*this);
return (res /= a);
}
/* 逆元 */
MODINT inv() const { return pow(MOD - 2); }
/* 除算 */
MODINT &operator/=(const MODINT a) { return (*this) *= a.inv(); }
/* 整数版 */
MODINT &operator+=(const SQWORD a) {
*this += MODINT(a);
return *this;
};
MODINT &operator-=(const SQWORD a) {
*this -= MODINT(a);
return *this;
};
MODINT &operator*=(const SQWORD a) {
*this *= MODINT(a);
return *this;
};
MODINT &operator/=(const SQWORD a) {
*this /= MODINT(a);
return *this;
};
SQWORD getVal() { return m_x; };
};
SQWORD MODINT::MOD = ANS_MOD;
/*----------------------------------------------*/
/*----------------------------------------------*/
int main(void) {
SQWORD sqN = inputSQWORD();
SQWORD sqK = inputSQWORD();
MODINT::Init(sqK);
vector<MODINT> vsqRemSum;
MODINT sqSum = 0;
map<SQWORD, SQWORD> mapRem;
for (SQWORD sqIdx = 1; sqIdx <= sqN; sqIdx++) {
SQWORD sqA = inputSQWORD();
sqSum += (MODINT(sqA) - 1);
// printf("----%lld\n", sqSum);
vsqRemSum.emplace_back(sqSum);
}
for (SQWORD sqIdx = 0; sqIdx < min(sqN, sqK - 1); sqIdx++) {
mapRem[vsqRemSum[sqIdx].getVal()]++;
}
MODINT sqPrevFront = 0;
MODINT sqSearch = 0;
SQWORD sqAns = 0;
for (SQWORD sqIdx = 0; sqIdx < sqN; sqIdx++) {
MODINT sqFront = vsqRemSum[sqIdx] - sqPrevFront;
if (0 < mapRem.count(sqSearch.getVal())) {
sqAns += mapRem[sqSearch.getVal()];
}
// printf("f : %lld search %lld, cnt%lld rem %lld\n", sqFront,
// sqSearch, mapRem[sqSearch.getVal()], vsqRemSum[sqIdx]);
// printf("%lld %lld %lld %lld\n", mapRem[0], mapRem[1], mapRem[2],
// mapRem[3]);
sqSearch += sqFront;
sqPrevFront = vsqRemSum[sqIdx];
mapRem[vsqRemSum[sqIdx].getVal()]--;
if (sqIdx + sqK - 1 < sqN) {
mapRem[vsqRemSum[sqIdx + sqK - 1].getVal()]++;
}
}
printf("%lld\n", sqAns);
return 0;
} | 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;
rep(i, n + 1) mp[suma[i]] = 0;
rep(i, k) mp[suma[i]]++;
long long ans = 0;
rep(i, n) {
mp[suma[i]]--;
ans += mp[suma[i]];
if ((k + i) <= n)
mp[suma[i + k]]++;
}
cout << ans << endl;
} | #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;
rep(i, min(n + 1, k)) mp[suma[i]]++;
long long ans = 0;
rep(i, n) {
mp[suma[i]]--;
ans += mp[suma[i]];
if ((k + i) <= n)
mp[suma[i + k]]++;
}
cout << ans << endl;
} | 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;
pair<ll, ll> p;
for (i = 0; i < n; ++i)
scanf("%lld", &a[i]), sum[i + 1] = (sum[i] + --a[i]) % k;
if (k <= n) {
for (i = 1; i < k; ++i) {
p = make_pair(sum[i], 1);
if ((it = s.lower_bound(p)) != s.end() && (*it).first == sum[i])
p.second = (*it).second + 1, s.erase(it);
s.insert(p);
}
for (i = 0; i < n; ++i) {
p = make_pair(sum[i], 1);
if ((it = s.lower_bound(p)) != s.end() && (*it).first == sum[i])
ans += (*it).second;
p = make_pair(sum[i + 1], 1);
it = s.lower_bound(p);
p.second = (*it).second - 1;
s.erase(it);
if (p.second)
s.insert(p);
if (i + k <= n) {
p = make_pair(sum[i + k], 1);
if ((it = s.lower_bound(p)) != s.end() && (*it).first == sum[i + k])
p.second = (*it).second + 1, s.erase(it);
s.insert(p);
}
}
} else {
for (i = 1; i <= n; ++i) {
p = make_pair(sum[i], 1);
if ((it = s.lower_bound(p)) != s.end() && (*it).first == sum[i])
p.second = (*it).second + 1, s.erase(it);
s.insert(p);
}
for (i = 0; i < n; ++i) {
p = make_pair(sum[i], 1);
if ((it = s.lower_bound(p)) != s.end() && (*it).first == sum[i])
ans += (*it).second;
p = make_pair(sum[i + 1], 1);
it = s.lower_bound(p);
p.second = (*it).second - 1;
s.erase(it);
}
}
printf("%lld", ans);
return 0;
} | #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;
pair<ll, ll> p;
for (i = 0; i < n; ++i)
scanf("%lld", &a[i]), sum[i + 1] = (sum[i] + --a[i]) % k;
if (k <= n) {
for (i = 1; i < k; ++i) {
p = make_pair(sum[i], 1);
if ((it = s.lower_bound(p)) != s.end() && (*it).first == sum[i])
p.second = (*it).second + 1, s.erase(it);
s.insert(p);
}
for (i = 0; i < n; ++i) {
p = make_pair(sum[i], 1);
if ((it = s.lower_bound(p)) != s.end() && (*it).first == sum[i])
ans += (*it).second;
p = make_pair(sum[i + 1], 1);
it = s.lower_bound(p);
p.second = (*it).second - 1;
s.erase(it);
if (p.second)
s.insert(p);
if (i + k <= n) {
p = make_pair(sum[i + k], 1);
if ((it = s.lower_bound(p)) != s.end() && (*it).first == sum[i + k])
p.second = (*it).second + 1, s.erase(it);
s.insert(p);
}
}
} else {
for (i = 1; i <= n; ++i) {
p = make_pair(sum[i], 1);
if ((it = s.lower_bound(p)) != s.end() && (*it).first == sum[i])
p.second = (*it).second + 1, s.erase(it);
s.insert(p);
}
for (i = 0; i < n; ++i) {
p = make_pair(sum[i], 1);
if ((it = s.lower_bound(p)) != s.end() && (*it).first == sum[i])
ans += (*it).second;
p = make_pair(sum[i + 1], 1);
it = s.lower_bound(p);
p.second = (*it).second - 1;
s.erase(it);
if (p.second)
s.insert(p);
}
}
printf("%lld", ans);
return 0;
} | 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;
const ll mod = 1e9 + 7;
int main() {
int i, j;
int n, k;
cin >> n >> k;
ll a[n + 1];
for (i = 1; i <= n; i++) {
cin >> a[i];
a[i]--;
}
a[0] = 0;
VI m(k + 1, 0);
ll sum = 0;
VI s(n + 1, 0);
ll ans = 0;
for (i = 0; i <= n; i++) {
sum += a[i];
sum %= k;
ans += m[sum];
s[i] = sum;
m[sum]++;
if (i >= k - 1)
m[s[i - (k - 1)]]--;
}
cout << ans << endl;
} | #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;
const ll mod = 1e9 + 7;
int main() {
int i, j;
int n, k;
cin >> n >> k;
ll a[n + 1];
for (i = 1; i <= n; i++) {
cin >> a[i];
a[i]--;
}
a[0] = 0;
map<ll, ll> m;
ll sum = 0;
VI s(n + 1, 0);
ll ans = 0;
for (i = 0; i <= n; i++) {
sum += a[i];
sum %= k;
ans += m[sum];
s[i] = sum;
m[sum]++;
if (i >= k - 1)
m[s[i - (k - 1)]]--;
}
cout << ans << endl;
} | 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];
Map[Sum]++;
X[i] = Sum;
}
cout << Ans << endl;
return 0;
} | #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];
Map[Sum]++;
X[i] = Sum;
}
cout << Ans << endl;
return 0;
} | 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(i, n) {
int a;
cin >> a;
a--;
S[i + 1] = (S[i] + a) % k;
}
map<int, int> M;
ll ans = 0;
rep(i, n + 1) {
if (M.find(S[i - k]) == M.end())
M[S[i]] = 0;
if (i >= k)
M[S[i - k]]--;
ans += M[S[i]];
M[S[i]]++;
}
cout << ans << endl;
}
int main() {
std::cin.tie(nullptr);
std::ios_base::sync_with_stdio(false);
std::cout << std::fixed << std::setprecision(15);
Main();
return 0;
}
| #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(i, n) {
int a;
cin >> a;
a--;
S[i + 1] = (S[i] + a) % k;
}
map<int, int> M;
ll ans = 0;
rep(i, n + 1) {
if (M.find(S[i]) == M.end())
M[S[i]] = 0;
if (i >= k)
M[S[i - k]]--;
ans += M[S[i]];
M[S[i]]++;
}
cout << ans << endl;
}
int main() {
std::cin.tie(nullptr);
std::ios_base::sync_with_stdio(false);
std::cout << std::fixed << std::setprecision(15);
Main();
return 0;
}
| 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>
using namespace std;
#define REP(i, n) for (int64_t i = 0; i < (int64_t)n; i++)
#define REP_FOR(i, a, b) for (int64_t i = (int64_t)a; i < (int64_t)b; i++)
#define REP_REV(i, a, b) for (int64_t i = (int64_t)a; i > (int64_t)b; i--)
#define FORALL(v) (v).begin(), (v).end()
#define mp(a, b) make_pair(a, b)
#define eb(x) emplace_back(x)
#define F first
#define S second
typedef long long ll;
typedef long double ld;
typedef pair<int64_t, int64_t> pii;
typedef pair<ll, ll> pll;
typedef pair<ld, ld> pdd;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<int64_t> vii;
typedef vector<vii> vvii;
const ll mod = 1e9 + 7;
const int64_t infi = 1147483600;
const ll infl = 4e18 + 5;
const char EOL = '\n';
// cout << fixed << setprecision(17) << res << endl;
const ll MOD = 998244353;
int main() {
ll n, k;
cin >> n >> k;
vector<ll> a(n + 1, 0);
for (ll i = 0; i < n; ++i) {
cin >> a[i + 1];
--a[i + 1];
}
for (ll i = 0; i < n; ++i) {
a[i + 1] += a[i];
a[i + 1] %= k;
}
ll res = 0;
vector<ll> counts(k, 0);
for (ll i = 0; i < n + 1; ++i) {
if (i >= k)
--counts[a[i - k]];
res += counts[a[i]];
++counts[a[i]];
}
cout << res << endl;
}
| #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>
using namespace std;
#define REP(i, n) for (int64_t i = 0; i < (int64_t)n; i++)
#define REP_FOR(i, a, b) for (int64_t i = (int64_t)a; i < (int64_t)b; i++)
#define REP_REV(i, a, b) for (int64_t i = (int64_t)a; i > (int64_t)b; i--)
#define FORALL(v) (v).begin(), (v).end()
#define mp(a, b) make_pair(a, b)
#define eb(x) emplace_back(x)
#define F first
#define S second
typedef long long ll;
typedef long double ld;
typedef pair<int64_t, int64_t> pii;
typedef pair<ll, ll> pll;
typedef pair<ld, ld> pdd;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<int64_t> vii;
typedef vector<vii> vvii;
const ll mod = 1e9 + 7;
const int64_t infi = 1147483600;
const ll infl = 4e18 + 5;
const char EOL = '\n';
// cout << fixed << setprecision(17) << res << endl;
const ll MOD = 998244353;
int main() {
ll n, k;
cin >> n >> k;
vector<ll> a(n + 1, 0);
for (ll i = 0; i < n; ++i) {
cin >> a[i + 1];
--a[i + 1];
}
for (ll i = 0; i < n; ++i) {
a[i + 1] += a[i];
a[i + 1] %= k;
}
ll res = 0;
map<ll, ll> counts;
for (ll i = 0; i < n + 1; ++i) {
if (i >= k)
--counts[a[i - k]];
res += counts[a[i]];
++counts[a[i]];
}
cout << res << endl;
}
| 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); \
cin.tie(0); \
cout.tie(0)
#ifndef LOCAL
#define endl '\n'
#endif
const int N = 1e5 + 5;
const int mod = 1e9 + 7;
const int inf = 1e9 + 9;
map<int, int> m;
int a[N];
signed main() {
IOS;
#ifdef LOCAL
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int n, k, ans = 0;
;
cin >> n >> k;
for (int i = 1; i <= n; i++)
cin >> a[i], a[i] += a[i - 1];
int l = 0;
for (int i = 1; i <= n; i++) {
m[(a[i - 1] - (i - 1) + k) % k]++;
while (l <= i - k) {
m[(a[l] - l + k) % k]--;
l++;
}
ans += m[(a[i] - i + k) % k];
}
cout << ans;
return 0;
} | #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); \
cin.tie(0); \
cout.tie(0)
#ifndef LOCAL
#define endl '\n'
#endif
const int N = 2e5 + 5;
const int mod = 1e9 + 7;
const int inf = 1e9 + 9;
map<int, int> m;
int a[N];
signed main() {
IOS;
#ifdef LOCAL
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int n, k, ans = 0;
;
cin >> n >> k;
for (int i = 1; i <= n; i++)
cin >> a[i], a[i] += a[i - 1];
int l = 0;
for (int i = 1; i <= n; i++) {
m[(a[i - 1] - (i - 1) + k) % k]++;
while (l <= i - k) {
m[(a[l] - l + k) % k]--;
l++;
}
ans += m[(a[i] - i + k) % k];
}
cout << ans;
return 0;
} | 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;
vector<int> b(n);
rep(i, n) { b[i] = ((acc[i] - i) % k + k) % k; }
long long ans = 0;
rep(i, k) {
ans += cnt[b[i]];
cnt[b[i]]++;
}
for (int i = k; i < n; i++) {
cnt[b[i - k]]--;
ans += cnt[b[i]];
cnt[b[i]]++;
}
printf("%lld\n", ans);
return 0;
}
| #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;
vector<int> b(n);
rep(i, n) { b[i] = ((acc[i] - i) % k + k) % k; }
long long ans = 0;
rep(i, min(n, k)) {
ans += cnt[b[i]];
cnt[b[i]]++;
}
for (int i = k; i < n; i++) {
cnt[b[i - k]]--;
ans += cnt[b[i]];
cnt[b[i]]++;
}
printf("%lld\n", ans);
return 0;
}
| 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 i = 0; i < K; i++) {
mp[A[i]]++;
}
int64_t ans = 0;
for (int i = 0; i < N; i++) {
mp[A[i]]--;
ans += mp[A[i]];
if (i + K <= N)
mp[A[i + K]]++;
}
cout << ans << endl;
return 0;
}
| #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 (int i = 0; i < min(N + 1, K); i++) {
mp[A[i]]++;
}
int64_t ans = 0;
for (int i = 0; i < N; i++) {
mp[A[i]]--;
ans += mp[A[i]];
if (i + K <= N)
mp[A[i + K]]++;
}
cout << ans << endl;
return 0;
}
| 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 = vector<vi>;
using vvb = vector<vb>;
constexpr int MOD = 1000000007;
inline int mod(ll n, int k) {
n %= k;
if (n < 0) {
n += k;
}
return (int)n;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n, k;
cin >> n >> k;
if (k == 1) {
cout << 0 << endl;
return 0;
}
vi cnt(k, 0);
vi memory;
if (n >= k) {
memory.reserve(k - 1);
rep(i, 0, k - 1) { memory[i] = -1; }
}
ll sum = 0;
ll ans = 0;
rep(i, 0, n) {
ll a;
cin >> a;
a %= k;
sum = mod(sum + a, k);
++cnt[mod(a - sum + i, k)];
if (n >= k) {
if (memory[i % (k - 1)] != -1) {
--cnt[memory[i % (k - 1)]];
}
memory[i % (k - 1)] = mod(a - sum + i, k);
}
ans += cnt[mod(i + 1 - sum, k)];
}
cout << ans << endl;
return 0;
} | #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 = vector<vi>;
using vvb = vector<vb>;
constexpr int MOD = 1000000007;
inline int mod(ll n, int k) {
n %= k;
if (n < 0) {
n += k;
}
return (int)n;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll n, k;
cin >> n >> k;
if (k == 1) {
cout << 0 << endl;
return 0;
}
map<int, int> cnt;
vi memory;
if (n >= k) {
memory.reserve(k - 1);
rep(i, 0, k - 1) { memory[i] = -1; }
}
ll sum = 0;
ll ans = 0;
rep(i, 0, n) {
ll a;
cin >> a;
a %= k;
sum = mod(sum + a, k);
++cnt[mod(a - sum + i, k)];
if (n >= k) {
if (memory[i % (k - 1)] != -1) {
--cnt[memory[i % (k - 1)]];
}
memory[i % (k - 1)] = mod(a - sum + i, k);
}
ans += cnt[mod(i + 1 - sum, k)];
}
cout << ans << endl;
return 0;
} | 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> mp;
for (int i = 1; i < k && i <= n; i++) {
if (a[i] % k == 1)
ans++;
p[i] = p[i - 1] + a[i];
ans += mp[(p[i] - i + k) % k];
mp[(p[i - 1] - (i - 1) + k) % k]++;
q.push((p[i - 1] - (i - 1) + k) % k);
}
for (int i = k; i <= n; i++) {
if (a[i] % k == 1)
ans++;
mp[q.front()]--;
q.pop();
p[i] = p[i - 1] + a[i];
ans += mp[(p[i] - i + k) % k];
mp[(p[i - 1] - (i - 1) + k) % k]++;
q.push((p[i - 1] - (i - 1) + k) % k);
}
cout << ans << endl;
}
| #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> mp;
for (int i = 1; i < k && i <= n; i++) {
if (a[i] % k == 1)
ans++;
p[i] = p[i - 1] + a[i];
ans += mp[(p[i] - i + k) % k];
mp[(p[i - 1] - (i - 1) + k) % k]++;
q.push((p[i - 1] - (i - 1) + k) % k);
}
for (int i = k; i <= n; i++) {
if (a[i] % k == 1)
ans++;
if (q.size() > 0) {
mp[q.front()]--;
q.pop();
}
p[i] = p[i - 1] + a[i];
ans += mp[(p[i] - i + k) % k];
mp[(p[i - 1] - (i - 1) + k) % k]++;
q.push((p[i - 1] - (i - 1) + k) % k);
}
cout << ans << endl;
}
| 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>
#include <memory>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int getVal(const vector<long long> &sum, int i, int mod) {
int ans = (sum[i] - i) % mod;
ans += mod;
ans %= mod;
return ans;
}
int main() {
int n, mod;
cin >> n >> mod;
vector<int> a(n);
vector<long long> sum(n + 1);
for (int i = 0; i < n; ++i) {
cin >> a[i];
sum[i + 1] = sum[i] + a[i];
}
long long ans = 0;
vector<int> cnt(mod);
for (int i = 0; i < n; ++i) {
if (i >= mod - 1)
--cnt[getVal(sum, i - (mod - 1), mod)];
++cnt[getVal(sum, i, mod)];
ans += cnt[getVal(sum, i + 1, mod)];
}
cout << ans << endl;
return 0;
}
| #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>
#include <memory>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int getVal(const vector<long long> &sum, int i, int mod) {
int ans = (sum[i] - i) % mod;
ans += mod;
ans %= mod;
return ans;
}
int main() {
int n, mod;
cin >> n >> mod;
vector<int> a(n);
vector<long long> sum(n + 1);
for (int i = 0; i < n; ++i) {
cin >> a[i];
sum[i + 1] = sum[i] + a[i];
}
long long ans = 0;
map<int, int> cnt;
for (int i = 0; i < n; ++i) {
if (i >= mod - 1)
--cnt[getVal(sum, i - (mod - 1), mod)];
++cnt[getVal(sum, i, mod)];
ans += cnt[getVal(sum, i + 1, mod)];
}
cout << ans << endl;
return 0;
}
| 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 \
cin.tie(0); \
ios::sync_with_stdio(false);
template <class T> using V = vector<T>;
template <class T, class U> using P = pair<T, U>;
template <class T> using PQ = priority_queue<T>;
template <class T> using PQR = priority_queue<T, vector<T>, greater<T>>;
constexpr long long MOD = (long long)1e9 + 7;
constexpr long long MOD2 = 998244353;
constexpr long long HIGHINF = (long long)1e18;
constexpr long long LOWINF = (long long)1e15;
constexpr long double PI = 3.1415926535897932384626433;
template <class T> vector<T> multivector(size_t N, T init) {
return vector<T>(N, init);
}
template <class... T> auto multivector(size_t N, T... t) {
return vector<decltype(multivector(t...))>(N, multivector(t...));
}
template <class T> void corner(bool flg, T hoge) {
if (flg) {
cout << hoge << endl;
exit(0);
}
}
template <class T, class U>
ostream &operator<<(ostream &o, const map<T, U> &obj) {
o << "{";
for (auto &x : obj)
o << " {" << x.first << " : " << x.second << "}"
<< ",";
o << " }";
return o;
}
template <class T> ostream &operator<<(ostream &o, const set<T> &obj) {
o << "{";
for (auto itr = obj.begin(); itr != obj.end(); ++itr)
o << (itr != obj.begin() ? ", " : "") << *itr;
o << "}";
return o;
}
template <class T> ostream &operator<<(ostream &o, const multiset<T> &obj) {
o << "{";
for (auto itr = obj.begin(); itr != obj.end(); ++itr)
o << (itr != obj.begin() ? ", " : "") << *itr;
o << "}";
return o;
}
template <class T> ostream &operator<<(ostream &o, const vector<T> &obj) {
o << "{";
for (int i = 0; i < (int)obj.size(); ++i)
o << (i > 0 ? ", " : "") << obj[i];
o << "}";
return o;
}
template <class T, class U>
ostream &operator<<(ostream &o, const pair<T, U> &obj) {
o << "{" << obj.first << ", " << obj.second << "}";
return o;
}
template <template <class tmp> class T, class U>
ostream &operator<<(ostream &o, const T<U> &obj) {
o << "{";
for (auto itr = obj.begin(); itr != obj.end(); ++itr)
o << (itr != obj.begin() ? ", " : "") << *itr;
o << "}";
return o;
}
void print(void) { cout << endl; }
template <class Head> void print(Head &&head) {
cout << head;
print();
}
template <class Head, class... Tail> void print(Head &&head, Tail &&...tail) {
cout << head << " ";
print(forward<Tail>(tail)...);
}
template <class T> void chmax(T &a, const T b) { a = max(a, b); }
template <class T> void chmin(T &a, const T b) { a = min(a, b); }
void YN(bool flg) { cout << (flg ? "YES" : "NO") << endl; }
void Yn(bool flg) { cout << (flg ? "Yes" : "No") << endl; }
void yn(bool flg) { cout << (flg ? "yes" : "no") << endl; }
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]--;
}
for (int i = 1; i <= N; ++i)
(A[i] += A[i - 1]) %= K;
map<ll, deque<int>> mp;
for (int i = 0; i < K; ++i) {
mp[A[i]].push_back(i);
}
ll sum = 0;
for (auto &e : mp) {
ll n = e.second.size();
sum += n * (n - 1) / 2;
}
for (int i = K; i <= N; ++i) {
mp[A[i - K]].pop_front();
ll n = mp[A[i]].size();
mp[A[i]].push_back(i);
sum += n;
}
cout << sum << endl;
return 0;
}
| #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 \
cin.tie(0); \
ios::sync_with_stdio(false);
template <class T> using V = vector<T>;
template <class T, class U> using P = pair<T, U>;
template <class T> using PQ = priority_queue<T>;
template <class T> using PQR = priority_queue<T, vector<T>, greater<T>>;
constexpr long long MOD = (long long)1e9 + 7;
constexpr long long MOD2 = 998244353;
constexpr long long HIGHINF = (long long)1e18;
constexpr long long LOWINF = (long long)1e15;
constexpr long double PI = 3.1415926535897932384626433;
template <class T> vector<T> multivector(size_t N, T init) {
return vector<T>(N, init);
}
template <class... T> auto multivector(size_t N, T... t) {
return vector<decltype(multivector(t...))>(N, multivector(t...));
}
template <class T> void corner(bool flg, T hoge) {
if (flg) {
cout << hoge << endl;
exit(0);
}
}
template <class T, class U>
ostream &operator<<(ostream &o, const map<T, U> &obj) {
o << "{";
for (auto &x : obj)
o << " {" << x.first << " : " << x.second << "}"
<< ",";
o << " }";
return o;
}
template <class T> ostream &operator<<(ostream &o, const set<T> &obj) {
o << "{";
for (auto itr = obj.begin(); itr != obj.end(); ++itr)
o << (itr != obj.begin() ? ", " : "") << *itr;
o << "}";
return o;
}
template <class T> ostream &operator<<(ostream &o, const multiset<T> &obj) {
o << "{";
for (auto itr = obj.begin(); itr != obj.end(); ++itr)
o << (itr != obj.begin() ? ", " : "") << *itr;
o << "}";
return o;
}
template <class T> ostream &operator<<(ostream &o, const vector<T> &obj) {
o << "{";
for (int i = 0; i < (int)obj.size(); ++i)
o << (i > 0 ? ", " : "") << obj[i];
o << "}";
return o;
}
template <class T, class U>
ostream &operator<<(ostream &o, const pair<T, U> &obj) {
o << "{" << obj.first << ", " << obj.second << "}";
return o;
}
template <template <class tmp> class T, class U>
ostream &operator<<(ostream &o, const T<U> &obj) {
o << "{";
for (auto itr = obj.begin(); itr != obj.end(); ++itr)
o << (itr != obj.begin() ? ", " : "") << *itr;
o << "}";
return o;
}
void print(void) { cout << endl; }
template <class Head> void print(Head &&head) {
cout << head;
print();
}
template <class Head, class... Tail> void print(Head &&head, Tail &&...tail) {
cout << head << " ";
print(forward<Tail>(tail)...);
}
template <class T> void chmax(T &a, const T b) { a = max(a, b); }
template <class T> void chmin(T &a, const T b) { a = min(a, b); }
void YN(bool flg) { cout << (flg ? "YES" : "NO") << endl; }
void Yn(bool flg) { cout << (flg ? "Yes" : "No") << endl; }
void yn(bool flg) { cout << (flg ? "yes" : "no") << endl; }
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]--;
}
for (int i = 1; i <= N; ++i)
(A[i] += A[i - 1]) %= K;
map<ll, deque<int>> mp;
for (int i = 0; i < K && i <= N; ++i) {
mp[A[i]].push_back(i);
}
ll sum = 0;
for (auto &e : mp) {
ll n = e.second.size();
sum += n * (n - 1) / 2;
}
for (int i = K; i <= N; ++i) {
mp[A[i - K]].pop_front();
ll n = mp[A[i]].size();
mp[A[i]].push_back(i);
sum += n;
}
cout << sum << endl;
return 0;
}
| 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) << endl;
#define debug(x) \
cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" \
<< " " << __FILE__ << endl;
template <class S, class T>
ostream &operator<<(ostream &os, const pair<S, T> v) {
os << "(" << v.first << ", " << v.second << ")";
return os;
}
template <class T> ostream &operator<<(ostream &os, const vector<T> v) {
for (int i = 0; i < (int)v.size(); i++) {
if (i > 0) {
os << " ";
}
os << v[i];
}
return os;
}
template <class T> ostream &operator<<(ostream &os, const vector<vector<T>> v) {
for (int i = 0; i < (int)v.size(); i++) {
if (i > 0) {
os << endl;
}
os << v[i];
}
return os;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll N, K;
cin >> N >> K;
vector<ll> A(N);
REP(i, N) cin >> A[i];
REP(i, N) A[i]--;
vector<ll> S(N + 1, 0);
REP(i, N) S[i + 1] = S[i] + A[i];
// cout << S << endl;
REP(i, N + 1) S[i] %= K;
// cout << S << endl;
map<ll, ll> cnt;
REP(i, K) { cnt[S[i]]++; }
ll res = 0;
REP(i, N + 1) {
cnt[S[i]]--;
res += cnt[S[i]];
// dump(cnt[S[i]])
if (i + K < N + 1)
cnt[S[i + K]]++;
}
cout << res << endl;
return 0;
} | #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) << endl;
#define debug(x) \
cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" \
<< " " << __FILE__ << endl;
template <class S, class T>
ostream &operator<<(ostream &os, const pair<S, T> v) {
os << "(" << v.first << ", " << v.second << ")";
return os;
}
template <class T> ostream &operator<<(ostream &os, const vector<T> v) {
for (int i = 0; i < (int)v.size(); i++) {
if (i > 0) {
os << " ";
}
os << v[i];
}
return os;
}
template <class T> ostream &operator<<(ostream &os, const vector<vector<T>> v) {
for (int i = 0; i < (int)v.size(); i++) {
if (i > 0) {
os << endl;
}
os << v[i];
}
return os;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll N, K;
cin >> N >> K;
vector<ll> A(N);
REP(i, N) cin >> A[i];
REP(i, N) A[i]--;
vector<ll> S(N + 1, 0);
REP(i, N) S[i + 1] = S[i] + A[i];
// cout << S << endl;
REP(i, N + 1) S[i] %= K;
// cout << S << endl;
map<ll, ll> cnt;
REP(i, min(K, N + 1)) { cnt[S[i]]++; }
ll res = 0;
REP(i, N + 1) {
cnt[S[i]]--;
res += cnt[S[i]];
// dump(cnt[S[i]])
if (i + K < N + 1)
cnt[S[i + K]]++;
}
cout << res << endl;
return 0;
} | 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<cstring>
// #include<bits/stdc++.h>
// }}}
using namespace std;
using ll = long long;
// #undef DEBUG
// #define DEBUG
// DEBUG {{{
#include <array>
#include <deque>
#include <iostream>
#include <list>
#include <queue>
#include <stack>
#include <tuple>
#include <valarray>
#include <vector>
template <int n, class... T>
typename std::enable_if<(n >= sizeof...(T))>::type
__output_tuple(std::ostream &, std::tuple<T...> const &) {}
template <int n, class... T>
typename std::enable_if<(n < sizeof...(T))>::type
__output_tuple(std::ostream &os, std::tuple<T...> const &t) {
os << (n == 0 ? "" : ", ") << std::get<n>(t);
__output_tuple<n + 1>(os, t);
}
template <class... T>
std::ostream &operator<<(std::ostream &os, std::tuple<T...> const &t) {
os << "(";
__output_tuple<0>(os, t);
os << ")";
return os;
}
template <class T, class U>
std::ostream &operator<<(std::ostream &os, std::pair<T, U> const &p) {
os << "(" << p.first << ", " << p.second << ")";
return os;
}
template <class T>
std::ostream &operator<<(std::ostream &os, const std::stack<T> &a) {
os << "{";
for (auto tmp = a; tmp.size(); tmp.pop())
os << (a.size() == tmp.size() ? "" : ", ") << tmp.top();
os << "}";
return os;
}
template <class T, class Container, class Compare>
std::ostream &operator<<(std::ostream &os,
std::priority_queue<T, Container, Compare> a) {
os << "{ (top) ";
while (a.size())
os << a.top() << (a.size() == 1 ? "" : ", "), a.pop();
os << " }";
return os;
}
template <class T, class Container>
std::ostream &operator<<(std::ostream &os, std::queue<T, Container> a) {
os << "{ ";
while (a.size())
os << a.front() << (a.size() == 1 ? "" : ", "), a.pop();
os << " }";
return os;
}
#ifdef DEBUG
#if !defined(DEBUG_OUT)
// #define DEBUG_OUT std::cerr
#endif
#define dump(...) \
[&]() { \
auto __debug_tap = std::make_tuple(__VA_ARGS__); \
DEBUG_OUT << "[" << __LINE__ << "] " << #__VA_ARGS__ << " = " \
<< __debug_tap << std::endl; \
}()
template <class T> inline void dump2D(T &d, size_t sizey, size_t sizex) {
for (size_t i = 0; i < sizey; i++) {
DEBUG_OUT << "\t";
for (size_t j = 0; j < sizex; j++)
DEBUG_OUT << d[i][j] << (j + 1 == sizex ? "" : "\t");
DEBUG_OUT << std::endl;
}
}
template <class T> inline void dump1D(T &d, size_t sizey) {
for (size_t i = 0; i < sizey; i++) {
DEBUG_OUT << d[i] << (i + 1 == sizey ? "" : " ");
}
DEBUG_OUT << std::endl;
}
template <
class T,
class = typename std::iterator_traits<decltype(begin(T()))>::value_type,
class = typename std::enable_if<!std::is_same<T, std::string>::value>::type>
std::ostream &operator<<(std::ostream &os, const T &a) {
os << "{";
for (auto ite = begin(a); ite != end(a); ++ite)
os << (ite == begin(a) ? "" : ", ") << *ite;
os << "}";
return os;
}
#else
#define dump(...) ((void)42)
#define dump2D(...) ((void)42)
#define dump1D(...) ((void)42)
template <
class T,
class = typename std::iterator_traits<decltype(begin(T()))>::value_type,
class = typename std::enable_if<!std::is_same<T, std::string>::value>::type>
std::ostream &operator<<(std::ostream &os, const T &a) {
for (auto ite = begin(a); ite != end(a); ++ite)
os << (ite == begin(a) ? "" : " ") << *ite;
return os;
}
#endif
// }}}
ll n, k;
int mk(ll x) { return (x % k + k) % k; }
int main() {
std::ios::sync_with_stdio(false), std::cin.tie(0);
cin >> n >> k;
vector<ll> a(n);
for (int i = 0; i < n; i++)
cin >> a[i];
ll bias = 0;
map<ll, int> cnt;
ll ans = 0;
ll lastk = 0;
for (int i = 0; i < n; i++) {
if (i - (k - 1) >= 0) {
assert(cnt[mk((lastk - (k - 1)) + bias)] >= 1);
cnt[mk((lastk - (k - 1)) + bias)]--;
lastk -= a[i - (k - 1)];
}
lastk += a[i];
cnt[mk(0 + bias)]++;
bias -= a[i] - 1;
ans += cnt[mk(0 + bias)];
dump(ans, bias);
dump(cnt);
}
cout << ans << endl;
return 0;
}
| // 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<cstring>
// #include<bits/stdc++.h>
// }}}
using namespace std;
using ll = long long;
// #undef DEBUG
// #define DEBUG
// DEBUG {{{
#include <array>
#include <deque>
#include <iostream>
#include <list>
#include <queue>
#include <stack>
#include <tuple>
#include <valarray>
#include <vector>
template <int n, class... T>
typename std::enable_if<(n >= sizeof...(T))>::type
__output_tuple(std::ostream &, std::tuple<T...> const &) {}
template <int n, class... T>
typename std::enable_if<(n < sizeof...(T))>::type
__output_tuple(std::ostream &os, std::tuple<T...> const &t) {
os << (n == 0 ? "" : ", ") << std::get<n>(t);
__output_tuple<n + 1>(os, t);
}
template <class... T>
std::ostream &operator<<(std::ostream &os, std::tuple<T...> const &t) {
os << "(";
__output_tuple<0>(os, t);
os << ")";
return os;
}
template <class T, class U>
std::ostream &operator<<(std::ostream &os, std::pair<T, U> const &p) {
os << "(" << p.first << ", " << p.second << ")";
return os;
}
template <class T>
std::ostream &operator<<(std::ostream &os, const std::stack<T> &a) {
os << "{";
for (auto tmp = a; tmp.size(); tmp.pop())
os << (a.size() == tmp.size() ? "" : ", ") << tmp.top();
os << "}";
return os;
}
template <class T, class Container, class Compare>
std::ostream &operator<<(std::ostream &os,
std::priority_queue<T, Container, Compare> a) {
os << "{ (top) ";
while (a.size())
os << a.top() << (a.size() == 1 ? "" : ", "), a.pop();
os << " }";
return os;
}
template <class T, class Container>
std::ostream &operator<<(std::ostream &os, std::queue<T, Container> a) {
os << "{ ";
while (a.size())
os << a.front() << (a.size() == 1 ? "" : ", "), a.pop();
os << " }";
return os;
}
#ifdef DEBUG
#if !defined(DEBUG_OUT)
// #define DEBUG_OUT std::cerr
#endif
#define dump(...) \
[&]() { \
auto __debug_tap = std::make_tuple(__VA_ARGS__); \
DEBUG_OUT << "[" << __LINE__ << "] " << #__VA_ARGS__ << " = " \
<< __debug_tap << std::endl; \
}()
template <class T> inline void dump2D(T &d, size_t sizey, size_t sizex) {
for (size_t i = 0; i < sizey; i++) {
DEBUG_OUT << "\t";
for (size_t j = 0; j < sizex; j++)
DEBUG_OUT << d[i][j] << (j + 1 == sizex ? "" : "\t");
DEBUG_OUT << std::endl;
}
}
template <class T> inline void dump1D(T &d, size_t sizey) {
for (size_t i = 0; i < sizey; i++) {
DEBUG_OUT << d[i] << (i + 1 == sizey ? "" : " ");
}
DEBUG_OUT << std::endl;
}
template <
class T,
class = typename std::iterator_traits<decltype(begin(T()))>::value_type,
class = typename std::enable_if<!std::is_same<T, std::string>::value>::type>
std::ostream &operator<<(std::ostream &os, const T &a) {
os << "{";
for (auto ite = begin(a); ite != end(a); ++ite)
os << (ite == begin(a) ? "" : ", ") << *ite;
os << "}";
return os;
}
#else
#define dump(...) ((void)42)
#define dump2D(...) ((void)42)
#define dump1D(...) ((void)42)
template <
class T,
class = typename std::iterator_traits<decltype(begin(T()))>::value_type,
class = typename std::enable_if<!std::is_same<T, std::string>::value>::type>
std::ostream &operator<<(std::ostream &os, const T &a) {
for (auto ite = begin(a); ite != end(a); ++ite)
os << (ite == begin(a) ? "" : " ") << *ite;
return os;
}
#endif
// }}}
ll n, k;
int mk(ll x) { return (x % k + k) % k; }
int main() {
std::ios::sync_with_stdio(false), std::cin.tie(0);
cin >> n >> k;
if (k == 1)
return cout << 0 << endl, 0;
vector<ll> a(n);
for (int i = 0; i < n; i++)
cin >> a[i];
ll bias = 0;
map<ll, int> cnt;
ll ans = 0;
ll lastk = 0;
for (int i = 0; i < n; i++) {
if (i - (k - 1) >= 0) {
assert(cnt[mk((lastk - (k - 1)) + bias)] >= 1);
cnt[mk((lastk - (k - 1)) + bias)]--;
lastk -= a[i - (k - 1)];
}
lastk += a[i];
cnt[mk(0 + bias)]++;
bias -= a[i] - 1;
ans += cnt[mk(0 + bias)];
dump(ans, bias);
dump(cnt);
}
cout << ans << endl;
return 0;
}
| 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) {
if (b & 1)
res = (res * a) % p;
a = (a * a) % p;
b = b >> 1;
}
return res % p;
}
const int N = 2 * 1e5 + 2;
vector<int> v[N];
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, k;
cin >> n >> k;
int a[n + 1];
for (int i = 1; i <= n; i++)
cin >> a[i];
a[0] = 0;
for (int i = 1; i <= n; i++)
a[i] += a[i - 1];
v[0].pb(0);
int ans = 0;
for (int i = 1; i <= n; i++) {
int s = a[i] - i;
s %= k;
// cout<<s<<" ";
if (v[s].size() == 0) {
v[s % k].pb(i);
continue;
}
// cout<<i<<" ";
int r = i - k;
int o = v[s].end() - upper_bound(all(v[s]), r);
ans += o;
// cout<<i<<" "<<o<<" "<<s<<" "<<v[s].size()<<"\n";
v[s % k].pb(i);
}
cout << ans;
}
// I never lose. I either win or I learn | #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) {
if (b & 1)
res = (res * a) % p;
a = (a * a) % p;
b = b >> 1;
}
return res % p;
}
const int N = 2 * 1e5 + 2;
map<int, vector<int>> v;
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n, k;
cin >> n >> k;
int a[n + 1];
for (int i = 1; i <= n; i++)
cin >> a[i];
a[0] = 0;
for (int i = 1; i <= n; i++)
a[i] += a[i - 1];
v[0].pb(0);
int ans = 0;
for (int i = 1; i <= n; i++) {
int s = a[i] - i;
s %= k;
// cout<<s<<" ";
if (v[s].size() == 0) {
v[s % k].pb(i);
continue;
}
// cout<<i<<" ";
int r = i - k;
int o = v[s].end() - upper_bound(all(v[s]), r);
ans += o;
// cout<<i<<" "<<o<<" "<<s<<" "<<v[s].size()<<"\n";
v[s % k].pb(i);
}
cout << ans;
}
// I never lose. I either win or I learn | 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>
#include <sys/time.h>
#include <unordered_map>
#include <vector>
#define fs first
#define sc second
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
ll a[201000];
ll s[201000];
unordered_map<ll, ll> mp;
int main() {
ll N, K;
cin >> N >> K;
for (int i = 0; i < N; i++) {
cin >> a[i];
}
s[0] = (a[0] - 1) % K;
for (int i = 1; i < N; i++) {
s[i] = (a[i] + s[i - 1] + K * N - 1) % K;
}
for (int i = 0; i < K - 1; i++) {
if (mp.find(s[i]) == mp.end()) {
mp[s[i] % K] = 1;
} else {
mp[s[i] % K]++;
}
}
ll res = 0;
ll index = 0;
for (int i = 0; i < N; i++) {
res += mp[index];
// cout << i << " " << mp[index] << " " << index << endl;
mp[s[i]]--;
if (i + K - 1 < N) {
if (mp.find(s[i + K - 1] % K) == mp.end()) {
mp[s[i + K - 1] % K] = 1;
} else {
mp[s[i + K - 1] % K]++;
}
}
index = (s[i]) % K;
}
cout << res << endl;
return 0;
}
| #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>
#include <sys/time.h>
#include <unordered_map>
#include <vector>
#define fs first
#define sc second
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
ll a[201000];
ll s[201000];
unordered_map<ll, ll> mp;
int main() {
ll N, K;
cin >> N >> K;
for (int i = 0; i < N; i++) {
cin >> a[i];
}
s[0] = (a[0] - 1) % K;
for (int i = 1; i < N; i++) {
s[i] = (a[i] + s[i - 1] + K * N - 1) % K;
}
for (int i = 0; i < min(N, K - 1); i++) {
if (mp.find(s[i]) == mp.end()) {
mp[s[i] % K] = 1;
} else {
mp[s[i] % K]++;
}
}
ll res = 0;
ll index = 0;
for (int i = 0; i < N; i++) {
res += mp[index];
// cout << i << " " << mp[index] << " " << index << endl;
mp[s[i]]--;
if (i + K - 1 < N) {
if (mp.find(s[i + K - 1] % K) == mp.end()) {
mp[s[i + K - 1] % K] = 1;
} else {
mp[s[i + K - 1] % K]++;
}
}
index = (s[i]) % K;
}
cout << res << endl;
return 0;
}
| 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_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
// Macros
#define ll long long
#define db long double
#define pb push_back
#define eb emplace_back
#define pii pair<int, int>
#define vi vector<int>
#define vii vector<pii>
#define mi map<int, int>
#define mii map<pii, int>
#define fi first
#define se second
#define all(a) (a).begin(), (a).end()
#define sz(x) (int)x.size()
#define mod 1000000007
#define EPS 1e-9
#define io \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0)
#define inf 1e10
#define PI acos(-1.0)
#define int long long
template <typename T>
using ordered_set =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define N 100005
// Solution
int n, k;
int a[N];
mi m;
int get(int a, int b) {
// return (a-b+k)%k;
int x = a - b;
while (x < 0)
x += k;
return x % k;
}
void solve() {
cin >> n >> k;
for (int i = 1; i <= n; i++)
cin >> a[i], a[i] += a[i - 1];
m[0]++;
int ans = 0;
for (int i = 1; i <= n; i++) {
if (i >= k)
m[get(a[i - k], i - k)]--;
ans += m[get(a[i], i)];
m[get(a[i], i)]++;
}
cout << ans << endl;
}
signed main() {
io;
// freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout);
int tests;
// cin>>tests;
tests = 1;
while (tests--) {
solve();
}
return 0;
} |
// 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_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
// Macros
#define ll long long
#define db long double
#define pb push_back
#define eb emplace_back
#define pii pair<int, int>
#define vi vector<int>
#define vii vector<pii>
#define mi map<int, int>
#define mii map<pii, int>
#define fi first
#define se second
#define all(a) (a).begin(), (a).end()
#define sz(x) (int)x.size()
#define mod 1000000007
#define EPS 1e-9
#define io \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0)
#define inf 1e10
#define PI acos(-1.0)
#define int long long
template <typename T>
using ordered_set =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define N 200005
// Solution
int n, k;
int a[N];
mi m;
int get(int a, int b) {
// return (a-b+k)%k;
int x = a - b;
while (x < 0)
x += k;
return x % k;
}
void solve() {
cin >> n >> k;
for (int i = 1; i <= n; i++)
cin >> a[i], a[i] += a[i - 1];
m[0]++;
int ans = 0;
for (int i = 1; i <= n; i++) {
if (i >= k)
m[get(a[i - k], i - k)]--;
ans += m[get(a[i], i)];
m[get(a[i], i)]++;
}
cout << ans << endl;
}
signed main() {
io;
// freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout);
int tests;
// cin>>tests;
tests = 1;
while (tests--) {
solve();
}
return 0;
} | 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;
}
map<int, int> mp;
for (int n = 1; n < K; ++n) {
mp[SUM[n]]++;
}
long long ans = 0;
for (long long n = 0; n <= N; ++n) {
ans += mp[SUM[n]];
mp[SUM[n + 1]]--;
if ((n + K) <= N) {
mp[SUM[n + K]]++;
}
}
cout << ans << endl;
return 0;
} | #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;
}
map<int, int> mp;
for (int n = 1; n < K; ++n) {
if (n <= N) {
mp[SUM[n]]++;
}
}
long long ans = 0;
for (long long n = 0; n <= N; ++n) {
ans += mp[SUM[n]];
mp[SUM[n + 1]]--;
if ((n + K) <= N) {
mp[SUM[n + K]]++;
}
}
cout << ans << endl;
return 0;
} | 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, a, b) for (int i = (b)-1; i >= (a); --i)
#define DEBUG(x) cout << #x << ": " << (x) << '\n'
#define DEBUG_VEC(v) \
cout << #v << ":"; \
REP(i, v.size()) cout << ' ' << v[i]; \
cout << '\n'
#define ALL(a) (a).begin(), (a).end()
template <typename T> inline void CHMAX(T &a, const T b) {
if (a < b)
a = b;
}
template <typename T> inline void CHMIN(T &a, const T b) {
if (a > b)
a = b;
}
constexpr ll MOD = 1000000007ll;
// constexpr ll MOD=998244353ll;
#define FIX(a) ((a) % MOD + MOD) % MOD
const double EPS = 1e-11;
#define EQ0(x) (abs((x)) < EPS)
#define EQ(a, b) (abs((a) - (b)) < EPS)
pll sum[252521];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
// cout<<setprecision(10)<<fixed;
int n;
ll k, a[252521];
cin >> n >> k;
sum[0] = pll(0, 0);
REP(i, n) {
cin >> a[i];
sum[i + 1] = pll((sum[i].first + a[i]) % k, i + 1);
}
REP(i, n) {
sum[i + 1].first -= i + 1;
while (sum[i + 1].first < 0) {
sum[i + 1].first += k;
}
}
sort(sum, sum + n + 1);
// FOR(i, 0, n+1){
// cout<<sum[i].first<<" \n"[i==n];
// }
ll ans = 0;
int r = 0;
REP(i, n) {
ll cnt = 0;
while (r < n + 1 && sum[i].first == sum[r].first &&
sum[r].second - sum[i].second < k) {
++r;
}
if (r != i) {
ans += r - i - 1;
// cout<<i<<' '<<r<<'\n';
// DEBUG(ans);
}
}
cout << ans << '\n';
return 0;
}
| #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, a, b) for (int i = (b)-1; i >= (a); --i)
#define DEBUG(x) cout << #x << ": " << (x) << '\n'
#define DEBUG_VEC(v) \
cout << #v << ":"; \
REP(i, v.size()) cout << ' ' << v[i]; \
cout << '\n'
#define ALL(a) (a).begin(), (a).end()
template <typename T> inline void CHMAX(T &a, const T b) {
if (a < b)
a = b;
}
template <typename T> inline void CHMIN(T &a, const T b) {
if (a > b)
a = b;
}
constexpr ll MOD = 1000000007ll;
// constexpr ll MOD=998244353ll;
#define FIX(a) ((a) % MOD + MOD) % MOD
const double EPS = 1e-11;
#define EQ0(x) (abs((x)) < EPS)
#define EQ(a, b) (abs((a) - (b)) < EPS)
pll sum[252521];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
// cout<<setprecision(10)<<fixed;
int n;
ll k, a[252521];
cin >> n >> k;
sum[0] = pll(0, 0);
REP(i, n) {
cin >> a[i];
sum[i + 1] = pll((sum[i].first + a[i]) % k, i + 1);
}
REP(i, n) {
sum[i + 1].first -= (i + 1) % k;
while (sum[i + 1].first < 0) {
sum[i + 1].first += k;
}
}
sort(sum, sum + n + 1);
// FOR(i, 0, n+1){
// cout<<sum[i].first<<" \n"[i==n];
// }
ll ans = 0;
int r = 0;
REP(i, n) {
ll cnt = 0;
while (r < n + 1 && sum[i].first == sum[r].first &&
sum[r].second - sum[i].second < k) {
++r;
}
if (r != i) {
ans += r - i - 1;
// cout<<i<<' '<<r<<'\n';
// DEBUG(ans);
}
}
cout << ans << '\n';
return 0;
}
| 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 >> A[i];
}
for (int i = 1; i <= N; i++) {
cumA[i] = cumA[i - 1] + A[i - 1];
M[i] = (cumA[i] - i) % K;
}
ll ans = 0;
// **** debug : この方法でカウントするとTLE ****
/*
for (int i=0; i<N; i++) {
for (int j=i+1; j<=N; j++) {
if ((j - i < K) && (M[i] % K == M[j] % K)) {
ans++;
}
}
}
*/
map<ll, ll> M_cnt; // 0 < j - i < K の範囲でのMの度数分布
// i = 0
for (int j = 1; j < K; j++) {
M_cnt[M[j]]++;
}
for (int i = 0; i < N; i++) {
ans += M_cnt[M[i]];
// 度数分布をスライド
M_cnt[M[i + 1]]--;
if (i + K <= N)
M_cnt[M[i + K]]++;
}
cout << ans << endl;
return 0;
} |
// 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 >> A[i];
}
for (int i = 1; i <= N; i++) {
cumA[i] = cumA[i - 1] + A[i - 1];
M[i] = (cumA[i] - i) % K;
}
ll ans = 0;
// **** debug : この方法でカウントするとTLE ****
/*
for (int i=0; i<N; i++) {
for (int j=i+1; j<=N; j++) {
if ((j - i < K) && (M[i] % K == M[j] % K)) {
ans++;
}
}
}
*/
map<ll, ll> M_cnt; // 0 < j - i < K の範囲でのMの度数分布
// i = 0
for (int j = 1; j < K && j <= N; j++) {
M_cnt[M[j]]++;
}
for (int i = 0; i < N; i++) {
ans += M_cnt[M[i]];
// 度数分布をスライド
M_cnt[M[i + 1]]--;
if (i + K <= N)
M_cnt[M[i + K]]++;
}
cout << ans << endl;
return 0;
} | 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]]--;
dp[i] = (dp[i] + m - i % m) % m;
ans += mp[dp[i]];
mp[dp[i]]++;
}
cout << ans << endl;
return 0;
} | #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]]--;
dp[i] = (dp[i] + m - i % m) % m;
ans += mp[dp[i]];
mp[dp[i]]++;
}
cout << ans << endl;
return 0;
} | 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 (x = 0, ch = getchar(); !isdigit(ch); ch = getchar())
if (ch == '-')
f = 0;
for (; isdigit(ch); x = (x << 1) + (x << 3) + (ch ^ 48), ch = getchar())
;
x = f ? x : -x;
}
template <typename T> void print(T x) {
if (x < 0)
x = -x, putchar('-');
if (x > 9)
print(x / 10);
putchar(x % 10 + 48);
}
template <typename T> inline void print(T x, char ap) {
print(x);
if (ap)
putchar(ap);
}
template <typename T> inline void chkmax(T &x, const T &y) {
x = x < y ? y : x;
}
template <typename T> inline void chkmin(T &x, const T &y) {
x = x < y ? x : y;
}
map<int, int> mp;
int n, k;
ll a[100001], tot;
int main() {
ios::sync_with_stdio(false);
cin >> n >> k;
for (res i = 1; i <= n; ++i)
cin >> a[i], a[i] += a[i - 1];
mp[0] = 1;
for (res i = 1; i <= n; ++i) {
if (i >= k)
--mp[(a[i - k] % k - i % k + k) % k];
tot += mp[(a[i] % k - i % k + k) % k], ++mp[(a[i] % k - i % k + k) % k];
}
cout << tot << '\n';
cout << flush;
return 0;
}
/* stuff you should look for
* int overflow, array bounds
* special cases (n=1?), set tle
* do something instead of nothing and stay organized
*/ | #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 (x = 0, ch = getchar(); !isdigit(ch); ch = getchar())
if (ch == '-')
f = 0;
for (; isdigit(ch); x = (x << 1) + (x << 3) + (ch ^ 48), ch = getchar())
;
x = f ? x : -x;
}
template <typename T> void print(T x) {
if (x < 0)
x = -x, putchar('-');
if (x > 9)
print(x / 10);
putchar(x % 10 + 48);
}
template <typename T> inline void print(T x, char ap) {
print(x);
if (ap)
putchar(ap);
}
template <typename T> inline void chkmax(T &x, const T &y) {
x = x < y ? y : x;
}
template <typename T> inline void chkmin(T &x, const T &y) {
x = x < y ? x : y;
}
map<int, int> mp;
int n, k;
ll a[200001], tot;
int main() {
ios::sync_with_stdio(false);
cin >> n >> k;
for (res i = 1; i <= n; ++i)
cin >> a[i], a[i] += a[i - 1];
mp[0] = 1;
for (res i = 1; i <= n; ++i) {
if (i >= k)
--mp[(a[i - k] % k - i % k + k) % k];
tot += mp[(a[i] % k - i % k + k) % k], ++mp[(a[i] % k - i % k + k) % k];
}
cout << tot << '\n';
cout << flush;
return 0;
}
/* stuff you should look for
* int overflow, array bounds
* special cases (n=1?), set tle
* do something instead of nothing and stay organized
*/ | 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 (l == (sum[i + l] - sum[i] + k) % k)
res++;
}
}
cout << res << '\n';
return 0;
} | #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] = ((sum[i] - i) % k + k) % k;
if (i >= k)
m[sum[i - k]]--;
res += m[sum[i]];
m[sum[i]]++;
}
cout << res << '\n';
return 0;
} | 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 tools {
template <typename T>
void read(::std::istream &is, ::std::vector<T> &vector,
const typename ::std::vector<T>::size_type size) {
vector.reserve(size);
::std::copy_n(::std::istream_iterator<T>(is), size,
::std::back_inserter(vector));
}
template <typename T>
void read(::std::vector<T> &vector,
const typename ::std::vector<T>::size_type size) {
::tools::read(::std::cin, vector, size);
}
template <typename T, ::std::size_t N>
void read(::std::istream &is, ::std::array<T, N> &array) {
::std::copy_n(std::istream_iterator<T>(is), N, array.begin());
}
template <typename T, ::std::size_t N> void read(::std::array<T, N> &array) {
::tools::read(::std::cin, array);
}
} // namespace tools
#endif
// main.cpp
int main() {
i64 N, K;
std::cin >> N >> K;
std::vector<i64> A;
tools::read(A, N);
std::transform(A.begin(), A.end(), A.begin(),
[](const i64 &A_i) { return A_i - 1; });
std::vector<i64> cumsum({0});
std::partial_sum(A.begin(), A.end(), std::back_inserter(cumsum));
std::transform(cumsum.begin(), cumsum.end(), cumsum.begin(),
[&K](const i64 &cumsum_i) { return cumsum_i % K; });
std::queue<i64> queue;
std::unordered_map<i64, i64> map;
for (i64 i = 0; i < K; ++i) {
map.emplace(i, 0);
}
i64 answer = 0;
for (const i64 &cumsum_i : cumsum) {
if (static_cast<i64>(queue.size()) >= K) {
--map[queue.front()];
queue.pop();
}
answer += map[cumsum_i];
queue.push(cumsum_i);
++map[cumsum_i];
}
std::cout << answer << std::endl;
return 0;
} | #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 tools {
template <typename T>
void read(::std::istream &is, ::std::vector<T> &vector,
const typename ::std::vector<T>::size_type size) {
vector.reserve(size);
::std::copy_n(::std::istream_iterator<T>(is), size,
::std::back_inserter(vector));
}
template <typename T>
void read(::std::vector<T> &vector,
const typename ::std::vector<T>::size_type size) {
::tools::read(::std::cin, vector, size);
}
template <typename T, ::std::size_t N>
void read(::std::istream &is, ::std::array<T, N> &array) {
::std::copy_n(std::istream_iterator<T>(is), N, array.begin());
}
template <typename T, ::std::size_t N> void read(::std::array<T, N> &array) {
::tools::read(::std::cin, array);
}
} // namespace tools
#endif
// main.cpp
int main() {
i64 N, K;
std::cin >> N >> K;
std::vector<i64> A;
tools::read(A, N);
std::transform(A.begin(), A.end(), A.begin(),
[](const i64 &A_i) { return A_i - 1; });
std::vector<i64> cumsum({0});
std::partial_sum(A.begin(), A.end(), std::back_inserter(cumsum));
std::transform(cumsum.begin(), cumsum.end(), cumsum.begin(),
[&K](const i64 &cumsum_i) { return cumsum_i % K; });
std::queue<i64> queue;
std::unordered_map<i64, i64> map;
i64 answer = 0;
for (const i64 &cumsum_i : cumsum) {
if (static_cast<i64>(queue.size()) >= K) {
--map[queue.front()];
queue.pop();
}
answer += map[cumsum_i];
queue.push(cumsum_i);
++map[cumsum_i];
}
std::cout << answer << std::endl;
return 0;
} | 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
ret += en - st - 1
print(ret)
| 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] - a[st] < k:
en += 1
ret += en - st - 1
print(ret)
| 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 namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using vll = vector<ll>;
using vvll = vector<vll>;
using pll = pair<ll, ll>;
using vpll = vector<pll>;
using vvpll = vector<vpll>;
using tll = tuple<ll, ll, ll>;
using vtll = vector<tll>;
using vvtll = vector<vtll>;
#define all(v) (v).begin(), (v).end()
#define for1(i, n) for (ll i = 0; i < (n); i++)
#define for2(i, m, n) for (ll i = (m); i < (n); i++)
#define for3(i, m, n, d) for (ll i = (m); i < (n); i += (d))
#define rfor2(i, m, n) for (ll i = (m); i > (n); i--)
#define rfor3(i, m, n, d) for (ll i = (m); i > (n); i += (d))
#define PI 3.1415926535897932384626433832795028841971693993751
#define INF 1111111111111111111LL
#define print(...) print_1(__VA_ARGS__)
#define in(...) in_1(__VA_ARGS__)
#if DEBUG
#define dump(...) dump_1(#__VA_ARGS__, __VA_ARGS__)
#define dumpa(...) dumpa_1(#__VA_ARGS__, __VA_ARGS__)
#else
#define dump(...)
#define dumpa(...)
#endif
template <typename Head> void dump_1(const char *str, Head &&h) {
cerr << str << ": " << h << '\n';
}
template <typename Head, typename... Tail>
void dump_1(const char *str, Head &&h, Tail &&...t) {
while (*str != ',') {
cerr << *str++;
}
cerr << ": " << h << ' ';
dump_1(str + 1, t...);
}
template <typename T>
void dumpa_1(const char *str, const T v[], const ll size) {
while (*str != ',') {
cerr << *str++;
}
cerr << ": ";
for1(i, size) {
if (i != 0) {
cerr << ' ';
}
cerr << v[i];
}
cerr << '\n';
}
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &v) {
os << v.first << ' ' << v.second;
return os;
}
template <typename T1, typename T2, typename T3>
ostream &operator<<(ostream &os, const tuple<T1, T2, T3> &v) {
os << get<0>(v) << ' ' << get<1>(v) << ' ' << get<2>(v);
return os;
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> &v) {
for (auto it = v.begin(); it != v.end(); it++) {
if (it != v.begin()) {
os << ' ';
}
os << *it;
}
return os;
}
template <typename T> ostream &operator<<(ostream &os, const set<T> &v) {
for (auto it = v.begin(); it != v.end(); it++) {
if (it != v.begin()) {
os << ' ';
}
os << *it;
}
return os;
}
template <typename T> ostream &operator<<(ostream &os, const multiset<T> &v) {
for (auto it = v.begin(); it != v.end(); it++) {
if (it != v.begin()) {
os << ' ';
}
os << *it;
}
return os;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const map<T1, T2> &v) {
os << '{';
for (auto it = v.begin(); it != v.end(); it++) {
if (it != v.begin()) {
os << ", ";
}
os << it->first << ':' << it->second;
}
os << '}';
return os;
}
void Yes(void) { cout << "Yes\n"; }
void No(void) { cout << "No\n"; }
void YES(void) { cout << "YES\n"; }
void NO(void) { cout << "NO\n"; }
template <typename T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <typename T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <typename T> void vin(vector<T> &v, ll len) {
for1(i, len) { cin >> v[i]; }
}
template <typename Head> void in_1(Head &h) { cin >> h; }
template <typename Head, typename... Tail> void in_1(Head &h, Tail &...t) {
cin >> h;
in_1(t...);
}
template <typename Head> void print_1(Head &&h) { cout << h << '\n'; }
template <typename Head, typename... Tail> void print_1(Head &&h, Tail &&...t) {
cout << h << ' ';
print_1(t...);
}
//---------------------------------------------------------
void solve() {
ll N, K;
in(N, K);
vll A(N);
for1(i, N) {
ll a;
in(a);
a--;
a %= K;
A[i] = a;
}
vll C(N + 1);
for1(i, N) {
C[i + 1] = C[i] + A[i];
if (C[i + 1] >= K) {
C[i + 1] -= K;
}
}
vll cnt(K);
ll ans = 0;
for1(i, N + 1) {
ll a = C[i];
cnt[a]++;
ans += cnt[a] - 1;
if (i >= K - 1) {
a = C[i - (K - 1)];
cnt[a]--;
}
}
print(ans);
}
//---------------------------------------------------------
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(16);
cerr << fixed << setprecision(16);
solve();
}
| #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 namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using vll = vector<ll>;
using vvll = vector<vll>;
using pll = pair<ll, ll>;
using vpll = vector<pll>;
using vvpll = vector<vpll>;
using tll = tuple<ll, ll, ll>;
using vtll = vector<tll>;
using vvtll = vector<vtll>;
#define all(v) (v).begin(), (v).end()
#define for1(i, n) for (ll i = 0; i < (n); i++)
#define for2(i, m, n) for (ll i = (m); i < (n); i++)
#define for3(i, m, n, d) for (ll i = (m); i < (n); i += (d))
#define rfor2(i, m, n) for (ll i = (m); i > (n); i--)
#define rfor3(i, m, n, d) for (ll i = (m); i > (n); i += (d))
#define PI 3.1415926535897932384626433832795028841971693993751
#define INF 1111111111111111111LL
#define print(...) print_1(__VA_ARGS__)
#define in(...) in_1(__VA_ARGS__)
#if DEBUG
#define dump(...) dump_1(#__VA_ARGS__, __VA_ARGS__)
#define dumpa(...) dumpa_1(#__VA_ARGS__, __VA_ARGS__)
#else
#define dump(...)
#define dumpa(...)
#endif
template <typename Head> void dump_1(const char *str, Head &&h) {
cerr << str << ": " << h << '\n';
}
template <typename Head, typename... Tail>
void dump_1(const char *str, Head &&h, Tail &&...t) {
while (*str != ',') {
cerr << *str++;
}
cerr << ": " << h << ' ';
dump_1(str + 1, t...);
}
template <typename T>
void dumpa_1(const char *str, const T v[], const ll size) {
while (*str != ',') {
cerr << *str++;
}
cerr << ": ";
for1(i, size) {
if (i != 0) {
cerr << ' ';
}
cerr << v[i];
}
cerr << '\n';
}
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &v) {
os << v.first << ' ' << v.second;
return os;
}
template <typename T1, typename T2, typename T3>
ostream &operator<<(ostream &os, const tuple<T1, T2, T3> &v) {
os << get<0>(v) << ' ' << get<1>(v) << ' ' << get<2>(v);
return os;
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> &v) {
for (auto it = v.begin(); it != v.end(); it++) {
if (it != v.begin()) {
os << ' ';
}
os << *it;
}
return os;
}
template <typename T> ostream &operator<<(ostream &os, const set<T> &v) {
for (auto it = v.begin(); it != v.end(); it++) {
if (it != v.begin()) {
os << ' ';
}
os << *it;
}
return os;
}
template <typename T> ostream &operator<<(ostream &os, const multiset<T> &v) {
for (auto it = v.begin(); it != v.end(); it++) {
if (it != v.begin()) {
os << ' ';
}
os << *it;
}
return os;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const map<T1, T2> &v) {
os << '{';
for (auto it = v.begin(); it != v.end(); it++) {
if (it != v.begin()) {
os << ", ";
}
os << it->first << ':' << it->second;
}
os << '}';
return os;
}
void Yes(void) { cout << "Yes\n"; }
void No(void) { cout << "No\n"; }
void YES(void) { cout << "YES\n"; }
void NO(void) { cout << "NO\n"; }
template <typename T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <typename T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <typename T> void vin(vector<T> &v, ll len) {
for1(i, len) { cin >> v[i]; }
}
template <typename Head> void in_1(Head &h) { cin >> h; }
template <typename Head, typename... Tail> void in_1(Head &h, Tail &...t) {
cin >> h;
in_1(t...);
}
template <typename Head> void print_1(Head &&h) { cout << h << '\n'; }
template <typename Head, typename... Tail> void print_1(Head &&h, Tail &&...t) {
cout << h << ' ';
print_1(t...);
}
//---------------------------------------------------------
void solve() {
ll N, K;
in(N, K);
vll A(N);
for1(i, N) {
ll a;
in(a);
a--;
a %= K;
A[i] = a;
}
vll C(N + 1);
for1(i, N) {
C[i + 1] = C[i] + A[i];
if (C[i + 1] >= K) {
C[i + 1] -= K;
}
}
map<ll, ll> cnt;
ll ans = 0;
for1(i, N + 1) {
ll a = C[i];
cnt[a]++;
ans += cnt[a] - 1;
if (i >= K - 1) {
a = C[i - (K - 1)];
cnt[a]--;
}
}
print(ans);
}
//---------------------------------------------------------
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(16);
cerr << fixed << setprecision(16);
solve();
}
| 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] = (r[i] + a[i]) % k;
vector<int> v(k, 0);
i64 ans = 0;
for (int i = 0; i <= n; ++i) {
ans += v[r[i]];
v[r[i]]++;
if (i - k + 1 >= 0)
v[r[i - k + 1]]--;
}
cout << ans << endl;
}
| #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] = (r[i] + a[i]) % k;
map<int, int> v;
i64 ans = 0;
for (int i = 0; i <= n; ++i) {
ans += v[r[i]];
v[r[i]]++;
if (i - k + 1 >= 0)
v[r[i - k + 1]]--;
}
cout << ans << endl;
}
| 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 - 1; i++) {
ll cand = (sum[i] - i) % k;
cand = (cand + k) % k;
m[cand]++;
}
ll ans = 0;
for (int i = 0; i < n; i++) {
ll cand = (sum[i] - i) % k;
cand = (cand + k) % k;
m[cand]--;
ans += m[cand];
if (k + i <= n) {
ll add = (sum[k + i] - (k + i)) % k;
add = (add + k) % k;
m[add]++;
}
}
cout << ans << endl;
}
| #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 <= min(n, k - 1); i++) {
ll cand = (sum[i] - i) % k;
cand = (cand + k) % k;
m[cand]++;
}
ll ans = 0;
for (int i = 0; i < n; i++) {
ll cand = (sum[i] - i) % k;
cand = (cand + k) % k;
m[cand]--;
ans += m[cand];
if (k + i <= n) {
ll add = (sum[k + i] - (k + i)) % k;
add = (add + k) % k;
m[add]++;
}
}
cout << ans << endl;
}
| 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] + a[i - 1]) %= k;
map<int, int> m;
int r = 0;
for (int i = 1; i < k; ++i)
++m[s[i]];
for (int i = 0; i <= n; ++i) {
r += m[s[i]];
if (i + k <= n)
++m[s[i + k]];
if (i + 1 <= n)
--m[s[i + 1]];
}
cout << r << endl;
for (int i : s)
cerr << i << " ";
cerr << endl;
} | #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] + a[i - 1]) %= k;
map<int, int> m;
ll r = 0;
for (int i = 1; i < min(k, n + 1); ++i)
++m[s[i]];
for (int i = 0; i <= n; ++i) {
r += m[s[i]];
if (i + k <= n)
++m[s[i + k]];
if (i + 1 <= n)
--m[s[i + 1]];
}
cout << r << endl;
for (int i : s)
cerr << i << " ";
cerr << endl;
} | 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 <typename T> void view(const std::vector<std::vector<T>> &vv) {
for (const auto &v : vv) {
view(v);
}
}
#pragma endregion
int main() {
int n, k;
cin >> n >> k;
vector<int> a(n);
vector<int> sum(n + 1, 0);
rep(i, n) {
cin >> a[i];
a[i]--;
sum[i + 1] = (sum[i] + a[i]) % k;
}
vector<int> dp(k, 0);
queue<int> q;
ll ans = 0;
for (int i = 0; i <= n; ++i) {
int s = sum[i];
ans += dp[s];
dp[s]++;
q.push(s);
if (q.size() == k) {
dp[q.front()]--;
q.pop();
}
}
cout << ans << endl;
return 0;
}
| #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 <typename T> void view(const std::vector<std::vector<T>> &vv) {
for (const auto &v : vv) {
view(v);
}
}
#pragma endregion
int main() {
int n, k;
cin >> n >> k;
vector<int> a(n);
vector<int> sum(n + 1, 0);
rep(i, n) {
cin >> a[i];
a[i]--;
sum[i + 1] = (sum[i] + a[i]) % k;
}
map<int, int> dp;
queue<int> q;
ll ans = 0;
for (int i = 0; i <= n; ++i) {
int s = sum[i];
ans += dp[s];
dp[s]++;
q.push(s);
if (q.size() == k) {
dp[q.front()]--;
q.pop();
}
}
cout << ans << endl;
return 0;
}
| 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 long int ans = 0;
vector<int> rem(k);
queue<int> q;
for (int i = 0; i < n + 1; i++) {
ans += rem[a[i]];
rem[a[i]] += 1;
q.push(a[i]);
if (q.size() == k) {
rem[q.front()] -= 1;
q.pop();
}
}
cout << ans << endl;
return 0;
} | #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 long int ans = 0;
map<int, int> rem;
queue<int> q;
for (int i = 0; i < n + 1; i++) {
ans += rem[a[i]];
rem[a[i]] += 1;
q.push(a[i]);
if (q.size() == k) {
rem[q.front()] -= 1;
q.pop();
}
}
cout << ans << endl;
return 0;
} | 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 <unistd.h>
#include <unordered_map>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<vvl> vvvl;
typedef vector<vvvl> vvvvl;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<bool> vb;
typedef vector<vector<bool>> vvb;
typedef vector<vvb> vvvb;
typedef vector<vvvb> vvvvb;
typedef vector<string> vs;
typedef vector<vs> vvs;
typedef vector<vvs> vvvs;
typedef vector<char> vc;
typedef vector<vector<char>> vvc;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef vector<vvd> vvvd;
typedef pair<ll, ll> PL;
typedef vector<PL> vpl;
typedef vector<vector<PL>> vvpl;
typedef vector<vvpl> vvvpl;
typedef pair<ll, PL> TL;
typedef vector<TL> vtl;
typedef vector<vtl> vvtl;
const int INF = 1001001001;
const ll LINF = 1e18;
const double pi = 3.1415926535897932;
const string endstr = "\n";
#define FOR(i, a, b) for (ll i = (a); i < b; i++)
#define RFOR(i, a, b) for (ll i = (a); i > b; i--)
#define rep(i, n) for (ll i = 0; i < n; i++)
#define rrep(i, n) for (ll i = n - 1; i > -1; i--)
#define FORMAP(it, m) for (auto it = m.begin(); it != m.end(); it++)
#define ff first
#define ss second
#define pb push_back
#define epb emplace_back
#define ALL(X) (X).begin(), (X).end()
template <typename T> T gcd(T a, T b) { return (a == 0) ? b : gcd(b % a, a); }
template <typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
bool p_comp_fs(const PL p1, const PL p2) { return p1.first < p2.first; };
bool p_comp_fg(const PL p1, const PL p2) { return p1.first > p2.first; };
bool p_comp_ss(const PL p1, const PL p2) { return p1.second < p2.second; };
bool p_comp_sg(const PL p1, const PL p2) { return p1.second > p2.second; };
template <typename T> vector<T> uniquen(vector<T> vec) {
sort(ALL(vec));
vec.erase(unique(vec.begin(), vec.end()), vec.end());
return vec;
}
inline ll popcnt(ll x) { return __builtin_popcountll((unsigned long long)x); };
template <class T> bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
// friend bool operator<(const stc& lhs, const stc& rhs){
// return std::tie(lhs.l, lhs.r) < std::tie(rhs.l, rhs.r);
// }
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
ll N, K;
cin >> N >> K;
vl A(N);
rep(i, N) {
cin >> A[i];
A[i]--;
}
vl S(N + 1, 0);
rep(i, N) S[i + 1] = (A[i] + S[i]) % K;
ll idx = 0;
ll ans = 0;
map<ll, ll> m;
rep(i, K) m[S[i]]++;
while (idx < N) {
// cerr << m[S[idx]]-1 << endstr;
ans += m[S[idx]] - 1;
if (idx + K <= N)
m[S[idx + K]]++;
m[S[idx]]--;
idx++;
}
cout << ans << endstr;
return 0;
}
| #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 <unistd.h>
#include <unordered_map>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<vvl> vvvl;
typedef vector<vvvl> vvvvl;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<bool> vb;
typedef vector<vector<bool>> vvb;
typedef vector<vvb> vvvb;
typedef vector<vvvb> vvvvb;
typedef vector<string> vs;
typedef vector<vs> vvs;
typedef vector<vvs> vvvs;
typedef vector<char> vc;
typedef vector<vector<char>> vvc;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef vector<vvd> vvvd;
typedef pair<ll, ll> PL;
typedef vector<PL> vpl;
typedef vector<vector<PL>> vvpl;
typedef vector<vvpl> vvvpl;
typedef pair<ll, PL> TL;
typedef vector<TL> vtl;
typedef vector<vtl> vvtl;
const int INF = 1001001001;
const ll LINF = 1e18;
const double pi = 3.1415926535897932;
const string endstr = "\n";
#define FOR(i, a, b) for (ll i = (a); i < b; i++)
#define RFOR(i, a, b) for (ll i = (a); i > b; i--)
#define rep(i, n) for (ll i = 0; i < n; i++)
#define rrep(i, n) for (ll i = n - 1; i > -1; i--)
#define FORMAP(it, m) for (auto it = m.begin(); it != m.end(); it++)
#define ff first
#define ss second
#define pb push_back
#define epb emplace_back
#define ALL(X) (X).begin(), (X).end()
template <typename T> T gcd(T a, T b) { return (a == 0) ? b : gcd(b % a, a); }
template <typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
bool p_comp_fs(const PL p1, const PL p2) { return p1.first < p2.first; };
bool p_comp_fg(const PL p1, const PL p2) { return p1.first > p2.first; };
bool p_comp_ss(const PL p1, const PL p2) { return p1.second < p2.second; };
bool p_comp_sg(const PL p1, const PL p2) { return p1.second > p2.second; };
template <typename T> vector<T> uniquen(vector<T> vec) {
sort(ALL(vec));
vec.erase(unique(vec.begin(), vec.end()), vec.end());
return vec;
}
inline ll popcnt(ll x) { return __builtin_popcountll((unsigned long long)x); };
template <class T> bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
// friend bool operator<(const stc& lhs, const stc& rhs){
// return std::tie(lhs.l, lhs.r) < std::tie(rhs.l, rhs.r);
// }
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
ll N, K;
cin >> N >> K;
vl A(N);
rep(i, N) {
cin >> A[i];
A[i]--;
}
vl S(N + 1, 0);
rep(i, N) S[i + 1] = (A[i] + S[i]) % K;
ll idx = 0;
ll ans = 0;
map<ll, ll> m;
rep(i, min(K, N + 1)) m[S[i]]++;
while (idx < N) {
// cerr << m[S[idx]]-1 << endstr;
ans += m[S[idx]] - 1;
if (idx + K <= N)
m[S[idx + K]]++;
m[S[idx]]--;
idx++;
}
cout << ans << endstr;
return 0;
}
| 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 CHABS(a) a = std::abs(a)
#define COUT(a) std::cout << a << std::endl
#define CERR(a) std::cerr << a << std::endl
#define FOR(n) for (lli i = 0; i < n; i++)
using namespace std;
using lli = long long int;
using pll = pair<lli, lli>;
using tlll = tuple<lli, lli, lli>;
using vll = vector<lli>;
lli mod197 = 1000000007LL;
lli INF = 10000000000000;
// ax + by = gcd(a,b) 最大公約数
template <typename T> T extgcd(T a, T b, T &x, T &y) {
T d = a;
if (b != 0) {
d = extgcd(b, a % b, y, x);
y -= (a / b) * x;
} else {
x = 1;
y = 0;
}
return d;
}
lli a[200002] = {};
lli ruiseki[200002] = {};
int main(void) {
lli n, k;
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
ruiseki[i] += a[i];
ruiseki[i + 1] += ruiseki[i];
ruiseki[i] = (ruiseki[i] - i + k) % k;
// cerr << ruiseki[i] << " ";
}
// cerr << endl;
map<lli, lli> m;
m[1]++;
lli sum = 0;
for (lli i = 0; i < k; i++) {
if (i == k - 1) {
m[1]--;
}
// ここで尺取りを使う
m[ruiseki[i]]++;
sum += m[ruiseki[i]] - 1;
// cerr << sum << " ";
}
for (lli i = k; i < n; i++) {
m[ruiseki[i - k]]--;
m[ruiseki[i]]++;
sum += m[ruiseki[i]] - 1;
// cerr << sum << " ";
}
// cerr << endl;
cout << sum << endl;
return 0;
} | #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 CHABS(a) a = std::abs(a)
#define COUT(a) std::cout << a << std::endl
#define CERR(a) std::cerr << a << std::endl
#define FOR(n) for (lli i = 0; i < n; i++)
using namespace std;
using lli = long long int;
using pll = pair<lli, lli>;
using tlll = tuple<lli, lli, lli>;
using vll = vector<lli>;
lli mod197 = 1000000007LL;
lli INF = 10000000000000;
// ax + by = gcd(a,b) 最大公約数
template <typename T> T extgcd(T a, T b, T &x, T &y) {
T d = a;
if (b != 0) {
d = extgcd(b, a % b, y, x);
y -= (a / b) * x;
} else {
x = 1;
y = 0;
}
return d;
}
lli a[200002] = {};
lli ruiseki[200002] = {};
int main(void) {
lli n, k;
cin >> n >> k;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
for (int i = 0; i < n; i++) {
ruiseki[i] += a[i];
ruiseki[i + 1] += ruiseki[i];
ruiseki[i] = (ruiseki[i] - i + k) % k;
// cerr << ruiseki[i] << " ";
}
// cerr << endl;
map<lli, lli> m;
m[1]++;
lli sum = 0;
for (lli i = 0; i < min(k, n); i++) {
if (i == k - 1) {
m[1]--;
}
// ここで尺取りを使う
m[ruiseki[i]]++;
sum += m[ruiseki[i]] - 1;
// cerr << sum << " ";
}
for (lli i = k; i < n; i++) {
m[ruiseki[i - k]]--;
m[ruiseki[i]]++;
sum += m[ruiseki[i]] - 1;
// cerr << sum << " ";
}
// cerr << endl;
cout << sum << endl;
return 0;
} | 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; i++) {
sum.push_back(sum[sum.size() - 1] + A[i]);
}
ll ans = 0;
ll tmp[200005];
tmp[0] = 0;
for (int i = 0; i < N; i++) {
tmp[i + 1] = (sum[i] - (i + 1)) % K;
}
map<ll, ll> cnt;
ll las = K - 1;
for (int i = 0; i <= las; i++) {
cnt[tmp[i]]++;
}
for (int i = 0; i <= N; i++) {
ans += cnt[tmp[i]] - 1;
// cout << cnt[tmp[i]] << endl;
cnt[tmp[i]]--;
las++;
if (las <= N) {
cnt[tmp[las]]++;
}
}
cout << ans << endl;
return 0;
} | #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; i++) {
sum.push_back(sum[sum.size() - 1] + A[i]);
}
ll ans = 0;
ll tmp[200005];
tmp[0] = 0;
for (int i = 0; i < N; i++) {
tmp[i + 1] = (sum[i] - (i + 1)) % K;
}
map<ll, ll> cnt;
ll las = K - 1;
for (int i = 0; i <= min(las, N); i++) {
cnt[tmp[i]]++;
}
for (int i = 0; i <= N; i++) {
ans += cnt[tmp[i]] - 1;
// cout << cnt[tmp[i]] << endl;
cnt[tmp[i]]--;
las++;
if (las <= N) {
cnt[tmp[las]]++;
}
}
cout << ans << endl;
return 0;
} | 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, i##len = (int)(n); i < i##len; ++i)
#define rrep(i, a, n) for(int i = (int)(n - 1); i >= a; --i)
#define sz(c) ((int)c.size())
#define contains(c, x) (c.find(x) != end(c))
#define inseg(l, x, r) ((l) <= (x) && (x) < (r))
#define dump(...)
#define pb push_back
#define eb emplace_back
#define _ 0
const signed INF_ = 1001001001; const long long INF = 1001001001001001001LL;
const int DX[9] = {0,1,0,-1,1,1,-1,-1,0}, DY[9] = {-1,0,1,0,-1,1,1,-1,0};
template<class T> ostream& operator<<(ostream &os, const vector<T> &v) {
for (auto i = begin(v); i != end(v); i++) os<<*i<<(i==end(v)-1?"":" ");return os;}
template<class T> istream& operator>>(istream &is, vector<T> &v) {
for (auto i = begin(v); i != end(v); i++) is>>*i;return is;}
template<class T,class U> istream& operator>>(istream &is, pair<T,U> &p) {
is>>p.first>>p.second;return is;}
template<class T, class U> bool chmax(T &a, const U &b){return a<b?a=b,1:0;}
template<class T, class U> bool chmin(T &a, const U &b){return a>b?a=b,1:0;}
template <class T> void psum(T& c) {partial_sum(begin(c), end(c), begin(c));}
template<class T> using heap = priority_queue<T, deque<T>, greater<T>>;
struct before_main_function {
before_main_function() {
cin.tie(nullptr); ios::sync_with_stdio(0);
cout << setprecision(15) << fixed;
}
} before_main_function;
// clang-format on
//------------------8<------------------------------------8<--------------------
signed main() {
int N, K;
cin >> N >> K;
vi A(N);
cin >> A;
vi S = A;
psum(S);
dump(S);
int ans = 0;
map<int, int> cnt;
vi lim(N, -1);
cnt[1] = 1;
lim[-1 + K] = 1;
rep(i, 0, N) {
dump(i);
if (lim[i] != -1) {
dump(lim[i]);
cnt[lim[i]]--;
}
int x = (S[i] - i + K) % K;
dump(x, cnt[x]);
ans += cnt[x];
cnt[x]++;
if (i + K < N)
lim[i + K] = x;
}
cout << ans << endl;
return (0 ^ _ ^ 0);
}
| // 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, i##len = (int)(n); i < i##len; ++i)
#define rrep(i, a, n) for(int i = (int)(n - 1); i >= a; --i)
#define sz(c) ((int)c.size())
#define contains(c, x) (c.find(x) != end(c))
#define inseg(l, x, r) ((l) <= (x) && (x) < (r))
#define dump(...)
#define pb push_back
#define eb emplace_back
#define _ 0
const signed INF_ = 1001001001; const long long INF = 1001001001001001001LL;
const int DX[9] = {0,1,0,-1,1,1,-1,-1,0}, DY[9] = {-1,0,1,0,-1,1,1,-1,0};
template<class T> ostream& operator<<(ostream &os, const vector<T> &v) {
for (auto i = begin(v); i != end(v); i++) os<<*i<<(i==end(v)-1?"":" ");return os;}
template<class T> istream& operator>>(istream &is, vector<T> &v) {
for (auto i = begin(v); i != end(v); i++) is>>*i;return is;}
template<class T,class U> istream& operator>>(istream &is, pair<T,U> &p) {
is>>p.first>>p.second;return is;}
template<class T, class U> bool chmax(T &a, const U &b){return a<b?a=b,1:0;}
template<class T, class U> bool chmin(T &a, const U &b){return a>b?a=b,1:0;}
template <class T> void psum(T& c) {partial_sum(begin(c), end(c), begin(c));}
template<class T> using heap = priority_queue<T, deque<T>, greater<T>>;
struct before_main_function {
before_main_function() {
cin.tie(nullptr); ios::sync_with_stdio(0);
cout << setprecision(15) << fixed;
}
} before_main_function;
// clang-format on
//------------------8<------------------------------------8<--------------------
signed main() {
int N, K;
cin >> N >> K;
vi A(N);
cin >> A;
vi S = A;
psum(S);
dump(S);
int ans = 0;
map<int, int> cnt;
vi lim(N, -1);
cnt[1] = 1;
if (-1 + K < N)
lim[-1 + K] = 1;
rep(i, 0, N) {
dump(i);
if (lim[i] != -1) {
dump(lim[i]);
cnt[lim[i]]--;
}
int x = (S[i] - i + K) % K;
dump(x, cnt[x]);
ans += cnt[x];
cnt[x]++;
if (i + K < N)
lim[i + K] = x;
}
cout << ans << endl;
return (0 ^ _ ^ 0);
}
| 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] + a) % k;
ans += (m[(sum[i] - (i) % k + k) % k]);
m[(sum[i] - (i) % k + k) % k]++;
if (i - k + 1 >= 0) {
m[(sum[i - k + 1] - (i - k + 1) % k + k) % k]--;
}
}
if (k == 1) {
cout << "0\n";
} else
cout << ans << "\n";
}
| #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] + a) % k;
ans += (m[(sum[i] - (i) % k + k) % k]);
m[(sum[i] - (i) % k + k) % k]++;
if (i - k + 1 >= 0) {
m[(sum[i - k + 1] - (i - k + 1) % k + k) % k]--;
}
}
if (k == 1) {
cout << "0\n";
} else
cout << ans << "\n";
}
| 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() {
ll n, k, ans = 0, su = 0;
cin >> n >> k;
vector<ll> a(k, 0), b(n), r(n);
rep(i, n) {
r[i] = su;
cin >> b[i];
b[i] %= k;
ll u = (b[i] - 1 + k) % k;
if (i + 1 >= k)
a[(k - r[i + 1 - k]) % k]--;
if (u == 0)
ans++;
ans += a[abs(2 * k - u - su) % k];
a[(k - su) % k]++;
su = (su + u) % k;
}
cout << ans << endl;
}
| #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() {
ll n, k, ans = 0, su = 0;
cin >> n >> k;
map<ll, ll> a;
vector<ll> b(n), r(n);
rep(i, n) {
r[i] = su;
cin >> b[i];
b[i] %= k;
ll u = (b[i] - 1 + k) % k;
if (i + 1 >= k)
a[(k - r[i + 1 - k]) % k]--;
if (u == 0)
ans++;
ans += a[abs(2 * k - u - su) % k];
a[(k - su) % k]++;
su = (su + u) % k;
}
cout << ans << endl;
}
| 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 GCC optimize("unroll-loops,no-stack-protector")
// order_of_key #of elements less than x
// find_by_order kth element
typedef long long ll;
#define ld double
#define pii pair<ll, ll>
#define f first
#define s second
#define pb push_back
#define REP(i, n) for (int i = 0; i < n; i++)
#define REP1(i, n) for (int i = 1; i <= n; i++)
#define FILL(n, x) memset(n, x, sizeof(n))
#define ALL(_a) _a.begin(), _a.end()
#define sz(x) (int)x.size()
const ll maxn = 1e5 + 5;
const ll maxlg = __lg(maxn) + 2;
const ll INF64 = 4e18;
const int INF = 0x3f3f3f3f;
const ll MOD = ll(1e9 + 7);
const ld PI = acos(-1);
const ld eps = 1e-9;
#define lowb(x) x & (-x)
#define MNTO(x, y) x = min(x, (__typeof__(x))y)
#define MXTO(x, y) x = max(x, (__typeof__(x))y)
#define SORT_UNIQUE(c) \
(sort(c.begin(), c.end()), \
c.resize(distance(c.begin(), unique(c.begin(), c.end()))))
#define GET_POS(c, x) (lower_bound(c.begin(), c.end(), x) - c.begin())
ll mult(ll a, ll b) { return ((a % MOD) * (b % MOD)) % MOD; }
ll mypow(ll a, ll b, ll MOD) {
if (b <= 0)
return 1;
ll res = 1LL;
while (b) {
if (b & 1)
res = res * a % MOD;
a = a * a % MOD;
b >>= 1;
}
return res;
}
int pre[maxn];
map<int, int> m;
int32_t main() {
int n, k;
cin >> n >> k;
ll ans = 0;
m[0]++;
for (int i = 1, x; i <= n; i++) {
cin >> x;
pre[i] = ((pre[i - 1] + x - 1) % k + k) % k;
if (i >= k)
m[pre[i - k]]--;
ans += m[pre[i]];
m[pre[i]]++;
}
cout << ans << endl;
} | /*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 GCC optimize("unroll-loops,no-stack-protector")
// order_of_key #of elements less than x
// find_by_order kth element
typedef long long ll;
#define ld double
#define pii pair<ll, ll>
#define f first
#define s second
#define pb push_back
#define REP(i, n) for (int i = 0; i < n; i++)
#define REP1(i, n) for (int i = 1; i <= n; i++)
#define FILL(n, x) memset(n, x, sizeof(n))
#define ALL(_a) _a.begin(), _a.end()
#define sz(x) (int)x.size()
const ll maxn = 2e5 + 5;
const ll maxlg = __lg(maxn) + 2;
const ll INF64 = 4e18;
const int INF = 0x3f3f3f3f;
const ll MOD = ll(1e9 + 7);
const ld PI = acos(-1);
const ld eps = 1e-9;
#define lowb(x) x & (-x)
#define MNTO(x, y) x = min(x, (__typeof__(x))y)
#define MXTO(x, y) x = max(x, (__typeof__(x))y)
#define SORT_UNIQUE(c) \
(sort(c.begin(), c.end()), \
c.resize(distance(c.begin(), unique(c.begin(), c.end()))))
#define GET_POS(c, x) (lower_bound(c.begin(), c.end(), x) - c.begin())
ll mult(ll a, ll b) { return ((a % MOD) * (b % MOD)) % MOD; }
ll mypow(ll a, ll b, ll MOD) {
if (b <= 0)
return 1;
ll res = 1LL;
while (b) {
if (b & 1)
res = res * a % MOD;
a = a * a % MOD;
b >>= 1;
}
return res;
}
int pre[maxn];
map<int, int> m;
int32_t main() {
int n, k;
cin >> n >> k;
ll ans = 0;
m[0]++;
for (int i = 1, x; i <= n; i++) {
cin >> x;
pre[i] = ((pre[i - 1] + x - 1) % k + k) % k;
if (i >= k)
m[pre[i - k]]--;
ans += m[pre[i]];
m[pre[i]]++;
}
cout << ans << endl;
} | 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);
cin.tie(NULL);
// #ifndef ONLINE_JUDGE
// freopen ("INPUT.txt" , "r" , stdin);
// freopen ("OUTPUT.txt" , "w" , stdout);
// #endif
// -------------------------------------Code starts
// here---------------------------------------------------------------------
int n, k;
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> a[i];
a[i]--;
pre[i] = (pre[i - 1] + a[i]) % k;
// cout<<pre[i]<<" ";
}
int ans = 0;
mm[0]++;
for (int i = 1; i <= k - 1; i++) {
ans += mm[pre[i]];
mm[pre[i]]++;
}
for (int i = k; i <= n; i++) {
mm[pre[i - k]]--;
ans += mm[pre[i]];
mm[pre[i]]++;
}
cout << ans;
// -------------------------------------Code ends
// here------------------------------------------------------------------
clock_t clk;
clk = clock();
clk = clock() - clk;
cerr << fixed << setprecision(6) << "Time: " << ((double)clk) / CLOCKS_PER_SEC
<< "\n";
return 0;
} | #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);
cin.tie(NULL);
// #ifndef ONLINE_JUDGE
// freopen ("INPUT.txt" , "r" , stdin);
// freopen ("OUTPUT.txt" , "w" , stdout);
// #endif
// -------------------------------------Code starts
// here---------------------------------------------------------------------
int n, k;
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> a[i];
a[i]--;
pre[i] = (pre[i - 1] + a[i]) % k;
// cout<<pre[i]<<" ";
}
int ans = 0;
mm[0]++;
for (int i = 1; i <= min(k - 1, n); i++) {
ans += mm[pre[i]];
mm[pre[i]]++;
}
for (int i = k; i <= n; i++) {
mm[pre[i - k]]--;
ans += mm[pre[i]];
mm[pre[i]]++;
}
cout << ans;
// -------------------------------------Code ends
// here------------------------------------------------------------------
clock_t clk;
clk = clock();
clk = clock() - clk;
cerr << fixed << setprecision(6) << "Time: " << ((double)clk) / CLOCKS_PER_SEC
<< "\n";
return 0;
} | 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) << " "
#define ce(x) cerr << (x) << "\n"
#define cesp(x) cerr << (x) << " "
#define pb push_back
#define mp make_pair
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
#define Would
#define you
#define please
const int cm = 1 << 17;
char cn[cm], *ci = cn + cm, ct;
inline char getcha() {
if (ci - cn == cm) {
fread_unlocked(cn, 1, cm, stdin);
ci = cn;
}
return *ci++;
}
inline int getint() {
int A = 0;
if (ci - cn + 16 > cm)
while ((ct = getcha()) >= '0')
A = A * 10 + ct - '0';
else
while ((ct = *ci++) >= '0')
A = A * 10 + ct - '0';
return A;
}
ll tmp[200001];
void pakuri_sort(int N, ll A[]) {
const int b = 8;
for (int k = 4; k < 8; k++) {
int kazu[1 << b] = {}, kazu2[1 << b] = {};
rep(i, N) kazu[A[i] >> k * b & ((1 << b) - 1)]++;
rep(i, (1 << b) - 1) kazu[i + 1] += kazu[i];
for (int i = N - 1; i >= 0; i--)
tmp[--kazu[A[i] >> k * b & ((1 << b) - 1)]] = A[i];
k++;
rep(i, N) kazu2[tmp[i] >> k * b & ((1 << b) - 1)]++;
rep(i, (1 << b) - 1) kazu2[i + 1] += kazu2[i];
for (int i = N - 1; i >= 0; i--)
A[--kazu2[tmp[i] >> k * b & ((1 << b) - 1)]] = tmp[i];
}
}
int main() {
// cin.tie(0);
// ios::sync_with_stdio(false);
const int m = (1 << 20) - 1;
int N = getint(), K = getint();
ll A[200001];
A[0] = 0;
rep(i, N) {
ll kari = (A[i] >> 32) + (getint() - 1) % K;
if (kari >= K)
kari -= K;
A[i + 1] = (kari << 32) + i + 1;
}
pakuri_sort(N + 1, A);
int kazu = 0;
int mae = A[0] >> 32;
rep(i, N + 1) {
if (mae != A[i] >> 32) {
kazu++;
mae = A[i] >> 32;
}
tmp[A[i] & m] = kazu;
}
rep(i, N + 1) A[i] = 0;
ll kotae = 0;
rep(i, K - 1) {
kotae += A[tmp[i]];
A[tmp[i]]++;
}
for (int i = K - 1; i <= N; i++) {
kotae += A[tmp[i]];
A[tmp[i]]++;
A[tmp[i - K + 1]]--;
}
printf("%lld", kotae);
Would you please return 0;
} | #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) << " "
#define ce(x) cerr << (x) << "\n"
#define cesp(x) cerr << (x) << " "
#define pb push_back
#define mp make_pair
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
#define Would
#define you
#define please
const int cm = 1 << 17;
char cn[cm], *ci = cn + cm, ct;
inline char getcha() {
if (ci - cn == cm) {
fread_unlocked(cn, 1, cm, stdin);
ci = cn;
}
return *ci++;
}
inline int getint() {
int A = 0;
if (ci - cn + 16 > cm)
while ((ct = getcha()) >= '0')
A = A * 10 + ct - '0';
else
while ((ct = *ci++) >= '0')
A = A * 10 + ct - '0';
return A;
}
ll tmp[200001];
void pakuri_sort(int N, ll A[]) {
const int b = 8;
for (int k = 4; k < 8; k++) {
int kazu[1 << b] = {}, kazu2[1 << b] = {};
rep(i, N) kazu[A[i] >> k * b & ((1 << b) - 1)]++;
rep(i, (1 << b) - 1) kazu[i + 1] += kazu[i];
for (int i = N - 1; i >= 0; i--)
tmp[--kazu[A[i] >> k * b & ((1 << b) - 1)]] = A[i];
k++;
rep(i, N) kazu2[tmp[i] >> k * b & ((1 << b) - 1)]++;
rep(i, (1 << b) - 1) kazu2[i + 1] += kazu2[i];
for (int i = N - 1; i >= 0; i--)
A[--kazu2[tmp[i] >> k * b & ((1 << b) - 1)]] = tmp[i];
}
}
int main() {
// cin.tie(0);
// ios::sync_with_stdio(false);
const int m = (1 << 20) - 1;
int N = getint(), K = getint();
ll A[200001];
A[0] = 0;
rep(i, N) {
ll kari = (A[i] >> 32) + (getint() - 1) % K;
if (kari >= K)
kari -= K;
A[i + 1] = (kari << 32) + i + 1;
}
pakuri_sort(N + 1, A);
int kazu = 0;
int mae = A[0] >> 32;
rep(i, N + 1) {
if (mae != A[i] >> 32) {
kazu++;
mae = A[i] >> 32;
}
tmp[A[i] & m] = kazu;
}
rep(i, N + 1) A[i] = 0;
ll kotae = 0;
rep(i, min(N + 1, K - 1)) {
kotae += A[tmp[i]];
A[tmp[i]]++;
}
for (int i = K - 1; i <= N; i++) {
kotae += A[tmp[i]];
A[tmp[i]]++;
A[tmp[i - K + 1]]--;
}
printf("%lld", kotae);
Would you please return 0;
} | 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 >> k;
vector<int> v(n + 1);
map<int, int> m;
m[0]++;
int sum = 0;
int ans = 0;
for (int i = 1; i <= n; i++) {
int x;
cin >> x;
if (i >= k) {
m[v[i - k]]--;
}
sum += x;
sum %= k;
int t = sum - i;
while (t < 0)
t += k;
t %= k;
ans += m[t];
v[i] = t;
m[t]++;
}
cout << ans << "\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 >> k;
vector<int> v(n + 1);
map<int, int> m;
m[0]++;
int sum = 0;
int ans = 0;
for (int i = 1; i <= n; i++) {
int x;
cin >> x;
if (i >= k) {
m[v[i - k]]--;
}
sum += x;
sum %= k;
int t = sum - i;
t += (i * k);
t %= k;
ans += m[t];
v[i] = t;
m[t]++;
}
cout << ans << "\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++) {
scanf("%d", &A[i]);
A[i] = (A[i] - 1 + k) % k;
}
S[0] = A[0];
for (int i = 1; i < n; i++) {
S[i] = S[i - 1] + A[i];
S[i] %= k;
}
for (int i = 0; i < k - 1; i++)
s[S[i]]++;
int req = 0;
LL ans = 0;
for (int i = 0; i < n; i++) {
ans += s[req];
s[S[i]]--;
if (i + k - 1 < n)
s[S[i + k - 1]]++;
req = (req + A[i]) % k;
}
printf("%lld\n", ans);
return 0;
} | #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++) {
scanf("%d", &A[i]);
A[i] = (A[i] - 1 + k) % k;
}
S[0] = A[0];
for (int i = 1; i < n; i++) {
S[i] = S[i - 1] + A[i];
S[i] %= k;
}
for (int i = 0; i < min(n, k - 1); i++)
s[S[i]]++;
int req = 0;
LL ans = 0;
for (int i = 0; i < n; i++) {
ans += s[req];
s[S[i]]--;
if (i + k - 1 < n)
s[S[i + k - 1]]++;
req = (req + A[i]) % k;
}
printf("%lld\n", ans);
return 0;
} | 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) {
cerr << " " << head;
debug_impl(tail...);
}
#ifndef STOPIT
#define debug(...) \
do { \
cerr << boolalpha << "[" << #__VA_ARGS__ << "]:"; \
debug_impl(__VA_ARGS__); \
cerr << std::noboolalpha; \
} while (false)
#else
#define debug(...) \
{}
#endif
template <typename Container, typename Value = typename Container::value_type,
enable_if_t<!is_same<Container, string>::value, nullptr_t> = nullptr>
istream &operator>>(istream &is, Container &v) {
for (auto &x : v) {
is >> x;
}
return is;
}
template <typename Container, typename Value = typename Container::value_type,
enable_if_t<!is_same<Container, string>::value, nullptr_t> = nullptr>
ostream &operator<<(ostream &os, Container const &v) {
os << "{";
for (auto it = v.begin(); it != v.end(); it++) {
os << (it != v.begin() ? "," : "") << *it;
}
return os << "}";
}
int main() {
// read input
ll N, K;
cin >> N >> K;
vector<ll> value(N + 1, 0);
rep(i, 0, N) {
// read
cin >> value[i + 1];
// minus one
--value[i + 1];
// cumulative sum
value[i + 1] += value[i];
// take modulo
value[i + 1] %= K;
}
vector<ll> cnts(K, 0);
ll res = 0;
int left = 0;
int right = 1;
while (left < N + 1) {
// push to cnts
while (right < N + 1 and right - left < K)
++cnts[value[right++]];
// count
// cout << left << ':' << value[left] << ' ' << cnts[value[left]] << endl;
res += cnts[value[left]];
// pop que
// cout << left << ' ' << right << ' ' << res << endl;
++left;
--cnts[value[left]];
}
cout << res << endl;
return 0;
}
| // #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) {
cerr << " " << head;
debug_impl(tail...);
}
#ifndef STOPIT
#define debug(...) \
do { \
cerr << boolalpha << "[" << #__VA_ARGS__ << "]:"; \
debug_impl(__VA_ARGS__); \
cerr << std::noboolalpha; \
} while (false)
#else
#define debug(...) \
{}
#endif
template <typename Container, typename Value = typename Container::value_type,
enable_if_t<!is_same<Container, string>::value, nullptr_t> = nullptr>
istream &operator>>(istream &is, Container &v) {
for (auto &x : v) {
is >> x;
}
return is;
}
template <typename Container, typename Value = typename Container::value_type,
enable_if_t<!is_same<Container, string>::value, nullptr_t> = nullptr>
ostream &operator<<(ostream &os, Container const &v) {
os << "{";
for (auto it = v.begin(); it != v.end(); it++) {
os << (it != v.begin() ? "," : "") << *it;
}
return os << "}";
}
int main() {
// read input
ll N, K;
cin >> N >> K;
vector<ll> value(N + 1, 0);
rep(i, 0, N) {
// read
cin >> value[i + 1];
// minus one
--value[i + 1];
// cumulative sum
value[i + 1] += value[i];
// take modulo
value[i + 1] %= K;
}
unordered_map<int, int> cnts;
ll res = 0;
int left = 0;
int right = 1;
while (left < N + 1) {
// push to cnts
while (right < N + 1 and right - left < K)
++cnts[value[right++]];
// count
// cout << left << ':' << value[left] << ' ' << cnts[value[left]] << endl;
res += cnts[value[left]];
// pop que
// cout << left << ' ' << right << ' ' << res << endl;
++left;
--cnts[value[left]];
}
cout << res << endl;
return 0;
}
| 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 <= n; ++i) {
int x;
cin >> x;
x %= k;
s[i] = (s[i - 1] + x) % k;
int t = s[i] - i;
for (; t < 0; t += k)
;
int pos = 0, sz = a[t].size(), sh;
for (; pos < sz; ++pos)
if (i - (sh = a[t][pos]) < k)
break;
ans += a[t].size() - pos;
while (pos--)
a[t].pop_front();
a[t].emplace_back(i);
}
cout << ans;
}
| #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 <= n; ++i) {
int x;
cin >> x;
x %= k;
s[i] = (s[i - 1] + x) % k;
int t = (s[i] - i + k * 200000ll) % k;
int pos = 0, sz = a[t].size(), sh;
for (; pos < sz; ++pos)
if (i - (sh = a[t][pos]) < k)
break;
ans += a[t].size() - pos;
while (pos--)
a[t].pop_front();
a[t].emplace_back(i);
}
cout << ans;
}
| 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 <= N; i++)
A[i] += A[i - 1], A[i] %= K;
map<ll, ll> Z;
for (int i = 0; i <= N; i++) {
if (Z.count(A[i])) {
num[Z[A[i]]].push_back(i);
} else {
Z.insert({A[i], i});
num[i].push_back(i);
}
}
ll ans = 0;
for (int i = 0; i <= N; i++) {
int js = num[i].size();
for (ll j = 0; j < js; j++) {
auto it = upper_bound(all(num[i]), num[i][j] - K);
ll dis = it - num[i].begin();
ans += j - dis;
}
}
cout << ans << endl;
} | #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 <= N; i++)
A[i] += A[i - 1], A[i] %= K;
map<ll, ll> Z;
for (int i = 0; i <= N; i++) {
if (Z.count(A[i])) {
num[Z[A[i]]].push_back(i);
} else {
Z.insert({A[i], i});
num[i].push_back(i);
}
}
ll ans = 0;
for (int i = 0; i <= N; i++) {
int js = num[i].size();
for (ll j = 0; j < js; j++) {
auto it = upper_bound(all(num[i]), num[i][j] - K);
ll dis = it - num[i].begin();
ans += j - dis;
}
}
cout << ans << endl;
} | 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]],
mp[s[i]]++;
}
printf("%lld\n", res);
return 0;
} | #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]],
mp[s[i]]++;
}
printf("%lld\n", res);
return 0;
} | 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) #VariableName
#define LOG(x) \
if (DEBUG) \
cout << TO_STRING(x) << "=" << x << " " << endl;
#define LOG2(x, y) \
if (DEBUG) \
cout << TO_STRING(x) << "=" << x << " " << TO_STRING(y) << "=" << y << endl;
#define LOG3(x, y, z) \
if (DEBUG) \
cout << TO_STRING(x) << "=" << x << " " << TO_STRING(y) << "=" << y << " " \
<< TO_STRING(z) << "=" << z << endl;
#define LOG4(w, x, y, z) \
if (DEBUG) \
cout << TO_STRING(w) << "=" << w << " " << TO_STRING(x) << "=" << x << " " \
<< TO_STRING(y) << "=" << y << " " << TO_STRING(z) << "=" << z \
<< endl;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
lli sum[200100];
void func(long long N, long long K, std::vector<long long> A) {
REP(i, 0, N) sum[i + 1] = sum[i] + A[i];
REP(i, 0, N + 1) {
sum[i] -= i;
sum[i] %= K;
}
map<lli, lli> cnt;
REP(i, 0, K) cnt[sum[i]]++;
lli ans = 0;
REP(i, 0, N + 1) {
lli now = sum[i];
lli c = cnt[sum[i]];
LOG3(i, now, c);
ans += (c - 1);
cnt[sum[i]]--;
if (i + K <= N)
cnt[sum[i + K]]++;
}
cout << ans << endl;
}
int main() {
// cout << fixed << setprecision(5);
long long N;
scanf("%lld", &N);
long long K;
scanf("%lld", &K);
std::vector<long long> A(N);
for (int i = 0; i < N; i++) {
scanf("%lld", &A[i]);
}
func(N, K, std::move(A));
return 0;
}
| #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) #VariableName
#define LOG(x) \
if (DEBUG) \
cout << TO_STRING(x) << "=" << x << " " << endl;
#define LOG2(x, y) \
if (DEBUG) \
cout << TO_STRING(x) << "=" << x << " " << TO_STRING(y) << "=" << y << endl;
#define LOG3(x, y, z) \
if (DEBUG) \
cout << TO_STRING(x) << "=" << x << " " << TO_STRING(y) << "=" << y << " " \
<< TO_STRING(z) << "=" << z << endl;
#define LOG4(w, x, y, z) \
if (DEBUG) \
cout << TO_STRING(w) << "=" << w << " " << TO_STRING(x) << "=" << x << " " \
<< TO_STRING(y) << "=" << y << " " << TO_STRING(z) << "=" << z \
<< endl;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
lli sum[200100];
void func(long long N, long long K, std::vector<long long> A) {
REP(i, 0, N) sum[i + 1] = sum[i] + A[i];
REP(i, 0, N + 1) {
sum[i] -= i;
sum[i] %= K;
}
map<lli, lli> cnt;
REP(i, 0, min(K, N + 1)) cnt[sum[i]]++;
lli ans = 0;
REP(i, 0, N + 1) {
lli now = sum[i];
lli c = cnt[sum[i]];
LOG3(i, now, c);
ans += (c - 1);
cnt[sum[i]]--;
if (i + K <= N)
cnt[sum[i + K]]++;
}
cout << ans << endl;
}
int main() {
// cout << fixed << setprecision(5);
long long N;
scanf("%lld", &N);
long long K;
scanf("%lld", &K);
std::vector<long long> A(N);
for (int i = 0; i < N; i++) {
scanf("%lld", &A[i]);
}
func(N, K, std::move(A));
return 0;
}
| 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++) {
if (r - l >= k) {
--v[(s[l] - l) % k];
++l;
}
ans += v[(s[r] - r) % k];
++v[(s[r] - r) % k];
}
cout << ans << endl;
return 0;
} | #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++) {
if (r - l >= k) {
--v[(s[l] - l) % k];
++l;
}
ans += v[(s[r] - r) % k];
++v[(s[r] - r) % k];
}
cout << ans << endl;
return 0;
} | 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] = (psum[i - 1] + A[i]) % K;
}
ll ans = 0ll;
mp[psum[0]]++;
for (i = 1; i <= N; ++i) {
if (i - K >= 0) {
mp[MOD(psum[i - K] - (i - K), K)]--;
}
ans += mp[MOD(psum[i] - i, K)];
mp[MOD(psum[i] - i, K)]++;
}
printf("%lld", ans);
return 0;
} | #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] = (psum[i - 1] + A[i]) % K;
}
ll ans = 0ll;
mp[psum[0]]++;
for (i = 1; i <= N; ++i) {
if (i - K >= 0) {
mp[MOD(psum[i - K] - (i - K), K)]--;
}
ans += mp[MOD(psum[i] - i, K)];
mp[MOD(psum[i] - i, K)]++;
}
printf("%lld", ans);
return 0;
} | 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; i++)
#define loopR(i, a, B) for (int i = a; i B; i--)
#define all(x) (x).begin(), (x).end()
#define allR(x) (x).rbegin(), (x).rend()
#define eb emplace_back
#define mp make_pair
#define fst first
#define snd second
#ifdef LOCAL
#define dump(...) \
cerr << "[" << __LINE__ << ":" << __FUNCTION__ << "] ", \
dump_impl(#__VA_ARGS__, __VA_ARGS__)
#define say(x) \
cerr << "[" << __LINE__ << ":" << __FUNCTION__ << "] " << x << endl;
#define debug if (1)
void dump_impl(const char *) { cerr << endl; }
template <class T, class... U>
void dump_impl(const char *s, T const &x, U const &...y) {
const char *o = "({[", *e = "]})";
for (int i = 0; *s != '\0'; cerr << *s++) {
if (count(o, o + 3, *s))
i++;
if (count(e, e + 3, *s))
i--;
if (!i && *s == ',')
break;
}
cerr << " = " << x;
if (*s == ',')
cerr << ", ", s++;
dump_impl(s, y...);
}
#else
#define dump(...)
#define say(x)
#define debug if (0)
#endif
using ll = long long;
using ld = long double;
#define int ll
#define double ld
template <class T> using pque_max = priority_queue<T>;
template <class T> using pque_min = priority_queue<T, vector<T>, greater<T>>;
template <class T, class = typename T::iterator,
class = typename enable_if<!is_same<T, string>::value>::type>
ostream &operator<<(ostream &os, T const &v) {
os << "{";
for (auto const &x : v)
os << " " << x;
return os << " }";
}
template <class T> istream &operator>>(istream &is, vector<T> &v) {
for (auto &x : v)
is >> x;
return is;
}
template <class T, class S>
ostream &operator<<(ostream &os, pair<T, S> const &p) {
return os << "(" << p.first << ", " << p.second << ")";
}
template <class T, class S> istream &operator>>(istream &is, pair<T, S> &p) {
return is >> p.first >> p.second;
}
template <size_t i, class T>
typename enable_if<i >= tuple_size<T>::value>::type output_tuple(ostream &,
T const &) {}
template <size_t i = 0, class T>
typename enable_if <
i<tuple_size<T>::value>::type output_tuple(ostream &os, T const &t) {
os << (i ? " " : "") << get<i>(t);
output_tuple<i + 1, T>(os, t);
}
template <class... T> ostream &operator<<(ostream &os, tuple<T...> const &t) {
return output_tuple(os, t), os;
}
struct IOSetup {
IOSetup() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
}
} iosetup;
template <class T, size_t d> struct vec_impl {
using type = vector<typename vec_impl<T, d - 1>::type>;
template <class... U> static type make_v(size_t n, U &&...x) {
return type(n, vec_impl<T, d - 1>::make_v(forward<U>(x)...));
}
};
template <class T> struct vec_impl<T, 0> {
using type = T;
static type make_v(T const &x = {}) { return x; }
};
template <class T, size_t d = 1> using vec = typename vec_impl<T, d>::type;
template <class T, size_t d = 1, class... Args> auto make_v(Args &&...args) {
return vec_impl<T, d>::make_v(forward<Args>(args)...);
}
template <class T> void quit(T const &x) {
cout << x << endl;
exit(0);
}
template <class T> constexpr bool chmin(T &x, T const &y) {
if (x > y) {
x = y;
return true;
}
return false;
}
template <class T> constexpr bool chmax(T &x, T const &y) {
if (x < y) {
x = y;
return true;
}
return false;
}
template <class It> constexpr auto sumof(It b, It e) {
return accumulate(b, e, typename iterator_traits<It>::value_type{});
}
const ll INF = (1LL << 62) - 1; // ~ 4.6e18
// <<<
int32_t main() {
int n, k;
cin >> n >> k;
vector<int> a(n);
cin >> a;
rep(i, n) a[i]--;
vector<int> sa(n + 1);
rep(i, n) sa[i + 1] = sa[i] + a[i];
rep(i, n + 1) sa[i] %= k;
vector<int> c(k);
loop(i, 1, <= min(n - 1, k - 1)) c[sa[i]]++;
dump(c);
int cnt = 0;
rep(i, n) {
cnt += c[sa[i]];
dump(i, c[sa[i]]);
if (i + k < n + 1)
c[sa[i + k]]++;
c[sa[i + 1]]--;
dump(c);
}
cout << cnt << endl;
}
| // >>> 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; i++)
#define loopR(i, a, B) for (int i = a; i B; i--)
#define all(x) (x).begin(), (x).end()
#define allR(x) (x).rbegin(), (x).rend()
#define eb emplace_back
#define mp make_pair
#define fst first
#define snd second
#ifdef LOCAL
#define dump(...) \
cerr << "[" << __LINE__ << ":" << __FUNCTION__ << "] ", \
dump_impl(#__VA_ARGS__, __VA_ARGS__)
#define say(x) \
cerr << "[" << __LINE__ << ":" << __FUNCTION__ << "] " << x << endl;
#define debug if (1)
void dump_impl(const char *) { cerr << endl; }
template <class T, class... U>
void dump_impl(const char *s, T const &x, U const &...y) {
const char *o = "({[", *e = "]})";
for (int i = 0; *s != '\0'; cerr << *s++) {
if (count(o, o + 3, *s))
i++;
if (count(e, e + 3, *s))
i--;
if (!i && *s == ',')
break;
}
cerr << " = " << x;
if (*s == ',')
cerr << ", ", s++;
dump_impl(s, y...);
}
#else
#define dump(...)
#define say(x)
#define debug if (0)
#endif
using ll = long long;
using ld = long double;
#define int ll
#define double ld
template <class T> using pque_max = priority_queue<T>;
template <class T> using pque_min = priority_queue<T, vector<T>, greater<T>>;
template <class T, class = typename T::iterator,
class = typename enable_if<!is_same<T, string>::value>::type>
ostream &operator<<(ostream &os, T const &v) {
os << "{";
for (auto const &x : v)
os << " " << x;
return os << " }";
}
template <class T> istream &operator>>(istream &is, vector<T> &v) {
for (auto &x : v)
is >> x;
return is;
}
template <class T, class S>
ostream &operator<<(ostream &os, pair<T, S> const &p) {
return os << "(" << p.first << ", " << p.second << ")";
}
template <class T, class S> istream &operator>>(istream &is, pair<T, S> &p) {
return is >> p.first >> p.second;
}
template <size_t i, class T>
typename enable_if<i >= tuple_size<T>::value>::type output_tuple(ostream &,
T const &) {}
template <size_t i = 0, class T>
typename enable_if <
i<tuple_size<T>::value>::type output_tuple(ostream &os, T const &t) {
os << (i ? " " : "") << get<i>(t);
output_tuple<i + 1, T>(os, t);
}
template <class... T> ostream &operator<<(ostream &os, tuple<T...> const &t) {
return output_tuple(os, t), os;
}
struct IOSetup {
IOSetup() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
}
} iosetup;
template <class T, size_t d> struct vec_impl {
using type = vector<typename vec_impl<T, d - 1>::type>;
template <class... U> static type make_v(size_t n, U &&...x) {
return type(n, vec_impl<T, d - 1>::make_v(forward<U>(x)...));
}
};
template <class T> struct vec_impl<T, 0> {
using type = T;
static type make_v(T const &x = {}) { return x; }
};
template <class T, size_t d = 1> using vec = typename vec_impl<T, d>::type;
template <class T, size_t d = 1, class... Args> auto make_v(Args &&...args) {
return vec_impl<T, d>::make_v(forward<Args>(args)...);
}
template <class T> void quit(T const &x) {
cout << x << endl;
exit(0);
}
template <class T> constexpr bool chmin(T &x, T const &y) {
if (x > y) {
x = y;
return true;
}
return false;
}
template <class T> constexpr bool chmax(T &x, T const &y) {
if (x < y) {
x = y;
return true;
}
return false;
}
template <class It> constexpr auto sumof(It b, It e) {
return accumulate(b, e, typename iterator_traits<It>::value_type{});
}
const ll INF = (1LL << 62) - 1; // ~ 4.6e18
// <<<
int32_t main() {
int n, k;
cin >> n >> k;
vector<int> a(n);
cin >> a;
rep(i, n) a[i]--;
vector<int> sa(n + 1);
rep(i, n) sa[i + 1] = sa[i] + a[i];
rep(i, n + 1) sa[i] %= k;
map<int, int> c;
loop(i, 1, <= min(n, k - 1)) c[sa[i]]++;
dump(c);
int cnt = 0;
rep(i, n) {
cnt += c[sa[i]];
dump(i, c[sa[i]]);
if (i + k < n + 1)
c[sa[i + k]]++;
c[sa[i + 1]]--;
dump(c);
}
cout << cnt << endl;
}
| 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;
}
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
int main() {
ll n, k;
cin >> n >> k;
vector<ll> a(n);
rep(i, n) cin >> a[i];
vector<ll> sum(n + 1);
sum[0] = 0;
rep(i, n) { sum[i + 1] = sum[i] + a[i]; }
rep1(i, n) sum[i] = (sum[i] - (ll)i) % k;
map<ll, ll> mp;
rep(i, k) { mp[sum[i]]++; }
ll res = 0;
for (auto m : mp) {
res += m.second * (m.second - (ll)1) / (ll)2;
}
rep(i, n - k + 1) {
mp[sum[i]]--;
res += mp[sum[i + k]];
mp[sum[i + k]]++;
}
cout << res << "\n";
return 0;
}
| #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;
}
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
int main() {
ll n, k;
cin >> n >> k;
vector<ll> a(n);
rep(i, n) cin >> a[i];
vector<ll> sum(n + 1);
sum[0] = 0;
rep(i, n) { sum[i + 1] = sum[i] + a[i]; }
rep1(i, n) sum[i] = (sum[i] - (ll)i) % k;
map<ll, ll> mp;
rep(i, min(n + 1, k)) { mp[sum[i]]++; }
ll res = 0;
for (auto m : mp) {
res += m.second * (m.second - (ll)1) / (ll)2;
}
rep(i, n - k + 1) {
mp[sum[i]]--;
res += mp[sum[i + k]];
mp[sum[i + k]]++;
}
cout << res << "\n";
return 0;
}
| replace | 34 | 35 | 34 | 35 | 0 | |
p02851 | C++ | Runtime Error | // Nihal Mittal - nihal_47
// Strike First , Strike Hard , No Mercy !!
/**⠀⠀⠀⠀⠀⠀⣀⣤⣤⣄⣀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⣠⣾⣿⣿⣿⣿⣿⣿⣿⣿⣿⣦⣀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⣰⣿⣿⣿⣿⠿⠿⣿⣿⣿⣿⣿⣿⣿⣧⢀⠀⠀⠀⠀
⠀⠀⠀⣿⣿⣿⠋⠀⠀⠀⠀⠀⠙⠀⠙⣿⣿⣿⣷⢳⢀⠀⠀⠀
⠀⠀⣠⣿⣿⣿⢸⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⣿⣿⣿⣿⣿⢀
⠀⠀⣸⣿⣿⣿⠸⠀⠀⠀⠒⠒⠒⠐⠀⠀⢿⣿⣿⣿⣿⣿⠀⠀
⠀⣴⣿⣿⣿⡿⠀⠒⣋⣙⡒⢰⠀⠤⣖⠒⢾⣿⣿⣿⣿⣧⠀⠀
⢺⣿⣿⣿⣿⢀⠀⠀⠉⠉⠉⠸⠀⡇⠉⠉⠀⢿⣿⣿⣿⣄⠀⠀
⠀⠙⣿⣿⣧⢻⠀⠀⠀⠀⠀⠠⠀⠰⠀⠀⠀⣸⠸⣿⣿⠿⠰⠀
⠀⠀⠀⠹⣿⣿⣿⣷⠀⡠⠙⣲⣔⣅⢡⣰⣷⣿⣿⣿⣧⠀⠀⠀
⠀⠀⠀⣼⣿⣿⣿⣿⠀⡿⠭⠭⠭⠭⢿⠀⣿⢻⣿⣿⠃⠀⠀⠀
⠀⠀⠀⠙⠛⣿⢻⠹⣿⠐⠙⠛⠟⠉⢀⣴⡟⢿⣿⡏⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⡟⠀⠀⠻⣦⣤⣶⠾⠋⠀⠀⠁⡦⢄⢀⠀⠀⠀
⠀⠀⠀⠀⡠⠁⡇⠑⢄⠀⠀⠀⠀⠀⠀⠔⠀⠀⠁⠀⠀⠀⠉⠁
⠀⠔⠊⠁⠀⠀⣇⠀⠀⠀⠑⡤⠤⢎⠁⠀⠀⡘⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⢢⠠⠀⡠⢆⠀⠀⡠⠙⢄⠀⡸⠀
**/
#include <bits/stdc++.h>
#define ll long long
#define l long
#define mk make_pair
#define pb push_back
#define in insert
#define se second
#define fi first
#define mod 1000000007
#define watch(x) cout << (#x) << " is " << (x) << "\n"
#define all(v) (v).begin(), (v).end()
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(0);
#define pii pair<int, int>
#define maxn 100005
using namespace std;
ll psum[100005];
signed main() {
fast;
ll n, k, i, ans = 0;
cin >> n >> k;
ll a[n + 2];
map<ll, ll> ma;
for (i = 1; i <= n; i++) {
cin >> a[i];
psum[i] = (psum[i - 1] % k + a[i] % k) % k;
}
for (i = 1; i <= n; i++) {
psum[i] = ((psum[i] - i) % k + k) % k;
}
for (i = 0; i <= n; i++) {
if (i >= k) {
ma[psum[i - k]]--;
}
ans += ma[psum[i]];
ma[psum[i]]++;
}
cout << ans;
} | // Nihal Mittal - nihal_47
// Strike First , Strike Hard , No Mercy !!
/**⠀⠀⠀⠀⠀⠀⣀⣤⣤⣄⣀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⣠⣾⣿⣿⣿⣿⣿⣿⣿⣿⣿⣦⣀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⣰⣿⣿⣿⣿⠿⠿⣿⣿⣿⣿⣿⣿⣿⣧⢀⠀⠀⠀⠀
⠀⠀⠀⣿⣿⣿⠋⠀⠀⠀⠀⠀⠙⠀⠙⣿⣿⣿⣷⢳⢀⠀⠀⠀
⠀⠀⣠⣿⣿⣿⢸⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⣿⣿⣿⣿⣿⢀
⠀⠀⣸⣿⣿⣿⠸⠀⠀⠀⠒⠒⠒⠐⠀⠀⢿⣿⣿⣿⣿⣿⠀⠀
⠀⣴⣿⣿⣿⡿⠀⠒⣋⣙⡒⢰⠀⠤⣖⠒⢾⣿⣿⣿⣿⣧⠀⠀
⢺⣿⣿⣿⣿⢀⠀⠀⠉⠉⠉⠸⠀⡇⠉⠉⠀⢿⣿⣿⣿⣄⠀⠀
⠀⠙⣿⣿⣧⢻⠀⠀⠀⠀⠀⠠⠀⠰⠀⠀⠀⣸⠸⣿⣿⠿⠰⠀
⠀⠀⠀⠹⣿⣿⣿⣷⠀⡠⠙⣲⣔⣅⢡⣰⣷⣿⣿⣿⣧⠀⠀⠀
⠀⠀⠀⣼⣿⣿⣿⣿⠀⡿⠭⠭⠭⠭⢿⠀⣿⢻⣿⣿⠃⠀⠀⠀
⠀⠀⠀⠙⠛⣿⢻⠹⣿⠐⠙⠛⠟⠉⢀⣴⡟⢿⣿⡏⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⡟⠀⠀⠻⣦⣤⣶⠾⠋⠀⠀⠁⡦⢄⢀⠀⠀⠀
⠀⠀⠀⠀⡠⠁⡇⠑⢄⠀⠀⠀⠀⠀⠀⠔⠀⠀⠁⠀⠀⠀⠉⠁
⠀⠔⠊⠁⠀⠀⣇⠀⠀⠀⠑⡤⠤⢎⠁⠀⠀⡘⠀⠀⠀⠀⠀⠀
⠀⠀⠀⠀⠀⠀⢢⠠⠀⡠⢆⠀⠀⡠⠙⢄⠀⡸⠀
**/
#include <bits/stdc++.h>
#define ll long long
#define l long
#define mk make_pair
#define pb push_back
#define in insert
#define se second
#define fi first
#define mod 1000000007
#define watch(x) cout << (#x) << " is " << (x) << "\n"
#define all(v) (v).begin(), (v).end()
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(0);
#define pii pair<int, int>
#define maxn 100005
using namespace std;
ll psum[200005];
signed main() {
fast;
ll n, k, i, ans = 0;
cin >> n >> k;
ll a[n + 2];
map<ll, ll> ma;
for (i = 1; i <= n; i++) {
cin >> a[i];
psum[i] = (psum[i - 1] % k + a[i] % k) % k;
}
for (i = 1; i <= n; i++) {
psum[i] = ((psum[i] - i) % k + k) % k;
}
for (i = 0; i <= n; i++) {
if (i >= k) {
ma[psum[i - k]]--;
}
ans += ma[psum[i]];
ma[psum[i]]++;
}
cout << ans;
} | 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 <cassert>
#include <functional>
typedef long long ll;
using namespace std;
#ifndef LOCAL
#define debug(x) ;
#else
#define debug(x) cerr << __LINE__ << " : " << #x << " = " << (x) << endl;
template <typename T1, typename T2>
ostream &operator<<(ostream &out, const pair<T1, T2> &p) {
out << "{" << p.first << ", " << p.second << "}";
return out;
}
template <typename T> ostream &operator<<(ostream &out, const vector<T> &v) {
out << '{';
for (const T &item : v)
out << item << ", ";
out << "\b\b}";
return out;
}
#endif
#define mod 1000000007 // 1e9+7(prime number)
#define INF 1000000000 // 1e9
#define LLINF 2000000000000000000LL // 2e18
#define SIZE 200010
int main() {
int N, K;
ll A[SIZE];
cin >> N >> K;
for (int i = 0; i < N; i++) {
cin >> A[i + 1];
A[i + 1] += A[i];
A[i + 1] %= K;
}
int counter[SIZE] = {};
ll ans = 0;
for (int i = 0; i <= N; i++) {
if (i - K >= 0)
counter[A[i - K]]--;
debug(A[i]);
A[i] = (A[i] + K - i % K) % K;
debug(A[i]);
ans += counter[A[i]];
counter[A[i]]++;
}
cout << ans << endl;
return 0;
}
| #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 <cassert>
#include <functional>
typedef long long ll;
using namespace std;
#ifndef LOCAL
#define debug(x) ;
#else
#define debug(x) cerr << __LINE__ << " : " << #x << " = " << (x) << endl;
template <typename T1, typename T2>
ostream &operator<<(ostream &out, const pair<T1, T2> &p) {
out << "{" << p.first << ", " << p.second << "}";
return out;
}
template <typename T> ostream &operator<<(ostream &out, const vector<T> &v) {
out << '{';
for (const T &item : v)
out << item << ", ";
out << "\b\b}";
return out;
}
#endif
#define mod 1000000007 // 1e9+7(prime number)
#define INF 1000000000 // 1e9
#define LLINF 2000000000000000000LL // 2e18
#define SIZE 200010
int main() {
int N, K;
ll A[SIZE];
cin >> N >> K;
for (int i = 0; i < N; i++) {
cin >> A[i + 1];
A[i + 1] += A[i];
A[i + 1] %= K;
}
map<int, int> counter = {};
ll ans = 0;
for (int i = 0; i <= N; i++) {
if (i - K >= 0)
counter[A[i - K]]--;
debug(A[i]);
A[i] = (A[i] + K - i % K) % K;
debug(A[i]);
ans += counter[A[i]];
counter[A[i]]++;
}
cout << ans << endl;
return 0;
}
| 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(NULL);
ll n, k;
cin >> n >> k;
vector<ll> v(n + 1);
for (ll i = 1; i <= n; i++) {
cin >> v[i];
v[i]--;
}
vector<ll> pref(n + 1, 0);
for (ll i = 1; i <= n; i++) {
pref[i] = pref[i - 1];
pref[i] += v[i];
pref[i] %= k;
}
map<ll, ll> rem;
ll ans = 0;
for (ll i = 0; i < k; i++) {
ans += rem[pref[i]];
rem[pref[i]]++;
}
for (ll i = k; i <= n; i++) {
rem[pref[i - k]]--;
ans += rem[pref[i]];
rem[pref[i]]++;
}
cout << ans;
}
| #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(NULL);
ll n, k;
cin >> n >> k;
vector<ll> v(n + 1);
for (ll i = 1; i <= n; i++) {
cin >> v[i];
v[i]--;
}
vector<ll> pref(n + 1, 0);
for (ll i = 1; i <= n; i++) {
pref[i] = pref[i - 1];
pref[i] += v[i];
pref[i] %= k;
}
map<ll, ll> rem;
ll ans = 0;
for (ll i = 0; i < min(k, n + 1); i++) {
ans += rem[pref[i]];
rem[pref[i]]++;
}
for (ll i = k; i <= n; i++) {
rem[pref[i - k]]--;
ans += rem[pref[i]];
rem[pref[i]]++;
}
cout << ans;
}
| 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 <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(v) (v).begin(), (v).end()
const int INF = 0x3f3f3f3f;
const long long LINF = 0x3f3f3f3f3f3f3f3fLL;
const double EPS = 1e-8;
const int MOD = 1000000007;
// const int MOD = 998244353;
const int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1};
// const int dy[] = {1, 1, 0, -1, -1, -1, 0, 1},
// dx[] = {0, -1, -1, -1, 0, 1, 1, 1};
struct IOSetup {
IOSetup() {
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
cout << fixed << setprecision(20);
cerr << fixed << setprecision(10);
}
} iosetup;
/*-------------------------------------------------*/
int main() {
int n;
long long k;
cin >> n >> k;
vector<long long> a(n);
REP(i, n) {
cin >> a[i];
a[i] %= k;
}
vector<long long> sum(n);
sum[0] = a[0];
FOR(i, 1, n) sum[i] = (sum[i - 1] + a[i]) % k;
REP(i, n) {
(sum[i] -= i + 1) %= k;
if (sum[i] < 0)
sum[i] += k;
}
// REP(i, n) cout << sum[i] << ' ';
map<long long, int> mp;
REP(i, k - 2)++ mp[sum[i]];
long long ans = 0, now = 0;
REP(i, n) {
if (i + k - 2 < n)
++mp[sum[i + k - 2]];
ans += mp[now];
// cout << ans << ' ' << now << '\n';
--mp[sum[i]];
(now += a[i] - 1) %= k;
if (now < 0)
now += k;
}
cout << ans << '\n';
return 0;
}
| #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 <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(v) (v).begin(), (v).end()
const int INF = 0x3f3f3f3f;
const long long LINF = 0x3f3f3f3f3f3f3f3fLL;
const double EPS = 1e-8;
const int MOD = 1000000007;
// const int MOD = 998244353;
const int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1};
// const int dy[] = {1, 1, 0, -1, -1, -1, 0, 1},
// dx[] = {0, -1, -1, -1, 0, 1, 1, 1};
struct IOSetup {
IOSetup() {
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
cout << fixed << setprecision(20);
cerr << fixed << setprecision(10);
}
} iosetup;
/*-------------------------------------------------*/
int main() {
int n;
long long k;
cin >> n >> k;
vector<long long> a(n);
REP(i, n) {
cin >> a[i];
a[i] %= k;
}
vector<long long> sum(n);
sum[0] = a[0];
FOR(i, 1, n) sum[i] = (sum[i - 1] + a[i]) % k;
REP(i, n) {
(sum[i] -= i + 1) %= k;
if (sum[i] < 0)
sum[i] += k;
}
// REP(i, n) cout << sum[i] << ' ';
map<long long, int> mp;
for (int i = 0; i < k - 2 && i < n; ++i)
++mp[sum[i]];
long long ans = 0, now = 0;
REP(i, n) {
if (i + k - 2 < n)
++mp[sum[i + k - 2]];
ans += mp[now];
// cout << ans << ' ' << now << '\n';
--mp[sum[i]];
(now += a[i] - 1) %= k;
if (now < 0)
now += k;
}
cout << ans << '\n';
return 0;
}
| 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);
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> x;
V[i] = x - 1;
if (V[i] == -1)
V[i] = k - 1;
}
if (k == 1) {
cout << 0;
return 0;
}
F[0] = 1;
A[0] = 0;
for (int i = 1; i <= n; i++) {
sp += V[i];
sp %= k;
tot += F[sp];
F[sp]++;
A[i] = sp;
if (i >= k - 1)
F[A[i - (k - 1)]]--;
}
cout << tot;
return 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);
cin >> n >> k;
for (int i = 1; i <= n; i++) {
cin >> x;
V[i] = x - 1;
if (V[i] == -1)
V[i] = k - 1;
}
if (k == 1) {
cout << 0;
return 0;
}
F[0] = 1;
A[0] = 0;
for (int i = 1; i <= n; i++) {
sp += V[i];
sp %= k;
tot += F[sp];
F[sp]++;
A[i] = sp;
if (i >= k - 1)
F[A[i - (k - 1)]]--;
}
cout << tot;
return 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.