oj.uz

Submission #921346

# Submission time Handle Problem Language Result Execution time Memory
921346 2024-02-03T18:00:15 Z danikoynov Shortcut (IOI16_shortcut) C++14
0 / 100
 37 ms 604 KB 
#include "shortcut.h"
#include <bits/stdc++.h>

using namespace std;
typedef long long ll;

const int maxn = 3010;
const ll inf = 1e18;
int n;
ll cp[maxn], cs[maxn], pref[maxn], bef[maxn], aft[maxn];
ll l[maxn], d[maxn], c;

ll dist[maxn];
struct edge
{
    int to;
    ll w;

    edge(int _to = 0, ll _w = 0)
    {
        to = _to;
        w = _w;
    }

    bool operator < (const edge &e) const
    {
        return w > e.w;
    }
};

int used[maxn];

ll get_dist(int l, int r)
{
    if (l > r)
        swap(l, r);
    return pref[r - 1] - pref[l - 1];
}

const int maxlog = 21;

struct sparse_table
{
    ll dp[maxlog][maxn];
    int lg[maxn];

    void build(vector < ll > values)
    {
        int len = values.size();
        for (int i = 1; i <= len; i ++)
        {
            lg[i] = lg[i / 2]  + 1;
            dp[0][i] = values[i - 1];
        }

        for (int j = 1; j < lg[len]; j ++)
        {
            for (int i = 1; i <= len - (1 << j) + 1; i ++)
            {
                dp[j][i] = dp[j - 1][i + (1 << (j - 1))];
                if (dp[j - 1][i] > dp[j][i])
                    dp[j][i] = dp[j - 1][i];
            }
        }
    }

    ll query(int l, int r)
    {
        if (l > r)
            return 0;
        int mlog = lg[r - l + 1] - 1;
        ll ans = dp[mlog][r - (1 << mlog) + 1];
        if (dp[mlog][l] > ans)
            ans = dp[mlog][l];
        return ans;
    }
};


struct point
{
    ll x, y;

    point(ll _x = 0, ll _y = 0)
    {
        x = _x;
        y = _y;
    }
};
struct rectangle
{
    point centre;
    ll diagonal;

    rectangle(point _centre = point(), ll _diagonal = 0)
    {
        centre = _centre;
        diagonal = _diagonal;
    }
};

ll p[maxn];


struct event
{
    int type;
};
bool check(ll x)
{


    vector < rectangle > con;
    for (int i = 1; i <= n; i ++)
    {
        for (int j = i + 1; j <= n; j ++)
        {
            ll path = get_dist(i, j) + d[i] + d[j];
            if (path <= x)
                continue;
            //cout << "condition " << i << " " << j << endl;
            //cout << p[i] << " " << p[j] << " " << x - d[i] - d[j] << endl;
            /// |x[i] - x[l]| + |x[j] - x[r]| + d[i] + d[j] + c<= k
            /// |x[l] - x[i]| + |x[r] - x[j]| <= k - d[i] - d[j] - c
            con.push_back(rectangle(point(p[i], p[j]), x - d[i] - d[j] - c));
        }
    }

    if (con.empty())
        return true;

    ///pair < ll, ll > ans;

    pair < ll, ll > ans = {-1, -1};
    for (int l = 1; l <= n; l ++)
        for (int r = l; r <= n; r ++)
        {
            bool tf = true;
            for (rectangle rec : con)
            {
                ll val = abs(p[l] - rec.centre.x) + abs(p[r] - rec.centre.y);
                if (val > rec.diagonal)
                {
                    //cout << "fuck " << l << " " << r << endl;
                    //cout << "rectangle " << rec.centre.x << " " << rec.centre.y << " " << rec.diagonal << endl;
                    tf = false;
                    break;
                }
            }
            if (tf)
            {
                ans = {p[l], p[r]};

            }
        }
    if (ans.first == -1)
        return false;
    for (int i = 0; i < con.size(); i ++)
    {
        ll top = inf;
        ll bot = -inf;
        for (int j = 0; j <= i; j ++)
        {
            top = min(top, con[j].centre.y + con[j].diagonal - (con[i].centre.x - con[j].centre.x));
            bot = max(bot, con[j].centre.y - con[j].diagonal + (con[i].centre.x - con[j].centre.x));
        }

        for (int j = i + 1; j < con.size(); j ++)
        {
            top = min(top, con[j].centre.y + con[j].diagonal - (con[j].centre.x - con[i].centre.x));
            bot = max(bot, con[j].centre.y - con[j].diagonal + (con[j].centre.x - con[i].centre.x));
        }
        if (con[i].centre.x == ans.first)
        {

        }
        for (int f = 1; f <= n; f ++)
        {
            if (p[f] >= bot && p[f] <= top)
            {
                return true;
            }
        }
    }




    return false;


}


