#include "shortcut.h"
#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#define F first
#define S second
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
const int N = 3010;
const ll Inf = 1e18;
ll ps[N];
ll maxp[N][N], maxn[N][N];
ll pre[N], suf[N];
ll d[N];
ll n, c;
pll Solve(ll i, ll j){
ll Di, Dj, dia, dia2;
ll cyc;
Di = ps[i] + maxn[0][i];
Dj = maxp[j][n - 1] - ps[j];
cyc = c + ps[j] - ps[i];
ll C2 = cyc / 2;
dia2 = Di + Dj + min(c, cyc - c);
dia = 0;
for(int k = i + 1; k < j; k++){
//ll po = lower_bound(ps, ps + n, ps[k]);
//for(int k2 = k + 1; k2 < j; k2++){
// dia = max(dia, d[k] + d[k2] + min(ps[k2] - ps[k], cyc - (ps[k2] - ps[k]) ) );
//}
dia = max(dia, Di + d[k] + min(ps[k] - ps[i], cyc - (ps[k] - ps[i])));
dia2 = max(dia2, Dj + d[k] + min(ps[j] - ps[k], cyc - (ps[j] - ps[k])));
}
int po = i + 1;
for(int k = i + 1; k < j; k++){
while((po < j - 1) && (ps[po + 1] - ps[k] <= C2)) po ++;
dia = max(dia, d[k] + maxp[k][po] - ps[k]);
if(po < j - 1){
dia = max(dia, d[k] + (cyc + maxn[po + 1][j - 1] + ps[k] ));
}
}
po = j - 1;
for(int k = j - 1; k > i; k--){
while((po > i + 1) && (ps[k] - ps[po - 1] <= C2)) po --;
dia = max(dia, d[k] + maxn[po][k] + ps[k]);
if(po > i + 1){
dia = max(dia, d[k] + (cyc + maxp[i + 1][po - 1] - ps[k] ));
}
}
dia2 = max(dia2, suf[j]);
dia = max(dia, pre[i]);
//cerr << "^ " << dia << ' ' << dia2 << '\n';
return make_pair(dia, dia2);
}
long long find_shortcut(int _n, vector<int> _l, vector<int> _d, int _c){
n = _n; c = _c;
for(int i = 0; i < n; i++) d[i] = _d[i];
ps[0] = 0;
for(int i = 1; i < n; i++) ps[i] = ps[i - 1] + _l[i - 1];
// Calc Maxp
for(int i = 0; i < n; i++) maxp[i][i] = d[i] + ps[i];
for(int i = 0; i < n; i++) maxn[i][i] = d[i] - ps[i];
for(int ln = 2; ln <= n; ln++){
for(int i = 0; i + ln <= n; i++){
int j = i + ln - 1;
maxp[i][j] = max(maxp[i + 1][j], maxp[i][j - 1]);
maxn[i][j] = max(maxn[i + 1][j], maxn[i][j - 1]);
}
}
// Calc pre
pre[0] = d[0];
for(int i = 1; i < n; i++){
pre[i] = max(pre[i - 1], d[i] + ps[i] + maxn[0][i - 1]);
}
suf[n - 1] = d[n - 1];
for(int i = n - 2; i >= 0; i--){
suf[i] = max(suf[i + 1], d[i] - ps[i] + maxp[i + 1][n - 1]);
}
// Calc dia
ll X = 0, Y = 0, D = -1;
for(int i = 0; i < n; i++){
for(int j = i + 1; j < n; j++){
if(D < ps[j] - ps[i] + d[i] + d[j]){
D = ps[j] - ps[i] + d[i] + d[j];
X = i; Y = j;
}
}
}
ll dia, dia2, ans = Inf;
pll res;
//vector<pll> V;
vector<ll> V2;
for(int i = X; i + 1 <= Y; i++){
pll resL = {Inf, Inf}, resR = {Inf, Inf};
int L = i, R = Y + 1, mid;
while(L + 1 < R){
mid = (L + R) >> 1;
res = Solve(i, mid);
if(res.F <= res.S){
L = mid;
resL = res;
} else{
R = mid;
resR = res;
}
}
pll best = {Inf, Inf};
dia = Inf;
/*
if(L != i){
res = resL;
if(max(best.F, best.S) > max(res.F, res.S))
best = res;
}
if(R != n){
res = resR;
if(max(best.F, best.S) > max(res.F, res.S))
best = res;
}
*/
dia = min(max(resL.F, resL.S), max(resR.F, resR.S));
ans = min(ans, dia);
V2.push_back(dia);
//cerr << "# " << ans << '\n';
/*
assert(best != pll(Inf, Inf));
ans = min(ans, max(best.F, best.S));
V2.push_back(max(best.F, best.S));
*/
//V.push_back(best);
/*
V.clear();
for(int j = i + 1; j < n; j++){
res = Solve(i, j);
dia = max({res.first, res.second});
ans = min(ans, dia);
V.push_back(res);
}
int sz = (int) V.size();
for(int j = 0; j + 1 < sz; j++){
assert(V[j].first <= V[j + 1].first);
assert(V[j].second >= V[j + 1].second);
}
*/
}
int sz = (int) V2.size();
bool flg = false;
for(int j = 0; j + 1 < sz; j++){
if(V2[j] == V2[j + 1]) continue;
if(V2[j] < V2[j + 1]) flg = true;
if(V2[j] > V2[j + 1] && flg)
assert(0);
}
return ans;
}
Compilation message
shortcut.cpp: In function 'long long int find_shortcut(int, std::vector<int>, std::vector<int>, int)':
shortcut.cpp:126:7: warning: variable 'best' set but not used [-Wunused-but-set-variable]
126 | pll best = {Inf, Inf};
| ^~~~
shortcut.cpp:108:10: warning: unused variable 'dia2' [-Wunused-variable]
108 | ll dia, dia2, ans = Inf;
| ^~~~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
384 KB |
n = 4, 80 is a correct answer |
2 |
Correct |
0 ms |
384 KB |
n = 9, 110 is a correct answer |
3 |
Correct |
1 ms |
384 KB |
n = 4, 21 is a correct answer |
4 |
Correct |
0 ms |
384 KB |
n = 3, 4 is a correct answer |
5 |
Correct |
0 ms |
384 KB |
n = 2, 62 is a correct answer |
6 |
Correct |
1 ms |
384 KB |
n = 2, 3 is a correct answer |
7 |
Correct |
0 ms |
384 KB |
n = 3, 29 is a correct answer |
8 |
Correct |
1 ms |
384 KB |
n = 2, 3 is a correct answer |
9 |
Correct |
0 ms |
384 KB |
n = 2, 3 is a correct answer |
10 |
Correct |
0 ms |
384 KB |
n = 2, 2000000001 is a correct answer |
11 |
Correct |
0 ms |
384 KB |
n = 2, 3000000000 is a correct answer |
12 |
Correct |
1 ms |
384 KB |
n = 3, 3000000000 is a correct answer |
13 |
Correct |
1 ms |
384 KB |
n = 3, 3000000000 is a correct answer |
14 |
Correct |
1 ms |
384 KB |
n = 4, 3000000001 is a correct answer |
15 |
Correct |
1 ms |
384 KB |
n = 4, 4000000000 is a correct answer |
16 |
Correct |
0 ms |
384 KB |
n = 5, 4000000000 is a correct answer |
17 |
Correct |
0 ms |
384 KB |
n = 10, 1000000343 is a correct answer |
18 |
Correct |
1 ms |
384 KB |
n = 10, 3189 is a correct answer |
19 |
Correct |
1 ms |
384 KB |
n = 10, 7000000000 is a correct answer |
20 |
Correct |
0 ms |
384 KB |
n = 5, 12 is a correct answer |
21 |
Correct |
0 ms |
384 KB |
n = 5, 25 is a correct answer |
22 |
Correct |
0 ms |
384 KB |
n = 2, 122 is a correct answer |
23 |
Correct |
0 ms |
384 KB |
n = 10, 117 is a correct answer |
24 |
Correct |
0 ms |
384 KB |
n = 10, 336 is a correct answer |
25 |
Correct |
0 ms |
384 KB |
n = 10, 438 is a correct answer |
26 |
Correct |
0 ms |
384 KB |
n = 10, 206 is a correct answer |
27 |
Correct |
0 ms |
384 KB |
n = 10, 636 is a correct answer |
28 |
Correct |
0 ms |
384 KB |
n = 4, 2399 is a correct answer |
29 |
Correct |
0 ms |
384 KB |
n = 10, 10992 is a correct answer |
30 |
Runtime error |
8 ms |
640 KB |
Execution killed with signal 11 |
31 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
384 KB |
n = 4, 80 is a correct answer |
2 |
Correct |
0 ms |
384 KB |
n = 9, 110 is a correct answer |
3 |
Correct |
1 ms |
384 KB |
n = 4, 21 is a correct answer |
4 |
Correct |
0 ms |
384 KB |
n = 3, 4 is a correct answer |
5 |
Correct |
0 ms |
384 KB |
n = 2, 62 is a correct answer |
6 |
Correct |
1 ms |
384 KB |
n = 2, 3 is a correct answer |
7 |
Correct |
0 ms |
384 KB |
n = 3, 29 is a correct answer |
8 |
Correct |
1 ms |
384 KB |
n = 2, 3 is a correct answer |
9 |
Correct |
0 ms |
384 KB |
n = 2, 3 is a correct answer |
10 |
Correct |
0 ms |
384 KB |
n = 2, 2000000001 is a correct answer |
11 |
Correct |
0 ms |
384 KB |
n = 2, 3000000000 is a correct answer |
12 |
Correct |
1 ms |
384 KB |
n = 3, 3000000000 is a correct answer |
13 |
Correct |
1 ms |
384 KB |
n = 3, 3000000000 is a correct answer |
14 |
Correct |
1 ms |
384 KB |
n = 4, 3000000001 is a correct answer |
15 |
Correct |
1 ms |
384 KB |
n = 4, 4000000000 is a correct answer |
16 |
Correct |
0 ms |
384 KB |
n = 5, 4000000000 is a correct answer |
17 |
Correct |
0 ms |
384 KB |
n = 10, 1000000343 is a correct answer |
18 |
Correct |
1 ms |
384 KB |
n = 10, 3189 is a correct answer |
19 |
Correct |
1 ms |
384 KB |
n = 10, 7000000000 is a correct answer |
20 |
Correct |
0 ms |
384 KB |
n = 5, 12 is a correct answer |
21 |
Correct |
0 ms |
384 KB |
n = 5, 25 is a correct answer |
22 |
Correct |
0 ms |
384 KB |
n = 2, 122 is a correct answer |
23 |
Correct |
0 ms |
384 KB |
n = 10, 117 is a correct answer |
24 |
Correct |
0 ms |
384 KB |
n = 10, 336 is a correct answer |
25 |
Correct |
0 ms |
384 KB |
n = 10, 438 is a correct answer |
26 |
Correct |
0 ms |
384 KB |
n = 10, 206 is a correct answer |
27 |
Correct |
0 ms |
384 KB |
n = 10, 636 is a correct answer |
28 |
Correct |
0 ms |
384 KB |
n = 4, 2399 is a correct answer |
29 |
Correct |
0 ms |
384 KB |
n = 10, 10992 is a correct answer |
30 |
Runtime error |
8 ms |
640 KB |
Execution killed with signal 11 |
31 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
384 KB |
n = 4, 80 is a correct answer |
2 |
Correct |
0 ms |
384 KB |
n = 9, 110 is a correct answer |
3 |
Correct |
1 ms |
384 KB |
n = 4, 21 is a correct answer |
4 |
Correct |
0 ms |
384 KB |
n = 3, 4 is a correct answer |
5 |
Correct |
0 ms |
384 KB |
n = 2, 62 is a correct answer |
6 |
Correct |
1 ms |
384 KB |
n = 2, 3 is a correct answer |
7 |
Correct |
0 ms |
384 KB |
n = 3, 29 is a correct answer |
8 |
Correct |
1 ms |
384 KB |
n = 2, 3 is a correct answer |
9 |
Correct |
0 ms |
384 KB |
n = 2, 3 is a correct answer |
10 |
Correct |
0 ms |
384 KB |
n = 2, 2000000001 is a correct answer |
11 |
Correct |
0 ms |
384 KB |
n = 2, 3000000000 is a correct answer |
12 |
Correct |
1 ms |
384 KB |
n = 3, 3000000000 is a correct answer |
13 |
Correct |
1 ms |
384 KB |
n = 3, 3000000000 is a correct answer |
14 |
Correct |
1 ms |
384 KB |
n = 4, 3000000001 is a correct answer |
15 |
Correct |
1 ms |
384 KB |
n = 4, 4000000000 is a correct answer |
16 |
Correct |
0 ms |
384 KB |
n = 5, 4000000000 is a correct answer |
17 |
Correct |
0 ms |
384 KB |
n = 10, 1000000343 is a correct answer |
18 |
Correct |
1 ms |
384 KB |
n = 10, 3189 is a correct answer |
19 |
Correct |
1 ms |
384 KB |
n = 10, 7000000000 is a correct answer |
20 |
Correct |
0 ms |
384 KB |
n = 5, 12 is a correct answer |
21 |
Correct |
0 ms |
384 KB |
n = 5, 25 is a correct answer |
22 |
Correct |
0 ms |
384 KB |
n = 2, 122 is a correct answer |
23 |
Correct |
0 ms |
384 KB |
n = 10, 117 is a correct answer |
24 |
Correct |
0 ms |
384 KB |
n = 10, 336 is a correct answer |
25 |
Correct |
0 ms |
384 KB |
n = 10, 438 is a correct answer |
26 |
Correct |
0 ms |
384 KB |
n = 10, 206 is a correct answer |
27 |
Correct |
0 ms |
384 KB |
n = 10, 636 is a correct answer |
28 |
Correct |
0 ms |
384 KB |
n = 4, 2399 is a correct answer |
29 |
Correct |
0 ms |
384 KB |
n = 10, 10992 is a correct answer |
30 |
Runtime error |
8 ms |
640 KB |
Execution killed with signal 11 |
31 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
384 KB |
n = 4, 80 is a correct answer |
2 |
Correct |
0 ms |
384 KB |
n = 9, 110 is a correct answer |
3 |
Correct |
1 ms |
384 KB |
n = 4, 21 is a correct answer |
4 |
Correct |
0 ms |
384 KB |
n = 3, 4 is a correct answer |
5 |
Correct |
0 ms |
384 KB |
n = 2, 62 is a correct answer |
6 |
Correct |
1 ms |
384 KB |
n = 2, 3 is a correct answer |
7 |
Correct |
0 ms |
384 KB |
n = 3, 29 is a correct answer |
8 |
Correct |
1 ms |
384 KB |
n = 2, 3 is a correct answer |
9 |
Correct |
0 ms |
384 KB |
n = 2, 3 is a correct answer |
10 |
Correct |
0 ms |
384 KB |
n = 2, 2000000001 is a correct answer |
11 |
Correct |
0 ms |
384 KB |
n = 2, 3000000000 is a correct answer |
12 |
Correct |
1 ms |
384 KB |
n = 3, 3000000000 is a correct answer |
13 |
Correct |
1 ms |
384 KB |
n = 3, 3000000000 is a correct answer |
14 |
Correct |
1 ms |
384 KB |
n = 4, 3000000001 is a correct answer |
15 |
Correct |
1 ms |
384 KB |
n = 4, 4000000000 is a correct answer |
16 |
Correct |
0 ms |
384 KB |
n = 5, 4000000000 is a correct answer |
17 |
Correct |
0 ms |
384 KB |
n = 10, 1000000343 is a correct answer |
18 |
Correct |
1 ms |
384 KB |
n = 10, 3189 is a correct answer |
19 |
Correct |
1 ms |
384 KB |
n = 10, 7000000000 is a correct answer |
20 |
Correct |
0 ms |
384 KB |
n = 5, 12 is a correct answer |
21 |
Correct |
0 ms |
384 KB |
n = 5, 25 is a correct answer |
22 |
Correct |
0 ms |
384 KB |
n = 2, 122 is a correct answer |
23 |
Correct |
0 ms |
384 KB |
n = 10, 117 is a correct answer |
24 |
Correct |
0 ms |
384 KB |
n = 10, 336 is a correct answer |
25 |
Correct |
0 ms |
384 KB |
n = 10, 438 is a correct answer |
26 |
Correct |
0 ms |
384 KB |
n = 10, 206 is a correct answer |
27 |
Correct |
0 ms |
384 KB |
n = 10, 636 is a correct answer |
28 |
Correct |
0 ms |
384 KB |
n = 4, 2399 is a correct answer |
29 |
Correct |
0 ms |
384 KB |
n = 10, 10992 is a correct answer |
30 |
Runtime error |
8 ms |
640 KB |
Execution killed with signal 11 |
31 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
384 KB |
n = 4, 80 is a correct answer |
2 |
Correct |
0 ms |
384 KB |
n = 9, 110 is a correct answer |
3 |
Correct |
1 ms |
384 KB |
n = 4, 21 is a correct answer |
4 |
Correct |
0 ms |
384 KB |
n = 3, 4 is a correct answer |
5 |
Correct |
0 ms |
384 KB |
n = 2, 62 is a correct answer |
6 |
Correct |
1 ms |
384 KB |
n = 2, 3 is a correct answer |
7 |
Correct |
0 ms |
384 KB |
n = 3, 29 is a correct answer |
8 |
Correct |
1 ms |
384 KB |
n = 2, 3 is a correct answer |
9 |
Correct |
0 ms |
384 KB |
n = 2, 3 is a correct answer |
10 |
Correct |
0 ms |
384 KB |
n = 2, 2000000001 is a correct answer |
11 |
Correct |
0 ms |
384 KB |
n = 2, 3000000000 is a correct answer |
12 |
Correct |
1 ms |
384 KB |
n = 3, 3000000000 is a correct answer |
13 |
Correct |
1 ms |
384 KB |
n = 3, 3000000000 is a correct answer |
14 |
Correct |
1 ms |
384 KB |
n = 4, 3000000001 is a correct answer |
15 |
Correct |
1 ms |
384 KB |
n = 4, 4000000000 is a correct answer |
16 |
Correct |
0 ms |
384 KB |
n = 5, 4000000000 is a correct answer |
17 |
Correct |
0 ms |
384 KB |
n = 10, 1000000343 is a correct answer |
18 |
Correct |
1 ms |
384 KB |
n = 10, 3189 is a correct answer |
19 |
Correct |
1 ms |
384 KB |
n = 10, 7000000000 is a correct answer |
20 |
Correct |
0 ms |
384 KB |
n = 5, 12 is a correct answer |
21 |
Correct |
0 ms |
384 KB |
n = 5, 25 is a correct answer |
22 |
Correct |
0 ms |
384 KB |
n = 2, 122 is a correct answer |
23 |
Correct |
0 ms |
384 KB |
n = 10, 117 is a correct answer |
24 |
Correct |
0 ms |
384 KB |
n = 10, 336 is a correct answer |
25 |
Correct |
0 ms |
384 KB |
n = 10, 438 is a correct answer |
26 |
Correct |
0 ms |
384 KB |
n = 10, 206 is a correct answer |
27 |
Correct |
0 ms |
384 KB |
n = 10, 636 is a correct answer |
28 |
Correct |
0 ms |
384 KB |
n = 4, 2399 is a correct answer |
29 |
Correct |
0 ms |
384 KB |
n = 10, 10992 is a correct answer |
30 |
Runtime error |
8 ms |
640 KB |
Execution killed with signal 11 |
31 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
384 KB |
n = 4, 80 is a correct answer |
2 |
Correct |
0 ms |
384 KB |
n = 9, 110 is a correct answer |
3 |
Correct |
1 ms |
384 KB |
n = 4, 21 is a correct answer |
4 |
Correct |
0 ms |
384 KB |
n = 3, 4 is a correct answer |
5 |
Correct |
0 ms |
384 KB |
n = 2, 62 is a correct answer |
6 |
Correct |
1 ms |
384 KB |
n = 2, 3 is a correct answer |
7 |
Correct |
0 ms |
384 KB |
n = 3, 29 is a correct answer |
8 |
Correct |
1 ms |
384 KB |
n = 2, 3 is a correct answer |
9 |
Correct |
0 ms |
384 KB |
n = 2, 3 is a correct answer |
10 |
Correct |
0 ms |
384 KB |
n = 2, 2000000001 is a correct answer |
11 |
Correct |
0 ms |
384 KB |
n = 2, 3000000000 is a correct answer |
12 |
Correct |
1 ms |
384 KB |
n = 3, 3000000000 is a correct answer |
13 |
Correct |
1 ms |
384 KB |
n = 3, 3000000000 is a correct answer |
14 |
Correct |
1 ms |
384 KB |
n = 4, 3000000001 is a correct answer |
15 |
Correct |
1 ms |
384 KB |
n = 4, 4000000000 is a correct answer |
16 |
Correct |
0 ms |
384 KB |
n = 5, 4000000000 is a correct answer |
17 |
Correct |
0 ms |
384 KB |
n = 10, 1000000343 is a correct answer |
18 |
Correct |
1 ms |
384 KB |
n = 10, 3189 is a correct answer |
19 |
Correct |
1 ms |
384 KB |
n = 10, 7000000000 is a correct answer |
20 |
Correct |
0 ms |
384 KB |
n = 5, 12 is a correct answer |
21 |
Correct |
0 ms |
384 KB |
n = 5, 25 is a correct answer |
22 |
Correct |
0 ms |
384 KB |
n = 2, 122 is a correct answer |
23 |
Correct |
0 ms |
384 KB |
n = 10, 117 is a correct answer |
24 |
Correct |
0 ms |
384 KB |
n = 10, 336 is a correct answer |
25 |
Correct |
0 ms |
384 KB |
n = 10, 438 is a correct answer |
26 |
Correct |
0 ms |
384 KB |
n = 10, 206 is a correct answer |
27 |
Correct |
0 ms |
384 KB |
n = 10, 636 is a correct answer |
28 |
Correct |
0 ms |
384 KB |
n = 4, 2399 is a correct answer |
29 |
Correct |
0 ms |
384 KB |
n = 10, 10992 is a correct answer |
30 |
Runtime error |
8 ms |
640 KB |
Execution killed with signal 11 |
31 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
384 KB |
n = 4, 80 is a correct answer |
2 |
Correct |
0 ms |
384 KB |
n = 9, 110 is a correct answer |
3 |
Correct |
1 ms |
384 KB |
n = 4, 21 is a correct answer |
4 |
Correct |
0 ms |
384 KB |
n = 3, 4 is a correct answer |
5 |
Correct |
0 ms |
384 KB |
n = 2, 62 is a correct answer |
6 |
Correct |
1 ms |
384 KB |
n = 2, 3 is a correct answer |
7 |
Correct |
0 ms |
384 KB |
n = 3, 29 is a correct answer |
8 |
Correct |
1 ms |
384 KB |
n = 2, 3 is a correct answer |
9 |
Correct |
0 ms |
384 KB |
n = 2, 3 is a correct answer |
10 |
Correct |
0 ms |
384 KB |
n = 2, 2000000001 is a correct answer |
11 |
Correct |
0 ms |
384 KB |
n = 2, 3000000000 is a correct answer |
12 |
Correct |
1 ms |
384 KB |
n = 3, 3000000000 is a correct answer |
13 |
Correct |
1 ms |
384 KB |
n = 3, 3000000000 is a correct answer |
14 |
Correct |
1 ms |
384 KB |
n = 4, 3000000001 is a correct answer |
15 |
Correct |
1 ms |
384 KB |
n = 4, 4000000000 is a correct answer |
16 |
Correct |
0 ms |
384 KB |
n = 5, 4000000000 is a correct answer |
17 |
Correct |
0 ms |
384 KB |
n = 10, 1000000343 is a correct answer |
18 |
Correct |
1 ms |
384 KB |
n = 10, 3189 is a correct answer |
19 |
Correct |
1 ms |
384 KB |
n = 10, 7000000000 is a correct answer |
20 |
Correct |
0 ms |
384 KB |
n = 5, 12 is a correct answer |
21 |
Correct |
0 ms |
384 KB |
n = 5, 25 is a correct answer |
22 |
Correct |
0 ms |
384 KB |
n = 2, 122 is a correct answer |
23 |
Correct |
0 ms |
384 KB |
n = 10, 117 is a correct answer |
24 |
Correct |
0 ms |
384 KB |
n = 10, 336 is a correct answer |
25 |
Correct |
0 ms |
384 KB |
n = 10, 438 is a correct answer |
26 |
Correct |
0 ms |
384 KB |
n = 10, 206 is a correct answer |
27 |
Correct |
0 ms |
384 KB |
n = 10, 636 is a correct answer |
28 |
Correct |
0 ms |
384 KB |
n = 4, 2399 is a correct answer |
29 |
Correct |
0 ms |
384 KB |
n = 10, 10992 is a correct answer |
30 |
Runtime error |
8 ms |
640 KB |
Execution killed with signal 11 |
31 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
384 KB |
n = 4, 80 is a correct answer |
2 |
Correct |
0 ms |
384 KB |
n = 9, 110 is a correct answer |
3 |
Correct |
1 ms |
384 KB |
n = 4, 21 is a correct answer |
4 |
Correct |
0 ms |
384 KB |
n = 3, 4 is a correct answer |
5 |
Correct |
0 ms |
384 KB |
n = 2, 62 is a correct answer |
6 |
Correct |
1 ms |
384 KB |
n = 2, 3 is a correct answer |
7 |
Correct |
0 ms |
384 KB |
n = 3, 29 is a correct answer |
8 |
Correct |
1 ms |
384 KB |
n = 2, 3 is a correct answer |
9 |
Correct |
0 ms |
384 KB |
n = 2, 3 is a correct answer |
10 |
Correct |
0 ms |
384 KB |
n = 2, 2000000001 is a correct answer |
11 |
Correct |
0 ms |
384 KB |
n = 2, 3000000000 is a correct answer |
12 |
Correct |
1 ms |
384 KB |
n = 3, 3000000000 is a correct answer |
13 |
Correct |
1 ms |
384 KB |
n = 3, 3000000000 is a correct answer |
14 |
Correct |
1 ms |
384 KB |
n = 4, 3000000001 is a correct answer |
15 |
Correct |
1 ms |
384 KB |
n = 4, 4000000000 is a correct answer |
16 |
Correct |
0 ms |
384 KB |
n = 5, 4000000000 is a correct answer |
17 |
Correct |
0 ms |
384 KB |
n = 10, 1000000343 is a correct answer |
18 |
Correct |
1 ms |
384 KB |
n = 10, 3189 is a correct answer |
19 |
Correct |
1 ms |
384 KB |
n = 10, 7000000000 is a correct answer |
20 |
Correct |
0 ms |
384 KB |
n = 5, 12 is a correct answer |
21 |
Correct |
0 ms |
384 KB |
n = 5, 25 is a correct answer |
22 |
Correct |
0 ms |
384 KB |
n = 2, 122 is a correct answer |
23 |
Correct |
0 ms |
384 KB |
n = 10, 117 is a correct answer |
24 |
Correct |
0 ms |
384 KB |
n = 10, 336 is a correct answer |
25 |
Correct |
0 ms |
384 KB |
n = 10, 438 is a correct answer |
26 |
Correct |
0 ms |
384 KB |
n = 10, 206 is a correct answer |
27 |
Correct |
0 ms |
384 KB |
n = 10, 636 is a correct answer |
28 |
Correct |
0 ms |
384 KB |
n = 4, 2399 is a correct answer |
29 |
Correct |
0 ms |
384 KB |
n = 10, 10992 is a correct answer |
30 |
Runtime error |
8 ms |
640 KB |
Execution killed with signal 11 |
31 |
Halted |
0 ms |
0 KB |
- |