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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
p03092 | C++ | Time Limit Exceeded | #include "bits/stdc++.h"
using namespace std;
#define FAST \
ios_base::sync_with_stdio(false); \
cin.tie(0);
#define pb push_back
#define eb emplace_back
#define ins insert
#define ph push
#define f first
#... | #include "bits/stdc++.h"
using namespace std;
#define FAST \
ios_base::sync_with_stdio(false); \
cin.tie(0);
#define pb push_back
#define eb emplace_back
#define ins insert
#define ph push
#define f first
#... | replace | 67 | 69 | 67 | 68 | TLE | |
p03092 | C++ | Runtime Error | #define _CRT_SECURE_NO_WARNINGS
#define _SCL_SECURE_NO_WARNINGS
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <m... | #define _CRT_SECURE_NO_WARNINGS
#define _SCL_SECURE_NO_WARNINGS
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <m... | replace | 131 | 132 | 131 | 132 | -11 | |
p03093 | C++ | Runtime Error | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <functional>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <memory.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <time.h>
#i... | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <functional>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <memory.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <time.h>
#i... | replace | 31 | 32 | 31 | 32 | 0 | |
p03093 | C++ | Runtime Error | #include <bits/stdc++.h>
typedef long long int ll;
typedef long double ld;
#define pb push_back
#define pii pair<int, int>
#define F first
#define S second
#define endl '\n'
#define int long long
#define sync \
ios_base::sync_with_stdio(false); ... | #include <bits/stdc++.h>
typedef long long int ll;
typedef long double ld;
#define pb push_back
#define pii pair<int, int>
#define F first
#define S second
#define endl '\n'
#define int long long
#define sync \
ios_base::sync_with_stdio(false); ... | replace | 16 | 17 | 16 | 17 | 0 | |
p03093 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
inline int gi() {
char c = getchar();
while (c < '0' || c > '9')
c = getchar();
int sum = 0;
while ('0' <= c && c <= '9')
sum = sum * 10 + c - 48, c = getchar();
return sum;
}
const int maxn = 200005;
int n, a[maxn], p;
bool check(int t) {
for (int i... | #include <bits/stdc++.h>
using namespace std;
inline int gi() {
char c = getchar();
while (c < '0' || c > '9')
c = getchar();
int sum = 0;
while ('0' <= c && c <= '9')
sum = sum * 10 + c - 48, c = getchar();
return sum;
}
const int maxn = 200005;
int n, a[maxn], p;
bool check(int t) {
for (int i... | replace | 19 | 20 | 19 | 20 | 0 | |
p03093 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define N 100005
int n, m;
int a[N << 1];
int main() {
scanf("%d %d", &n, &m);
int nn = n << 1;
for (int i = 1; i <= nn; i++)
scanf("%d", &a[i]);
sort(a + 1, a + nn + 1);
int st = 0, en = n + 1;
while (en - st > 1) {
int mid = en + st >> 1;
int le... | #include <bits/stdc++.h>
using namespace std;
#define N 100005
int n, m;
int a[N << 1];
int main() {
scanf("%d %d", &n, &m);
int nn = n << 1;
for (int i = 1; i <= nn; i++)
scanf("%d", &a[i]);
sort(a + 1, a + nn + 1);
int st = 0, en = n + 1;
while (en - st > 1) {
int mid = en + st >> 1;
int le... | replace | 20 | 24 | 20 | 23 | 0 | |
p03093 | C++ | Runtime Error | // This amazing code is by Eric Sunli Chen.
#include <bits/stdc++.h>
using namespace std;
template <typename T> bool get_int(T &x) {
char t = getchar();
bool neg = false;
x = 0;
for (; (t > '9' || t < '0') && t != '-' && t != EOF; t = getchar())
;
if (t == '-')
neg = true, t = getchar();
if (t == EO... | // This amazing code is by Eric Sunli Chen.
#include <bits/stdc++.h>
using namespace std;
template <typename T> bool get_int(T &x) {
char t = getchar();
bool neg = false;
x = 0;
for (; (t > '9' || t < '0') && t != '-' && t != EOF; t = getchar())
;
if (t == '-')
neg = true, t = getchar();
if (t == EO... | replace | 46 | 47 | 46 | 47 | 0 | |
p03093 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int N = 100010;
int n, m, a[N];
int main() {
scanf("%d%d", &n, &m);
for (int i = 1; i <= 2 * n; ++i)
scanf("%d", &a[i]);
sort(a + 1, a + n * 2 + 1);
int l = 0, r = n;
while (l < r) {
int mid = (l + r) >> 1;
bool flag = 1;
for (int i = 1; i <=... | #include <bits/stdc++.h>
using namespace std;
const int N = 1000010;
int n, m, a[N];
int main() {
scanf("%d%d", &n, &m);
for (int i = 1; i <= 2 * n; ++i)
scanf("%d", &a[i]);
sort(a + 1, a + n * 2 + 1);
int l = 0, r = n;
while (l < r) {
int mid = (l + r) >> 1;
bool flag = 1;
for (int i = 1; i <... | replace | 2 | 3 | 2 | 3 | 0 | |
p03093 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
using namespace std;
int n, m, a[100100], Ans, ans;
int main() {
scanf("%d%d", &n, &m);
for (int i = 1; i <= 2 * n; i++)
scanf("%d", &a[i]);
sort(a + 1, a + 2 * n + 1);
int L = 0, R = n, ans;
while (L <= R) {
int mid = (L + R) / 2;
bool bo = true;
for (in... | #include <algorithm>
#include <cstdio>
using namespace std;
int n, m, a[200100], Ans, ans;
int main() {
scanf("%d%d", &n, &m);
for (int i = 1; i <= 2 * n; i++)
scanf("%d", &a[i]);
sort(a + 1, a + 2 * n + 1);
int L = 0, R = n, ans;
while (L <= R) {
int mid = (L + R) / 2;
bool bo = true;
for (in... | replace | 3 | 4 | 3 | 4 | 0 | |
p03093 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int n, m, a[120000], ans;
int main() {
scanf("%d%d", &n, &m);
for (int i = 1; i <= n * 2; ++i)
scanf("%d", a + i);
sort(a + 1, a + n * 2 + 1);
int l = 0, r = n;
while (l <= r) {
int mid = (l + r) >> 1;
bool fl = 1;
int tmp = 0;
for (int i = ... | #include <bits/stdc++.h>
using namespace std;
int n, m, a[300000], ans;
int main() {
scanf("%d%d", &n, &m);
for (int i = 1; i <= n * 2; ++i)
scanf("%d", a + i);
sort(a + 1, a + n * 2 + 1);
int l = 0, r = n;
while (l <= r) {
int mid = (l + r) >> 1;
bool fl = 1;
int tmp = 0;
for (int i = ... | replace | 4 | 5 | 4 | 5 | 0 | |
p03093 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ci const int &
using namespace std;
int n, m, a[100010], l, r, mid, ans;
bool Check(int x) {
if (!(x & 1))
--x;
for (int i = x, j = (n << 1); i < j; ++i, --j)
if (a[i] + a[j] < m)
return 0;
return 1;
}
int main() {
scanf("%d%d", &n, &m);
for (int i = 1; i <= (n <... | #include <bits/stdc++.h>
#define ci const int &
using namespace std;
int n, m, a[200010], l, r, mid, ans;
bool Check(int x) {
if (!(x & 1))
--x;
for (int i = x, j = (n << 1); i < j; ++i, --j)
if (a[i] + a[j] < m)
return 0;
return 1;
}
int main() {
scanf("%d%d", &n, &m);
for (int i = 1; i <= (n <... | replace | 3 | 4 | 3 | 4 | 0 | |
p03093 | C++ | Runtime Error | #pragma GCC optimize(3)
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/priority_queue.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define MAXN 100005
#define INF 1000000000
#define MOD 1000000007
#define F first
#define S second
using namespace std;
using namespace __gnu_pbds;
typed... | #pragma GCC optimize(3)
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/priority_queue.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define MAXN 200005
#define INF 1000000000
#define MOD 1000000007
#define F first
#define S second
using namespace std;
using namespace __gnu_pbds;
typed... | replace | 5 | 6 | 5 | 6 | 0 | |
p03093 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
using namespace std;
int a[100000];
int main() {
int n, m, l, r, mid, ans = 0, i, j;
scanf("%d %d", &n, &m);
for (i = 0; i < n * 2; i++)
scanf("%d", &a[i]);
sort(a, a + n * 2);
l = -1, r = n, mid = (l + r) / 2;
while (r - l > 1) {
for (i = mid * 2, j = ... | #include <algorithm>
#include <cstdio>
using namespace std;
int a[200000];
int main() {
int n, m, l, r, mid, ans = 0, i, j;
scanf("%d %d", &n, &m);
for (i = 0; i < n * 2; i++)
scanf("%d", &a[i]);
sort(a, a + n * 2);
l = -1, r = n, mid = (l + r) / 2;
while (r - l > 1) {
for (i = mid * 2, j = ... | replace | 5 | 6 | 5 | 6 | 0 | |
p03093 | C++ | Runtime Error | #include <bits/stdc++.h>
// #pragma GCC optimize ("O3")
// #pragma GCC target ("sse4")
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
typedef pair<int, int> PII;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORD(i, a, b) for (... | #include <bits/stdc++.h>
// #pragma GCC optimize ("O3")
// #pragma GCC target ("sse4")
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
typedef pair<int, int> PII;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORD(i, a, b) for (... | replace | 20 | 21 | 20 | 21 | 0 | |
p03093 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define eps 1e-5
#define M 100010
#define fi first
#define se second
#define pb push_back
#define LL long long
#define MOD 1000000007
#define pii pair<int, int>
#define rep(i, x, y) for (int i = (x); i <= (y); ++i)
inline int read() {
char ch = getchar();
int x = 0, f =... | #include <bits/stdc++.h>
using namespace std;
#define eps 1e-5
#define M 200010
#define fi first
#define se second
#define pb push_back
#define LL long long
#define MOD 1000000007
#define pii pair<int, int>
#define rep(i, x, y) for (int i = (x); i <= (y); ++i)
inline int read() {
char ch = getchar();
int x = 0, f =... | replace | 3 | 4 | 3 | 4 | 0 | |
p03093 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 200005;
const ll inf = 0x3f3f3f3f3f3f3f3fll;
int read() {
int f = 1, g = 0;
char ch = getchar();
for (; !isdigit(ch); ch = getchar())
if (ch == '-')
f = -1;
for (; isdigit(ch); ch = getchar())
g = g * 10 + ch - '0';
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 200005;
const ll inf = 0x3f3f3f3f3f3f3f3fll;
int read() {
int f = 1, g = 0;
char ch = getchar();
for (; !isdigit(ch); ch = getchar())
if (ch == '-')
f = -1;
for (; isdigit(ch); ch = getchar())
g = g * 10 + ch - '0';
... | replace | 24 | 25 | 24 | 25 | 0 | |
p03093 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
vector<int> a;
int n, M;
int Q(int k) {
int f = -1;
for (int i = 0; i < k; i++) {
f = max(f, a[i] + a[2 * k - 1 - i]);
}
for (int i = 0; i < (n - k); i++) {
int r = a[2 * k + i] + a[2 * n - 1 - i];
if (r < M)
return -1;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
vector<int> a;
int n, M;
int Q(int k) {
int f = -1;
for (int i = 0; i < k; i++) {
f = max(f, (a[i] + a[2 * k - 1 - i]) % M);
}
for (int i = 0; i < (n - k); i++) {
int r = a[2 * k + i] + a[2 * n - 1 - i];
if (r < M)
return -1... | replace | 10 | 11 | 10 | 11 | 0 | |
p03093 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for ((i) = 1; (i) <= (n); (i)++)
using namespace std;
int n, m, i, j, a[100005], l, r, mid, ans, res;
bool check(int x) {
int i, j;
for (i = 2 * x + 1, j = n * 2; i <= j; i++, j--) {
if (a[i] + a[j] < m)
return 0;
}
return 1;
}
int main() {
cin >> n >> m;
... | #include <bits/stdc++.h>
#define rep(i, n) for ((i) = 1; (i) <= (n); (i)++)
using namespace std;
int n, m, i, j, a[200005], l, r, mid, ans, res;
bool check(int x) {
int i, j;
for (i = 2 * x + 1, j = n * 2; i <= j; i++, j--) {
if (a[i] + a[j] < m)
return 0;
}
return 1;
}
int main() {
cin >> n >> m;
... | replace | 3 | 4 | 3 | 4 | 0 | |
p03093 | C++ | Runtime Error | // E.cpp
#include <bits/stdc++.h>
using namespace std;
const int MAX_N = 1e5 + 200;
int n, m, ai[MAX_N];
int main() {
scanf("%d%d", &n, &m);
for (int i = 1; i <= 2 * n; i++)
scanf("%d", &ai[i]);
sort(ai + 1, ai + 1 + 2 * n);
int l = 0, r = n, res;
while (l <= r) {
int mid = (l + r) >> 1;
bool ... | // E.cpp
#include <bits/stdc++.h>
using namespace std;
const int MAX_N = 2e5 + 200;
int n, m, ai[MAX_N];
int main() {
scanf("%d%d", &n, &m);
for (int i = 1; i <= 2 * n; i++)
scanf("%d", &ai[i]);
sort(ai + 1, ai + 1 + 2 * n);
int l = 0, r = n, res;
while (l <= r) {
int mid = (l + r) >> 1;
bool ... | replace | 5 | 6 | 5 | 6 | 0 | |
p03093 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 11;
int n, mod;
int a[N];
bool check(int pos) {
int l = pos + 1, r = 2 * n;
while (l <= r) {
if (a[l] + a[r] < mod)
return 0;
l++;
r--;
}
return 1;
}
int main() {
cin >> n >> mod;
for (int i = 1; i <= n + n; i++) {
scanf... | #include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 11;
int n, mod;
int a[N];
bool check(int pos) {
int l = pos + 1, r = 2 * n;
while (l <= r) {
if (a[l] + a[r] < mod)
return 0;
l++;
r--;
}
return 1;
}
int main() {
cin >> n >> mod;
for (int i = 1; i <= n + n; i++) {
scanf... | replace | 2 | 3 | 2 | 3 | 0 | |
p03093 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <vector>
using namespace std;
#define LL long long
#define fgx cerr << "--------------" << endl;
#define dgx cerr << "==============" << endl;
inline int read() {
int x = 0, f = 1;
char c = getchar();
for (; !isdigit(c); c =... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <vector>
using namespace std;
#define LL long long
#define fgx cerr << "--------------" << endl;
#define dgx cerr << "==============" << endl;
inline int read() {
int x = 0, f = 1;
char c = getchar();
for (; !isdigit(c); c =... | replace | 22 | 23 | 22 | 23 | 0 | |
p03093 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <iostream>
#define FOF(i, a, b) for (int i = a; i < b; i++)
using namespace std;
const int N = 100100;
int n, m, w, T, L, R, mi, mx, a[N];
int cal(int x, int y) { return a[x] - (x >= y) * m; }
bool chk(int x) {
int y = x + n;
x <<= 1;
mx = 0;
mi = m;
FOF(i, 0, T... | #include <algorithm>
#include <cstdio>
#include <iostream>
#define FOF(i, a, b) for (int i = a; i < b; i++)
using namespace std;
const int N = 200200;
int n, m, w, T, L, R, mi, mx, a[N];
int cal(int x, int y) { return a[x] - (x >= y) * m; }
bool chk(int x) {
int y = x + n;
x <<= 1;
mx = 0;
mi = m;
FOF(i, 0, T... | replace | 5 | 6 | 5 | 6 | 0 | |
p03093 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define Fast_IO ios::sync_with_stdio(false);
#define DEBUG \
fprintf(stderr, "Running on Line %d in Function %s\n", __LINE__, __FUNCTION__)
/... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define Fast_IO ios::sync_with_stdio(false);
#define DEBUG \
fprintf(stderr, "Running on Line %d in Function %s\n", __LINE__, __FUNCTION__)
/... | replace | 37 | 38 | 37 | 38 | 0 | |
p03093 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = (a); i <= (b); ++i)
using namespace std;
const int N = 100005, INF = 0X3F3F3F3F;
int n, P, a[N], b[N], ans = INF;
bool chk(int mid) {
rep(i, 1, n) b[i] = a[i] - (i >= n - mid + 1) * P;
inplace_merge(b + 1, b + n - mid + 1, b + 1 + n);
int mx = 0;
rep(i,... | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = (a); i <= (b); ++i)
using namespace std;
const int N = 200005, INF = 0X3F3F3F3F;
int n, P, a[N], b[N], ans = INF;
bool chk(int mid) {
rep(i, 1, n) b[i] = a[i] - (i >= n - mid + 1) * P;
inplace_merge(b + 1, b + n - mid + 1, b + 1 + n);
int mx = 0;
rep(i,... | replace | 3 | 4 | 3 | 4 | 0 | |
p03093 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int N, M;
int a[500005];
bool check1(int Now) {
int L = 1, R = Now;
while (a[L] + a[R] < M && L < R)
L++, R--;
if (a[L] + a[R] >= M)
return false;
return true;
}
bool check2(int Now) {
int L = Now + 1, R = N;
while (a[L] + a[R] >= M && L < R)
L++, R-... | #include <bits/stdc++.h>
using namespace std;
int N, M;
int a[500005];
bool check1(int Now) {
int L = 1, R = Now;
while (a[L] + a[R] < M && L < R)
L++, R--;
if (a[L] + a[R] >= M)
return false;
return true;
}
bool check2(int Now) {
int L = Now + 1, R = N;
while (a[L] + a[R] >= M && L < R)
L++, R-... | replace | 41 | 42 | 41 | 42 | 0 | |
p03093 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <stdio.h>
#define maxn 100005
using namespace std;
int n, m, a[maxn];
int judge(int x) {
for (int i = 2 * x + 1, j = 1; i <= 2 * n; i++, j++)
if (a[i] + a[2 * n - j + 1] < m)
return 0;
return 1;
}
int main() {
scanf("%d%d", &n, &m);
for (int i = 1; i <= 2 * n; i++)
... | #include <bits/stdc++.h>
#include <stdio.h>
#define maxn 200005
using namespace std;
int n, m, a[maxn];
int judge(int x) {
for (int i = 2 * x + 1, j = 1; i <= 2 * n; i++, j++)
if (a[i] + a[2 * n - j + 1] < m)
return 0;
return 1;
}
int main() {
scanf("%d%d", &n, &m);
for (int i = 1; i <= 2 * n; i++)
... | replace | 2 | 3 | 2 | 3 | 0 | |
p03093 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 10;
int n, mod, a[N];
int calcmin(int l, int r) {
int Min = mod << 1;
for (int _l = l, _r = r; _l <= _r; _l++, _r--) {
// printf("__ %d %d %d [%d\n",_l,_r,a[_l]+a[_r],Min);
Min = min(Min, a[_l] + a[_r]);
}
return Min;
}
int main() {
... | #include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 10;
int n, mod, a[N];
int calcmin(int l, int r) {
int Min = mod << 1;
for (int _l = l, _r = r; _l <= _r; _l++, _r--) {
// printf("__ %d %d %d [%d\n",_l,_r,a[_l]+a[_r],Min);
Min = min(Min, a[_l] + a[_r]);
}
return Min;
}
int main() {
... | replace | 24 | 25 | 24 | 25 | 0 | |
p03093 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
const int MN = 100005;
int N, M, A[MN], Ans;
inline bool check(int pos) {
int Now = 0;
for (int i = 1; i <= pos; ++i)
Now = std::max(Now, A[i] + A[2 * pos - i + 1]);
for (int i = 1; i <= N - pos; ++i) {
int v = A[2 * pos + i] + A[2 * N - i + 1];
if (v < M)
... | #include <algorithm>
#include <cstdio>
const int MN = 200005;
int N, M, A[MN], Ans;
inline bool check(int pos) {
int Now = 0;
for (int i = 1; i <= pos; ++i)
Now = std::max(Now, A[i] + A[2 * pos - i + 1]);
for (int i = 1; i <= N - pos; ++i) {
int v = A[2 * pos + i] + A[2 * N - i + 1];
if (v < M)
... | replace | 3 | 4 | 3 | 4 | 0 | |
p03094 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <queue>
#include <vector>
#define LL long long
#define LD long double
using namespace std;
const int NN = 1000000 + 117;
const int MM = 1000000 + 117;
int read() {
int fl = 1, x;
char c;
for ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <queue>
#include <vector>
#define LL long long
#define LD long double
using namespace std;
const int NN = 1000000 + 117;
const int MM = 1000000 + 117;
int read() {
int fl = 1, x;
char c;
for ... | replace | 57 | 58 | 57 | 58 | TLE | |
p03094 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long
template <class T> inline void read(T &x) {
x = 0;
register char c = getchar();
register bool f = 0;
while (!isdigit(c))
f ^= c == '-', c = getchar();
while (isdigit(c))
x = x * 10 + c - '0', c = getchar();
if (f)
x = -x;
}
const int N = 1e5 + 10, mo... | #include <bits/stdc++.h>
#define ll long long
template <class T> inline void read(T &x) {
x = 0;
register char c = getchar();
register bool f = 0;
while (!isdigit(c))
f ^= c == '-', c = getchar();
while (isdigit(c))
x = x * 10 + c - '0', c = getchar();
if (f)
x = -x;
}
const int N = 1e6 + 10, mo... | replace | 13 | 14 | 13 | 14 | 0 | |
p03095 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
string S;
int count[26] = {};
cin >> N;
cin >> S;
for (int i = 0; i < N; i++) {
count[S[i] - 'a']++;
}
long long int ans = 1;
for (int i = 0; i < N; i++) {
ans *= count[i] + 1;
ans %= 1000000007;
}
cout << ans - 1 <<... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
string S;
int count[26] = {};
cin >> N;
cin >> S;
for (int i = 0; i < N; i++) {
count[S[i] - 'a']++;
}
long long int ans = 1;
for (int i = 0; i < 26; i++) {
ans *= count[i] + 1;
ans %= 1000000007;
}
cout << ans - 1 <... | replace | 16 | 17 | 16 | 17 | 0 | |
p03095 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
const long long mod = 1e9 + 7;
#define rep(i, n) for (int i = 0; i < n; i++)
#define r... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
const long long mod = 1e9 + 7;
#define rep(i, n) for (int i = 0; i < n; i++)
#define r... | replace | 42 | 44 | 42 | 44 | 0 | |
p03095 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int MOD = 1e9 + 7;
int main() {
int n;
string s;
cin >> n >> s;
ll ans = 1;
vector<ll> al(26, 0);
for (int i = 0; i < n; i++) {
al[s[i] - 'a']++;
}
for (int i = 0; i < n; i++) {
ans *= (al[i] + 1);
ans %= MOD;
}
c... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int MOD = 1e9 + 7;
int main() {
int n;
string s;
cin >> n >> s;
ll ans = 1;
vector<ll> al(26, 0);
for (int i = 0; i < n; i++) {
al[s[i] - 'a']++;
}
for (int i = 0; i < 26; i++) {
ans *= (al[i] + 1);
ans %= MOD;
}
... | replace | 14 | 15 | 14 | 15 | 0 | |
p03095 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N;
string S;
cin >> N >> S;
vector<int> count(26);
for (int i = 0; i < N; i++) {
count.at((int)(S.at(i) - 'a'))++;
}
ll ans = 1;
int div = 1000000007;
for (int i = 0; i < N; i++) {
ans *= count.at(i) + ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N;
string S;
cin >> N >> S;
vector<int> count(26);
for (int i = 0; i < N; i++) {
count.at((int)(S.at(i) - 'a'))++;
}
ll ans = 1;
int div = 1000000007;
for (int i = 0; i < 26; i++) {
ans *= count.at(i) +... | replace | 20 | 21 | 20 | 21 | 0 | |
p03095 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long
using namespace std;
const ll Mod = 1e9 + 7;
ll Cnt[26];
int main() {
ll n;
cin >> n;
string s;
cin >> s;
for (ll i = 0; i < n; i++)
Cnt[s[i] - 'a']++;
ll Ans = 1;
for (ll i = 0; i < n; i++)
Ans = (Ans * (Cnt[i] + 1)) % Mod;
cout << (Ans - 1 ... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
const ll Mod = 1e9 + 7;
ll Cnt[26];
int main() {
ll n;
cin >> n;
string s;
cin >> s;
for (ll i = 0; i < n; i++)
Cnt[s[i] - 'a']++;
ll Ans = 1;
for (ll i = 0; i < 26; i++)
Ans = (Ans * (Cnt[i] + 1)) % Mod;
cout << (Ans - 1... | replace | 20 | 21 | 20 | 21 | 0 | |
p03095 | C++ | Runtime Error | #include <bits/stdc++.h>
#define llong long long
#define mkpr make_pair
#define riterator reverse_iterator
using namespace std;
inline int read() {
int x = 0, f = 1;
char ch = getchar();
for (; !isdigit(ch); ch = getchar()) {
if (ch == '-')
f = -1;
}
for (; isdigit(ch); ch = getchar()) {
x = x ... | #include <bits/stdc++.h>
#define llong long long
#define mkpr make_pair
#define riterator reverse_iterator
using namespace std;
inline int read() {
int x = 0, f = 1;
char ch = getchar();
for (; !isdigit(ch); ch = getchar()) {
if (ch == '-')
f = -1;
}
for (; isdigit(ch); ch = getchar()) {
x = x ... | replace | 31 | 32 | 31 | 32 | 0 | |
p03095 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
long long co[30] = {0};
long lon... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
long long co[30] = {0};
long lon... | replace | 25 | 26 | 25 | 26 | 0 | |
p03095 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <climits>
#include <complex>
#include <cstring>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
... | #include <algorithm>
#include <bitset>
#include <climits>
#include <complex>
#include <cstring>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
... | replace | 75 | 76 | 75 | 76 | 0 | |
p03095 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int mod = 1'000'000'007;
int main() {
int n;
cin >> n;
string s;
cin >> s;
vector<int> num(26, 0);
for (int i = 0; i < n; i++)
num[s[i] - 'a']++;
long long ans = 1;
for (int i = 0; i < n; i++) {
ans *= num[i] + 1;
ans %= mod;
}
cout << (ans... | #include <bits/stdc++.h>
using namespace std;
int mod = 1'000'000'007;
int main() {
int n;
cin >> n;
string s;
cin >> s;
vector<int> num(26, 0);
for (int i = 0; i < n; i++)
num[s[i] - 'a']++;
long long ans = 1;
for (int i = 0; i < 26; i++) {
ans *= num[i] + 1;
ans %= mod;
}
cout << (an... | replace | 14 | 15 | 14 | 15 | 0 | |
p03095 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t n, mod = 1000000007;
string s;
cin >> n >> s;
vector<int64_t> cnt(26, 0);
for (auto &c : s) {
cnt[c - 'a']++;
}
int64_t ans = 0;
for (int i = 1; i < (1 << 26); i++) {
int64_t tmp = 0;
for (int j = 0; j < 26; j++) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int64_t n, mod = 1000000007;
string s;
cin >> n >> s;
vector<int64_t> cnt(26, 0);
for (auto &c : s) {
cnt[c - 'a']++;
}
int64_t ans = 0;
for (int i = 0; i < 26; i++) {
int64_t tmp = cnt[i];
for (int j = i + 1; j < 26; j++) {
... | replace | 15 | 25 | 15 | 19 | TLE | |
p03095 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ALL(a) (a).begin(), (a).end()
#define rALL(a) (a).rbegin(), (a).rend()
typedef pair<int, int> Pint;
typedef pair<int64_t, int64_t> Pll;
int main() {
int64_t N, ans = 1;
string S;
cin >> N >> S;
vector<int64_t> A(26);
for (int i = 0; i < N; i++) {
A.at... | #include <bits/stdc++.h>
using namespace std;
#define ALL(a) (a).begin(), (a).end()
#define rALL(a) (a).rbegin(), (a).rend()
typedef pair<int, int> Pint;
typedef pair<int64_t, int64_t> Pll;
int main() {
int64_t N, ans = 1;
string S;
cin >> N >> S;
vector<int64_t> A(26);
for (int i = 0; i < N; i++) {
A.at... | replace | 16 | 17 | 16 | 17 | 0 | |
p03095 | C++ | Runtime Error | #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#incl... | #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#incl... | replace | 82 | 83 | 82 | 85 | 0 | |
p03095 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int n;
int a[300005];
char s[100005];
int cnt[30];
ll mod = 1e9 + 7;
int main() {
#ifndef ONLINE_JUDGE
freopen("in.txt", "r", stdin);
#endif
ios::sync_with_stdio(false);
cin >> n;
cin >> s;
int len = strlen(s);
ll ans = 1;
for (int i = 0;... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int n;
int a[300005];
char s[100005];
int cnt[30];
ll mod = 1e9 + 7;
int main() {
#ifndef ONLINE_JUDGE
// freopen("in.txt","r",stdin);
#endif
ios::sync_with_stdio(false);
cin >> n;
cin >> s;
int len = strlen(s);
ll ans = 1;
for (int i = 0... | replace | 10 | 11 | 10 | 11 | 0 | |
p03095 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
template <class T> using V = vector<T>;
templ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
template <class T> using V = vector<T>;
templ... | replace | 626 | 627 | 626 | 630 | 0 | |
p03095 | C++ | Runtime Error | #include <algorithm>
#include <array>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <limits.h>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <unordered_map>
#include <vector>
#de... | #include <algorithm>
#include <array>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <limits.h>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <unordered_map>
#include <vector>
#de... | replace | 394 | 395 | 394 | 395 | -6 | *** stack smashing detected ***: terminated
|
p03095 | C++ | Runtime Error | // Miss Me??
#include <bits/stdc++.h>
using namespace std;
#define boost \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0)
#de... | // Miss Me??
#include <bits/stdc++.h>
using namespace std;
#define boost \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0)
#de... | replace | 33 | 34 | 33 | 34 | 0 | |
p03095 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using vi = vector<int>;
using vb = vector<bool>;
using vl = vector<long>;
using vs = vector<string>;
using vvi = vector<vector<int>>;
using vvb = vector<vector<bool>>;
using vvc = vector<vector<char>>;
using vvl = vector<vector<long>>;
using pii = pair<int, int>;
using pil ... | #include <bits/stdc++.h>
using namespace std;
using vi = vector<int>;
using vb = vector<bool>;
using vl = vector<long>;
using vs = vector<string>;
using vvi = vector<vector<int>>;
using vvb = vector<vector<bool>>;
using vvc = vector<vector<char>>;
using vvl = vector<vector<long>>;
using pii = pair<int, int>;
using pil ... | replace | 28 | 29 | 28 | 29 | -6 | terminate called after throwing an instance of 'std::out_of_range'
what(): vector::_M_range_check: __n (which is 49) >= this->size() (which is 26)
|
p03095 | C++ | Runtime Error | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPP(i, n) for (int i = 1; i <= n; i++)
const double PI = acos(-1);
const double EPS = 1e-15;
long long INF = (long long)1E17;
#define i_7 (long long)(1E9 + 7)
long mod(long a) {
long long c = a % i_7;
if (c >= 0)
return c;
return ... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPP(i, n) for (int i = 1; i <= n; i++)
const double PI = acos(-1);
const double EPS = 1e-15;
long long INF = (long long)1E17;
#define i_7 (long long)(1E9 + 7)
long mod(long a) {
long long c = a % i_7;
if (c >= 0)
return c;
return ... | replace | 101 | 102 | 101 | 102 | 0 | |
p03095 | C++ | Runtime Error | #include <iostream>
using namespace std;
int c[26];
const long long MOD = 1e9 + 7;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
string s;
cin >> s;
for (int i = 0; i < n; i++) {
c[s[i] - 'a']++;
}
long long ans = 1;
for (int i = 0; i < n; i++) {
ans ... | #include <iostream>
using namespace std;
int c[26];
const long long MOD = 1e9 + 7;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
string s;
cin >> s;
for (int i = 0; i < n; i++) {
c[s[i] - 'a']++;
}
long long ans = 1;
for (int i = 0; i < 26; i++) {
ans... | replace | 21 | 23 | 21 | 23 | 0 | |
p03095 | C++ | Runtime Error | #include <bits/stdc++.h>
#define pb push_back
#define pii pair<int, int>
#define int long long
#define MOD 1000000007
using namespace std;
int32_t main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int n;
cin >> n;
string s;
cin >> s;
int v[26] = {}... | #include <bits/stdc++.h>
#define pb push_back
#define pii pair<int, int>
#define int long long
#define MOD 1000000007
using namespace std;
int32_t main() {
int n;
cin >> n;
string s;
cin >> s;
int v[26] = {};
for (int i = 0; i < n; i++) {
++v[s[i] - 'a'];
}
vector<int> p;
for (int i = 0; i < 26; ... | delete | 8 | 12 | 8 | 8 | 0 | |
p03095 | C++ | Runtime Error | // finish date: 2019/2/28
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int(i) = a; (i) < (b); (i)++)
#define rep(i, n) FOR(i, 0, n)
typedef long long ll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<vector<vector<int>>> vvvi;
typedef vector<ll> vl;
typedef vector... | // finish date: 2019/2/28
#include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int(i) = a; (i) < (b); (i)++)
#define rep(i, n) FOR(i, 0, n)
typedef long long ll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<vector<vector<int>>> vvvi;
typedef vector<ll> vl;
typedef vector... | replace | 48 | 49 | 48 | 49 | 0 | |
p03095 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
ll mod = 1e9 + 7;
int n;
string s;
string a = "abcdefghijklmnopqrstuvwxyz";
cin >> n >> s;
ll ans = 1;
ll vec[26] = {};
for (int i = 0; i < n; i++) {
for (int j = 0; j < 26; j++) {
if (s[i] == a[j]) {
vec[... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
ll mod = 1e9 + 7;
int n;
string s;
string a = "abcdefghijklmnopqrstuvwxyz";
cin >> n >> s;
ll ans = 1;
ll vec[26] = {};
for (int i = 0; i < n; i++) {
for (int j = 0; j < 26; j++) {
if (s[i] == a[j]) {
vec[... | replace | 19 | 20 | 19 | 20 | 0 | |
p03095 | C++ | Runtime Error | #include <bits/stdc++.h>
#define int long long
#define ll long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define INF (((ll)1 << 31) - 1)
#define eps LDBL_EPSILON
#define moder (1000000007)
#define pie 3.141592653589793238462643383279
#define P std::pair<int, int>
#define prique priority_queue
#define ggr ... | #include <bits/stdc++.h>
#define int long long
#define ll long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define INF (((ll)1 << 31) - 1)
#define eps LDBL_EPSILON
#define moder (1000000007)
#define pie 3.141592653589793238462643383279
#define P std::pair<int, int>
#define prique priority_queue
#define ggr ... | replace | 23 | 24 | 23 | 24 | 0 | |
p03095 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
int cnt[256];
void solve() {
int n;
string s;
cin >> n >> s;
for (int i = 0; i < n; i++)
cnt[s[i]]++;
ll ret = 1;
for (int i = 0; i < 256; i++) {
ret *= ++s[i];
ret %= 100... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
int cnt[256];
void solve() {
int n;
string s;
cin >> n >> s;
for (int i = 0; i < n; i++)
cnt[s[i]]++;
ll ret = 1;
for (int i = 0; i < 256; i++) {
ret *= ++cnt[i];
ret %= 1... | replace | 17 | 18 | 17 | 18 | -6 | *** stack smashing detected ***: terminated
|
p03095 | C++ | Runtime Error | // スタックサイズ: 100MB
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
typedef int64_t ll;
const ll IN... | // スタックサイズ: 100MB
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
typedef int64_t ll;
const ll IN... | replace | 42 | 43 | 42 | 43 | 0 | |
p03095 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define ll long long
#define rep(i, s, n) for (int i = s; i < n; i++)
#define MOD 1000000007;
int main() {
int n;
cin >> n;
string s;
cin >> s;
ll ans = 1;
vector<int> count(2... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define ll long long
#define rep(i, s, n) for (int i = s; i < n; i++)
#define MOD 1000000007;
int main() {
int n;
cin >> n;
string s;
cin >> s;
ll ans = 1;
vector<int> count(2... | replace | 23 | 24 | 23 | 24 | 0 | |
p03095 | C++ | Time Limit Exceeded | #include "bits/stdc++.h"
using namespace std;
typedef long long int lint;
typedef pair<lint, lint> plint;
typedef pair<double long, double long> pld;
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((lint)(x).size())
#define POW2(n) (1LL << (n))
#define FOR(i, begin, end) ... | #include "bits/stdc++.h"
using namespace std;
typedef long long int lint;
typedef pair<lint, lint> plint;
typedef pair<double long, double long> pld;
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((lint)(x).size())
#define POW2(n) (1LL << (n))
#define FOR(i, begin, end) ... | replace | 109 | 122 | 109 | 112 | TLE | |
p03095 | C++ | Runtime Error | #include <bits/stdc++.h>
//{ START
using namespace std;
#define int int64_t
#define rep(i, a, n) for (int i = (a); i < (n); ++i)
#define reps(i, a, n) for (int i = (n - 1); i > (a - 1); --i)
#define arep(i, x) for (auto &&i : (x))
#define irep(i, x) for (auto i = (x).begin(); i != (x).end(); ++i)
#define rirep(i, x) f... | #include <bits/stdc++.h>
//{ START
using namespace std;
#define int int64_t
#define rep(i, a, n) for (int i = (a); i < (n); ++i)
#define reps(i, a, n) for (int i = (n - 1); i > (a - 1); --i)
#define arep(i, x) for (auto &&i : (x))
#define irep(i, x) for (auto i = (x).begin(); i != (x).end(); ++i)
#define rirep(i, x) f... | replace | 72 | 73 | 72 | 73 | 0 | |
p03095 | C++ | Runtime Error | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
ll cnt[30];
ll pow_2(ll x) {
ll ret = 1;
for (int i = 0; i < x; i++) {
ret = ret * 2 % 1000000007;
}
return ret;
}
int main() {
string s;
int n;
cin >> n >> s;
for (int i = 0; i < n; i++) {
cnt[s[i] - 'a']++;
}
ll cnt2 ... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
ll cnt[30];
ll pow_2(ll x) {
ll ret = 1;
for (int i = 0; i < x; i++) {
ret = ret * 2 % 1000000007;
}
return ret;
}
int main() {
string s;
int n;
cin >> n >> s;
for (int i = 0; i < n; i++) {
cnt[s[i] - 'a']++;
}
ll cnt2 ... | replace | 25 | 26 | 25 | 26 | 0 | |
p03095 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <chrono>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repl(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define rep2l(i, s, n) for (ll i = (ll)(s); i ... | #include <bits/stdc++.h>
#include <chrono>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repl(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define rep2l(i, s, n) for (ll i = (ll)(s); i ... | replace | 21 | 22 | 21 | 22 | 0 | |
p03095 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1000000007;
const int dx[4] = {+1, 0, -1, 0};
const int dy[4] = {0, -1, 0, +1};
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
ll n;
cin >> n;
string str;
cin >> str;
ll cnt[26];
for (int i = 0; i < 26; i... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1000000007;
const int dx[4] = {+1, 0, -1, 0};
const int dy[4] = {0, -1, 0, +1};
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
ll n;
cin >> n;
string str;
cin >> str;
ll cnt[26];
for (int i = 0; i < 26; i... | replace | 25 | 26 | 25 | 26 | 0 | |
p03095 | C++ | Runtime Error | #include <bits/stdc++.h>
#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 rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define repi(i, n, m) for (int i = (int)(n); i < (int)(m); i++)
#define all(x) (x).begin(), (x).end()
typedef long long ll;
usin... | #include <bits/stdc++.h>
#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 rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define repi(i, n, m) for (int i = (int)(n); i < (int)(m); i++)
#define all(x) (x).begin(), (x).end()
typedef long long ll;
usin... | replace | 16 | 17 | 16 | 17 | 0 | |
p03095 | C++ | Time Limit Exceeded | #include <algorithm>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <vector>
#define _USE_MATH_DEFINES
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#... | #include <algorithm>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <vector>
#define _USE_MATH_DEFINES
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#... | replace | 155 | 164 | 155 | 158 | TLE | |
p03095 | C++ | Runtime Error | /*
`-:://:::-
`//:-------:/:`
.+:--.......--:+`
`+:--..`````..--//`
.o:--..`` ``..--:o`
... | /*
`-:://:::-
`//:-------:/:`
.+:--.......--:+`
`+:--..`````..--//`
.o:--..`` ``..--:o`
... | replace | 175 | 176 | 175 | 176 | 0 | |
p03095 | C++ | Time Limit Exceeded | #include <cstdio>
#include <iostream>
#include <sstream>
#include <string>
#include <vector>
#define ll long long
#define FOR(i, N) for (int i = 0; i < (int)N; i++)
#define FORIN(i, a, b) for (int i = a; i < (int)b; i++)
#define ALL(x) (x).begin(), (x).end()
#define LAST(x) (x)[(x).size() - 1]
using namespace std;
s... | #include <cstdio>
#include <iostream>
#include <sstream>
#include <string>
#include <vector>
#define ll long long
#define FOR(i, N) for (int i = 0; i < (int)N; i++)
#define FORIN(i, a, b) for (int i = a; i < (int)b; i++)
#define ALL(x) (x).begin(), (x).end()
#define LAST(x) (x)[(x).size() - 1]
using namespace std;
s... | replace | 46 | 60 | 46 | 50 | TLE | |
p03095 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int cnt[30];
const int MOD = 1e9 + 7;
int main() {
string s;
int n;
cin >> n >> s;
for (int i = 0; i < n; i++) {
cnt[s[i] - 'a']++;
}
long long ans = 1;
for (int i = 0; i < n; i++) {
ans = (ans * (cnt[i] + 1LL)) % MOD;
}
cout << (ans + MOD - 1) % M... | #include <bits/stdc++.h>
using namespace std;
int cnt[30];
const int MOD = 1e9 + 7;
int main() {
string s;
int n;
cin >> n >> s;
for (int i = 0; i < n; i++) {
cnt[s[i] - 'a']++;
}
long long ans = 1;
for (int i = 0; i < 28; i++) {
ans = (ans * (cnt[i] + 1LL)) % MOD;
}
cout << (ans + MOD - 1) % ... | replace | 12 | 13 | 12 | 13 | 0 | |
p03095 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using Int = long long;
typedef pair<int, int> P;
typedef priority_queue<int> Pr;
typedef vector<int> V;
typedef vector<P> Vp;
typedef map<int, int> MP;
const int mod = 1000000007;
const Int INF = 1145141919810893931;
#define END ... | #include <bits/stdc++.h>
using namespace std;
using Int = long long;
typedef pair<int, int> P;
typedef priority_queue<int> Pr;
typedef vector<int> V;
typedef vector<P> Vp;
typedef map<int, int> MP;
const int mod = 1000000007;
const Int INF = 1145141919810893931;
#define END ... | replace | 117 | 118 | 117 | 118 | 0 | |
p03095 | C++ | Runtime Error | #include <bits/stdc++.h>
#define r(i, n) for (int i = 0; i < n; i++)
#define int long long
using namespace std;
typedef pair<int, int> P;
#define F first
#define S second
int n;
string s;
int a[28];
unordered_set<int> st;
signed main() {
cin >> n;
cin >> s;
r(i, n) { a[s[i] - 'a']++; }
int ans = 1, S = 0, sum... | #include <bits/stdc++.h>
#define r(i, n) for (int i = 0; i < n; i++)
#define int long long
using namespace std;
typedef pair<int, int> P;
#define F first
#define S second
int n;
string s;
int a[28];
unordered_set<int> st;
signed main() {
cin >> n;
cin >> s;
r(i, n) { a[s[i] - 'a']++; }
int ans = 1, S = 0, sum... | replace | 22 | 23 | 22 | 23 | 0 | |
p03095 | C++ | Runtime Error | #include <bits/stdc++.h>
#define LOCAL
using namespace std;
template <typename A, typename B>
ostream &operator<<(ostream &out, const pair<A, B> &a) {
out << "(" << a.first << "," << a.second << ")";
return out;
}
template <typename T, size_t N>
ostream &operator<<(ostream &out, const array<T, N> &a) {
out << "["... | #include <bits/stdc++.h>
#define LOCAL
using namespace std;
template <typename A, typename B>
ostream &operator<<(ostream &out, const pair<A, B> &a) {
out << "(" << a.first << "," << a.second << ")";
return out;
}
template <typename T, size_t N>
ostream &operator<<(ostream &out, const array<T, N> &a) {
out << "["... | replace | 81 | 85 | 81 | 85 | 0 | |
p03095 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
typedef char SINT8;
typedef unsigned char UINT8;
typedef short SINT16;
typedef unsigned short UINT16;
typedef int SINT32;
typedef unsigned int UINT32;
typedef long long SINT64;
typedef unsigned long long UINT64;
typedef double DOUBLE;
#define... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
typedef char SINT8;
typedef unsigned char UINT8;
typedef short SINT16;
typedef unsigned short UINT16;
typedef int SINT32;
typedef unsigned int UINT32;
typedef long long SINT64;
typedef unsigned long long UINT64;
typedef double DOUBLE;
#define... | replace | 34 | 35 | 34 | 35 | 0 | |
p03095 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
ll mod = 1e9 + 7;
int main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output1.txt", "w", stdout);
#endif
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n;
cin >> n;
st... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
ll mod = 1e9 + 7;
int main() {
/* #ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output1.txt", "w", stdout);
#endif*/
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int n;
ci... | replace | 6 | 10 | 6 | 10 | 0 | |
p03095 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
string S;
cin >> S;
vector<char> vec(N);
for (int i = 0; i < N; i++) {
vec.at(i) = S.at(i);
}
sort(vec.begin(), vec.end());
long long ans = 1;
long long count = 1;
for (int j = 0; j < N - 1; j++) {
if (vec.at(j) ==... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
string S;
cin >> S;
vector<char> vec(N);
for (int i = 0; i < N; i++) {
vec.at(i) = S.at(i);
}
sort(vec.begin(), vec.end());
long long ans = 1;
long long count = 1;
for (int j = 0; j < N - 1; j++) {
if (vec.at(j) ==... | replace | 22 | 24 | 22 | 25 | 0 | |
p03095 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> s(26, 1);
for (int i = 0; i < n; i++) {
char c;
cin >> c;
s[c - 97]++;
}
long long ans = 1;
for (int i = 0; i < n; i++) {
ans *= s[i];
ans %= 1000000007;
}
cout << ans - 1 << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> s(26, 1);
for (int i = 0; i < n; i++) {
char c;
cin >> c;
s[c - 97]++;
}
long long ans = 1;
for (int i = 0; i < 26; i++) {
ans *= s[i];
ans %= 1000000007;
}
cout << ans - 1 << endl;
} | replace | 15 | 16 | 15 | 16 | 0 | |
p03095 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cmath>
#include <fstream>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_set>
#include <vector>
#define MOD_BIG 1000000007
#define MOD_BIG2 998244353
using std::cerr;
using std::cin;
using std::... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <fstream>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_set>
#include <vector>
#define MOD_BIG 1000000007
#define MOD_BIG2 998244353
using std::cerr;
using std::cin;
using std::... | replace | 45 | 46 | 45 | 46 | 0 | |
p03095 | C++ | Runtime Error | #include <iostream>
#include <string>
using namespace std;
int N;
string S;
long long cnt[26] = {};
long long ans = 1;
int main() {
cin >> N >> S;
for (int i = 0; i < N; i++)
cnt[int(S[i] - 'a')]++;
for (int i = 0; i < N; i++)
ans = (long long)(ans * (cnt[i] + 1)) % (long long)(1e9 + 7);
cout << ans - ... | #include <iostream>
#include <string>
using namespace std;
int N;
string S;
long long cnt[26] = {};
long long ans = 1;
int main() {
cin >> N >> S;
for (int i = 0; i < N; i++)
cnt[int(S[i] - 'a')]++;
for (int i = 0; i < 26; i++)
ans = (long long)(ans * (cnt[i] + 1)) % (long long)(1e9 + 7);
cout << ans -... | replace | 12 | 13 | 12 | 13 | 0 | |
p03095 | C++ | Time Limit Exceeded | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define endl "\n"
#define sz(x) ((ll)(x).size())
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define prt(x) cout << (x)
#define prtl(x) cout << (x) << endl
#define rep(i, a, b) for (ll i = a; i < b; i++)
#define rrep(i, a, b) for (ll i = a; i > b; i--)
... | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define endl "\n"
#define sz(x) ((ll)(x).size())
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define prt(x) cout << (x)
#define prtl(x) cout << (x) << endl
#define rep(i, a, b) for (ll i = a; i < b; i++)
#define rrep(i, a, b) for (ll i = a; i > b; i--)
... | replace | 81 | 94 | 81 | 84 | TLE | |
p03095 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <cmath>
// using namespace boost::multiprecision;
using namespace std;
typedef long long ll;
// typedef unsigned long long ll;
const double EPS = 1e-9;
#define rep(i, n) for (int i = 0; i < (n); ++i)
// #define rep(i, n) for (ll i = 0; i < (n); ++i)
// #define sz(x) ll(x.size())
typed... | #include <bits/stdc++.h>
#include <cmath>
// using namespace boost::multiprecision;
using namespace std;
typedef long long ll;
// typedef unsigned long long ll;
const double EPS = 1e-9;
#define rep(i, n) for (int i = 0; i < (n); ++i)
// #define rep(i, n) for (ll i = 0; i < (n); ++i)
// #define sz(x) ll(x.size())
typed... | replace | 110 | 111 | 110 | 111 | 0 | |
p03095 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
long long MOD = 1000000007;
vector<long long> c(26, 0);
int main() {
int N;
string S;
cin >> N >> S;
for (int i = 0; i < N; i++) {
c[S[i] - 'a']++;
}
long long ans = 1;
for (int i = 0; i < N; i++) {
ans *= c[i] + 1;
if (ans >= MOD)
ans %= ... | #include <bits/stdc++.h>
using namespace std;
long long MOD = 1000000007;
vector<long long> c(26, 0);
int main() {
int N;
string S;
cin >> N >> S;
for (int i = 0; i < N; i++) {
c[S[i] - 'a']++;
}
long long ans = 1;
for (int i = 0; i < 26; i++) {
ans *= c[i] + 1;
if (ans >= MOD)
ans %=... | replace | 15 | 16 | 15 | 16 | 0 | |
p03095 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const LL mod = 1e9 + 7;
string s;
LL a[30], res = 0;
int vis[30];
void dfs(int pos, int len, LL val) {
if (!len) {
res = (res + val) % mod;
return;
}
for (int i = pos; i < 26; ++i) {
if (!a[i])
continue;
dfs(i + 1, len - 1,... | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const LL mod = 1e9 + 7;
string s;
LL a[30], res = 0;
int vis[30];
void dfs(int pos, int len, LL val) {
if (!len) {
res = (res + val) % mod;
return;
}
for (int i = pos; i <= 26 - len; ++i) {
if (!a[i])
continue;
dfs(i + 1, l... | replace | 13 | 14 | 13 | 14 | TLE | |
p03095 | C++ | Runtime Error | #define _USE_MATH_DEFINES
#include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define MOD int(1e9 + 7)
#define INF (long long)(1e18)
int main() {
long long N;
vector<long long> c(26, 1... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define MOD int(1e9 + 7)
#define INF (long long)(1e18)
int main() {
long long N;
vector<long long> c(26, 1... | replace | 26 | 27 | 26 | 27 | 0 | |
p03095 | C++ | Time Limit Exceeded | // #define DEBUG_IS_VALID
#ifdef DEBUG_IS_VALID
#define DEB 1
#define _LIBCPP_DEBUG 0
#else
#define DEB 0
#define NDEBUG
#endif
#include "bits/stdc++.h"
#define ALL(g) (g).begin(), (g).end()
#define REP(i, x, n) for (int i = x; i < n; i++)
#define rep(i, n) REP(i, 0, n)
#define RREP(i, x, n) for (int i = x; i >= n; ... | // #define DEBUG_IS_VALID
#ifdef DEBUG_IS_VALID
#define DEB 1
#define _LIBCPP_DEBUG 0
#else
#define DEB 0
#define NDEBUG
#endif
#include "bits/stdc++.h"
#define ALL(g) (g).begin(), (g).end()
#define REP(i, x, n) for (int i = x; i < n; i++)
#define rep(i, n) REP(i, 0, n)
#define RREP(i, x, n) for (int i = x; i >= n; ... | replace | 204 | 212 | 204 | 208 | TLE | |
p03095 | C++ | Runtime Error | #include <bits/stdc++.h>
#define FLASH \
cin.tie(0); \
cout.tie(0); \
ios_base::sync_with_stdio(false);
#define pb push_... | #include <bits/stdc++.h>
#define FLASH \
cin.tie(0); \
cout.tie(0); \
ios_base::sync_with_stdio(false);
#define pb push_... | replace | 18 | 21 | 18 | 19 | 0 | |
p03095 | C++ | Runtime Error | #include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
using namespace std;
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
int main() {
ios_base::sync_with_stdio(false);
int n;
cin >> n;
string s;
cin >> s;
vector<int> cnt(26, 0);
for (int i = 0; i < n; ++i) {
++cnt... | #include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
using namespace std;
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
int main() {
ios_base::sync_with_stdio(false);
int n;
cin >> n;
string s;
cin >> s;
vector<int> cnt(26, 0);
for (int i = 0; i < n; ++i) {
++cnt... | replace | 19 | 20 | 19 | 20 | 0 | |
p03095 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
///////////////////////////////////////////
const long long int INF = 100000000000;
const long long int Mod = 1000000007;
using ll = long long int; // long long int は64bit
using ci = const int;
using vi = vector<int>;
using Vi = vector<long long int>;
using pii = pair<int, ... | #include <bits/stdc++.h>
using namespace std;
///////////////////////////////////////////
const long long int INF = 100000000000;
const long long int Mod = 1000000007;
using ll = long long int; // long long int は64bit
using ci = const int;
using vi = vector<int>;
using Vi = vector<long long int>;
using pii = pair<int, ... | replace | 52 | 64 | 52 | 54 | TLE | |
p03096 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> P;
#define REP(i, n) for (ll i = 0LL; i < (ll)(n); i++)
#define REPR(i, n) for (ll i = n - 1; i >= 0LL; i--)
#define FOR(i, n, m) for (ll i = n; i < (ll)(m); i++)
#define PRINT(x) cout << x << endl
#define ALL(v) v.begin(), v.... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> P;
#define REP(i, n) for (ll i = 0LL; i < (ll)(n); i++)
#define REPR(i, n) for (ll i = n - 1; i >= 0LL; i--)
#define FOR(i, n, m) for (ll i = n; i < (ll)(m); i++)
#define PRINT(x) cout << x << endl
#define ALL(v) v.begin(), v.... | replace | 39 | 40 | 39 | 40 | 0 | |
p03096 | C++ | Runtime Error | #ifdef LOCAL
// #define _GLIBCXX_DEBUG
// #pragma comment(linker, "/STACK:102400000,102400000") // 在 Windows 上有效
#endif
// #pragma GCC optimize ("Ofast") // Ofast 等效于 -O3 -ffast-math
#include <bits/stdc++.h>
using namespace std;
#define sq(x) (x) * (x) // square
#define FAST_READ ... | #ifdef LOCAL
// #define _GLIBCXX_DEBUG
// #pragma comment(linker, "/STACK:102400000,102400000") // 在 Windows 上有效
#endif
// #pragma GCC optimize ("Ofast") // Ofast 等效于 -O3 -ffast-math
#include <bits/stdc++.h>
using namespace std;
#define sq(x) (x) * (x) // square
#define FAST_READ ... | replace | 492 | 493 | 492 | 494 | 0 | |
p03096 | C++ | Runtime Error | #include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include ... | #include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include ... | replace | 40 | 41 | 40 | 41 | 0 | |
p03096 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 3e4 + 20, maxm = 3e4 + 20;
int c[maxn], a[maxn];
ll mod = 1e9 + 7;
const ll inf = 1e9;
queue<int> q;
set<int> s;
set<int> s1;
int dp[maxn];
int X[] = {119, 18, 93, 91, 58, 107, 111, 82, 127, 123};
int main() {
ios_base::sync_with... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 2e5 + 20, maxm = 2e5 + 20;
int c[maxn], a[maxn];
ll mod = 1e9 + 7;
const ll inf = 1e9;
queue<int> q;
set<int> s;
set<int> s1;
int dp[maxn];
int X[] = {119, 18, 93, 91, 58, 107, 111, 82, 127, 123};
int main() {
ios_base::sync_with... | replace | 4 | 5 | 4 | 5 | 0 | |
p03096 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> c(n);
for (int i = 0; i < n; ++i) {
cin >> c[i];
--c[i];
}
const long long mod = 1e9 + 7;
vector<long long> dp(n + 1);
vector<int> l(n, -1);
dp[0] = 1;
for (int i = 0; i < n; ++i) {
dp[i + 1] = dp[... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> c(n);
for (int i = 0; i < n; ++i) {
cin >> c[i];
--c[i];
}
const long long mod = 1e9 + 7;
vector<long long> dp(n + 1);
vector<int> l(*max_element(c.begin(), c.end()) + 1, -1);
dp[0] = 1;
for (int i = 0... | replace | 15 | 16 | 15 | 16 | 0 | |
p03096 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
inline int read() {
int x = 0;
char c = getchar();
while (!isdigit(c))
c = getchar();
while (isdigit(c))
x = x * 10 + c - '0', c = getchar();
return x;
}
const int maxn = 1e5;
const int mod = 1e9 + 7;
int num[maxn];
int a[maxn], pre[maxn], f[maxn] = {1};... | #include <bits/stdc++.h>
using namespace std;
inline int read() {
int x = 0;
char c = getchar();
while (!isdigit(c))
c = getchar();
while (isdigit(c))
x = x * 10 + c - '0', c = getchar();
return x;
}
const int maxn = 2e5;
const int mod = 1e9 + 7;
int num[maxn];
int a[maxn], pre[maxn], f[maxn] = {1};... | replace | 13 | 14 | 13 | 14 | 0 | |
p03096 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define REP(i, n) for (int i = 1; i <... | #include <algorithm>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define REP(i, n) for (int i = 1; i <... | replace | 74 | 75 | 74 | 75 | 0 | |
p03096 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
ll const MOD = 1e9 + 7;
int main() {
int N;
cin >> N;
vi C;
for (int i = 0; i < N; ++i) {
int c;
cin >> c;
C.push_back(c);
}
ll dp[N];
ll c_cum[N + 1];
memset(c_cum, 0, sizeof(c_cum));
dp[0] = 1;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
ll const MOD = 1e9 + 7;
int main() {
int N;
cin >> N;
vi C;
for (int i = 0; i < N; ++i) {
int c;
cin >> c;
C.push_back(c);
}
ll dp[200010];
ll c_cum[200010];
memset(c_cum, 0, sizeof(c_cum));
dp[0]... | replace | 16 | 18 | 16 | 18 | 0 | |
p03096 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define mp make_pair
#define st first
#define nd second
typedef pair<int, int> pp;
const int mod = 1e9 + 7;
const int N = 1e5 + 5;
int M[N];
signed main() {
int n;
cin >> n;
int pre = 1;
int prex = 0;
int dp;
for (i... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define mp make_pair
#define st first
#define nd second
typedef pair<int, int> pp;
const int mod = 1e9 + 7;
const int N = 2e5 + 5;
int M[N];
signed main() {
int n;
cin >> n;
int pre = 1;
int prex = 0;
int dp;
for (i... | replace | 11 | 12 | 11 | 12 | 0 | |
p03096 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
// long long
using ll = long long;
// pair<int, int>
using PII = pair<int, int>;
// 最大値、mod
const int MOD = 1000000007;
const int mod = 1000000007;
const int INF = 1000000000;
const long long LINF = 1e18;
const int MAX = 510000;
// 出力系
#define print(x) cout << x << endl... | #include <bits/stdc++.h>
using namespace std;
// long long
using ll = long long;
// pair<int, int>
using PII = pair<int, int>;
// 最大値、mod
const int MOD = 1000000007;
const int mod = 1000000007;
const int INF = 1000000000;
const long long LINF = 1e18;
const int MAX = 510000;
// 出力系
#define print(x) cout << x << endl... | replace | 275 | 276 | 275 | 276 | 0 | |
p03096 | C++ | Runtime Error | #include <algorithm>
#include <cctype>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, a, b) ... | #include <algorithm>
#include <cctype>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, a, b) ... | replace | 85 | 86 | 85 | 86 | 0 | |
p03096 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef uint64_t u64;
typedef int64_t s64;
ty... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef uint64_t u64;
typedef int64_t s64;
ty... | replace | 43 | 44 | 43 | 44 | 0 | |
p03096 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
// #define double long double
typedef pair<int, int> ii;
typedef pair<int, long long> il;
typedef pair<long long, long long> ll;
typedef pair<ll, int> lli;
typedef pair<long long, int> li;
typedef pair<double, double> dd;
typedef pair<ii, int> iii;
typedef pair<double, i... | #include <bits/stdc++.h>
using namespace std;
// #define double long double
typedef pair<int, int> ii;
typedef pair<int, long long> il;
typedef pair<long long, long long> ll;
typedef pair<ll, int> lli;
typedef pair<long long, int> li;
typedef pair<double, double> dd;
typedef pair<ii, int> iii;
typedef pair<double, i... | replace | 29 | 30 | 29 | 30 | 0 | |
p03096 | C++ | Runtime Error | #include <iostream>
#include <vector>
int main() {
long long mod = 1000000007;
int n;
std::vector<int> aList;
std::vector<int> colorList;
std::vector<long long> dpList;
std::cin >> n;
aList.resize(n);
colorList.resize(n + 1, -1);
dpList.resize(n, 0);
for (int i = 0; i < n; i++)
std::cin >> a... | #include <iostream>
#include <vector>
int main() {
long long mod = 1000000007;
int n;
std::vector<int> aList;
std::vector<int> colorList;
std::vector<long long> dpList;
std::cin >> n;
aList.resize(n);
colorList.resize(200001, -1);
dpList.resize(n, 0);
for (int i = 0; i < n; i++)
std::cin >> ... | replace | 13 | 14 | 13 | 14 | 0 | |
p03096 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
const ll M = 1e9 + 7;
const int MN = 200100;
inline ll mul(ll a, ll b) { return (a * b) % M; }
vi fr[MN];
int v[MN];
ll dp[MN];
ll ds(int id) {
if (id == 0)
return 1;
int val = v[id];
int pos = lower_bound(fr[val].begi... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
const ll M = 1e9 + 7;
const int MN = 200100;
inline ll mul(ll a, ll b) { return (a * b) % M; }
vi fr[MN];
int v[MN];
ll dp[MN];
ll ds(int id) {
if (id == 0)
return 1;
if (dp[id] != -1)
return dp[id];
int val = v[id... | insert | 13 | 13 | 13 | 15 | TLE | |
p03096 | 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>
using namespace std;
#define TRACE
#ifdef TRACE
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void __f(const cha... | #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>
using namespace std;
#define TRACE
#ifdef TRACE
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void __f(const cha... | replace | 42 | 43 | 42 | 43 | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.