ll find_shortcut(int N, vector<int> L, vector<int> D, int C)
{
    n = N;
    c = C;
    for (int i = 0; i < n - 1; i ++)
        l[i + 1] = L[i];
    for (int i = 0; i < n; i ++)
        d[i + 1] = D[i];

    p[1] = 0;
    for (int i = 2; i <= n; i ++)
    {
        p[i] = p[i - 1] + l[i - 1];
    }

    for (int i = 1; i <= n; i ++)
    {
        pref[i] = pref[i - 1] + l[i];
    }

    for (int i = 1; i <= n; i ++)
    {
        cp[i] = cp[i - 1] + l[i - 1];
        cp[i] = max(cp[i], d[i]);
        bef[i] = bef[i - 1];
        for (int j = 1; j < i; j ++)
        {
            bef[i] = max(bef[i], get_dist(i, j) + d[i] + d[j]);
        }
    }

    for (int i = n; i > 0; i --)
    {
        cs[i] = cs[i + 1] + l[i];
        cs[i] = max(cs[i], d[i]);
        aft[i] = aft[i + 1];
        for (int j = i + 1; j <= n; j ++)
        {
            aft[i] = max(aft[i], get_dist(i, j) + d[i] + d[j]);
        }
    }




    ll lf = 0, rf = inf;
    while(lf <= rf)
    {
        ll mf = (lf + rf) / 2;
        if (check(mf))
            rf = mf - 1;
        else
            lf = mf + 1;
    }


    return lf;
}

Compilation message

shortcut.cpp: In function 'bool check(ll)':
shortcut.cpp:158:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<rectangle>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  158 |     for (int i = 0; i < con.size(); i ++)
      |                     ~~^~~~~~~~~~~~
shortcut.cpp:168:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<rectangle>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  168 |         for (int j = i + 1; j < con.size(); j ++)
      |                             ~~^~~~~~~~~~~~

