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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
p02889 | C++ | Time Limit Exceeded | typedef long long ll;
#include <bits/stdc++.h>
using namespace std;
ll n, m, l;
vector<vector<pair<ll, ll>>> edges(400);
vector<vector<bool>> reals(400, vector<bool>(400, false));
vector<vector<ll>> costs(400, vector<ll>(400, -1));
void saiki(ll from, ll now, ll gas) {
for (auto e : edges[now]) {
ll to = e.first... | typedef long long ll;
#include <bits/stdc++.h>
using namespace std;
ll n, m, l;
vector<vector<pair<ll, ll>>> edges(400);
vector<vector<bool>> reals(400, vector<bool>(400, false));
vector<vector<ll>> costs(400, vector<ll>(400, -1));
void saiki(ll from, ll now, ll gas) {
for (auto e : edges[now]) {
ll to = e.first... | replace | 34 | 35 | 34 | 52 | TLE | |
p02889 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, m) for (long long i = 0; i < m; i++)
#define per(i, m) for (long long i = m - 1; i >= 0; i--)
#define FOR(i, n, m) for (long long i = n; i < m; i++)
#define ROF(i, n, m) for (long long i = m - 1; i >= n; i--)
#define SORT(v, n) ... | #include <bits/stdc++.h>
#define rep(i, m) for (long long i = 0; i < m; i++)
#define per(i, m) for (long long i = m - 1; i >= 0; i--)
#define FOR(i, n, m) for (long long i = n; i < m; i++)
#define ROF(i, n, m) for (long long i = m - 1; i >= n; i--)
#define SORT(v, n) ... | replace | 321 | 322 | 321 | 324 | TLE | |
p02889 | C++ | Runtime Error | ///*****************************???????????????????
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define Khela \
ios_base::sync_with_stdio(false)... | ///*****************************???????????????????
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define Khela \
ios_base::sync_with_stdio(false)... | replace | 33 | 34 | 33 | 34 | 0 | |
p02889 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define f1(a, b, c) for (int c = a; c <= b; c++)
#define f2(a, b, c) for (int c = a; c >= b; c--)
#define f3(a, b, c) for (int c = a; c; c = b)
#define so1(a, n) sort(a + 1, a + n + 1, mycmp);
#define so2(a, n) sort(a + 1, a + n + 1);
#define ll long long
#define itn int
#d... | #include <bits/stdc++.h>
using namespace std;
#define f1(a, b, c) for (int c = a; c <= b; c++)
#define f2(a, b, c) for (int c = a; c >= b; c--)
#define f3(a, b, c) for (int c = a; c; c = b)
#define so1(a, n) sort(a + 1, a + n + 1, mycmp);
#define so2(a, n) sort(a + 1, a + n + 1);
#define ll long long
#define itn int
#d... | replace | 10 | 11 | 10 | 11 | 0 | |
p02889 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, j) for (int i = 0; i < j; i++)
#define all(obj) (obj).begin(), (obj).end()
#define rall(obj) (obj).rbegin(), (obj).rend()
typedef long long int ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vi> vvi;
typedef ve... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, j) for (int i = 0; i < j; i++)
#define all(obj) (obj).begin(), (obj).end()
#define rall(obj) (obj).rbegin(), (obj).rend()
typedef long long int ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vi> vvi;
typedef ve... | insert | 71 | 71 | 71 | 73 | TLE | |
p02889 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define debug(x) \
cout << "DEBUG" \
<< " " << #x << ":" << x << '\n'
// ↓0-originか1-originでn回繰り返し
#define rep(i, n) for (int i = 0; i < ((i... | #include <bits/stdc++.h>
using namespace std;
#define debug(x) \
cout << "DEBUG" \
<< " " << #x << ":" << x << '\n'
// ↓0-originか1-originでn回繰り返し
#define rep(i, n) for (int i = 0; i < ((i... | replace | 89 | 90 | 89 | 91 | TLE | |
p02889 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define all(v) v.begin(), v.end()
typedef long long ll;
typedef pair<ll, ll> P;
typedef vector<ll> vec;
typedef vector<vec> mat;
int main() {
ll n, m, l, d[201][201], q, inf = 1e18;
cin >> n >> m >> l;
int a, b, c;
rep(i... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define all(v) v.begin(), v.end()
typedef long long ll;
typedef pair<ll, ll> P;
typedef vector<ll> vec;
typedef vector<vec> mat;
int main() {
ll n, m, l, d[301][301], q, inf = 1e18;
cin >> n >> m >> l;
int a, b, c;
rep(i... | replace | 9 | 10 | 9 | 10 | 0 | |
p02889 | C++ | Runtime Error | #include <algorithm>
#include <climits>
#include <iostream>
#include <vector>
using namespace std;
static const int MAX = 100;
static const long long INFTY = (1LL << 50);
int n;
long long d[MAX][MAX];
long long d_[MAX][MAX];
void floyd() {
for (int k = 0; k < n; k++) {
for (int i = 0; i < n; i++) {
if (d... | #include <algorithm>
#include <climits>
#include <iostream>
#include <vector>
using namespace std;
static const int MAX = 300;
static const long long INFTY = 9223372036854775807;
int n;
long long d[MAX][MAX];
long long d_[MAX][MAX];
void floyd() {
for (int k = 0; k < n; k++) {
for (int i = 0; i < n; i++) {
... | replace | 6 | 8 | 6 | 8 | 0 | |
p02889 | C++ | Time Limit Exceeded | #define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
using namespace s... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
using namespace s... | replace | 760 | 761 | 760 | 762 | TLE | |
p02889 | C++ | Runtime Error | // C++ 14
#include <algorithm>
#include <iostream>
#include <list>
#include <math.h>
#include <queue>
#include <stack>
#include <vector>
#define ll long long
#define Int int
#define loop(x, start, end) for (Int x = start; x < end; x++)
#define loopdown(x, start, end) for (int x = start; x > end; x--)
#define span(a, x... | // C++ 14
#include <algorithm>
#include <iostream>
#include <list>
#include <math.h>
#include <queue>
#include <stack>
#include <vector>
#define ll long long
#define Int int
#define loop(x, start, end) for (Int x = start; x < end; x++)
#define loopdown(x, start, end) for (int x = start; x > end; x--)
#define span(a, x... | replace | 21 | 22 | 21 | 22 | 0 | |
p02889 | C++ | Time Limit Exceeded | #if 1
#include <bits/stdc++.h>
using namespace std;
int n, m, l;
int d[305][305];
vector<pair<int, int>> v[305];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cin >> n >> m >> l;
int x, y, z;
for (int i = 1; i <= m; i++) {
cin >> x >> y >> z;
v[x].push_back({y, z});
v[y].push_back({... | #if 1
#include <bits/stdc++.h>
using namespace std;
int n, m, l;
int d[305][305];
vector<pair<int, int>> v[305];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cin >> n >> m >> l;
int x, y, z;
for (int i = 1; i <= m; i++) {
cin >> x >> y >> z;
v[x].push_back({y, z});
v[y].push_back({... | insert | 33 | 33 | 33 | 35 | TLE | |
p02889 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main(void) {
// 5+ 1854-
int N, M;
long long L;
cin >> N >> M >> L;
vector<vector<int>> Load_to(N, vector<int>());
vector<vector<int>> Load_cost(N, vector<int>());
for (int i = 0; i < M; i++) {
int a, b, c;
cin >> a >> b >> c;
a--;
b--;... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
// 5+ 1854-
int N, M;
long long L;
cin >> N >> M >> L;
vector<vector<int>> Load_to(N, vector<int>());
vector<vector<int>> Load_cost(N, vector<int>());
for (int i = 0; i < M; i++) {
int a, b, c;
cin >> a >> b >> c;
a--;
b--;... | replace | 48 | 49 | 48 | 49 | TLE | |
p02889 | C++ | Runtime Error | #include <iostream>
#include <queue>
#include <utility>
#include <vector>
using namespace std;
const long MAXV = 101;
const long MAXD = (long)1e12;
long V;
void warshall_floyd(vector<vector<long>> &d) {
for (long k = 1; k <= V; k++) {
for (long i = 1; i <= V; i++) {
for (long j = 1; j <= V; j++) {
... | #include <iostream>
#include <queue>
#include <utility>
#include <vector>
using namespace std;
const long MAXV = 301;
const long MAXD = (long)1e12;
long V;
void warshall_floyd(vector<vector<long>> &d) {
for (long k = 1; k <= V; k++) {
for (long i = 1; i <= V; i++) {
for (long j = 1; j <= V; j++) {
... | replace | 6 | 7 | 6 | 7 | 0 | |
p02889 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
// template {{{ 0
// using {{{ 1
using ll = long long int;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vii = vector<pii>;
using vll = vector<pll>;
// }}} 1
// definition {{{ 1
// scan... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
// template {{{ 0
// using {{{ 1
using ll = long long int;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vii = vector<pii>;
using vll = vector<pll>;
// }}} 1
// definition {{{ 1
// scan... | replace | 70 | 71 | 70 | 73 | TLE | |
p02890 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
typedef long double ld;
const int inf = 1e9 + 7;
const ll longinf = 1LL << 60;
#define REP(i, m, n) for (ll i = (int)(m); i < (int)(n); ++i)
#define rep(i, n) REP(i, 0, n)
#define F first
#define S second
constexpr char ln = '... | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
typedef long double ld;
const int inf = 1e9 + 7;
const ll longinf = 1LL << 60;
#define REP(i, m, n) for (ll i = (int)(m); i < (int)(n); ++i)
#define rep(i, n) REP(i, 0, n)
#define F first
#define S second
constexpr char ln = '... | replace | 33 | 34 | 33 | 34 | 0 | |
p02890 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
#define int long long
int MOD = 1000000007;
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin ... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
#define int long long
int MOD = 1000000007;
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin ... | replace | 35 | 36 | 35 | 36 | 0 | |
p02890 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define ignore ignore
#define pb emplace_back
#define mt make_tuple
#define gcd __gcd
// Input
#define in(a) scanf("%d", &a)
#define in2(a, b) scanf("%d%d", &a, &b)
#define in3(a, b, c) scanf("%d%d%d", &a, &b, &c)
#define in4(a, b, c, d) sca... | #include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define ignore ignore
#define pb emplace_back
#define mt make_tuple
#define gcd __gcd
// Input
#define in(a) scanf("%d", &a)
#define in2(a, b) scanf("%d%d", &a, &b)
#define in3(a, b, c) scanf("%d%d%d", &a, &b, &c)
#define in4(a, b, c, d) sca... | replace | 121 | 122 | 121 | 122 | 0 | |
p02890 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <utility>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> c(n);
for (int i = 0; i < n; i++) {
int a;
cin >> a;
c[a - 1]++;
}
sort(c.rbegin(), c.rend());
vector<int> d(n);
int j = n - 1;
int tot = 0;
... | #include <algorithm>
#include <iostream>
#include <utility>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> c(n);
for (int i = 0; i < n; i++) {
int a;
cin >> a;
c[a - 1]++;
}
sort(c.rbegin(), c.rend());
vector<int> d(n + 1);
int j = n - 1;
int tot =... | replace | 22 | 23 | 22 | 23 | 0 | |
p02890 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define ignore ignore
#define pb emplace_back
#define mt make_tuple
#define gcd __gcd
// Input
#define in(a) scanf("%d", &a)
#define in2(a, b) scanf("%d%d", &a, &b)
#define in3(a, b, c) scanf("%d%d%d", &a, &b, &c)
#define in4(a, b, c, d) sca... | #include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define ignore ignore
#define pb emplace_back
#define mt make_tuple
#define gcd __gcd
// Input
#define in(a) scanf("%d", &a)
#define in2(a, b) scanf("%d%d", &a, &b)
#define in3(a, b, c) scanf("%d%d%d", &a, &b, &c)
#define in4(a, b, c, d) sca... | replace | 121 | 122 | 121 | 122 | 0 | |
p02890 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> Pii;
typedef pair<ll, ll> Pll;
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define rep2(i, a, b) for (ll i = a; i < b; ++i)
const ll MOD = 1000000007;
const ll INF = 1e9;
const ll IINF = 1e18;
const double EPS = 1e-8;
const doub... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> Pii;
typedef pair<ll, ll> Pll;
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define rep2(i, a, b) for (ll i = a; i < b; ++i)
const ll MOD = 1000000007;
const ll INF = 1e9;
const ll IINF = 1e18;
const double EPS = 1e-8;
const doub... | replace | 43 | 44 | 43 | 44 | 0 | |
p02890 | C++ | Runtime Error | #pragma GCC optimize("-O3")
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
void solve();
signed main() {
#ifdef Sprinkle
clock_t clock_start = clock();
assert(freopen("test.txt", "r", stdin));
#else
ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
#endif
solve();
#ifdef Sprinkle
cerr << ... | #pragma GCC optimize("-O3")
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
void solve();
signed main() {
#ifdef Sprinkle
clock_t clock_start = clock();
assert(freopen("test.txt", "r", stdin));
#else
ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
#endif
solve();
#ifdef Sprinkle
cerr << ... | replace | 47 | 48 | 47 | 48 | 0 | |
p02890 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int N;
int A[30010];
vector<int> V;
int ans[300010];
int main() {
cin >> N;
for (int i = 0; i < N; i++) {
int a;
cin >> a;
A[a]++;
}
for (int i = 1; i <= N; i++) {
V.push_back(A[i]);
}
sort(V.begin(), V.end());
int tmp = N;
int sum = 0;
... | #include <bits/stdc++.h>
using namespace std;
int N;
int A[300010];
vector<int> V;
int ans[300010];
int main() {
cin >> N;
for (int i = 0; i < N; i++) {
int a;
cin >> a;
A[a]++;
}
for (int i = 1; i <= N; i++) {
V.push_back(A[i]);
}
sort(V.begin(), V.end());
int tmp = N;
int sum = 0;... | replace | 4 | 5 | 4 | 5 | 0 | |
p02890 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int read() {
int xx = 0, ff = 1;
char ch = ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int read() {
int xx = 0, ff = 1;
char ch = ... | replace | 49 | 50 | 49 | 50 | 0 | |
p02890 | C++ | Time Limit Exceeded | #include <cassert>
#include <iostream>
#include <list>
#include <map>
using namespace std;
int main() {
int n;
cin >> n;
map<int, int> m;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
m[a]++;
}
map<int, int> m2;
for (auto &x : m)
m2[x.second]++;
int sz = 0;
for (auto &x : m2)
sz +... | #include <cassert>
#include <iostream>
#include <list>
#include <map>
using namespace std;
int main() {
int n;
cin >> n;
map<int, int> m;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
m[a]++;
}
map<int, int> m2;
for (auto &x : m)
m2[x.second]++;
int sz = 0;
for (auto &x : m2)
sz +... | insert | 21 | 21 | 21 | 25 | TLE | |
p02890 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = (3e5) + 5;
int n, a[N];
int freq[N];
int ac[N];
int f(int x, int pos) {
while (pos >= 0) {
if (freq[pos] < x)
break;
pos--;
}
return (pos >= 0 ? ac[pos] : 0) + x * (n - pos - 1);
}
int main() { // claudio van
scan... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = (3e5) + 5;
int n, a[N];
int freq[N];
int ac[N];
int f(int x, int &pos) {
while (pos >= 0) {
if (freq[pos] < x)
break;
pos--;
}
return (pos >= 0 ? ac[pos] : 0) + x * (n - pos - 1);
}
int main() { // claudio van
sca... | replace | 9 | 10 | 9 | 10 | TLE | |
p02890 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <climits>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include ... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <climits>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include ... | replace | 51 | 53 | 51 | 53 | TLE | |
p02890 | C++ | Runtime Error | #include <stdio.h>
#include <stdlib.h>
#include <iomanip>
#include <iostream>
#include <sstream>
#include <stdint.h>
#include <string.h>
#define _USE_MATH_DEFINES
#include <math.h>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <uno... | #include <stdio.h>
#include <stdlib.h>
#include <iomanip>
#include <iostream>
#include <sstream>
#include <stdint.h>
#include <string.h>
#define _USE_MATH_DEFINES
#include <math.h>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <uno... | replace | 50 | 51 | 50 | 51 | 0 | |
p02890 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 3e5 + 7;
int a[maxn];
vector<int> ans;
vector<int> vec;
vector<int> rem;
long double f(int u, int k) {
long double right = (long double)rem[u - 1] / (long double)(k - u);
return right;
}
int SanFen(int l, int r, int k) // 找凸点
{
w... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 3e5 + 7;
int a[maxn];
vector<int> ans;
vector<int> vec;
vector<int> rem;
long double f(int u, int k) {
long double right = (long double)rem[u - 1] / (long double)(k - u);
return right;
}
int SanFen(int l, int r, int k) // 找凸点
{
w... | replace | 50 | 53 | 50 | 55 | -8 | |
p02890 | C++ | Runtime Error | #include <bits/stdc++.h>
#define fr first
#define se second
using namespace std;
const long long N = 2e5 + 7;
const long long inf = 1e9 + 7;
const long long mod = 1e9 + 7;
int n;
int a[N];
int main() {
ios_base::sync_with_stdio(false);
cin >> n;
for (int i = 1; i <= n; i++) {
int x;
cin >> x;
a[x... | #include <bits/stdc++.h>
#define fr first
#define se second
using namespace std;
const long long N = 3e5 + 7;
const long long inf = 1e9 + 7;
const long long mod = 1e9 + 7;
int n;
int a[N];
int main() {
ios_base::sync_with_stdio(false);
cin >> n;
for (int i = 1; i <= n; i++) {
int x;
cin >> x;
a[x... | replace | 7 | 8 | 7 | 8 | 0 | |
p02890 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using pii = pair<int, int>;
int main() {
int N;
cin >> N;
vector<int> A(N);
map<int, int> cnt;
for (int i = 0; i < N; i++) {
cin >> A[i];
cnt[A[i]] += 1;
}
vector<int> all;
for (auto p : cnt) {
all.emplace_back(p.second);
}
sort(all.begin(),... | #include <bits/stdc++.h>
using namespace std;
using pii = pair<int, int>;
int main() {
int N;
cin >> N;
vector<int> A(N);
map<int, int> cnt;
for (int i = 0; i < N; i++) {
cin >> A[i];
cnt[A[i]] += 1;
}
vector<int> all;
for (auto p : cnt) {
all.emplace_back(p.second);
}
sort(all.begin(),... | replace | 20 | 21 | 20 | 21 | 0 | |
p02890 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define N 100005
int sum[N], cc[N], number[N];
void update(int *pen, int ind, int v) {
while (ind < N) {
pen[ind] += v;
ind += ind & (-ind);
}
}
int query(int *pen, int ind) {
int ret = 0;
while (ind > 0) {
ret += pen[ind];
ind = ind & (ind - 1);
... | #include <bits/stdc++.h>
using namespace std;
#define N 300005
int sum[N], cc[N], number[N];
void update(int *pen, int ind, int v) {
while (ind < N) {
pen[ind] += v;
ind += ind & (-ind);
}
}
int query(int *pen, int ind) {
int ret = 0;
while (ind > 0) {
ret += pen[ind];
ind = ind & (ind - 1);
... | replace | 2 | 3 | 2 | 3 | 0 | |
p02890 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
#define LL long long
#define MAXN 100000
int n, cnt[MAXN + 5], ans[MAXN + 5];
LL sum[MAXN + 5];
LL read() {
LL x = 0, F = 1;
char c = getchar();
while (c < '0' || c > '9') {
if (c == '-')
F = -1;
c = getchar();
}
whi... | #include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
#define LL long long
#define MAXN 300000
int n, cnt[MAXN + 5], ans[MAXN + 5];
LL sum[MAXN + 5];
LL read() {
LL x = 0, F = 1;
char c = getchar();
while (c < '0' || c > '9') {
if (c == '-')
F = -1;
c = getchar();
}
whi... | replace | 5 | 6 | 5 | 6 | 0 | |
p02890 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define LLI long long int
#define FOR(v, a, b) for (LLI v = (a); v < (b); ++v)
#define FORE(v, a, b) for (LLI v = (a); v <= (b); ++v)
#define REP(v, n) FOR(v, 0, n)
#define REPE(v, n) FORE(v, 0, n)
#define REV(v, a, b) for (LLI v = (a); v >= (b); --v)
#define ALL(x) (x).begin(), (x).end()
#defi... | #include <bits/stdc++.h>
#define LLI long long int
#define FOR(v, a, b) for (LLI v = (a); v < (b); ++v)
#define FORE(v, a, b) for (LLI v = (a); v <= (b); ++v)
#define REP(v, n) FOR(v, 0, n)
#define REPE(v, n) FORE(v, 0, n)
#define REV(v, a, b) for (LLI v = (a); v >= (b); --v)
#define ALL(x) (x).begin(), (x).end()
#defi... | replace | 113 | 114 | 113 | 114 | TLE | |
p02891 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main(void) {
string S;
cin >> S;
long long N;
cin >> N;
vector<int> Chars;
int num = 1;
for (int i = 1; i < S.size(); i++) {
if (S[i] == S[i - 1]) {
num++;
if (i == S.size() - 1) {
Chars.push_back(num);
}
} else {
... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
string S;
cin >> S;
long long N;
cin >> N;
if (S.size() == 1) {
int result = N / 2;
cout << result << endl;
return 0;
}
vector<int> Chars;
int num = 1;
for (int i = 1; i < S.size(); i++) {
if (S[i] == S[i - 1]) {
... | insert | 9 | 9 | 9 | 15 | 0 | |
p02891 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
#define ll long long int
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n; i >= 0; i--)
#define REP(i, s, t) for (int i = s; i <= t; i++)
#define RREP(i, s, t) for (int i = s; i >= t; i--)
#define dump(x) cerr << #x << " = " << (x) << endl;
#d... | #include "bits/stdc++.h"
using namespace std;
#define ll long long int
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n; i >= 0; i--)
#define REP(i, s, t) for (int i = s; i <= t; i++)
#define RREP(i, s, t) for (int i = s; i >= t; i--)
#define dump(x) cerr << #x << " = " << (x) << endl;
#d... | replace | 42 | 49 | 42 | 49 | 0 | |
p02891 | C++ | Time Limit Exceeded | #pragma GCC optimize("-O3")
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef pair<int, int> p32;
typedef pair<ll, ll> p64;
typedef pair<double, double> pdd;
typedef vector<ll> v64;
typedef vector<int> v32;
typedef vector<vector<int>> vv32;
typedef vector<vector<ll... | #pragma GCC optimize("-O3")
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef pair<int, int> p32;
typedef pair<ll, ll> p64;
typedef pair<double, double> pdd;
typedef vector<ll> v64;
typedef vector<int> v32;
typedef vector<vector<int>> vv32;
typedef vector<vector<ll... | replace | 74 | 75 | 74 | 75 | TLE | |
p02891 | Python | Time Limit Exceeded | def count_changes(s, k, prev=None):
count = 0
for _ in range(k):
for cur in s:
if cur == prev:
count += 1
prev = None
else:
prev = cur
return count, prev
if __name__ == "__main__":
s = input()
k = int(input())
prin... | def count_changes(s, k, prev=None):
count = 0
for _ in range(k):
for cur in s:
if cur == prev:
count += 1
prev = None
else:
prev = cur
return count, prev
if __name__ == "__main__":
s = input()
k = int(input())
if l... | replace | 15 | 16 | 15 | 29 | TLE | |
p02891 | C++ | Runtime Error | #include <bits/stdc++.h>
#define inf 1000000000
#define ll long long
using namespace std;
int main() {
int len, locate, locate1, flag = 1;
ll k, ans = 0, ans1 = 0, ans2 = 0, ans3 = 0;
char a[105];
scanf("%s%lld", a, &k);
len = strlen(a);
if (k == 1) {
for (int i = 0; i < len; i++) {
int tmp1 = i;
... | #include <bits/stdc++.h>
#define inf 1000000000
#define ll long long
using namespace std;
int main() {
int len, locate, locate1, flag = 1;
ll k, ans = 0, ans1 = 0, ans2 = 0, ans3 = 0;
char a[205];
scanf("%s%lld", a, &k);
len = strlen(a);
if (k == 1) {
for (int i = 0; i < len; i++) {
int tmp1 = i;
... | replace | 7 | 8 | 7 | 8 | 0 | |
p02891 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
string s;
cin >> s;
long long k;
cin >> k;
int s_length = (int)s.length();
int tmp = 0;
int buf = 0;
vector<int> array(s_length, 0);
long long ans = 0;
if (s[0] == s[s_length - 1])
buf ... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
string s;
cin >> s;
long long k;
cin >> k;
int s_length = (int)s.length();
int tmp = 0;
int buf = 0;
vector<int> array(s_length, 0);
long long ans = 0;
if (s[0] == s[s_length - 1])
buf ... | replace | 32 | 33 | 32 | 33 | 0 | |
p02891 | C++ | Runtime Error | // https://yamakasa.net/atcoder-agc-039-a/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for (ll i = 0; i < (ll)n; i++)
int main() {
string S;
ll K;
cin >> S >> K;
ll n = S.length();
if (n == 1) {
cout << K / 2 << "\n";
return 0;
}
ll cnt = 1;
REP(i, n - 1... | // https://yamakasa.net/atcoder-agc-039-a/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for (ll i = 0; i < (ll)n; i++)
int main() {
string S;
ll K;
cin >> S >> K;
ll n = S.length();
if (n == 1) {
cout << K / 2 << "\n";
return 0;
}
ll cnt = 1;
REP(i, n - 1... | replace | 45 | 46 | 45 | 50 | 0 | |
p02891 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
string s;
long long k;
int main() {
cin >> s >> k;
int n = s.size();
if (n == 1) {
cout << k / 2 << endl;
return 0;
}
if (n == 2) {
cout << (s[0] == s[1]) * k << endl;
return 0;
}
long long a = 0, b = 0;
while (s[a] == s[n - 1] && a < n)
... | #include <bits/stdc++.h>
using namespace std;
string s;
long long k;
int main() {
cin >> s >> k;
int n = s.size();
if (n == 1) {
cout << k / 2 << endl;
return 0;
}
if (n == 2) {
cout << (s[0] == s[1]) * k << endl;
return 0;
}
long long a = 0, b = 0;
while (s[a] == s[n - 1] && a < n)
... | replace | 28 | 29 | 28 | 30 | 0 | |
p02891 | C++ | Runtime Error | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
#define repl(i, l, r) for (ll i = l; i < r; i++)
#define rep(i, n) repl(i, 0, n)
using namespace std;
using ll = long long;
int main() {
string S;
l... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
#define repl(i, l, r) for (ll i = l; i < r; i++)
#define rep(i, n) repl(i, 0, n)
using namespace std;
using ll = long long;
int main() {
string S;
l... | insert | 39 | 39 | 39 | 43 | 0 | |
p02891 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define drep(i, n) for (int i = (n - 1); i >= 0; i--)
#define all(v) (v).begin(), (v).end()
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool ch... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define drep(i, n) for (int i = (n - 1); i >= 0; i--)
#define all(v) (v).begin(), (v).end()
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool ch... | replace | 45 | 46 | 45 | 46 | 0 | |
p02891 | C++ | Runtime Error | #include <cctype>
#include <iostream>
#include <string>
using namespace std;
char c[105];
long long a[105];
int main() {
long long sum = 0;
long long res = 0;
long long m = 0, n;
long long cnt = 0;
char s;
while (s = getchar()) {
if (s == '\n')
break;
c[++m] = s;
}
cin >> n;
if (m == 1) ... | #include <cctype>
#include <iostream>
#include <string>
using namespace std;
char c[105];
long long a[105];
int main() {
long long sum = 0;
long long res = 0;
long long m = 0, n;
long long cnt = 0;
char s;
while (s = getchar()) {
if (s == '\n')
break;
c[++m] = s;
}
cin >> n;
if (m == 1) ... | replace | 50 | 52 | 50 | 53 | 0 | |
p02891 | Python | Runtime Error | from itertools import groupby
s = input()
k = int(input())
a = [sum(1 for _ in g) for _, g in groupby(s)]
if s[0] == s[-1]:
a[0] += a.pop()
print(sum(x // 2 for x in a) * k)
| from itertools import groupby
s = input()
k = int(input())
a = [sum(1 for _ in g) for _, g in groupby(s)]
if len(a) == 1:
print(len(s) * k // 2)
else:
x, y = a[0], a[-1]
b = (x + y) // 2 if s[0] == s[-1] else x // 2 + y // 2
print(x // 2 + y // 2 + sum(x // 2 for x in a[1:-1]) * k + b * (k - 1))
| replace | 5 | 8 | 5 | 11 | 0 | |
p02891 | C++ | Runtime Error | #include <bits/stdc++.h>
#define int long long
using namespace std;
const int INF = 1e10;
const int ZERO = 0;
signed main() {
string S;
cin >> S;
int K;
cin >> K;
bool s = true;
for (int i = 0; i < S.size(); i++) {
if (S.at(i) != S.at(i + 1)) {
s = false;
}
}
if (S.size() == 1) {
cout... | #include <bits/stdc++.h>
#define int long long
using namespace std;
const int INF = 1e10;
const int ZERO = 0;
signed main() {
string S;
cin >> S;
int K;
cin >> K;
bool s = true;
for (int i = 0; i < S.size() - 1; i++) {
if (S.at(i) != S.at(i + 1)) {
s = false;
}
}
if (S.size() == 1) {
... | replace | 12 | 13 | 12 | 13 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): basic_string::at: __n (which is 5) >= this->size() (which is 5)
|
p02891 | C++ | Runtime Error | #include <bits/stdc++.h>
#define int long long
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef pair<int, int> pii;
const int INF = 1l << 60;
#define u_b upper_bound
#define l_b lower_bound
int f(string S) {
S.push_back('!');
int res = 0;
for (int i = 1; i < S.length(); ++i) {
if... | #include <bits/stdc++.h>
#define int long long
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef pair<int, int> pii;
const int INF = 1l << 60;
#define u_b upper_bound
#define l_b lower_bound
int f(string S) {
S.push_back('!');
int res = 0;
for (int i = 1; i < S.length(); ++i) {
if... | delete | 54 | 55 | 54 | 54 | 0 | |
p02891 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl "\n"
#define REP(i, a, n) for (int i = a; i < n; ++i)
#define REPR(i, a, n) for (int i = a; i > n; --i)
#define RUP(a, b) ((a + b - 1) / (b))
#define ALL(v) (v).begin(), (v).end()
#define pb push_back
#define mp make_pair
#define mt make_... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl "\n"
#define REP(i, a, n) for (int i = a; i < n; ++i)
#define REPR(i, a, n) for (int i = a; i > n; --i)
#define RUP(a, b) ((a + b - 1) / (b))
#define ALL(v) (v).begin(), (v).end()
#define pb push_back
#define mp make_pair
#define mt make_... | insert | 69 | 69 | 69 | 73 | 0 | |
p02891 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define reps(i, n) for (int i = 1; i <= (int)(n); ++i)
#define repd(i, n) for (int i = (int)(n - 1); i >= 0; --i)
#define repds(i, n) for (int i = (int)(n); i > 0; --i)
#define loop(i, x, n) for (int i = (int)(x); i < (n... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define reps(i, n) for (int i = 1; i <= (int)(n); ++i)
#define repd(i, n) for (int i = (int)(n - 1); i >= 0; --i)
#define repds(i, n) for (int i = (int)(n); i > 0; --i)
#define loop(i, x, n) for (int i = (int)(x); i < (n... | replace | 54 | 56 | 54 | 55 | 0 | |
p02891 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
long long K;
cin >> S >> K;
vector<int> len;
int cnt = 1;
for (int i = 1; i < S.size(); ++i) {
if (S[i] == S[i - 1])
++cnt;
if (S[i] != S[i - 1] || i + 1 == S.size()) {
len.push_back(cnt);
cnt = 1;
}
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
long long K;
cin >> S >> K;
vector<int> len;
int cnt = 1;
if (S.size() == 1)
len.push_back(1);
for (int i = 1; i < S.size(); ++i) {
if (S[i] == S[i - 1])
++cnt;
if (S[i] != S[i - 1] || i + 1 == S.size()) {
len.p... | insert | 10 | 10 | 10 | 12 | 0 | |
p02891 | C++ | Runtime Error | #include <iostream>
#include <sstream>
#include <stdio.h>
#define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cmath>
#include <ctype.h>
#include <limits>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
typedef long long int ll... | #include <iostream>
#include <sstream>
#include <stdio.h>
#define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cmath>
#include <ctype.h>
#include <limits>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
typedef long long int ll... | replace | 32 | 34 | 32 | 34 | 0 | |
p02891 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#ifdef DEBUG
#include... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#ifdef DEBUG
#include... | insert | 185 | 185 | 185 | 196 | TLE | |
p02891 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long
char S[105];
int K, las = 1;
vector<int> vec;
signed main() {
cin >> (S + 1) >> K;
int n = strlen(S + 1);
for (int i = 2; i <= n; ++i)
if (S[i] != S[i - 1])
vec.push_back(i - las), las = i;
else if (i == n)
vec.push_back(i - l... | #include <bits/stdc++.h>
using namespace std;
#define int long long
char S[105];
int K, las = 1;
vector<int> vec;
signed main() {
cin >> (S + 1) >> K;
int n = strlen(S + 1);
if (n == 1)
return cout << n * K / 2, 0;
for (int i = 2; i <= n; ++i)
if (S[i] != S[i - 1])
vec.push_back(i - las), las = i;... | insert | 9 | 9 | 9 | 11 | 0 | |
p02891 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <ios>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <utility>
#include <vecto... | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <ios>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <utility>
#include <vecto... | insert | 45 | 45 | 45 | 48 | 0 | |
p02891 | C++ | Runtime Error | #include <bits/stdc++.h>
int main() {
std::string s[3];
long long k, a[3] = {};
std::cin >> s[0] >> k;
for (size_t i = 0; i < 2; ++i)
s[i + 1] = s[i] + s[0];
for (size_t i = 0; i < 3; ++i)
for (size_t j = 1; j < s[i].length(); ++j)
if (s[i][j] == s[i][j - 1])
++a[i], ++j;
std::cout << ... | #include <bits/stdc++.h>
int main() {
std::string s[3];
long long k, a[3] = {};
std::cin >> s[0] >> k;
for (size_t i = 0; i < 2; ++i)
s[i + 1] = s[i] + s[0];
for (size_t i = 0; i < 3; ++i)
for (size_t j = 1; j < s[i].length(); ++j)
if (s[i][j] == s[i][j - 1])
++a[i], ++j;
std::cout << ... | replace | 12 | 13 | 12 | 13 | 0 | |
p02891 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
string S;
ll K, ans, l = 1;
cin >> S >> K;
vector<pair<char, ll>> v;
for (ll i = 0; i < S.length(); i++) {
if (i == 0)
continue;
if (S[i] == S[i - 1])
l++;
else {
v.push_back(make_pair(S[i - 1], l))... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
string S;
ll K, ans, l = 1;
cin >> S >> K;
vector<pair<char, ll>> v;
for (ll i = 0; i < S.length(); i++) {
if (i == 0)
continue;
if (S[i] == S[i - 1])
l++;
else {
v.push_back(make_pair(S[i - 1], l))... | insert | 21 | 21 | 21 | 23 | 0 | |
p02891 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
char d[100004];
long long k, cnt = 0;
vector<long long> v;
int main() {
scanf("%s", d);
scanf("%lld", &k);
char bef = d[0];
int cc = 1;
for (long long i = 1; i < strlen(d); i++) {
if (bef == d[i])
cc++;
else {
v.push_back(cc);
cc = 1;
... | #include <bits/stdc++.h>
using namespace std;
char d[100004];
long long k, cnt = 0;
vector<long long> v;
int main() {
scanf("%s", d);
scanf("%lld", &k);
char bef = d[0];
int cc = 1;
for (long long i = 1; i < strlen(d); i++) {
if (bef == d[i])
cc++;
else {
v.push_back(cc);
cc = 1;
... | insert | 28 | 28 | 28 | 35 | 0 | |
p02891 | C++ | Runtime Error | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include ... | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include ... | replace | 56 | 57 | 56 | 59 | 0 | |
p02891 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define trav(a, x) for (auto &a : x)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
typedef __int128 ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
// const ll mod = 3006703054056749LL;
// const ll... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define trav(a, x) for (auto &a : x)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
typedef __int128 ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
// const ll mod = 3006703054056749LL;
// const ll... | replace | 114 | 115 | 114 | 115 | 0 | |
p02891 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define int long long
typedef long long LL;
template <class T> inline void read(T &x) {
x = 0;
char c = getchar();
bool f = 0;
for (; !isdigit(c); c = getchar())
f ^= c == '-';
for (; isdigit(c); c = getchar())
x = x * 10 + (c ^ 48);
x = f ? -x : x;
}
... | #include <bits/stdc++.h>
using namespace std;
#define int long long
typedef long long LL;
template <class T> inline void read(T &x) {
x = 0;
char c = getchar();
bool f = 0;
for (; !isdigit(c); c = getchar())
f ^= c == '-';
for (; isdigit(c); c = getchar())
x = x * 10 + (c ^ 48);
x = f ? -x : x;
}
... | delete | 34 | 36 | 34 | 34 | TLE | |
p02891 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <bitset>
#include <chrono>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <random>
#define IOS \
ios_base::sync_with_stdio(false); \
... | #include <bits/stdc++.h>
#include <bitset>
#include <chrono>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <random>
#define IOS \
ios_base::sync_with_stdio(false); \
... | delete | 32 | 36 | 32 | 32 | 0 | |
p02891 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
string s, t, u;
cin >> s;
t = s + s;
u = s + s + s;
int64_t K, count1 = 0, count2 = 0, N, count3 = 0;
cin >> K;
N = s.size();
if (N == 1) {
cout << K / 2 << endl;
return 0;
}
for (int i = 0; i < N - 1; i++) {
if (s.at(i) == s.at... | #include <bits/stdc++.h>
using namespace std;
int main() {
string s, t, u;
cin >> s;
t = s + s;
u = s + s + s;
int64_t K, count1 = 0, count2 = 0, N, count3 = 0;
cin >> K;
N = s.size();
if (N == 1) {
cout << K / 2 << endl;
return 0;
}
for (int i = 0; i < N - 1; i++) {
if (s.at(i) == s.at... | replace | 36 | 37 | 36 | 42 | 0 | |
p02891 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#include <map>
int main() {
string S;
long long K;
cin >> S >> K;
string SS = S + S;
vector<int> X(109, 0);
long long flag = -1;
long long x = 1;
long long point = 0;
for (int i = 1; i < SS.size(); i++) {
if (SS[i - 1] == SS[i])... | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#include <map>
int main() {
string S;
long long K;
cin >> S >> K;
string SS = S + S;
vector<int> X(210, 0);
long long flag = -1;
long long x = 1;
long long point = 0;
for (int i = 1; i < SS.size(); i++) {
if (SS[i - 1] == SS[i])... | replace | 10 | 11 | 10 | 11 | 0 | |
p02891 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long
#define rep(i, n) for (ll(i) = 0; (i) < (n); ++(i))
using namespace std;
int main() {
string s;
ll k;
cin >> s >> k;
char prev = s[0];
ll cnt = 1;
vector<ll> n;
for (ll i = 1; i < s.size(); i++) {
if (s[i] == prev) {
cnt++;
if (i == s.size() -... | #include <bits/stdc++.h>
#define ll long long
#define rep(i, n) for (ll(i) = 0; (i) < (n); ++(i))
using namespace std;
int main() {
string s;
ll k;
cin >> s >> k;
if (s.size() == 1) {
cout << k / 2 << endl;
return 0;
}
char prev = s[0];
ll cnt = 1;
vector<ll> n;
for (ll i = 1; i < s.size(); i... | insert | 9 | 9 | 9 | 13 | 0 | |
p02891 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
// Defination {{{
#define PI std::pair<int, int>
#define mk std::make_pair
#define reg register
#define ll long long
#define rep(i, a, b) for (reg int i = a; i <= b; ++i)
#define per(i, a, b) for (reg int i = a; i >= b; --i)
#define pb push_back
#define debug(...) fprintf(stderr, __VA_ARGS__)
... | #include <bits/stdc++.h>
// Defination {{{
#define PI std::pair<int, int>
#define mk std::make_pair
#define reg register
#define ll long long
#define rep(i, a, b) for (reg int i = a; i <= b; ++i)
#define per(i, a, b) for (reg int i = a; i >= b; --i)
#define pb push_back
#define debug(...) fprintf(stderr, __VA_ARGS__)
... | replace | 35 | 37 | 35 | 37 | TLE | |
p02892 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define rrep(i, a, b) for (int i = a; i >= b; i--)
#define erep(i, a, n) for (int i = a; i <= n; i++)
typedef long long ll;
#define int long long
#define vint vector<int>
#define vvint vector<vector<int>>
#define vstring vect... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define rrep(i, a, b) for (int i = a; i >= b; i--)
#define erep(i, a, n) for (int i = a; i <= n; i++)
typedef long long ll;
#define int long long
#define vint vector<int>
#define vvint vector<vector<int>>
#define vstring vect... | replace | 49 | 50 | 49 | 50 | 0 | |
p02892 | Python | Runtime Error | import numpy as np
import sys
from scipy.sparse.csgraph import floyd_warshall, csgraph_from_dense
N = int(input())
S = np.frombuffer(sys.stdin.buffer.read(), dtype="S1").reshape(N, -1)[:, :N].astype(int)
G = csgraph_from_dense(S)
F = floyd_warshall(G).astype(int)
F2 = F % 2
I0 = np.where(F2[0] == 0)
I1 = np.where(F2[0... | import numpy as np
import sys
from scipy.sparse.csgraph import floyd_warshall, csgraph_from_dense
N = int(sys.stdin.buffer.readline())
S = np.frombuffer(sys.stdin.buffer.read(), dtype="S1").reshape(N, -1)[:, :N].astype(int)
G = csgraph_from_dense(S)
F = floyd_warshall(G).astype(int)
F2 = F % 2
I0 = np.where(F2[0] == 0... | replace | 4 | 5 | 4 | 5 | TLE | |
p02892 | Python | Runtime Error | from collections import deque
n = int(input())
s = [input() for i in range(n)]
q = deque([0])
d = [float("inf")] * n
d[0] = 0
while q:
p = q.popleft()
for i, c in enumerate(s[p]):
if c == "1" and d[i] == float("inf"):
d[i] = d[p] + 1
q.append(i)
m = 0
for i in range(n):
if d... | from collections import deque
n = int(input())
s = [input() for i in range(n)]
ans = -2
for k in range(n):
q = deque([k])
d = [float("inf")] * n
d[k] = 0
while q:
flg = 0
p = q.popleft()
for i, c in enumerate(s[p]):
if c == "1":
if d[i] == float("inf"... | replace | 4 | 34 | 4 | 27 | 0 | |
p02892 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int N = 110;
char s[N][N];
int stg[N];
int n;
int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
scanf("%s", s[i] + 1);
}
int ret = -1;
for (int S = 1; S <= n; S++) {
queue<int> q;
q.push(S);
for (int i = 1; i <= n; i++)
stg[i] = 0;
... | #include <bits/stdc++.h>
using namespace std;
const int N = 210;
char s[N][N];
int stg[N];
int n;
int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
scanf("%s", s[i] + 1);
}
int ret = -1;
for (int S = 1; S <= n; S++) {
queue<int> q;
q.push(S);
for (int i = 1; i <= n; i++)
stg[i] = 0;
... | replace | 2 | 3 | 2 | 3 | 0 | |
p02892 | C++ | Runtime Error | #include <iostream>
using namespace std;
int n, i, ii, j, x, nr, p, u, ok;
int v[105], c[105];
char a[105][105];
int main() {
cin >> n;
for (i = 1; i <= n; i++) {
cin >> a[i] + 1;
}
nr = -1;
for (ii = 1; ii <= n; ii++) {
for (i = 1; i <= n; i++) {
v[i] = 0;
}
v[ii] = p = u = 1;
c[1] ... | #include <iostream>
using namespace std;
int n, i, ii, j, x, nr, p, u, ok;
int v[205], c[205];
char a[205][205];
int main() {
cin >> n;
for (i = 1; i <= n; i++) {
cin >> a[i] + 1;
}
nr = -1;
for (ii = 1; ii <= n; ii++) {
for (i = 1; i <= n; i++) {
v[i] = 0;
}
v[ii] = p = u = 1;
c[1] ... | replace | 3 | 5 | 3 | 5 | 0 | |
p02892 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define ld long double
#define pii pair<int, int>
#define pld pair<ld, ld>
#define all(v) v.begin(), v.end()
#define F first
#define S second
#define mod 1000000007
#define pb push_back
#define MP make_pair
#define mset(x) memset(x, 0, sizeof(x));
#... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define ld long double
#define pii pair<int, int>
#define pld pair<ld, ld>
#define all(v) v.begin(), v.end()
#define F first
#define S second
#define mod 1000000007
#define pb push_back
#define MP make_pair
#define mset(x) memset(x, 0, sizeof(x));
#... | replace | 53 | 66 | 53 | 66 | -8 | |
p02892 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define sz(x) ((ll)x.size())
#define all(x) x.begin(), x.end()
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef long long ll;
typedef unsigned long long ul;
const int mn = 1e5 + 5;
const int mod = 1e9 + 7;
void bye() {
puts("-1");
exi... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define sz(x) ((ll)x.size())
#define all(x) x.begin(), x.end()
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef long long ll;
typedef unsigned long long ul;
const int mn = 1e5 + 5;
const int mod = 1e9 + 7;
void bye() {
puts("-1");
exi... | replace | 38 | 39 | 38 | 39 | TLE | |
p02892 | C++ | Runtime Error | /**/
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
typedef long long LL;
using namespace std;
int n, col[205], tot, head[205];
int dp[205][205];
char s... | /**/
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
typedef long long LL;
using namespace std;
int n, col[205], tot, head[205];
int dp[205][205];
char s... | replace | 23 | 24 | 23 | 24 | 0 | |
p02892 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#define mk make_pair
#define eb emplace_back
#define eps 1e-8
#define fi first
#define se second
#define all(x) (x).begin()... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#define mk make_pair
#define eb emplace_back
#define eps 1e-8
#define fi first
#define se second
#define all(x) (x).begin()... | delete | 58 | 62 | 58 | 58 | 0 | |
p02892 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int dis[105][105], e[105][105];
signed main() {
int n;
char ch;
cin >> n;
memset(dis, 0x3f, sizeof(dis));
for (int i = 1; i <= n; ++i)
dis[i][i] = 0;
for (int i = 1; i <= n; ++i)
for (int j = 1; j <= n; ++j) {
cin >> ch;
if (ch == '1')
... | #include <bits/stdc++.h>
using namespace std;
int dis[205][205], e[205][205];
signed main() {
int n;
char ch;
cin >> n;
memset(dis, 0x3f, sizeof(dis));
for (int i = 1; i <= n; ++i)
dis[i][i] = 0;
for (int i = 1; i <= n; ++i)
for (int j = 1; j <= n; ++j) {
cin >> ch;
if (ch == '1')
... | replace | 2 | 3 | 2 | 3 | 0 | |
p02892 | C++ | Time Limit Exceeded | // https://atcoder.jp/contests/agc039/tasks/agc039_b
#include "algorithm"
#include "iostream"
#include "queue"
#include "set"
#include "vector"
#define rep(i, from, to) for (ll i = from; i < (to); ++i)
using namespace std;
typedef long long ll;
template <typename T> using V = vector<T>;
template <typename T> inline bo... | // https://atcoder.jp/contests/agc039/tasks/agc039_b
#include "algorithm"
#include "iostream"
#include "queue"
#include "set"
#include "vector"
#define rep(i, from, to) for (ll i = from; i < (to); ++i)
using namespace std;
typedef long long ll;
template <typename T> using V = vector<T>;
template <typename T> inline bo... | replace | 52 | 54 | 52 | 58 | TLE | |
p02892 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <stdio.h>
#include <string>
#include <unordered_map>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define repn(i, n) for (int i = 1; i <= n; i++)
#define repr(e, x) f... | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <stdio.h>
#include <string>
#include <unordered_map>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define repn(i, n) for (int i = 1; i <= n; i++)
#define repr(e, x) f... | insert | 66 | 66 | 66 | 67 | TLE | |
p02892 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#pragma GCC optimize("Ofast")
using namespace std;
const long long INF = 20000000000;
// setprecision(2) <<
const int MOD = 1000000007;
lo... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#pragma GCC optimize("Ofast")
using namespace std;
const long long INF = 20000000000;
// setprecision(2) <<
const int MOD = 1000000007;
lo... | replace | 92 | 93 | 92 | 121 | 255 | |
p02892 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int N = 105;
typedef long long LL;
char ch;
int a[N][N], n, clr[N], ok, dis[N][N], ans;
void Dfs(int u, int col) {
clr[u] = col;
for (int i = 1; i <= n; i++)
if (a[u][i] == 1) {
if (clr[i]) {
if (clr[i] == col)
ok = 1;
contin... | #include <bits/stdc++.h>
using namespace std;
const int N = 205;
typedef long long LL;
char ch;
int a[N][N], n, clr[N], ok, dis[N][N], ans;
void Dfs(int u, int col) {
clr[u] = col;
for (int i = 1; i <= n; i++)
if (a[u][i] == 1) {
if (clr[i]) {
if (clr[i] == col)
ok = 1;
contin... | replace | 3 | 4 | 3 | 4 | 0 | |
p02892 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <ctime>
#include <deque>
#include <float.h>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <ctime>
#include <deque>
#include <float.h>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include... | insert | 135 | 135 | 135 | 136 | TLE | |
p02892 | C++ | Time Limit Exceeded | #include <algorithm>
#include <assert.h>
#include <climits>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <vector>
using namespace std;
template <typename T> inline bool sign(T A) { return (A > 0)... | #include <algorithm>
#include <assert.h>
#include <climits>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <vector>
using namespace std;
template <typename T> inline bool sign(T A) { return (A > 0)... | insert | 68 | 68 | 68 | 70 | TLE | |
p02892 | C++ | Runtime Error | #include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
using namespace std;
const int MAX_N = 1e3 + 10;
int N, fl, ans;
int col[MAX_N];
int cap;
int head[MAX_N], to[MAX_N], nxt[MAX_N];
queue<int> que;
inline int Abs(int x) { return x < 0 ? -x : x; }
void BFS(int x) {
memset(col, 0, sizeof c... | #include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
using namespace std;
const int MAX_N = 1e5 + 10;
int N, fl, ans;
int col[MAX_N];
int cap;
int head[MAX_N], to[MAX_N], nxt[MAX_N];
queue<int> que;
inline int Abs(int x) { return x < 0 ? -x : x; }
void BFS(int x) {
memset(col, 0, sizeof c... | replace | 7 | 8 | 7 | 8 | 0 | |
p02892 | C++ | Runtime Error | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author parsa bahrami
*/
#pragma GCC optimize("O2")
#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 long long i... | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author parsa bahrami
*/
#pragma GCC optimize("O2")
#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 long long i... | replace | 54 | 55 | 54 | 55 | 0 | |
p02892 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define REP(i, m, n) for (int i = (m); i < (int)(n); i++)
#define RREP(i, m, n) for (int i = (int)(n - 1); i >= m; i--)
#define rep(i, n) REP(i, 0, n)
#define rrep(i, n) RREP(i, 0, n)
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define fi... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, m, n) for (int i = (m); i < (int)(n); i++)
#define RREP(i, m, n) for (int i = (int)(n - 1); i >= m; i--)
#define rep(i, n) REP(i, 0, n)
#define rrep(i, n) RREP(i, 0, n)
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define fi... | replace | 66 | 67 | 66 | 67 | -11 | |
p02892 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <queue>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long int ll;
typedef pair<int, int> Pii;
const ll mod = 1000000007;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
vector<string> S(N)... | #include <algorithm>
#include <iostream>
#include <queue>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long int ll;
typedef pair<int, int> Pii;
const ll mod = 1000000007;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
vector<string> S(N)... | insert | 33 | 33 | 33 | 35 | TLE | |
p02892 | C++ | Time Limit Exceeded | #ifdef LOCAL
#pragma GCC optimize("O0")
#else
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx")
#endif
#include <algorithm>
#include <bitset>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <st... | #ifdef LOCAL
#pragma GCC optimize("O0")
#else
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx")
#endif
#include <algorithm>
#include <bitset>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <st... | replace | 466 | 486 | 466 | 472 | TLE | |
p02892 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using db = double;
using ld = long double;
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define eb emplace_back
#define all(v) (v).begin(), (v).end()
#define siz(v) (ll)(v).size()
#define rep(i, a, ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using db = double;
using ld = long double;
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define eb emplace_back
#define all(v) (v).begin(), (v).end()
#define siz(v) (ll)(v).size()
#define rep(i, a, ... | replace | 84 | 85 | 84 | 85 | 0 | |
p02892 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#define REP(i, a, n) for (int i = a; i <= n; ++i)
#define PER(i, a, n) for (int i =... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#define REP(i, a, n) for (int i = a; i <= n; ++i)
#define PER(i, a, n) for (int i =... | replace | 55 | 56 | 55 | 56 | 0 | |
p02892 | C++ | Time Limit Exceeded | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using datas = pair<ll, ll>;
using ddatas = pair<double, double>;
using tdata = pair<ll, datas>;
using vec = vector<ll>;
using mat = vector<vec>;
using pvec = vector<datas>;
using pmat = vector<pvec>;
#define For(i, a, b) f... | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using datas = pair<ll, ll>;
using ddatas = pair<double, double>;
using tdata = pair<ll, datas>;
using vec = vector<ll>;
using mat = vector<vec>;
using pvec = vector<datas>;
using pmat = vector<pvec>;
#define For(i, a, b) f... | replace | 144 | 147 | 144 | 150 | TLE | |
p02892 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ADD(a, b) a = (a + ll(b)) % mod
#define MUL(a, b) a = (a * ll(b)) % mod
#define MAX(a, b) a = max(a, b)
#define MIN(a, b) a = min(a, b)
#define rep(i, a, b) for (int i = int(a); i < int(b); i++)
#define rer(i, a, b) for (int i = int(a) - 1; i >= int(b); i--)
#define all(a) (a).begin(), ... | #include <bits/stdc++.h>
#define ADD(a, b) a = (a + ll(b)) % mod
#define MUL(a, b) a = (a * ll(b)) % mod
#define MAX(a, b) a = max(a, b)
#define MIN(a, b) a = min(a, b)
#define rep(i, a, b) for (int i = int(a); i < int(b); i++)
#define rer(i, a, b) for (int i = int(a) - 1; i >= int(b); i--)
#define all(a) (a).begin(), ... | replace | 54 | 55 | 54 | 55 | 0 | Time: 0.031144 s.
|
p02892 | C++ | Runtime Error | #include <cstdio>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
const int N = 202;
vector<int> g[N];
int col[N];
bool dfs(int v, int c, vector<int> &comp) {
comp.push_back(v);
col[v] = c;
for (int u : g[v]) {
if (col[u] == -1) {
if (!dfs(u, c ^ 1, comp))
return ... | #include <cstdio>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
const int N = 202;
vector<int> g[N];
int col[N];
bool dfs(int v, int c, vector<int> &comp) {
comp.push_back(v);
col[v] = c;
for (int u : g[v]) {
if (col[u] == -1) {
if (!dfs(u, c ^ 1, comp))
return ... | replace | 60 | 61 | 60 | 61 | 0 | |
p02892 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include ... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include ... | insert | 60 | 60 | 60 | 63 | TLE | |
p02892 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#inc... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#inc... | insert | 88 | 88 | 88 | 90 | TLE | |
p02892 | C++ | Runtime Error | #include <cstdio>
#include <iostream>
#define N 9
using namespace std;
int n, ans, d[N][N];
int main() {
int i, j, k, t;
cin >> n;
for (i = 0; i < n; i++)
for (j = 0; j < n; j++) {
scanf("%1d", &t);
d[i][j] = (t == 1 || i == j ? t : 1e9);
}
for (k = 0; k < n; k++)
for (i = 0; i < n; i++... | #include <cstdio>
#include <iostream>
#define N 205
using namespace std;
int n, ans, d[N][N];
int main() {
int i, j, k, t;
cin >> n;
for (i = 0; i < n; i++)
for (j = 0; j < n; j++) {
scanf("%1d", &t);
d[i][j] = (t == 1 || i == j ? t : 1e9);
}
for (k = 0; k < n; k++)
for (i = 0; i < n; i... | replace | 2 | 3 | 2 | 3 | 0 | |
p02892 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define ri register int
#define fi first
#define se second
#define pb push_back
using namespace std;
const int rlen = 1 << 18 | 1;
char buf[rlen], *ib = buf, *ob = buf;
#define gc() \
(((ib == ob) && (ob = (ib = buf) + fread(bu... | #include <bits/stdc++.h>
#define ri register int
#define fi first
#define se second
#define pb push_back
using namespace std;
const int rlen = 1 << 18 | 1;
char buf[rlen], *ib = buf, *ob = buf;
#define gc() \
(((ib == ob) && (ob = (ib = buf) + fread(bu... | insert | 76 | 76 | 76 | 77 | TLE | |
p02892 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define min(a, b) ((a) < (b) ? (a) : (b))
#define max(a, b) ((a) > (b) ? (a) : (b))
#define REP(i, n) for (ll i = 0; i < n; i++)
#define FOR(i, n1, n2) for (ll i = n1; i < n2; i++)
#define bFOR(i, n1, n2) for (ll i = n1; i >= n2; i--)
#define speed_up ... | #include <bits/stdc++.h>
using namespace std;
#define min(a, b) ((a) < (b) ? (a) : (b))
#define max(a, b) ((a) > (b) ? (a) : (b))
#define REP(i, n) for (ll i = 0; i < n; i++)
#define FOR(i, n1, n2) for (ll i = n1; i < n2; i++)
#define bFOR(i, n1, n2) for (ll i = n1; i >= n2; i--)
#define speed_up ... | replace | 51 | 53 | 51 | 53 | 0 | |
p02893 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int N, dp[200009], bit[200009], p2[200009], v[200009];
char initSir[200009];
const int mod = 998244353;
int add(int x, int y) {
int ans = x + y;
if (ans >= mod)
ans -= mod;
return ans;
}
int subtract(int x, int y) {
if (x >= y)
return x - y;
return x - ... | #include <bits/stdc++.h>
using namespace std;
int N, dp[400009], bit[200009], p2[200009], v[200009];
char initSir[200009];
const int mod = 998244353;
int add(int x, int y) {
int ans = x + y;
if (ans >= mod)
ans -= mod;
return ans;
}
int subtract(int x, int y) {
if (x >= y)
return x - y;
return x - ... | replace | 4 | 5 | 4 | 5 | 0 | |
p02893 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include ... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include ... | insert | 112 | 112 | 112 | 114 | TLE | |
p02893 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ri register int
#define pb push_back
#define fi first
#define se second
using namespace std;
const int rlen = 1 << 18 | 1;
char buf[rlen], *ib = buf, *ob = buf;
#define gc() \
(((ib == ob) && (ob = (ib = buf) + fread(bu... | #include <bits/stdc++.h>
#define ri register int
#define pb push_back
#define fi first
#define se second
using namespace std;
const int rlen = 1 << 18 | 1;
char buf[rlen], *ib = buf, *ob = buf;
#define gc() \
(((ib == ob) && (ob = (ib = buf) + fread(bu... | replace | 82 | 83 | 82 | 83 | 0 | |
p02893 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef pair<int, int> pi;
typedef vector<pi> vpi;
typedef long double ld;
#define pb emplace_back
#define mp make_pair
#define lb lower_bound
#define ub upper_bound
#define ALL(x) x.begin(), x.end()
#def... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef pair<int, int> pi;
typedef vector<pi> vpi;
typedef long double ld;
#define pb emplace_back
#define mp make_pair
#define lb lower_bound
#define ub upper_bound
#define ALL(x) x.begin(), x.end()
#def... | replace | 23 | 24 | 23 | 24 | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.