oj.uz

Submission #220875

# Submission time Handle Problem Language Result Execution time Memory
220875 2020-04-09T07:06:28 Z emil_physmath Shortcut (IOI16_shortcut) C++17
23 / 100
 2000 ms 1656 KB 
#include "shortcut.h"
#include <algorithm>
#include <iostream>
#include <vector>
#include <set>
using namespace std;
using llong  = long long;
const int maxN = 3000;
const int lg = 11;

llong t1[lg + 1][maxN], t2[lg + 1][maxN], t3[lg + 1][maxN], t4[lg + 1][maxN];
vector<llong> x, val;
llong c;

void Build(llong t[][maxN], const vector<llong>& a)
{
    int n = a.size();
    for (int i = 0; i < n; ++i)
        t[0][i] = a[i];
    for (int l = 1; l <= lg; ++l)
        for (int i = 0; i < n; ++i)
            t[l][i] = max(t[l - 1][i], t[l - 1][i + (1 << (l - 1))]);
}
llong Max(llong t[][maxN], int l, int r)
{
    int i = __lg(r - l + 1);
    return max(t[i][l], t[i][r - (1 << i) + 1]);
}
llong cache[maxN][maxN];
bool Poss(int s, int e, llong cur)
{
    if (cache[s][e] != numeric_limits<llong>::min())
        return cache[s][e] <= cur;
    multiset<llong> mx;
    for (int l = s, r = s - 1; l <= e; ++l)
    {
        if (r < l)
        {
            r = l;
            mx.clear();
        }
        else
            mx.erase(mx.find(x[l] + val[l]));
        while (r + 1 <= e && x[r + 1] - x[l] <= (x[e] - x[s]) - (x[r + 1] - x[l]) + c)
        {
            ++r;
            mx.insert(x[r] + val[r]);
        }
        if (mx.size()) cache[s][e] = max(cache[s][e], *mx.rbegin() - x[l] + val[l]);
    }
    mx.clear();
    for (int i = s; i <= e; ++i)
        mx.insert(val[i] - x[i]);
    for (int l = s, r = s; ; ++l)
    {
        while (l > r)
        {
            mx.erase(mx.find(val[r] - x[r]));
            ++r;
        }
        while (r <= e && x[r] - x[l] < (x[e] - x[s]) - (x[r] - x[l]) + c)
        {
            mx.erase(mx.find(val[r] - x[r]));
            ++r;
        }
        if (r > e)
            break;
        if (mx.size())
            cache[s][e] = max(cache[s][e], (x[e] - x[s]) + *mx.rbegin() + x[l] + val[l] + c);
    }
    if (cache[s][e] == numeric_limits<llong>::min())
        ++cache[s][e];
    return cache[s][e] <= cur;
};
long long Brutos(int n, vector<int> l, vector<int> val, int c)
{
    vector<llong> x(n);
    for (int i = 1; i < n; ++i)
        x[i] = x[i - 1] + l[i - 1];
    llong ans = numeric_limits<llong>::max();
    for (int l = 0; l < n; ++l)
        for (int r = l + 1; r < n; ++r)
        {
            llong cur = 0;
            for (int a = 0; a < n; ++a)
            {
                cur = max(cur, (llong)val[a]);
                for (int b = a + 1; b < n; ++b)
                {
                    if (b <= l || a >= r)
                        cur = max(cur, val[a] + val[b] + x[b] - x[a]);
                    else if (a <= l && b >= r)
                        cur = max(cur, val[a] + val[b] + x[l] - x[a] + x[b] - x[r] + min(x[r] - x[l], (llong)c));
                    else if (l <= a && b <= r)
                        cur = max(cur, val[a] + val[b] + min(x[b] - x[a], x[a] - x[l] + x[r] - x[b] + c));
                    else if (a <= l)
                        cur = max(cur, val[a] + val[b] + x[l] - x[a] + min(x[b] - x[l], x[r] - x[b] + c));
                    else if (b >= r)
                        cur = max(cur, val[a] + val[b] + x[b] - x[r] + min(x[r] - x[a], x[a] - x[l] + c));
                }
            }
            ans = min(ans, cur);
        }
    return ans;
}
llong lrout[maxN][maxN];
long long find_shortcut(int n, vector<int> l, vector<int> val_, int c_)
{
    cerr << "Brutos: " << Brutos(n, l, val_, c_) << '\n';
    for (int i = 0; i < n; ++i)
        for (int j = 0; j < n; ++j)
            cache[i][j] = lrout[i][j] = numeric_limits<llong>::min();
    c = c_;
    val.assign(val_.begin(), val_.end());
    vector<llong> valc(val.begin(), val.end());
    for (llong& x: valc)
        x += c;
    x.resize(n);
    x[0] = 0;
    for (int i = 1; i < n; ++i)
        x[i] = x[i - 1] + l[i - 1];
    vector<llong> pref(n), suff(n), pathpref(n), pathsuff(n);
    pref[0] = val[0];
    pathpref[0] = val[0];
    for (int i = 1; i < n; ++i)
    {
        pathpref[i] = max(pathpref[i - 1], pref[i - 1] + x[i] + val[i]);
        pref[i] = max(pref[i - 1], -x[i] + val[i]);
    }
    suff.back() = val.back();
    pathsuff.back() = val.back();
    for (int i = n - 2; i >= 0; --i)
    {
        pathsuff[i] = max(pathsuff[i + 1], suff[i + 1] + (x.back() - x[i]) + val[i]);
        suff[i] = max(suff[i + 1], -(x.back() - x[i]) + val[i]);
    }
    for (int l = 0; l < n; ++l)
    {
        vector<llong> valcr = valc;
        for (int r = l; r < n; ++r)
            valcr[r] += x[r] - x[l];
        vector<llong> valr = val;
        for (int r = l; r < n; ++r)
            valr[r] += x[r] - x[l];
        Build(t2, valcr);
        Build(t3, valr);
        int r = l, m = l, m1 = l;
        while (r < n)
        {
            lrout[l][r] = max(lrout[l][r], max(pathsuff[r], pathpref[l]));
            while (m <= r && x[m] - x[l] + c < x[r] - x[m])
                ++m;
            while (m1 + 1 <= r && x[m1 + 1] - x[l] <= x[r] - x[m1 + 1] + c)
                ++m1;
            /*if (l == 1 && r == 3)
                for (int i = l; i <= r; ++i)
                    cerr << "tree4[" << i << "] = " << Max(t4, lazy4, 1, 0, n - 1, i, i) << '\n';*/
            if (l <= m1 && l)
                lrout[l][r] = max(lrout[l][r], Max(t3, l, m1) + x[l] - x[l - 1] + pref[l - 1] + x[l - 1]);
            lrout[l][r] = max(lrout[l][r], max(pref[l] + suff[r] + x.back() - (x[r] - x[l]) + min(c, x[r] - x[l]), pathsuff[r]));
            if (l <= m - 1 && r + 1 < n)
                lrout[l][r] = max(lrout[l][r], Max(t2, l, m - 1) + x[r + 1] - x[r] + suff[r + 1] + (x.back() - x[r + 1]));
            // cerr << "lrout[" << l << "][" << r << "] = " << lrout[l][r] << '\n';
            ++r;
        }
    }
    for (int r = n - 1; r >= 0; --r)
    {
        vector<llong> vals = val;
        for (int i = 0; i <= r; ++i)
            vals[i] += x[r] - x[i];
        Build(t1, vals);
        vals = val;
        for (int i = 0; i <= r; ++i)
            vals[i] += x[r] - x[i] + c;
        Build(t4, vals);
        int l = r, m = r, m1 = r;
        while (l >= 0)
        {
            lrout[l][r] = max(lrout[l][r], max(pathsuff[r], pathpref[l]));
            while (m - 1 >= l && x[r] - x[m - 1] <= x[m - 1] - x[l] + c)
                --m;
            while (m1 >= l && x[m1] - x[l] > x[r] - x[m1] + c)
                --m1;
            /*if (l == 1 && r == 3)
                for (int i = l; i <= r; ++i)
                    cerr << "tree4[" << i << "] = " << Max(t4, lazy4, 1, 0, n - 1, i, i) << '\n';*/
            if (m1 + 1 <= r && l)
                lrout[l][r] = max(lrout[l][r], Max(t4, m1 + 1, r) + x[l] - x[l - 1] + pref[l - 1] + x[l - 1]);
            if (m <= r && r + 1 < n)
                lrout[l][r] = max(lrout[l][r], Max(t1, m, r) + x[r + 1] - x[r] + suff[r + 1] + (x.back() - x[r + 1]));
            // cerr << "lrout[" << l << "][" << r << "] = " << lrout[l][r] << '\n';
            --l;
        }
    }
    llong ans = (maxN + 2) * 1000'000'000LL + 1LL;
    for (int l = 0; l < n; ++l)
        for (int r = l; r < n; ++r)
        {
            Poss(l, r, 0);
            ans = min(ans, max(lrout[l][r], cache[l][r]));
        }
    return ans;
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 640 KB n = 4, 80 is a correct answer
2 Correct 5 ms 640 KB n = 9, 110 is a correct answer
3 Correct 5 ms 512 KB n = 4, 21 is a correct answer
4 Correct 5 ms 512 KB n = 3, 4 is a correct answer
5 Correct 5 ms 512 KB n = 2, 62 is a correct answer
6 Correct 5 ms 512 KB n = 2, 3 is a correct answer
7 Correct 5 ms 512 KB n = 3, 29 is a correct answer
8 Correct 5 ms 512 KB n = 2, 3 is a correct answer
9 Correct 5 ms 512 KB n = 2, 3 is a correct answer
10 Correct 5 ms 512 KB n = 2, 2000000001 is a correct answer
11 Correct 5 ms 512 KB n = 2, 3000000000 is a correct answer
12 Correct 5 ms 512 KB n = 3, 3000000000 is a correct answer
13 Correct 5 ms 512 KB n = 3, 3000000000 is a correct answer
14 Correct 5 ms 512 KB n = 4, 3000000001 is a correct answer
15 Correct 5 ms 512 KB n = 4, 4000000000 is a correct answer
16 Correct 5 ms 512 KB n = 5, 4000000000 is a correct answer
17 Correct 5 ms 640 KB n = 10, 1000000343 is a correct answer
18 Correct 5 ms 640 KB n = 10, 3189 is a correct answer
19 Correct 5 ms 640 KB n = 10, 7000000000 is a correct answer
20 Correct 5 ms 512 KB n = 5, 12 is a correct answer
21 Correct 5 ms 512 KB n = 5, 25 is a correct answer
22 Correct 5 ms 512 KB n = 2, 122 is a correct answer
23 Correct 5 ms 640 KB n = 10, 117 is a correct answer
24 Correct 5 ms 640 KB n = 10, 336 is a correct answer
25 Correct 5 ms 640 KB n = 10, 438 is a correct answer
26 Correct 5 ms 640 KB n = 10, 206 is a correct answer
27 Correct 5 ms 640 KB n = 10, 636 is a correct answer
28 Correct 6 ms 512 KB n = 4, 2399 is a correct answer
29 Correct 5 ms 640 KB n = 10, 10992 is a correct answer
30 Correct 5 ms 640 KB n = 10, 3112 is a correct answer
31 Correct 109 ms 1528 KB n = 100, 51000000001 is a correct answer
32 Correct 15 ms 1024 KB n = 50, 197881272 is a correct answer
33 Correct 119 ms 1528 KB n = 100, 20969 is a correct answer
34 Correct 120 ms 1528 KB n = 100, 20969 is a correct answer
35 Correct 104 ms 1528 KB n = 100, 52000000000 is a correct answer
36 Correct 111 ms 1532 KB n = 100, 285 is a correct answer
37 Correct 117 ms 1532 KB n = 100, 21272 is a correct answer
38 Correct 109 ms 1528 KB n = 100, 12161 is a correct answer

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 640 KB n = 4, 80 is a correct answer
2 Correct 5 ms 640 KB n = 9, 110 is a correct answer
3 Correct 5 ms 512 KB n = 4, 21 is a correct answer
4 Correct 5 ms 512 KB n = 3, 4 is a correct answer
5 Correct 5 ms 512 KB n = 2, 62 is a correct answer
6 Correct 5 ms 512 KB n = 2, 3 is a correct answer
7 Correct 5 ms 512 KB n = 3, 29 is a correct answer
8 Correct 5 ms 512 KB n = 2, 3 is a correct answer
9 Correct 5 ms 512 KB n = 2, 3 is a correct answer
10 Correct 5 ms 512 KB n = 2, 2000000001 is a correct answer
11 Correct 5 ms 512 KB n = 2, 3000000000 is a correct answer
12 Correct 5 ms 512 KB n = 3, 3000000000 is a correct answer
13 Correct 5 ms 512 KB n = 3, 3000000000 is a correct answer
14 Correct 5 ms 512 KB n = 4, 3000000001 is a correct answer
15 Correct 5 ms 512 KB n = 4, 4000000000 is a correct answer
16 Correct 5 ms 512 KB n = 5, 4000000000 is a correct answer
17 Correct 5 ms 640 KB n = 10, 1000000343 is a correct answer
18 Correct 5 ms 640 KB n = 10, 3189 is a correct answer
19 Correct 5 ms 640 KB n = 10, 7000000000 is a correct answer
20 Correct 5 ms 512 KB n = 5, 12 is a correct answer
21 Correct 5 ms 512 KB n = 5, 25 is a correct answer
22 Correct 5 ms 512 KB n = 2, 122 is a correct answer
23 Correct 5 ms 640 KB n = 10, 117 is a correct answer
24 Correct 5 ms 640 KB n = 10, 336 is a correct answer
25 Correct 5 ms 640 KB n = 10, 438 is a correct answer
26 Correct 5 ms 640 KB n = 10, 206 is a correct answer
27 Correct 5 ms 640 KB n = 10, 636 is a correct answer
28 Correct 6 ms 512 KB n = 4, 2399 is a correct answer
29 Correct 5 ms 640 KB n = 10, 10992 is a correct answer
30 Correct 5 ms 640 KB n = 10, 3112 is a correct answer
31 Correct 109 ms 1528 KB n = 100, 51000000001 is a correct answer
32 Correct 15 ms 1024 KB n = 50, 197881272 is a correct answer
33 Correct 119 ms 1528 KB n = 100, 20969 is a correct answer
34 Correct 120 ms 1528 KB n = 100, 20969 is a correct answer
35 Correct 104 ms 1528 KB n = 100, 52000000000 is a correct answer
36 Correct 111 ms 1532 KB n = 100, 285 is a correct answer
37 Correct 117 ms 1532 KB n = 100, 21272 is a correct answer
38 Correct 109 ms 1528 KB n = 100, 12161 is a correct answer
39 Correct 5 ms 512 KB n = 2, 62 is a correct answer
40 Correct 5 ms 512 KB n = 2, 3 is a correct answer
41 Correct 5 ms 512 KB n = 3, 29 is a correct answer
42 Correct 5 ms 512 KB n = 2, 3 is a correct answer
43 Correct 5 ms 512 KB n = 2, 3 is a correct answer
44 Correct 5 ms 512 KB n = 2, 2000000001 is a correct answer
45 Correct 5 ms 512 KB n = 2, 3000000000 is a correct answer
46 Correct 5 ms 640 KB n = 3, 3000000000 is a correct answer
47 Correct 5 ms 512 KB n = 3, 3000000000 is a correct answer
48 Correct 4 ms 512 KB n = 4, 3000000001 is a correct answer
49 Correct 5 ms 512 KB n = 4, 4000000000 is a correct answer
50 Correct 5 ms 512 KB n = 5, 4000000000 is a correct answer
51 Correct 5 ms 640 KB n = 10, 1000000343 is a correct answer
52 Correct 5 ms 640 KB n = 10, 3189 is a correct answer
53 Correct 5 ms 640 KB n = 10, 7000000000 is a correct answer
54 Correct 5 ms 640 KB n = 5, 12 is a correct answer
55 Correct 5 ms 512 KB n = 5, 25 is a correct answer
56 Correct 5 ms 512 KB n = 2, 122 is a correct answer
57 Correct 5 ms 640 KB n = 10, 117 is a correct answer
58 Correct 5 ms 640 KB n = 10, 336 is a correct answer
59 Correct 5 ms 640 KB n = 10, 438 is a correct answer
60 Correct 5 ms 640 KB n = 10, 206 is a correct answer
61 Correct 5 ms 640 KB n = 10, 636 is a correct answer
62 Correct 5 ms 512 KB n = 4, 2399 is a correct answer
63 Correct 5 ms 640 KB n = 10, 10992 is a correct answer
64 Correct 5 ms 640 KB n = 10, 3112 is a correct answer
65 Correct 105 ms 1528 KB n = 100, 51000000001 is a correct answer
66 Correct 15 ms 1024 KB n = 50, 197881272 is a correct answer
67 Correct 117 ms 1528 KB n = 100, 20969 is a correct answer
68 Correct 127 ms 1528 KB n = 100, 20969 is a correct answer
69 Correct 111 ms 1656 KB n = 100, 52000000000 is a correct answer
70 Correct 111 ms 1528 KB n = 100, 285 is a correct answer
71 Correct 121 ms 1560 KB n = 100, 21272 is a correct answer
72 Correct 107 ms 1528 KB n = 100, 12161 is a correct answer

Subtask #3
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 640 KB n = 4, 80 is a correct answer
2 Correct 5 ms 640 KB n = 9, 110 is a correct answer
3 Correct 5 ms 512 KB n = 4, 21 is a correct answer
4 Correct 5 ms 512 KB n = 3, 4 is a correct answer
5 Correct 5 ms 512 KB n = 2, 62 is a correct answer
6 Correct 5 ms 512 KB n = 2, 3 is a correct answer
7 Correct 5 ms 512 KB n = 3, 29 is a correct answer
8 Correct 5 ms 512 KB n = 2, 3 is a correct answer
9 Correct 5 ms 512 KB n = 2, 3 is a correct answer
10 Correct 5 ms 512 KB n = 2, 2000000001 is a correct answer
11 Correct 5 ms 512 KB n = 2, 3000000000 is a correct answer
12 Correct 5 ms 512 KB n = 3, 3000000000 is a correct answer
13 Correct 5 ms 512 KB n = 3, 3000000000 is a correct answer
14 Correct 5 ms 512 KB n = 4, 3000000001 is a correct answer
15 Correct 5 ms 512 KB n = 4, 4000000000 is a correct answer
16 Correct 5 ms 512 KB n = 5, 4000000000 is a correct answer
17 Correct 5 ms 640 KB n = 10, 1000000343 is a correct answer
18 Correct 5 ms 640 KB n = 10, 3189 is a correct answer
19 Correct 5 ms 640 KB n = 10, 7000000000 is a correct answer
20 Correct 5 ms 512 KB n = 5, 12 is a correct answer
21 Correct 5 ms 512 KB n = 5, 25 is a correct answer
22 Correct 5 ms 512 KB n = 2, 122 is a correct answer
23 Correct 5 ms 640 KB n = 10, 117 is a correct answer
24 Correct 5 ms 640 KB n = 10, 336 is a correct answer
25 Correct 5 ms 640 KB n = 10, 438 is a correct answer
26 Correct 5 ms 640 KB n = 10, 206 is a correct answer
27 Correct 5 ms 640 KB n = 10, 636 is a correct answer
28 Correct 6 ms 512 KB n = 4, 2399 is a correct answer
29 Correct 5 ms 640 KB n = 10, 10992 is a correct answer
30 Correct 5 ms 640 KB n = 10, 3112 is a correct answer
31 Correct 109 ms 1528 KB n = 100, 51000000001 is a correct answer
32 Correct 15 ms 1024 KB n = 50, 197881272 is a correct answer
33 Correct 119 ms 1528 KB n = 100, 20969 is a correct answer
34 Correct 120 ms 1528 KB n = 100, 20969 is a correct answer
35 Correct 104 ms 1528 KB n = 100, 52000000000 is a correct answer
36 Correct 111 ms 1532 KB n = 100, 285 is a correct answer
37 Correct 117 ms 1532 KB n = 100, 21272 is a correct answer
38 Correct 109 ms 1528 KB n = 100, 12161 is a correct answer
39 Correct 5 ms 512 KB n = 2, 62 is a correct answer
40 Correct 5 ms 512 KB n = 2, 3 is a correct answer
41 Correct 5 ms 512 KB n = 3, 29 is a correct answer
42 Correct 5 ms 512 KB n = 2, 3 is a correct answer
43 Correct 5 ms 512 KB n = 2, 3 is a correct answer
44 Correct 5 ms 512 KB n = 2, 2000000001 is a correct answer
45 Correct 5 ms 512 KB n = 2, 3000000000 is a correct answer
46 Correct 5 ms 640 KB n = 3, 3000000000 is a correct answer
47 Correct 5 ms 512 KB n = 3, 3000000000 is a correct answer
48 Correct 4 ms 512 KB n = 4, 3000000001 is a correct answer
49 Correct 5 ms 512 KB n = 4, 4000000000 is a correct answer
50 Correct 5 ms 512 KB n = 5, 4000000000 is a correct answer
51 Correct 5 ms 640 KB n = 10, 1000000343 is a correct answer
52 Correct 5 ms 640 KB n = 10, 3189 is a correct answer
53 Correct 5 ms 640 KB n = 10, 7000000000 is a correct answer
54 Correct 5 ms 640 KB n = 5, 12 is a correct answer
55 Correct 5 ms 512 KB n = 5, 25 is a correct answer
56 Correct 5 ms 512 KB n = 2, 122 is a correct answer
57 Correct 5 ms 640 KB n = 10, 117 is a correct answer
58 Correct 5 ms 640 KB n = 10, 336 is a correct answer
59 Correct 5 ms 640 KB n = 10, 438 is a correct answer
60 Correct 5 ms 640 KB n = 10, 206 is a correct answer
61 Correct 5 ms 640 KB n = 10, 636 is a correct answer
62 Correct 5 ms 512 KB n = 4, 2399 is a correct answer
63 Correct 5 ms 640 KB n = 10, 10992 is a correct answer
64 Correct 5 ms 640 KB n = 10, 3112 is a correct answer
65 Correct 105 ms 1528 KB n = 100, 51000000001 is a correct answer
66 Correct 15 ms 1024 KB n = 50, 197881272 is a correct answer
67 Correct 117 ms 1528 KB n = 100, 20969 is a correct answer
68 Correct 127 ms 1528 KB n = 100, 20969 is a correct answer
69 Correct 111 ms 1656 KB n = 100, 52000000000 is a correct answer
70 Correct 111 ms 1528 KB n = 100, 285 is a correct answer
71 Correct 121 ms 1560 KB n = 100, 21272 is a correct answer
72 Correct 107 ms 1528 KB n = 100, 12161 is a correct answer
73 Execution timed out 2084 ms 384 KB Time limit exceeded
74 Halted 0 ms 0 KB -

Subtask #4
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 640 KB n = 4, 80 is a correct answer
2 Correct 5 ms 640 KB n = 9, 110 is a correct answer
3 Correct 5 ms 512 KB n = 4, 21 is a correct answer
4 Correct 5 ms 512 KB n = 3, 4 is a correct answer
5 Correct 5 ms 512 KB n = 2, 62 is a correct answer
6 Correct 5 ms 512 KB n = 2, 3 is a correct answer
7 Correct 5 ms 512 KB n = 3, 29 is a correct answer
8 Correct 5 ms 512 KB n = 2, 3 is a correct answer
9 Correct 5 ms 512 KB n = 2, 3 is a correct answer
10 Correct 5 ms 512 KB n = 2, 2000000001 is a correct answer
11 Correct 5 ms 512 KB n = 2, 3000000000 is a correct answer
12 Correct 5 ms 512 KB n = 3, 3000000000 is a correct answer
13 Correct 5 ms 512 KB n = 3, 3000000000 is a correct answer
14 Correct 5 ms 512 KB n = 4, 3000000001 is a correct answer
15 Correct 5 ms 512 KB n = 4, 4000000000 is a correct answer
16 Correct 5 ms 512 KB n = 5, 4000000000 is a correct answer
17 Correct 5 ms 640 KB n = 10, 1000000343 is a correct answer
18 Correct 5 ms 640 KB n = 10, 3189 is a correct answer
19 Correct 5 ms 640 KB n = 10, 7000000000 is a correct answer
20 Correct 5 ms 512 KB n = 5, 12 is a correct answer
21 Correct 5 ms 512 KB n = 5, 25 is a correct answer
22 Correct 5 ms 512 KB n = 2, 122 is a correct answer
23 Correct 5 ms 640 KB n = 10, 117 is a correct answer
24 Correct 5 ms 640 KB n = 10, 336 is a correct answer
25 Correct 5 ms 640 KB n = 10, 438 is a correct answer
26 Correct 5 ms 640 KB n = 10, 206 is a correct answer
27 Correct 5 ms 640 KB n = 10, 636 is a correct answer
28 Correct 6 ms 512 KB n = 4, 2399 is a correct answer
29 Correct 5 ms 640 KB n = 10, 10992 is a correct answer
30 Correct 5 ms 640 KB n = 10, 3112 is a correct answer
31 Correct 109 ms 1528 KB n = 100, 51000000001 is a correct answer
32 Correct 15 ms 1024 KB n = 50, 197881272 is a correct answer
33 Correct 119 ms 1528 KB n = 100, 20969 is a correct answer
34 Correct 120 ms 1528 KB n = 100, 20969 is a correct answer
35 Correct 104 ms 1528 KB n = 100, 52000000000 is a correct answer
36 Correct 111 ms 1532 KB n = 100, 285 is a correct answer
37 Correct 117 ms 1532 KB n = 100, 21272 is a correct answer
38 Correct 109 ms 1528 KB n = 100, 12161 is a correct answer
39 Correct 5 ms 512 KB n = 2, 62 is a correct answer
40 Correct 5 ms 512 KB n = 2, 3 is a correct answer
41 Correct 5 ms 512 KB n = 3, 29 is a correct answer
42 Correct 5 ms 512 KB n = 2, 3 is a correct answer
43 Correct 5 ms 512 KB n = 2, 3 is a correct answer
44 Correct 5 ms 512 KB n = 2, 2000000001 is a correct answer
45 Correct 5 ms 512 KB n = 2, 3000000000 is a correct answer
46 Correct 5 ms 640 KB n = 3, 3000000000 is a correct answer
47 Correct 5 ms 512 KB n = 3, 3000000000 is a correct answer
48 Correct 4 ms 512 KB n = 4, 3000000001 is a correct answer
49 Correct 5 ms 512 KB n = 4, 4000000000 is a correct answer
50 Correct 5 ms 512 KB n = 5, 4000000000 is a correct answer
51 Correct 5 ms 640 KB n = 10, 1000000343 is a correct answer
52 Correct 5 ms 640 KB n = 10, 3189 is a correct answer
53 Correct 5 ms 640 KB n = 10, 7000000000 is a correct answer
54 Correct 5 ms 640 KB n = 5, 12 is a correct answer
55 Correct 5 ms 512 KB n = 5, 25 is a correct answer
56 Correct 5 ms 512 KB n = 2, 122 is a correct answer
57 Correct 5 ms 640 KB n = 10, 117 is a correct answer
58 Correct 5 ms 640 KB n = 10, 336 is a correct answer
59 Correct 5 ms 640 KB n = 10, 438 is a correct answer
60 Correct 5 ms 640 KB n = 10, 206 is a correct answer
61 Correct 5 ms 640 KB n = 10, 636 is a correct answer
62 Correct 5 ms 512 KB n = 4, 2399 is a correct answer
63 Correct 5 ms 640 KB n = 10, 10992 is a correct answer
64 Correct 5 ms 640 KB n = 10, 3112 is a correct answer
65 Correct 105 ms 1528 KB n = 100, 51000000001 is a correct answer
66 Correct 15 ms 1024 KB n = 50, 197881272 is a correct answer
67 Correct 117 ms 1528 KB n = 100, 20969 is a correct answer
68 Correct 127 ms 1528 KB n = 100, 20969 is a correct answer
69 Correct 111 ms 1656 KB n = 100, 52000000000 is a correct answer
70 Correct 111 ms 1528 KB n = 100, 285 is a correct answer
71 Correct 121 ms 1560 KB n = 100, 21272 is a correct answer
72 Correct 107 ms 1528 KB n = 100, 12161 is a correct answer
73 Execution timed out 2084 ms 384 KB Time limit exceeded
74 Halted 0 ms 0 KB -

Subtask #5
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 640 KB n = 4, 80 is a correct answer
2 Correct 5 ms 640 KB n = 9, 110 is a correct answer
3 Correct 5 ms 512 KB n = 4, 21 is a correct answer
4 Correct 5 ms 512 KB n = 3, 4 is a correct answer
5 Correct 5 ms 512 KB n = 2, 62 is a correct answer
6 Correct 5 ms 512 KB n = 2, 3 is a correct answer
7 Correct 5 ms 512 KB n = 3, 29 is a correct answer
8 Correct 5 ms 512 KB n = 2, 3 is a correct answer
9 Correct 5 ms 512 KB n = 2, 3 is a correct answer
10 Correct 5 ms 512 KB n = 2, 2000000001 is a correct answer
11 Correct 5 ms 512 KB n = 2, 3000000000 is a correct answer
12 Correct 5 ms 512 KB n = 3, 3000000000 is a correct answer
13 Correct 5 ms 512 KB n = 3, 3000000000 is a correct answer
14 Correct 5 ms 512 KB n = 4, 3000000001 is a correct answer
15 Correct 5 ms 512 KB n = 4, 4000000000 is a correct answer
16 Correct 5 ms 512 KB n = 5, 4000000000 is a correct answer
17 Correct 5 ms 640 KB n = 10, 1000000343 is a correct answer
18 Correct 5 ms 640 KB n = 10, 3189 is a correct answer
19 Correct 5 ms 640 KB n = 10, 7000000000 is a correct answer
20 Correct 5 ms 512 KB n = 5, 12 is a correct answer
21 Correct 5 ms 512 KB n = 5, 25 is a correct answer
22 Correct 5 ms 512 KB n = 2, 122 is a correct answer
23 Correct 5 ms 640 KB n = 10, 117 is a correct answer
24 Correct 5 ms 640 KB n = 10, 336 is a correct answer
25 Correct 5 ms 640 KB n = 10, 438 is a correct answer
26 Correct 5 ms 640 KB n = 10, 206 is a correct answer
27 Correct 5 ms 640 KB n = 10, 636 is a correct answer
28 Correct 6 ms 512 KB n = 4, 2399 is a correct answer
29 Correct 5 ms 640 KB n = 10, 10992 is a correct answer
30 Correct 5 ms 640 KB n = 10, 3112 is a correct answer
31 Correct 109 ms 1528 KB n = 100, 51000000001 is a correct answer
32 Correct 15 ms 1024 KB n = 50, 197881272 is a correct answer
33 Correct 119 ms 1528 KB n = 100, 20969 is a correct answer
34 Correct 120 ms 1528 KB n = 100, 20969 is a correct answer
35 Correct 104 ms 1528 KB n = 100, 52000000000 is a correct answer
36 Correct 111 ms 1532 KB n = 100, 285 is a correct answer
37 Correct 117 ms 1532 KB n = 100, 21272 is a correct answer
38 Correct 109 ms 1528 KB n = 100, 12161 is a correct answer
39 Correct 5 ms 512 KB n = 2, 62 is a correct answer
40 Correct 5 ms 512 KB n = 2, 3 is a correct answer
41 Correct 5 ms 512 KB n = 3, 29 is a correct answer
42 Correct 5 ms 512 KB n = 2, 3 is a correct answer
43 Correct 5 ms 512 KB n = 2, 3 is a correct answer
44 Correct 5 ms 512 KB n = 2, 2000000001 is a correct answer
45 Correct 5 ms 512 KB n = 2, 3000000000 is a correct answer
46 Correct 5 ms 640 KB n = 3, 3000000000 is a correct answer
47 Correct 5 ms 512 KB n = 3, 3000000000 is a correct answer
48 Correct 4 ms 512 KB n = 4, 3000000001 is a correct answer
49 Correct 5 ms 512 KB n = 4, 4000000000 is a correct answer
50 Correct 5 ms 512 KB n = 5, 4000000000 is a correct answer
51 Correct 5 ms 640 KB n = 10, 1000000343 is a correct answer
52 Correct 5 ms 640 KB n = 10, 3189 is a correct answer
53 Correct 5 ms 640 KB n = 10, 7000000000 is a correct answer
54 Correct 5 ms 640 KB n = 5, 12 is a correct answer
55 Correct 5 ms 512 KB n = 5, 25 is a correct answer
56 Correct 5 ms 512 KB n = 2, 122 is a correct answer
57 Correct 5 ms 640 KB n = 10, 117 is a correct answer
58 Correct 5 ms 640 KB n = 10, 336 is a correct answer
59 Correct 5 ms 640 KB n = 10, 438 is a correct answer
60 Correct 5 ms 640 KB n = 10, 206 is a correct answer
61 Correct 5 ms 640 KB n = 10, 636 is a correct answer
62 Correct 5 ms 512 KB n = 4, 2399 is a correct answer
63 Correct 5 ms 640 KB n = 10, 10992 is a correct answer
64 Correct 5 ms 640 KB n = 10, 3112 is a correct answer
65 Correct 105 ms 1528 KB n = 100, 51000000001 is a correct answer
66 Correct 15 ms 1024 KB n = 50, 197881272 is a correct answer
67 Correct 117 ms 1528 KB n = 100, 20969 is a correct answer
68 Correct 127 ms 1528 KB n = 100, 20969 is a correct answer
69 Correct 111 ms 1656 KB n = 100, 52000000000 is a correct answer
70 Correct 111 ms 1528 KB n = 100, 285 is a correct answer
71 Correct 121 ms 1560 KB n = 100, 21272 is a correct answer
72 Correct 107 ms 1528 KB n = 100, 12161 is a correct answer
73 Execution timed out 2084 ms 384 KB Time limit exceeded
74 Halted 0 ms 0 KB -

Subtask #6
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 640 KB n = 4, 80 is a correct answer
2 Correct 5 ms 640 KB n = 9, 110 is a correct answer
3 Correct 5 ms 512 KB n = 4, 21 is a correct answer
4 Correct 5 ms 512 KB n = 3, 4 is a correct answer
5 Correct 5 ms 512 KB n = 2, 62 is a correct answer
6 Correct 5 ms 512 KB n = 2, 3 is a correct answer
7 Correct 5 ms 512 KB n = 3, 29 is a correct answer
8 Correct 5 ms 512 KB n = 2, 3 is a correct answer
9 Correct 5 ms 512 KB n = 2, 3 is a correct answer
10 Correct 5 ms 512 KB n = 2, 2000000001 is a correct answer
11 Correct 5 ms 512 KB n = 2, 3000000000 is a correct answer
12 Correct 5 ms 512 KB n = 3, 3000000000 is a correct answer
13 Correct 5 ms 512 KB n = 3, 3000000000 is a correct answer
14 Correct 5 ms 512 KB n = 4, 3000000001 is a correct answer
15 Correct 5 ms 512 KB n = 4, 4000000000 is a correct answer
16 Correct 5 ms 512 KB n = 5, 4000000000 is a correct answer
17 Correct 5 ms 640 KB n = 10, 1000000343 is a correct answer
18 Correct 5 ms 640 KB n = 10, 3189 is a correct answer
19 Correct 5 ms 640 KB n = 10, 7000000000 is a correct answer
20 Correct 5 ms 512 KB n = 5, 12 is a correct answer
21 Correct 5 ms 512 KB n = 5, 25 is a correct answer
22 Correct 5 ms 512 KB n = 2, 122 is a correct answer
23 Correct 5 ms 640 KB n = 10, 117 is a correct answer
24 Correct 5 ms 640 KB n = 10, 336 is a correct answer
25 Correct 5 ms 640 KB n = 10, 438 is a correct answer
26 Correct 5 ms 640 KB n = 10, 206 is a correct answer
27 Correct 5 ms 640 KB n = 10, 636 is a correct answer
28 Correct 6 ms 512 KB n = 4, 2399 is a correct answer
29 Correct 5 ms 640 KB n = 10, 10992 is a correct answer
30 Correct 5 ms 640 KB n = 10, 3112 is a correct answer
31 Correct 109 ms 1528 KB n = 100, 51000000001 is a correct answer
32 Correct 15 ms 1024 KB n = 50, 197881272 is a correct answer
33 Correct 119 ms 1528 KB n = 100, 20969 is a correct answer
34 Correct 120 ms 1528 KB n = 100, 20969 is a correct answer
35 Correct 104 ms 1528 KB n = 100, 52000000000 is a correct answer
36 Correct 111 ms 1532 KB n = 100, 285 is a correct answer
37 Correct 117 ms 1532 KB n = 100, 21272 is a correct answer
38 Correct 109 ms 1528 KB n = 100, 12161 is a correct answer
39 Correct 5 ms 512 KB n = 2, 62 is a correct answer
40 Correct 5 ms 512 KB n = 2, 3 is a correct answer
41 Correct 5 ms 512 KB n = 3, 29 is a correct answer
42 Correct 5 ms 512 KB n = 2, 3 is a correct answer
43 Correct 5 ms 512 KB n = 2, 3 is a correct answer
44 Correct 5 ms 512 KB n = 2, 2000000001 is a correct answer
45 Correct 5 ms 512 KB n = 2, 3000000000 is a correct answer
46 Correct 5 ms 640 KB n = 3, 3000000000 is a correct answer
47 Correct 5 ms 512 KB n = 3, 3000000000 is a correct answer
48 Correct 4 ms 512 KB n = 4, 3000000001 is a correct answer
49 Correct 5 ms 512 KB n = 4, 4000000000 is a correct answer
50 Correct 5 ms 512 KB n = 5, 4000000000 is a correct answer
51 Correct 5 ms 640 KB n = 10, 1000000343 is a correct answer
52 Correct 5 ms 640 KB n = 10, 3189 is a correct answer
53 Correct 5 ms 640 KB n = 10, 7000000000 is a correct answer
54 Correct 5 ms 640 KB n = 5, 12 is a correct answer
55 Correct 5 ms 512 KB n = 5, 25 is a correct answer
56 Correct 5 ms 512 KB n = 2, 122 is a correct answer
57 Correct 5 ms 640 KB n = 10, 117 is a correct answer
58 Correct 5 ms 640 KB n = 10, 336 is a correct answer
59 Correct 5 ms 640 KB n = 10, 438 is a correct answer
60 Correct 5 ms 640 KB n = 10, 206 is a correct answer
61 Correct 5 ms 640 KB n = 10, 636 is a correct answer
62 Correct 5 ms 512 KB n = 4, 2399 is a correct answer
63 Correct 5 ms 640 KB n = 10, 10992 is a correct answer
64 Correct 5 ms 640 KB n = 10, 3112 is a correct answer
65 Correct 105 ms 1528 KB n = 100, 51000000001 is a correct answer
66 Correct 15 ms 1024 KB n = 50, 197881272 is a correct answer
67 Correct 117 ms 1528 KB n = 100, 20969 is a correct answer
68 Correct 127 ms 1528 KB n = 100, 20969 is a correct answer
69 Correct 111 ms 1656 KB n = 100, 52000000000 is a correct answer
70 Correct 111 ms 1528 KB n = 100, 285 is a correct answer
71 Correct 121 ms 1560 KB n = 100, 21272 is a correct answer
72 Correct 107 ms 1528 KB n = 100, 12161 is a correct answer
73 Execution timed out 2084 ms 384 KB Time limit exceeded
74 Halted 0 ms 0 KB -

Subtask #7
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 640 KB n = 4, 80 is a correct answer
2 Correct 5 ms 640 KB n = 9, 110 is a correct answer
3 Correct 5 ms 512 KB n = 4, 21 is a correct answer
4 Correct 5 ms 512 KB n = 3, 4 is a correct answer
5 Correct 5 ms 512 KB n = 2, 62 is a correct answer
6 Correct 5 ms 512 KB n = 2, 3 is a correct answer
7 Correct 5 ms 512 KB n = 3, 29 is a correct answer
8 Correct 5 ms 512 KB n = 2, 3 is a correct answer
9 Correct 5 ms 512 KB n = 2, 3 is a correct answer
10 Correct 5 ms 512 KB n = 2, 2000000001 is a correct answer
11 Correct 5 ms 512 KB n = 2, 3000000000 is a correct answer
12 Correct 5 ms 512 KB n = 3, 3000000000 is a correct answer
13 Correct 5 ms 512 KB n = 3, 3000000000 is a correct answer
14 Correct 5 ms 512 KB n = 4, 3000000001 is a correct answer
15 Correct 5 ms 512 KB n = 4, 4000000000 is a correct answer
16 Correct 5 ms 512 KB n = 5, 4000000000 is a correct answer
17 Correct 5 ms 640 KB n = 10, 1000000343 is a correct answer
18 Correct 5 ms 640 KB n = 10, 3189 is a correct answer
19 Correct 5 ms 640 KB n = 10, 7000000000 is a correct answer
20 Correct 5 ms 512 KB n = 5, 12 is a correct answer
21 Correct 5 ms 512 KB n = 5, 25 is a correct answer
22 Correct 5 ms 512 KB n = 2, 122 is a correct answer
23 Correct 5 ms 640 KB n = 10, 117 is a correct answer
24 Correct 5 ms 640 KB n = 10, 336 is a correct answer
25 Correct 5 ms 640 KB n = 10, 438 is a correct answer
26 Correct 5 ms 640 KB n = 10, 206 is a correct answer
27 Correct 5 ms 640 KB n = 10, 636 is a correct answer
28 Correct 6 ms 512 KB n = 4, 2399 is a correct answer
29 Correct 5 ms 640 KB n = 10, 10992 is a correct answer
30 Correct 5 ms 640 KB n = 10, 3112 is a correct answer
31 Correct 109 ms 1528 KB n = 100, 51000000001 is a correct answer
32 Correct 15 ms 1024 KB n = 50, 197881272 is a correct answer
33 Correct 119 ms 1528 KB n = 100, 20969 is a correct answer
34 Correct 120 ms 1528 KB n = 100, 20969 is a correct answer
35 Correct 104 ms 1528 KB n = 100, 52000000000 is a correct answer
36 Correct 111 ms 1532 KB n = 100, 285 is a correct answer
37 Correct 117 ms 1532 KB n = 100, 21272 is a correct answer
38 Correct 109 ms 1528 KB n = 100, 12161 is a correct answer
39 Correct 5 ms 512 KB n = 2, 62 is a correct answer
40 Correct 5 ms 512 KB n = 2, 3 is a correct answer
41 Correct 5 ms 512 KB n = 3, 29 is a correct answer
42 Correct 5 ms 512 KB n = 2, 3 is a correct answer
43 Correct 5 ms 512 KB n = 2, 3 is a correct answer
44 Correct 5 ms 512 KB n = 2, 2000000001 is a correct answer
45 Correct 5 ms 512 KB n = 2, 3000000000 is a correct answer
46 Correct 5 ms 640 KB n = 3, 3000000000 is a correct answer
47 Correct 5 ms 512 KB n = 3, 3000000000 is a correct answer
48 Correct 4 ms 512 KB n = 4, 3000000001 is a correct answer
49 Correct 5 ms 512 KB n = 4, 4000000000 is a correct answer
50 Correct 5 ms 512 KB n = 5, 4000000000 is a correct answer
51 Correct 5 ms 640 KB n = 10, 1000000343 is a correct answer
52 Correct 5 ms 640 KB n = 10, 3189 is a correct answer
53 Correct 5 ms 640 KB n = 10, 7000000000 is a correct answer
54 Correct 5 ms 640 KB n = 5, 12 is a correct answer
55 Correct 5 ms 512 KB n = 5, 25 is a correct answer
56 Correct 5 ms 512 KB n = 2, 122 is a correct answer
57 Correct 5 ms 640 KB n = 10, 117 is a correct answer
58 Correct 5 ms 640 KB n = 10, 336 is a correct answer
59 Correct 5 ms 640 KB n = 10, 438 is a correct answer
60 Correct 5 ms 640 KB n = 10, 206 is a correct answer
61 Correct 5 ms 640 KB n = 10, 636 is a correct answer
62 Correct 5 ms 512 KB n = 4, 2399 is a correct answer
63 Correct 5 ms 640 KB n = 10, 10992 is a correct answer
64 Correct 5 ms 640 KB n = 10, 3112 is a correct answer
65 Correct 105 ms 1528 KB n = 100, 51000000001 is a correct answer
66 Correct 15 ms 1024 KB n = 50, 197881272 is a correct answer
67 Correct 117 ms 1528 KB n = 100, 20969 is a correct answer
68 Correct 127 ms 1528 KB n = 100, 20969 is a correct answer
69 Correct 111 ms 1656 KB n = 100, 52000000000 is a correct answer
70 Correct 111 ms 1528 KB n = 100, 285 is a correct answer
71 Correct 121 ms 1560 KB n = 100, 21272 is a correct answer
72 Correct 107 ms 1528 KB n = 100, 12161 is a correct answer
73 Execution timed out 2084 ms 384 KB Time limit exceeded
74 Halted 0 ms 0 KB -

Subtask #8
0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 640 KB n = 4, 80 is a correct answer
2 Correct 5 ms 640 KB n = 9, 110 is a correct answer
3 Correct 5 ms 512 KB n = 4, 21 is a correct answer
4 Correct 5 ms 512 KB n = 3, 4 is a correct answer
5 Correct 5 ms 512 KB n = 2, 62 is a correct answer
6 Correct 5 ms 512 KB n = 2, 3 is a correct answer
7 Correct 5 ms 512 KB n = 3, 29 is a correct answer
8 Correct 5 ms 512 KB n = 2, 3 is a correct answer
9 Correct 5 ms 512 KB n = 2, 3 is a correct answer
10 Correct 5 ms 512 KB n = 2, 2000000001 is a correct answer
11 Correct 5 ms 512 KB n = 2, 3000000000 is a correct answer
12 Correct 5 ms 512 KB n = 3, 3000000000 is a correct answer
13 Correct 5 ms 512 KB n = 3, 3000000000 is a correct answer
14 Correct 5 ms 512 KB n = 4, 3000000001 is a correct answer
15 Correct 5 ms 512 KB n = 4, 4000000000 is a correct answer
16 Correct 5 ms 512 KB n = 5, 4000000000 is a correct answer
17 Correct 5 ms 640 KB n = 10, 1000000343 is a correct answer
18 Correct 5 ms 640 KB n = 10, 3189 is a correct answer
19 Correct 5 ms 640 KB n = 10, 7000000000 is a correct answer
20 Correct 5 ms 512 KB n = 5, 12 is a correct answer
21 Correct 5 ms 512 KB n = 5, 25 is a correct answer
22 Correct 5 ms 512 KB n = 2, 122 is a correct answer
23 Correct 5 ms 640 KB n = 10, 117 is a correct answer
24 Correct 5 ms 640 KB n = 10, 336 is a correct answer
25 Correct 5 ms 640 KB n = 10, 438 is a correct answer
26 Correct 5 ms 640 KB n = 10, 206 is a correct answer
27 Correct 5 ms 640 KB n = 10, 636 is a correct answer
28 Correct 6 ms 512 KB n = 4, 2399 is a correct answer
29 Correct 5 ms 640 KB n = 10, 10992 is a correct answer
30 Correct 5 ms 640 KB n = 10, 3112 is a correct answer
31 Correct 109 ms 1528 KB n = 100, 51000000001 is a correct answer
32 Correct 15 ms 1024 KB n = 50, 197881272 is a correct answer
33 Correct 119 ms 1528 KB n = 100, 20969 is a correct answer
34 Correct 120 ms 1528 KB n = 100, 20969 is a correct answer
35 Correct 104 ms 1528 KB n = 100, 52000000000 is a correct answer
36 Correct 111 ms 1532 KB n = 100, 285 is a correct answer
37 Correct 117 ms 1532 KB n = 100, 21272 is a correct answer
38 Correct 109 ms 1528 KB n = 100, 12161 is a correct answer
39 Correct 5 ms 512 KB n = 2, 62 is a correct answer
40 Correct 5 ms 512 KB n = 2, 3 is a correct answer
41 Correct 5 ms 512 KB n = 3, 29 is a correct answer
42 Correct 5 ms 512 KB n = 2, 3 is a correct answer
43 Correct 5 ms 512 KB n = 2, 3 is a correct answer
44 Correct 5 ms 512 KB n = 2, 2000000001 is a correct answer
45 Correct 5 ms 512 KB n = 2, 3000000000 is a correct answer
46 Correct 5 ms 640 KB n = 3, 3000000000 is a correct answer
47 Correct 5 ms 512 KB n = 3, 3000000000 is a correct answer
48 Correct 4 ms 512 KB n = 4, 3000000001 is a correct answer
49 Correct 5 ms 512 KB n = 4, 4000000000 is a correct answer
50 Correct 5 ms 512 KB n = 5, 4000000000 is a correct answer
51 Correct 5 ms 640 KB n = 10, 1000000343 is a correct answer
52 Correct 5 ms 640 KB n = 10, 3189 is a correct answer
53 Correct 5 ms 640 KB n = 10, 7000000000 is a correct answer
54 Correct 5 ms 640 KB n = 5, 12 is a correct answer
55 Correct 5 ms 512 KB n = 5, 25 is a correct answer
56 Correct 5 ms 512 KB n = 2, 122 is a correct answer
57 Correct 5 ms 640 KB n = 10, 117 is a correct answer
58 Correct 5 ms 640 KB n = 10, 336 is a correct answer
59 Correct 5 ms 640 KB n = 10, 438 is a correct answer
60 Correct 5 ms 640 KB n = 10, 206 is a correct answer
61 Correct 5 ms 640 KB n = 10, 636 is a correct answer
62 Correct 5 ms 512 KB n = 4, 2399 is a correct answer
63 Correct 5 ms 640 KB n = 10, 10992 is a correct answer
64 Correct 5 ms 640 KB n = 10, 3112 is a correct answer
65 Correct 105 ms 1528 KB n = 100, 51000000001 is a correct answer
66 Correct 15 ms 1024 KB n = 50, 197881272 is a correct answer
67 Correct 117 ms 1528 KB n = 100, 20969 is a correct answer
68 Correct 127 ms 1528 KB n = 100, 20969 is a correct answer
69 Correct 111 ms 1656 KB n = 100, 52000000000 is a correct answer
70 Correct 111 ms 1528 KB n = 100, 285 is a correct answer
71 Correct 121 ms 1560 KB n = 100, 21272 is a correct answer
72 Correct 107 ms 1528 KB n = 100, 12161 is a correct answer
73 Execution timed out 2084 ms 384 KB Time limit exceeded
74 Halted 0 ms 0 KB -