Subtask #1
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB n = 4, 80 is a correct answer
2 Correct 1 ms 344 KB n = 9, 110 is a correct answer
3 Correct 0 ms 344 KB n = 4, 21 is a correct answer
4 Correct 0 ms 348 KB n = 3, 4 is a correct answer
5 Correct 0 ms 348 KB n = 2, 62 is a correct answer
6 Correct 0 ms 348 KB n = 2, 3 is a correct answer
7 Correct 0 ms 348 KB n = 3, 29 is a correct answer
8 Correct 1 ms 348 KB n = 2, 3 is a correct answer
9 Correct 1 ms 344 KB n = 2, 3 is a correct answer
10 Correct 1 ms 348 KB n = 2, 2000000001 is a correct answer
11 Correct 0 ms 348 KB n = 2, 3000000000 is a correct answer
12 Correct 0 ms 348 KB n = 3, 3000000000 is a correct answer
13 Correct 1 ms 348 KB n = 3, 3000000000 is a correct answer
14 Correct 0 ms 348 KB n = 4, 3000000001 is a correct answer
15 Correct 0 ms 348 KB n = 4, 4000000000 is a correct answer
16 Correct 1 ms 344 KB n = 5, 4000000000 is a correct answer
17 Correct 0 ms 348 KB n = 10, 1000000343 is a correct answer
18 Correct 1 ms 344 KB n = 10, 3189 is a correct answer
19 Correct 0 ms 348 KB n = 10, 7000000000 is a correct answer
20 Correct 0 ms 348 KB n = 5, 12 is a correct answer
21 Correct 0 ms 348 KB n = 5, 25 is a correct answer
22 Correct 0 ms 348 KB n = 2, 122 is a correct answer
23 Correct 0 ms 344 KB n = 10, 117 is a correct answer
24 Correct 0 ms 348 KB n = 10, 336 is a correct answer
25 Correct 0 ms 348 KB n = 10, 438 is a correct answer
26 Correct 0 ms 348 KB n = 10, 206 is a correct answer
27 Correct 0 ms 348 KB n = 10, 636 is a correct answer
28 Correct 0 ms 348 KB n = 4, 2399 is a correct answer
29 Correct 1 ms 348 KB n = 10, 10992 is a correct answer
30 Correct 0 ms 348 KB n = 10, 3112 is a correct answer
31 Correct 37 ms 604 KB n = 100, 51000000001 is a correct answer
32 Correct 1 ms 344 KB n = 50, 197881272 is a correct answer
33 Incorrect 2 ms 348 KB n = 100, incorrect answer: jury 20969 vs contestant 20974
34 Halted 0 ms 0 KB -

Subtask #2
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB n = 4, 80 is a correct answer
2 Correct 1 ms 344 KB n = 9, 110 is a correct answer
3 Correct 0 ms 344 KB n = 4, 21 is a correct answer
4 Correct 0 ms 348 KB n = 3, 4 is a correct answer
5 Correct 0 ms 348 KB n = 2, 62 is a correct answer
6 Correct 0 ms 348 KB n = 2, 3 is a correct answer
7 Correct 0 ms 348 KB n = 3, 29 is a correct answer
8 Correct 1 ms 348 KB n = 2, 3 is a correct answer
9 Correct 1 ms 344 KB n = 2, 3 is a correct answer
10 Correct 1 ms 348 KB n = 2, 2000000001 is a correct answer
11 Correct 0 ms 348 KB n = 2, 3000000000 is a correct answer
12 Correct 0 ms 348 KB n = 3, 3000000000 is a correct answer
13 Correct 1 ms 348 KB n = 3, 3000000000 is a correct answer
14 Correct 0 ms 348 KB n = 4, 3000000001 is a correct answer
15 Correct 0 ms 348 KB n = 4, 4000000000 is a correct answer
16 Correct 1 ms 344 KB n = 5, 4000000000 is a correct answer
17 Correct 0 ms 348 KB n = 10, 1000000343 is a correct answer
18 Correct 1 ms 344 KB n = 10, 3189 is a correct answer
19 Correct 0 ms 348 KB n = 10, 7000000000 is a correct answer
20 Correct 0 ms 348 KB n = 5, 12 is a correct answer
21 Correct 0 ms 348 KB n = 5, 25 is a correct answer
22 Correct 0 ms 348 KB n = 2, 122 is a correct answer
23 Correct 0 ms 344 KB n = 10, 117 is a correct answer
24 Correct 0 ms 348 KB n = 10, 336 is a correct answer
25 Correct 0 ms 348 KB n = 10, 438 is a correct answer
26 Correct 0 ms 348 KB n = 10, 206 is a correct answer
27 Correct 0 ms 348 KB n = 10, 636 is a correct answer
28 Correct 0 ms 348 KB n = 4, 2399 is a correct answer
29 Correct 1 ms 348 KB n = 10, 10992 is a correct answer
30 Correct 0 ms 348 KB n = 10, 3112 is a correct answer
31 Correct 37 ms 604 KB n = 100, 51000000001 is a correct answer
32 Correct 1 ms 344 KB n = 50, 197881272 is a correct answer
33 Incorrect 2 ms 348 KB n = 100, incorrect answer: jury 20969 vs contestant 20974
34 Halted 0 ms 0 KB -

Subtask #3
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB n = 4, 80 is a correct answer
2 Correct 1 ms 344 KB n = 9, 110 is a correct answer
3 Correct 0 ms 344 KB n = 4, 21 is a correct answer
4 Correct 0 ms 348 KB n = 3, 4 is a correct answer
5 Correct 0 ms 348 KB n = 2, 62 is a correct answer
6 Correct 0 ms 348 KB n = 2, 3 is a correct answer
7 Correct 0 ms 348 KB n = 3, 29 is a correct answer
8 Correct 1 ms 348 KB n = 2, 3 is a correct answer
9 Correct 1 ms 344 KB n = 2, 3 is a correct answer
10 Correct 1 ms 348 KB n = 2, 2000000001 is a correct answer
11 Correct 0 ms 348 KB n = 2, 3000000000 is a correct answer
12 Correct 0 ms 348 KB n = 3, 3000000000 is a correct answer
13 Correct 1 ms 348 KB n = 3, 3000000000 is a correct answer
14 Correct 0 ms 348 KB n = 4, 3000000001 is a correct answer
15 Correct 0 ms 348 KB n = 4, 4000000000 is a correct answer
16 Correct 1 ms 344 KB n = 5, 4000000000 is a correct answer
17 Correct 0 ms 348 KB n = 10, 1000000343 is a correct answer
18 Correct 1 ms 344 KB n = 10, 3189 is a correct answer
19 Correct 0 ms 348 KB n = 10, 7000000000 is a correct answer
20 Correct 0 ms 348 KB n = 5, 12 is a correct answer
21 Correct 0 ms 348 KB n = 5, 25 is a correct answer
22 Correct 0 ms 348 KB n = 2, 122 is a correct answer
23 Correct 0 ms 344 KB n = 10, 117 is a correct answer
24 Correct 0 ms 348 KB n = 10, 336 is a correct answer
25 Correct 0 ms 348 KB n = 10, 438 is a correct answer
26 Correct 0 ms 348 KB n = 10, 206 is a correct answer
27 Correct 0 ms 348 KB n = 10, 636 is a correct answer
28 Correct 0 ms 348 KB n = 4, 2399 is a correct answer
29 Correct 1 ms 348 KB n = 10, 10992 is a correct answer
30 Correct 0 ms 348 KB n = 10, 3112 is a correct answer
31 Correct 37 ms 604 KB n = 100, 51000000001 is a correct answer
32 Correct 1 ms 344 KB n = 50, 197881272 is a correct answer
33 Incorrect 2 ms 348 KB n = 100, incorrect answer: jury 20969 vs contestant 20974
34 Halted 0 ms 0 KB -

Subtask #4
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB n = 4, 80 is a correct answer
2 Correct 1 ms 344 KB n = 9, 110 is a correct answer
3 Correct 0 ms 344 KB n = 4, 21 is a correct answer
4 Correct 0 ms 348 KB n = 3, 4 is a correct answer
5 Correct 0 ms 348 KB n = 2, 62 is a correct answer
6 Correct 0 ms 348 KB n = 2, 3 is a correct answer
7 Correct 0 ms 348 KB n = 3, 29 is a correct answer
8 Correct 1 ms 348 KB n = 2, 3 is a correct answer
9 Correct 1 ms 344 KB n = 2, 3 is a correct answer
10 Correct 1 ms 348 KB n = 2, 2000000001 is a correct answer
11 Correct 0 ms 348 KB n = 2, 3000000000 is a correct answer
12 Correct 0 ms 348 KB n = 3, 3000000000 is a correct answer
13 Correct 1 ms 348 KB n = 3, 3000000000 is a correct answer
14 Correct 0 ms 348 KB n = 4, 3000000001 is a correct answer
15 Correct 0 ms 348 KB n = 4, 4000000000 is a correct answer
16 Correct 1 ms 344 KB n = 5, 4000000000 is a correct answer
17 Correct 0 ms 348 KB n = 10, 1000000343 is a correct answer
18 Correct 1 ms 344 KB n = 10, 3189 is a correct answer
19 Correct 0 ms 348 KB n = 10, 7000000000 is a correct answer
20 Correct 0 ms 348 KB n = 5, 12 is a correct answer
21 Correct 0 ms 348 KB n = 5, 25 is a correct answer
22 Correct 0 ms 348 KB n = 2, 122 is a correct answer
23 Correct 0 ms 344 KB n = 10, 117 is a correct answer
24 Correct 0 ms 348 KB n = 10, 336 is a correct answer
25 Correct 0 ms 348 KB n = 10, 438 is a correct answer
26 Correct 0 ms 348 KB n = 10, 206 is a correct answer
27 Correct 0 ms 348 KB n = 10, 636 is a correct answer
28 Correct 0 ms 348 KB n = 4, 2399 is a correct answer
29 Correct 1 ms 348 KB n = 10, 10992 is a correct answer
30 Correct 0 ms 348 KB n = 10, 3112 is a correct answer
31 Correct 37 ms 604 KB n = 100, 51000000001 is a correct answer
32 Correct 1 ms 344 KB n = 50, 197881272 is a correct answer
33 Incorrect 2 ms 348 KB n = 100, incorrect answer: jury 20969 vs contestant 20974
34 Halted 0 ms 0 KB -

Subtask #5
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB n = 4, 80 is a correct answer
2 Correct 1 ms 344 KB n = 9, 110 is a correct answer
3 Correct 0 ms 344 KB n = 4, 21 is a correct answer
4 Correct 0 ms 348 KB n = 3, 4 is a correct answer
5 Correct 0 ms 348 KB n = 2, 62 is a correct answer
6 Correct 0 ms 348 KB n = 2, 3 is a correct answer
7 Correct 0 ms 348 KB n = 3, 29 is a correct answer
8 Correct 1 ms 348 KB n = 2, 3 is a correct answer
9 Correct 1 ms 344 KB n = 2, 3 is a correct answer
10 Correct 1 ms 348 KB n = 2, 2000000001 is a correct answer
11 Correct 0 ms 348 KB n = 2, 3000000000 is a correct answer
12 Correct 0 ms 348 KB n = 3, 3000000000 is a correct answer
13 Correct 1 ms 348 KB n = 3, 3000000000 is a correct answer
14 Correct 0 ms 348 KB n = 4, 3000000001 is a correct answer
15 Correct 0 ms 348 KB n = 4, 4000000000 is a correct answer
16 Correct 1 ms 344 KB n = 5, 4000000000 is a correct answer
17 Correct 0 ms 348 KB n = 10, 1000000343 is a correct answer
18 Correct 1 ms 344 KB n = 10, 3189 is a correct answer
19 Correct 0 ms 348 KB n = 10, 7000000000 is a correct answer
20 Correct 0 ms 348 KB n = 5, 12 is a correct answer
21 Correct 0 ms 348 KB n = 5, 25 is a correct answer
22 Correct 0 ms 348 KB n = 2, 122 is a correct answer
23 Correct 0 ms 344 KB n = 10, 117 is a correct answer
24 Correct 0 ms 348 KB n = 10, 336 is a correct answer
25 Correct 0 ms 348 KB n = 10, 438 is a correct answer
26 Correct 0 ms 348 KB n = 10, 206 is a correct answer
27 Correct 0 ms 348 KB n = 10, 636 is a correct answer
28 Correct 0 ms 348 KB n = 4, 2399 is a correct answer
29 Correct 1 ms 348 KB n = 10, 10992 is a correct answer
30 Correct 0 ms 348 KB n = 10, 3112 is a correct answer
31 Correct 37 ms 604 KB n = 100, 51000000001 is a correct answer
32 Correct 1 ms 344 KB n = 50, 197881272 is a correct answer
33 Incorrect 2 ms 348 KB n = 100, incorrect answer: jury 20969 vs contestant 20974
34 Halted 0 ms 0 KB -

Subtask #6
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB n = 4, 80 is a correct answer
2 Correct 1 ms 344 KB n = 9, 110 is a correct answer
3 Correct 0 ms 344 KB n = 4, 21 is a correct answer
4 Correct 0 ms 348 KB n = 3, 4 is a correct answer
5 Correct 0 ms 348 KB n = 2, 62 is a correct answer
6 Correct 0 ms 348 KB n = 2, 3 is a correct answer
7 Correct 0 ms 348 KB n = 3, 29 is a correct answer
8 Correct 1 ms 348 KB n = 2, 3 is a correct answer
9 Correct 1 ms 344 KB n = 2, 3 is a correct answer
10 Correct 1 ms 348 KB n = 2, 2000000001 is a correct answer
11 Correct 0 ms 348 KB n = 2, 3000000000 is a correct answer
12 Correct 0 ms 348 KB n = 3, 3000000000 is a correct answer
13 Correct 1 ms 348 KB n = 3, 3000000000 is a correct answer
14 Correct 0 ms 348 KB n = 4, 3000000001 is a correct answer
15 Correct 0 ms 348 KB n = 4, 4000000000 is a correct answer
16 Correct 1 ms 344 KB n = 5, 4000000000 is a correct answer
17 Correct 0 ms 348 KB n = 10, 1000000343 is a correct answer
18 Correct 1 ms 344 KB n = 10, 3189 is a correct answer
19 Correct 0 ms 348 KB n = 10, 7000000000 is a correct answer
20 Correct 0 ms 348 KB n = 5, 12 is a correct answer
21 Correct 0 ms 348 KB n = 5, 25 is a correct answer
22 Correct 0 ms 348 KB n = 2, 122 is a correct answer
23 Correct 0 ms 344 KB n = 10, 117 is a correct answer
24 Correct 0 ms 348 KB n = 10, 336 is a correct answer
25 Correct 0 ms 348 KB n = 10, 438 is a correct answer
26 Correct 0 ms 348 KB n = 10, 206 is a correct answer
27 Correct 0 ms 348 KB n = 10, 636 is a correct answer
28 Correct 0 ms 348 KB n = 4, 2399 is a correct answer
29 Correct 1 ms 348 KB n = 10, 10992 is a correct answer
30 Correct 0 ms 348 KB n = 10, 3112 is a correct answer
31 Correct 37 ms 604 KB n = 100, 51000000001 is a correct answer
32 Correct 1 ms 344 KB n = 50, 197881272 is a correct answer
33 Incorrect 2 ms 348 KB n = 100, incorrect answer: jury 20969 vs contestant 20974
34 Halted 0 ms 0 KB -

Subtask #7
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB n = 4, 80 is a correct answer
2 Correct 1 ms 344 KB n = 9, 110 is a correct answer
3 Correct 0 ms 344 KB n = 4, 21 is a correct answer
4 Correct 0 ms 348 KB n = 3, 4 is a correct answer
5 Correct 0 ms 348 KB n = 2, 62 is a correct answer
6 Correct 0 ms 348 KB n = 2, 3 is a correct answer
7 Correct 0 ms 348 KB n = 3, 29 is a correct answer
8 Correct 1 ms 348 KB n = 2, 3 is a correct answer
9 Correct 1 ms 344 KB n = 2, 3 is a correct answer
10 Correct 1 ms 348 KB n = 2, 2000000001 is a correct answer
11 Correct 0 ms 348 KB n = 2, 3000000000 is a correct answer
12 Correct 0 ms 348 KB n = 3, 3000000000 is a correct answer
13 Correct 1 ms 348 KB n = 3, 3000000000 is a correct answer
14 Correct 0 ms 348 KB n = 4, 3000000001 is a correct answer
15 Correct 0 ms 348 KB n = 4, 4000000000 is a correct answer
16 Correct 1 ms 344 KB n = 5, 4000000000 is a correct answer
17 Correct 0 ms 348 KB n = 10, 1000000343 is a correct answer
18 Correct 1 ms 344 KB n = 10, 3189 is a correct answer
19 Correct 0 ms 348 KB n = 10, 7000000000 is a correct answer
20 Correct 0 ms 348 KB n = 5, 12 is a correct answer
21 Correct 0 ms 348 KB n = 5, 25 is a correct answer
22 Correct 0 ms 348 KB n = 2, 122 is a correct answer
23 Correct 0 ms 344 KB n = 10, 117 is a correct answer
24 Correct 0 ms 348 KB n = 10, 336 is a correct answer
25 Correct 0 ms 348 KB n = 10, 438 is a correct answer
26 Correct 0 ms 348 KB n = 10, 206 is a correct answer
27 Correct 0 ms 348 KB n = 10, 636 is a correct answer
28 Correct 0 ms 348 KB n = 4, 2399 is a correct answer
29 Correct 1 ms 348 KB n = 10, 10992 is a correct answer
30 Correct 0 ms 348 KB n = 10, 3112 is a correct answer
31 Correct 37 ms 604 KB n = 100, 51000000001 is a correct answer
32 Correct 1 ms 344 KB n = 50, 197881272 is a correct answer
33 Incorrect 2 ms 348 KB n = 100, incorrect answer: jury 20969 vs contestant 20974
34 Halted 0 ms 0 KB -

Subtask #8
0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB n = 4, 80 is a correct answer
2 Correct 1 ms 344 KB n = 9, 110 is a correct answer
3 Correct 0 ms 344 KB n = 4, 21 is a correct answer
4 Correct 0 ms 348 KB n = 3, 4 is a correct answer
5 Correct 0 ms 348 KB n = 2, 62 is a correct answer
6 Correct 0 ms 348 KB n = 2, 3 is a correct answer
7 Correct 0 ms 348 KB n = 3, 29 is a correct answer
8 Correct 1 ms 348 KB n = 2, 3 is a correct answer
9 Correct 1 ms 344 KB n = 2, 3 is a correct answer
10 Correct 1 ms 348 KB n = 2, 2000000001 is a correct answer
11 Correct 0 ms 348 KB n = 2, 3000000000 is a correct answer
12 Correct 0 ms 348 KB n = 3, 3000000000 is a correct answer
13 Correct 1 ms 348 KB n = 3, 3000000000 is a correct answer
14 Correct 0 ms 348 KB n = 4, 3000000001 is a correct answer
15 Correct 0 ms 348 KB n = 4, 4000000000 is a correct answer
16 Correct 1 ms 344 KB n = 5, 4000000000 is a correct answer
17 Correct 0 ms 348 KB n = 10, 1000000343 is a correct answer
18 Correct 1 ms 344 KB n = 10, 3189 is a correct answer
19 Correct 0 ms 348 KB n = 10, 7000000000 is a correct answer
20 Correct 0 ms 348 KB n = 5, 12 is a correct answer
21 Correct 0 ms 348 KB n = 5, 25 is a correct answer
22 Correct 0 ms 348 KB n = 2, 122 is a correct answer
23 Correct 0 ms 344 KB n = 10, 117 is a correct answer
24 Correct 0 ms 348 KB n = 10, 336 is a correct answer
25 Correct 0 ms 348 KB n = 10, 438 is a correct answer
26 Correct 0 ms 348 KB n = 10, 206 is a correct answer
27 Correct 0 ms 348 KB n = 10, 636 is a correct answer
28 Correct 0 ms 348 KB n = 4, 2399 is a correct answer
29 Correct 1 ms 348 KB n = 10, 10992 is a correct answer
30 Correct 0 ms 348 KB n = 10, 3112 is a correct answer
31 Correct 37 ms 604 KB n = 100, 51000000001 is a correct answer
32 Correct 1 ms 344 KB n = 50, 197881272 is a correct answer
33 Incorrect 2 ms 348 KB n = 100, incorrect answer: jury 20969 vs contestant 20974
34 Halted 0 ms 0 KB -