oj.uz

Submission #281986

# Submission time Handle Problem Language Result Execution time Memory
281986 2020-08-23T18:26:51 Z A02 Shortcut (IOI16_shortcut) C++14
23 / 100
 2000 ms 504 KB 
#include "shortcut.h"
#include <vector>
#include <iostream>
#include <set>
#include <algorithm>
#include <utility>
#include <queue>

using namespace std;

long long find_shortcut(int n, std::vector<int> l, std::vector<int> d, int c)
{
    long long BIG = (long long) 1 << 62;

    long long best = BIG;

    vector<vector<pair<int, long long> > > adjacent (n, vector<pair<int, long long> > ());

    for (int i = 0; i < n - 1; i++){

        adjacent[i].push_back(make_pair(i + 1, l[i]));
        adjacent[i + 1].push_back(make_pair(i, l[i]));

    }

    for (int s = 0; s < n; s++){
        for (int e = s + 1; e < n; e++){

            //Express line between s and e.

            //Longest path in [0, s].

            long long diameter = 0;
//
//            long long b1 = d[0];
//            long long b1_partial = d[0];
//
//            for (int i = 1; i <= s; i++){
//                b1_partial += l[i - 1];
//                b1 = max(b1_partial + d[i], b1);
//                b1_partial = max(b1_partial, d[i]);
//            }
//
//            diameter = max(diameter, b1);
//
//            long long bn = d[n - 1];
//            long long bn_partial = d[n - 1];
//
//            for (int i = n - 1; i >= e; i--){
//                bn_partial += l[i - 1];
//                bn = max(bn_partial + d[i], bn);
//                bn_partial = max(bn_partial, d[i]);
//            }
//
//            diameter = max(diameter, bn);
//
//            long long bs = 0;
//
            if (e != s + 1){
                adjacent[s].push_back(make_pair(e, c));
                adjacent[e].push_back(make_pair(s, c));
            } else {
                    adjacent[s].pop_back();
                    adjacent[e].pop_back();

                    if (s > 0){
                        adjacent[s].pop_back();
                        adjacent[s].push_back(make_pair(s - 1, l[s - 1]));
                    }
                    if (e < n - 1){
                        adjacent[e].pop_back();
                        adjacent[e].push_back(make_pair(e + 1, l[e]));
                    }

                    adjacent[s].push_back(make_pair(e, min(l[s], c)));
                    adjacent[e].push_back(make_pair(s, min(l[s], c)));
            }

            for (int a = 0; a < n; a++){

                priority_queue<pair<long long, int> > to_visit;

                vector<long long> visited (n, -1);

                to_visit.push(make_pair(-d[a], a));
                visited[a] = -1;
                diameter = max(diameter, (long long) d[a]);

                while (!to_visit.empty()){

                    pair<long long, int> current_p = to_visit.top();
                    int current = current_p.second;
                    to_visit.pop();

                    if (visited[current] == -1){

                        visited[current] = -current_p.first;
                        //cout << s<< ' ' << e << ' ' <<  a << ' ' << current << ' ' << visited[current] << ' ' << d[current]<< endl;
                        if (current != a){
                            diameter = max(diameter, visited[current] + d[current]);
                        }

                        for (int i = 0; i < adjacent[current].size(); i++){
                            int next = adjacent[current][i].first;
                            //cout << 'n' << next << endl;
                            if (visited[next] == -1){
                                pair<long long, int> n;
                                n.first = -visited[current] - adjacent[current][i].second;
                                n.second = next;
                                to_visit.push(n);
                                //cout << endl << n.first << ' ' << n.second << endl;
                            }
                        }
                    }
                }

            }

            adjacent[s].pop_back();
            adjacent[e].pop_back();

            if (e == s + 1){
                adjacent[s].push_back(make_pair(e, l[s]));
                adjacent[e].push_back(make_pair(s, l[s]));
            }
            //cout << diameter << ' ' << endl << endl;
            best = min(best, diameter);
        }


    }


    return best;
}

Compilation message

shortcut.cpp: In function 'long long int find_shortcut(int, std::vector<int>, std::vector<int>, int)':
shortcut.cpp:103:43: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  103 |                         for (int i = 0; i < adjacent[current].size(); i++){
      |                                         ~~^~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB n = 4, 80 is a correct answer
2 Correct 1 ms 256 KB n = 9, 110 is a correct answer
3 Correct 0 ms 256 KB n = 4, 21 is a correct answer
4 Correct 1 ms 256 KB n = 3, 4 is a correct answer
5 Correct 0 ms 256 KB n = 2, 62 is a correct answer
6 Correct 1 ms 256 KB n = 2, 3 is a correct answer
7 Correct 1 ms 256 KB n = 3, 29 is a correct answer
8 Correct 1 ms 256 KB n = 2, 3 is a correct answer
9 Correct 0 ms 256 KB n = 2, 3 is a correct answer
10 Correct 1 ms 384 KB n = 2, 2000000001 is a correct answer
11 Correct 0 ms 256 KB n = 2, 3000000000 is a correct answer
12 Correct 0 ms 256 KB n = 3, 3000000000 is a correct answer
13 Correct 1 ms 256 KB n = 3, 3000000000 is a correct answer
14 Correct 0 ms 256 KB n = 4, 3000000001 is a correct answer
15 Correct 0 ms 256 KB n = 4, 4000000000 is a correct answer
16 Correct 0 ms 256 KB n = 5, 4000000000 is a correct answer
17 Correct 1 ms 256 KB n = 10, 1000000343 is a correct answer
18 Correct 1 ms 256 KB n = 10, 3189 is a correct answer
19 Correct 1 ms 256 KB n = 10, 7000000000 is a correct answer
20 Correct 1 ms 256 KB n = 5, 12 is a correct answer
21 Correct 0 ms 256 KB n = 5, 25 is a correct answer
22 Correct 0 ms 256 KB n = 2, 122 is a correct answer
23 Correct 1 ms 256 KB n = 10, 117 is a correct answer
24 Correct 1 ms 256 KB n = 10, 336 is a correct answer
25 Correct 1 ms 256 KB n = 10, 438 is a correct answer
26 Correct 1 ms 256 KB n = 10, 206 is a correct answer
27 Correct 1 ms 256 KB n = 10, 636 is a correct answer
28 Correct 0 ms 256 KB n = 4, 2399 is a correct answer
29 Correct 1 ms 256 KB n = 10, 10992 is a correct answer
30 Correct 1 ms 256 KB n = 10, 3112 is a correct answer
31 Correct 1448 ms 384 KB n = 100, 51000000001 is a correct answer
32 Correct 108 ms 372 KB n = 50, 197881272 is a correct answer
33 Correct 1634 ms 384 KB n = 100, 20969 is a correct answer
34 Correct 1626 ms 384 KB n = 100, 20969 is a correct answer
35 Correct 1452 ms 384 KB n = 100, 52000000000 is a correct answer
36 Correct 1642 ms 376 KB n = 100, 285 is a correct answer
37 Correct 1658 ms 376 KB n = 100, 21272 is a correct answer
38 Correct 1546 ms 376 KB n = 100, 12161 is a correct answer

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB n = 4, 80 is a correct answer
2 Correct 1 ms 256 KB n = 9, 110 is a correct answer
3 Correct 0 ms 256 KB n = 4, 21 is a correct answer
4 Correct 1 ms 256 KB n = 3, 4 is a correct answer
5 Correct 0 ms 256 KB n = 2, 62 is a correct answer
6 Correct 1 ms 256 KB n = 2, 3 is a correct answer
7 Correct 1 ms 256 KB n = 3, 29 is a correct answer
8 Correct 1 ms 256 KB n = 2, 3 is a correct answer
9 Correct 0 ms 256 KB n = 2, 3 is a correct answer
10 Correct 1 ms 384 KB n = 2, 2000000001 is a correct answer
11 Correct 0 ms 256 KB n = 2, 3000000000 is a correct answer
12 Correct 0 ms 256 KB n = 3, 3000000000 is a correct answer
13 Correct 1 ms 256 KB n = 3, 3000000000 is a correct answer
14 Correct 0 ms 256 KB n = 4, 3000000001 is a correct answer
15 Correct 0 ms 256 KB n = 4, 4000000000 is a correct answer
16 Correct 0 ms 256 KB n = 5, 4000000000 is a correct answer
17 Correct 1 ms 256 KB n = 10, 1000000343 is a correct answer
18 Correct 1 ms 256 KB n = 10, 3189 is a correct answer
19 Correct 1 ms 256 KB n = 10, 7000000000 is a correct answer
20 Correct 1 ms 256 KB n = 5, 12 is a correct answer
21 Correct 0 ms 256 KB n = 5, 25 is a correct answer
22 Correct 0 ms 256 KB n = 2, 122 is a correct answer
23 Correct 1 ms 256 KB n = 10, 117 is a correct answer
24 Correct 1 ms 256 KB n = 10, 336 is a correct answer
25 Correct 1 ms 256 KB n = 10, 438 is a correct answer
26 Correct 1 ms 256 KB n = 10, 206 is a correct answer
27 Correct 1 ms 256 KB n = 10, 636 is a correct answer
28 Correct 0 ms 256 KB n = 4, 2399 is a correct answer
29 Correct 1 ms 256 KB n = 10, 10992 is a correct answer
30 Correct 1 ms 256 KB n = 10, 3112 is a correct answer
31 Correct 1448 ms 384 KB n = 100, 51000000001 is a correct answer
32 Correct 108 ms 372 KB n = 50, 197881272 is a correct answer
33 Correct 1634 ms 384 KB n = 100, 20969 is a correct answer
34 Correct 1626 ms 384 KB n = 100, 20969 is a correct answer
35 Correct 1452 ms 384 KB n = 100, 52000000000 is a correct answer
36 Correct 1642 ms 376 KB n = 100, 285 is a correct answer
37 Correct 1658 ms 376 KB n = 100, 21272 is a correct answer
38 Correct 1546 ms 376 KB n = 100, 12161 is a correct answer
39 Correct 0 ms 256 KB n = 2, 62 is a correct answer
40 Correct 0 ms 256 KB n = 2, 3 is a correct answer
41 Correct 1 ms 256 KB n = 3, 29 is a correct answer
42 Correct 0 ms 256 KB n = 2, 3 is a correct answer
43 Correct 1 ms 256 KB n = 2, 3 is a correct answer
44 Correct 1 ms 256 KB n = 2, 2000000001 is a correct answer
45 Correct 1 ms 256 KB n = 2, 3000000000 is a correct answer
46 Correct 1 ms 256 KB n = 3, 3000000000 is a correct answer
47 Correct 1 ms 256 KB n = 3, 3000000000 is a correct answer
48 Correct 1 ms 256 KB n = 4, 3000000001 is a correct answer
49 Correct 1 ms 256 KB n = 4, 4000000000 is a correct answer
50 Correct 1 ms 256 KB n = 5, 4000000000 is a correct answer
51 Correct 1 ms 256 KB n = 10, 1000000343 is a correct answer
52 Correct 1 ms 256 KB n = 10, 3189 is a correct answer
53 Correct 1 ms 256 KB n = 10, 7000000000 is a correct answer
54 Correct 1 ms 256 KB n = 5, 12 is a correct answer
55 Correct 1 ms 256 KB n = 5, 25 is a correct answer
56 Correct 0 ms 256 KB n = 2, 122 is a correct answer
57 Correct 1 ms 256 KB n = 10, 117 is a correct answer
58 Correct 1 ms 256 KB n = 10, 336 is a correct answer
59 Correct 1 ms 256 KB n = 10, 438 is a correct answer
60 Correct 1 ms 256 KB n = 10, 206 is a correct answer
61 Correct 1 ms 256 KB n = 10, 636 is a correct answer
62 Correct 0 ms 256 KB n = 4, 2399 is a correct answer
63 Correct 1 ms 256 KB n = 10, 10992 is a correct answer
64 Correct 1 ms 256 KB n = 10, 3112 is a correct answer
65 Correct 1487 ms 376 KB n = 100, 51000000001 is a correct answer
66 Correct 111 ms 256 KB n = 50, 197881272 is a correct answer
67 Correct 1617 ms 376 KB n = 100, 20969 is a correct answer
68 Correct 1651 ms 504 KB n = 100, 20969 is a correct answer
69 Correct 1509 ms 384 KB n = 100, 52000000000 is a correct answer
70 Correct 1694 ms 384 KB n = 100, 285 is a correct answer
71 Correct 1641 ms 504 KB n = 100, 21272 is a correct answer
72 Correct 1538 ms 380 KB n = 100, 12161 is a correct answer

Subtask #3
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB n = 4, 80 is a correct answer
2 Correct 1 ms 256 KB n = 9, 110 is a correct answer
3 Correct 0 ms 256 KB n = 4, 21 is a correct answer
4 Correct 1 ms 256 KB n = 3, 4 is a correct answer
5 Correct 0 ms 256 KB n = 2, 62 is a correct answer
6 Correct 1 ms 256 KB n = 2, 3 is a correct answer
7 Correct 1 ms 256 KB n = 3, 29 is a correct answer
8 Correct 1 ms 256 KB n = 2, 3 is a correct answer
9 Correct 0 ms 256 KB n = 2, 3 is a correct answer
10 Correct 1 ms 384 KB n = 2, 2000000001 is a correct answer
11 Correct 0 ms 256 KB n = 2, 3000000000 is a correct answer
12 Correct 0 ms 256 KB n = 3, 3000000000 is a correct answer
13 Correct 1 ms 256 KB n = 3, 3000000000 is a correct answer
14 Correct 0 ms 256 KB n = 4, 3000000001 is a correct answer
15 Correct 0 ms 256 KB n = 4, 4000000000 is a correct answer
16 Correct 0 ms 256 KB n = 5, 4000000000 is a correct answer
17 Correct 1 ms 256 KB n = 10, 1000000343 is a correct answer
18 Correct 1 ms 256 KB n = 10, 3189 is a correct answer
19 Correct 1 ms 256 KB n = 10, 7000000000 is a correct answer
20 Correct 1 ms 256 KB n = 5, 12 is a correct answer
21 Correct 0 ms 256 KB n = 5, 25 is a correct answer
22 Correct 0 ms 256 KB n = 2, 122 is a correct answer
23 Correct 1 ms 256 KB n = 10, 117 is a correct answer
24 Correct 1 ms 256 KB n = 10, 336 is a correct answer
25 Correct 1 ms 256 KB n = 10, 438 is a correct answer
26 Correct 1 ms 256 KB n = 10, 206 is a correct answer
27 Correct 1 ms 256 KB n = 10, 636 is a correct answer
28 Correct 0 ms 256 KB n = 4, 2399 is a correct answer
29 Correct 1 ms 256 KB n = 10, 10992 is a correct answer
30 Correct 1 ms 256 KB n = 10, 3112 is a correct answer
31 Correct 1448 ms 384 KB n = 100, 51000000001 is a correct answer
32 Correct 108 ms 372 KB n = 50, 197881272 is a correct answer
33 Correct 1634 ms 384 KB n = 100, 20969 is a correct answer
34 Correct 1626 ms 384 KB n = 100, 20969 is a correct answer
35 Correct 1452 ms 384 KB n = 100, 52000000000 is a correct answer
36 Correct 1642 ms 376 KB n = 100, 285 is a correct answer
37 Correct 1658 ms 376 KB n = 100, 21272 is a correct answer
38 Correct 1546 ms 376 KB n = 100, 12161 is a correct answer
39 Correct 0 ms 256 KB n = 2, 62 is a correct answer
40 Correct 0 ms 256 KB n = 2, 3 is a correct answer
41 Correct 1 ms 256 KB n = 3, 29 is a correct answer
42 Correct 0 ms 256 KB n = 2, 3 is a correct answer
43 Correct 1 ms 256 KB n = 2, 3 is a correct answer
44 Correct 1 ms 256 KB n = 2, 2000000001 is a correct answer
45 Correct 1 ms 256 KB n = 2, 3000000000 is a correct answer
46 Correct 1 ms 256 KB n = 3, 3000000000 is a correct answer
47 Correct 1 ms 256 KB n = 3, 3000000000 is a correct answer
48 Correct 1 ms 256 KB n = 4, 3000000001 is a correct answer
49 Correct 1 ms 256 KB n = 4, 4000000000 is a correct answer
50 Correct 1 ms 256 KB n = 5, 4000000000 is a correct answer
51 Correct 1 ms 256 KB n = 10, 1000000343 is a correct answer
52 Correct 1 ms 256 KB n = 10, 3189 is a correct answer
53 Correct 1 ms 256 KB n = 10, 7000000000 is a correct answer
54 Correct 1 ms 256 KB n = 5, 12 is a correct answer
55 Correct 1 ms 256 KB n = 5, 25 is a correct answer
56 Correct 0 ms 256 KB n = 2, 122 is a correct answer
57 Correct 1 ms 256 KB n = 10, 117 is a correct answer
58 Correct 1 ms 256 KB n = 10, 336 is a correct answer
59 Correct 1 ms 256 KB n = 10, 438 is a correct answer
60 Correct 1 ms 256 KB n = 10, 206 is a correct answer
61 Correct 1 ms 256 KB n = 10, 636 is a correct answer
62 Correct 0 ms 256 KB n = 4, 2399 is a correct answer
63 Correct 1 ms 256 KB n = 10, 10992 is a correct answer
64 Correct 1 ms 256 KB n = 10, 3112 is a correct answer
65 Correct 1487 ms 376 KB n = 100, 51000000001 is a correct answer
66 Correct 111 ms 256 KB n = 50, 197881272 is a correct answer
67 Correct 1617 ms 376 KB n = 100, 20969 is a correct answer
68 Correct 1651 ms 504 KB n = 100, 20969 is a correct answer
69 Correct 1509 ms 384 KB n = 100, 52000000000 is a correct answer
70 Correct 1694 ms 384 KB n = 100, 285 is a correct answer
71 Correct 1641 ms 504 KB n = 100, 21272 is a correct answer
72 Correct 1538 ms 380 KB n = 100, 12161 is a correct answer
73 Execution timed out 2083 ms 504 KB Time limit exceeded
74 Halted 0 ms 0 KB -

Subtask #4
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB n = 4, 80 is a correct answer
2 Correct 1 ms 256 KB n = 9, 110 is a correct answer
3 Correct 0 ms 256 KB n = 4, 21 is a correct answer
4 Correct 1 ms 256 KB n = 3, 4 is a correct answer
5 Correct 0 ms 256 KB n = 2, 62 is a correct answer
6 Correct 1 ms 256 KB n = 2, 3 is a correct answer
7 Correct 1 ms 256 KB n = 3, 29 is a correct answer
8 Correct 1 ms 256 KB n = 2, 3 is a correct answer
9 Correct 0 ms 256 KB n = 2, 3 is a correct answer
10 Correct 1 ms 384 KB n = 2, 2000000001 is a correct answer
11 Correct 0 ms 256 KB n = 2, 3000000000 is a correct answer
12 Correct 0 ms 256 KB n = 3, 3000000000 is a correct answer
13 Correct 1 ms 256 KB n = 3, 3000000000 is a correct answer
14 Correct 0 ms 256 KB n = 4, 3000000001 is a correct answer
15 Correct 0 ms 256 KB n = 4, 4000000000 is a correct answer
16 Correct 0 ms 256 KB n = 5, 4000000000 is a correct answer
17 Correct 1 ms 256 KB n = 10, 1000000343 is a correct answer
18 Correct 1 ms 256 KB n = 10, 3189 is a correct answer
19 Correct 1 ms 256 KB n = 10, 7000000000 is a correct answer
20 Correct 1 ms 256 KB n = 5, 12 is a correct answer
21 Correct 0 ms 256 KB n = 5, 25 is a correct answer
22 Correct 0 ms 256 KB n = 2, 122 is a correct answer
23 Correct 1 ms 256 KB n = 10, 117 is a correct answer
24 Correct 1 ms 256 KB n = 10, 336 is a correct answer
25 Correct 1 ms 256 KB n = 10, 438 is a correct answer
26 Correct 1 ms 256 KB n = 10, 206 is a correct answer
27 Correct 1 ms 256 KB n = 10, 636 is a correct answer
28 Correct 0 ms 256 KB n = 4, 2399 is a correct answer
29 Correct 1 ms 256 KB n = 10, 10992 is a correct answer
30 Correct 1 ms 256 KB n = 10, 3112 is a correct answer
31 Correct 1448 ms 384 KB n = 100, 51000000001 is a correct answer
32 Correct 108 ms 372 KB n = 50, 197881272 is a correct answer
33 Correct 1634 ms 384 KB n = 100, 20969 is a correct answer
34 Correct 1626 ms 384 KB n = 100, 20969 is a correct answer
35 Correct 1452 ms 384 KB n = 100, 52000000000 is a correct answer
36 Correct 1642 ms 376 KB n = 100, 285 is a correct answer
37 Correct 1658 ms 376 KB n = 100, 21272 is a correct answer
38 Correct 1546 ms 376 KB n = 100, 12161 is a correct answer
39 Correct 0 ms 256 KB n = 2, 62 is a correct answer
40 Correct 0 ms 256 KB n = 2, 3 is a correct answer
41 Correct 1 ms 256 KB n = 3, 29 is a correct answer
42 Correct 0 ms 256 KB n = 2, 3 is a correct answer
43 Correct 1 ms 256 KB n = 2, 3 is a correct answer
44 Correct 1 ms 256 KB n = 2, 2000000001 is a correct answer
45 Correct 1 ms 256 KB n = 2, 3000000000 is a correct answer
46 Correct 1 ms 256 KB n = 3, 3000000000 is a correct answer
47 Correct 1 ms 256 KB n = 3, 3000000000 is a correct answer
48 Correct 1 ms 256 KB n = 4, 3000000001 is a correct answer
49 Correct 1 ms 256 KB n = 4, 4000000000 is a correct answer
50 Correct 1 ms 256 KB n = 5, 4000000000 is a correct answer
51 Correct 1 ms 256 KB n = 10, 1000000343 is a correct answer
52 Correct 1 ms 256 KB n = 10, 3189 is a correct answer
53 Correct 1 ms 256 KB n = 10, 7000000000 is a correct answer
54 Correct 1 ms 256 KB n = 5, 12 is a correct answer
55 Correct 1 ms 256 KB n = 5, 25 is a correct answer
56 Correct 0 ms 256 KB n = 2, 122 is a correct answer
57 Correct 1 ms 256 KB n = 10, 117 is a correct answer
58 Correct 1 ms 256 KB n = 10, 336 is a correct answer
59 Correct 1 ms 256 KB n = 10, 438 is a correct answer
60 Correct 1 ms 256 KB n = 10, 206 is a correct answer
61 Correct 1 ms 256 KB n = 10, 636 is a correct answer
62 Correct 0 ms 256 KB n = 4, 2399 is a correct answer
63 Correct 1 ms 256 KB n = 10, 10992 is a correct answer
64 Correct 1 ms 256 KB n = 10, 3112 is a correct answer
65 Correct 1487 ms 376 KB n = 100, 51000000001 is a correct answer
66 Correct 111 ms 256 KB n = 50, 197881272 is a correct answer
67 Correct 1617 ms 376 KB n = 100, 20969 is a correct answer
68 Correct 1651 ms 504 KB n = 100, 20969 is a correct answer
69 Correct 1509 ms 384 KB n = 100, 52000000000 is a correct answer
70 Correct 1694 ms 384 KB n = 100, 285 is a correct answer
71 Correct 1641 ms 504 KB n = 100, 21272 is a correct answer
72 Correct 1538 ms 380 KB n = 100, 12161 is a correct answer
73 Execution timed out 2083 ms 504 KB Time limit exceeded
74 Halted 0 ms 0 KB -

Subtask #5
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB n = 4, 80 is a correct answer
2 Correct 1 ms 256 KB n = 9, 110 is a correct answer
3 Correct 0 ms 256 KB n = 4, 21 is a correct answer
4 Correct 1 ms 256 KB n = 3, 4 is a correct answer
5 Correct 0 ms 256 KB n = 2, 62 is a correct answer
6 Correct 1 ms 256 KB n = 2, 3 is a correct answer
7 Correct 1 ms 256 KB n = 3, 29 is a correct answer
8 Correct 1 ms 256 KB n = 2, 3 is a correct answer
9 Correct 0 ms 256 KB n = 2, 3 is a correct answer
10 Correct 1 ms 384 KB n = 2, 2000000001 is a correct answer
11 Correct 0 ms 256 KB n = 2, 3000000000 is a correct answer
12 Correct 0 ms 256 KB n = 3, 3000000000 is a correct answer
13 Correct 1 ms 256 KB n = 3, 3000000000 is a correct answer
14 Correct 0 ms 256 KB n = 4, 3000000001 is a correct answer
15 Correct 0 ms 256 KB n = 4, 4000000000 is a correct answer
16 Correct 0 ms 256 KB n = 5, 4000000000 is a correct answer
17 Correct 1 ms 256 KB n = 10, 1000000343 is a correct answer
18 Correct 1 ms 256 KB n = 10, 3189 is a correct answer
19 Correct 1 ms 256 KB n = 10, 7000000000 is a correct answer
20 Correct 1 ms 256 KB n = 5, 12 is a correct answer
21 Correct 0 ms 256 KB n = 5, 25 is a correct answer
22 Correct 0 ms 256 KB n = 2, 122 is a correct answer
23 Correct 1 ms 256 KB n = 10, 117 is a correct answer
24 Correct 1 ms 256 KB n = 10, 336 is a correct answer
25 Correct 1 ms 256 KB n = 10, 438 is a correct answer
26 Correct 1 ms 256 KB n = 10, 206 is a correct answer
27 Correct 1 ms 256 KB n = 10, 636 is a correct answer
28 Correct 0 ms 256 KB n = 4, 2399 is a correct answer
29 Correct 1 ms 256 KB n = 10, 10992 is a correct answer
30 Correct 1 ms 256 KB n = 10, 3112 is a correct answer
31 Correct 1448 ms 384 KB n = 100, 51000000001 is a correct answer
32 Correct 108 ms 372 KB n = 50, 197881272 is a correct answer
33 Correct 1634 ms 384 KB n = 100, 20969 is a correct answer
34 Correct 1626 ms 384 KB n = 100, 20969 is a correct answer
35 Correct 1452 ms 384 KB n = 100, 52000000000 is a correct answer
36 Correct 1642 ms 376 KB n = 100, 285 is a correct answer
37 Correct 1658 ms 376 KB n = 100, 21272 is a correct answer
38 Correct 1546 ms 376 KB n = 100, 12161 is a correct answer
39 Correct 0 ms 256 KB n = 2, 62 is a correct answer
40 Correct 0 ms 256 KB n = 2, 3 is a correct answer
41 Correct 1 ms 256 KB n = 3, 29 is a correct answer
42 Correct 0 ms 256 KB n = 2, 3 is a correct answer
43 Correct 1 ms 256 KB n = 2, 3 is a correct answer
44 Correct 1 ms 256 KB n = 2, 2000000001 is a correct answer
45 Correct 1 ms 256 KB n = 2, 3000000000 is a correct answer
46 Correct 1 ms 256 KB n = 3, 3000000000 is a correct answer
47 Correct 1 ms 256 KB n = 3, 3000000000 is a correct answer
48 Correct 1 ms 256 KB n = 4, 3000000001 is a correct answer
49 Correct 1 ms 256 KB n = 4, 4000000000 is a correct answer
50 Correct 1 ms 256 KB n = 5, 4000000000 is a correct answer
51 Correct 1 ms 256 KB n = 10, 1000000343 is a correct answer
52 Correct 1 ms 256 KB n = 10, 3189 is a correct answer
53 Correct 1 ms 256 KB n = 10, 7000000000 is a correct answer
54 Correct 1 ms 256 KB n = 5, 12 is a correct answer
55 Correct 1 ms 256 KB n = 5, 25 is a correct answer
56 Correct 0 ms 256 KB n = 2, 122 is a correct answer
57 Correct 1 ms 256 KB n = 10, 117 is a correct answer
58 Correct 1 ms 256 KB n = 10, 336 is a correct answer
59 Correct 1 ms 256 KB n = 10, 438 is a correct answer
60 Correct 1 ms 256 KB n = 10, 206 is a correct answer
61 Correct 1 ms 256 KB n = 10, 636 is a correct answer
62 Correct 0 ms 256 KB n = 4, 2399 is a correct answer
63 Correct 1 ms 256 KB n = 10, 10992 is a correct answer
64 Correct 1 ms 256 KB n = 10, 3112 is a correct answer
65 Correct 1487 ms 376 KB n = 100, 51000000001 is a correct answer
66 Correct 111 ms 256 KB n = 50, 197881272 is a correct answer
67 Correct 1617 ms 376 KB n = 100, 20969 is a correct answer
68 Correct 1651 ms 504 KB n = 100, 20969 is a correct answer
69 Correct 1509 ms 384 KB n = 100, 52000000000 is a correct answer
70 Correct 1694 ms 384 KB n = 100, 285 is a correct answer
71 Correct 1641 ms 504 KB n = 100, 21272 is a correct answer
72 Correct 1538 ms 380 KB n = 100, 12161 is a correct answer
73 Execution timed out 2083 ms 504 KB Time limit exceeded
74 Halted 0 ms 0 KB -

Subtask #6
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB n = 4, 80 is a correct answer
2 Correct 1 ms 256 KB n = 9, 110 is a correct answer
3 Correct 0 ms 256 KB n = 4, 21 is a correct answer
4 Correct 1 ms 256 KB n = 3, 4 is a correct answer
5 Correct 0 ms 256 KB n = 2, 62 is a correct answer
6 Correct 1 ms 256 KB n = 2, 3 is a correct answer
7 Correct 1 ms 256 KB n = 3, 29 is a correct answer
8 Correct 1 ms 256 KB n = 2, 3 is a correct answer
9 Correct 0 ms 256 KB n = 2, 3 is a correct answer
10 Correct 1 ms 384 KB n = 2, 2000000001 is a correct answer
11 Correct 0 ms 256 KB n = 2, 3000000000 is a correct answer
12 Correct 0 ms 256 KB n = 3, 3000000000 is a correct answer
13 Correct 1 ms 256 KB n = 3, 3000000000 is a correct answer
14 Correct 0 ms 256 KB n = 4, 3000000001 is a correct answer
15 Correct 0 ms 256 KB n = 4, 4000000000 is a correct answer
16 Correct 0 ms 256 KB n = 5, 4000000000 is a correct answer
17 Correct 1 ms 256 KB n = 10, 1000000343 is a correct answer
18 Correct 1 ms 256 KB n = 10, 3189 is a correct answer
19 Correct 1 ms 256 KB n = 10, 7000000000 is a correct answer
20 Correct 1 ms 256 KB n = 5, 12 is a correct answer
21 Correct 0 ms 256 KB n = 5, 25 is a correct answer
22 Correct 0 ms 256 KB n = 2, 122 is a correct answer
23 Correct 1 ms 256 KB n = 10, 117 is a correct answer
24 Correct 1 ms 256 KB n = 10, 336 is a correct answer
25 Correct 1 ms 256 KB n = 10, 438 is a correct answer
26 Correct 1 ms 256 KB n = 10, 206 is a correct answer
27 Correct 1 ms 256 KB n = 10, 636 is a correct answer
28 Correct 0 ms 256 KB n = 4, 2399 is a correct answer
29 Correct 1 ms 256 KB n = 10, 10992 is a correct answer
30 Correct 1 ms 256 KB n = 10, 3112 is a correct answer
31 Correct 1448 ms 384 KB n = 100, 51000000001 is a correct answer
32 Correct 108 ms 372 KB n = 50, 197881272 is a correct answer
33 Correct 1634 ms 384 KB n = 100, 20969 is a correct answer
34 Correct 1626 ms 384 KB n = 100, 20969 is a correct answer
35 Correct 1452 ms 384 KB n = 100, 52000000000 is a correct answer
36 Correct 1642 ms 376 KB n = 100, 285 is a correct answer
37 Correct 1658 ms 376 KB n = 100, 21272 is a correct answer
38 Correct 1546 ms 376 KB n = 100, 12161 is a correct answer
39 Correct 0 ms 256 KB n = 2, 62 is a correct answer
40 Correct 0 ms 256 KB n = 2, 3 is a correct answer
41 Correct 1 ms 256 KB n = 3, 29 is a correct answer
42 Correct 0 ms 256 KB n = 2, 3 is a correct answer
43 Correct 1 ms 256 KB n = 2, 3 is a correct answer
44 Correct 1 ms 256 KB n = 2, 2000000001 is a correct answer
45 Correct 1 ms 256 KB n = 2, 3000000000 is a correct answer
46 Correct 1 ms 256 KB n = 3, 3000000000 is a correct answer
47 Correct 1 ms 256 KB n = 3, 3000000000 is a correct answer
48 Correct 1 ms 256 KB n = 4, 3000000001 is a correct answer
49 Correct 1 ms 256 KB n = 4, 4000000000 is a correct answer
50 Correct 1 ms 256 KB n = 5, 4000000000 is a correct answer
51 Correct 1 ms 256 KB n = 10, 1000000343 is a correct answer
52 Correct 1 ms 256 KB n = 10, 3189 is a correct answer
53 Correct 1 ms 256 KB n = 10, 7000000000 is a correct answer
54 Correct 1 ms 256 KB n = 5, 12 is a correct answer
55 Correct 1 ms 256 KB n = 5, 25 is a correct answer
56 Correct 0 ms 256 KB n = 2, 122 is a correct answer
57 Correct 1 ms 256 KB n = 10, 117 is a correct answer
58 Correct 1 ms 256 KB n = 10, 336 is a correct answer
59 Correct 1 ms 256 KB n = 10, 438 is a correct answer
60 Correct 1 ms 256 KB n = 10, 206 is a correct answer
61 Correct 1 ms 256 KB n = 10, 636 is a correct answer
62 Correct 0 ms 256 KB n = 4, 2399 is a correct answer
63 Correct 1 ms 256 KB n = 10, 10992 is a correct answer
64 Correct 1 ms 256 KB n = 10, 3112 is a correct answer
65 Correct 1487 ms 376 KB n = 100, 51000000001 is a correct answer
66 Correct 111 ms 256 KB n = 50, 197881272 is a correct answer
67 Correct 1617 ms 376 KB n = 100, 20969 is a correct answer
68 Correct 1651 ms 504 KB n = 100, 20969 is a correct answer
69 Correct 1509 ms 384 KB n = 100, 52000000000 is a correct answer
70 Correct 1694 ms 384 KB n = 100, 285 is a correct answer
71 Correct 1641 ms 504 KB n = 100, 21272 is a correct answer
72 Correct 1538 ms 380 KB n = 100, 12161 is a correct answer
73 Execution timed out 2083 ms 504 KB Time limit exceeded
74 Halted 0 ms 0 KB -

Subtask #7
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB n = 4, 80 is a correct answer
2 Correct 1 ms 256 KB n = 9, 110 is a correct answer
3 Correct 0 ms 256 KB n = 4, 21 is a correct answer
4 Correct 1 ms 256 KB n = 3, 4 is a correct answer
5 Correct 0 ms 256 KB n = 2, 62 is a correct answer
6 Correct 1 ms 256 KB n = 2, 3 is a correct answer
7 Correct 1 ms 256 KB n = 3, 29 is a correct answer
8 Correct 1 ms 256 KB n = 2, 3 is a correct answer
9 Correct 0 ms 256 KB n = 2, 3 is a correct answer
10 Correct 1 ms 384 KB n = 2, 2000000001 is a correct answer
11 Correct 0 ms 256 KB n = 2, 3000000000 is a correct answer
12 Correct 0 ms 256 KB n = 3, 3000000000 is a correct answer
13 Correct 1 ms 256 KB n = 3, 3000000000 is a correct answer
14 Correct 0 ms 256 KB n = 4, 3000000001 is a correct answer
15 Correct 0 ms 256 KB n = 4, 4000000000 is a correct answer
16 Correct 0 ms 256 KB n = 5, 4000000000 is a correct answer
17 Correct 1 ms 256 KB n = 10, 1000000343 is a correct answer
18 Correct 1 ms 256 KB n = 10, 3189 is a correct answer
19 Correct 1 ms 256 KB n = 10, 7000000000 is a correct answer
20 Correct 1 ms 256 KB n = 5, 12 is a correct answer
21 Correct 0 ms 256 KB n = 5, 25 is a correct answer
22 Correct 0 ms 256 KB n = 2, 122 is a correct answer
23 Correct 1 ms 256 KB n = 10, 117 is a correct answer
24 Correct 1 ms 256 KB n = 10, 336 is a correct answer
25 Correct 1 ms 256 KB n = 10, 438 is a correct answer
26 Correct 1 ms 256 KB n = 10, 206 is a correct answer
27 Correct 1 ms 256 KB n = 10, 636 is a correct answer
28 Correct 0 ms 256 KB n = 4, 2399 is a correct answer
29 Correct 1 ms 256 KB n = 10, 10992 is a correct answer
30 Correct 1 ms 256 KB n = 10, 3112 is a correct answer
31 Correct 1448 ms 384 KB n = 100, 51000000001 is a correct answer
32 Correct 108 ms 372 KB n = 50, 197881272 is a correct answer
33 Correct 1634 ms 384 KB n = 100, 20969 is a correct answer
34 Correct 1626 ms 384 KB n = 100, 20969 is a correct answer
35 Correct 1452 ms 384 KB n = 100, 52000000000 is a correct answer
36 Correct 1642 ms 376 KB n = 100, 285 is a correct answer
37 Correct 1658 ms 376 KB n = 100, 21272 is a correct answer
38 Correct 1546 ms 376 KB n = 100, 12161 is a correct answer
39 Correct 0 ms 256 KB n = 2, 62 is a correct answer
40 Correct 0 ms 256 KB n = 2, 3 is a correct answer
41 Correct 1 ms 256 KB n = 3, 29 is a correct answer
42 Correct 0 ms 256 KB n = 2, 3 is a correct answer
43 Correct 1 ms 256 KB n = 2, 3 is a correct answer
44 Correct 1 ms 256 KB n = 2, 2000000001 is a correct answer
45 Correct 1 ms 256 KB n = 2, 3000000000 is a correct answer
46 Correct 1 ms 256 KB n = 3, 3000000000 is a correct answer
47 Correct 1 ms 256 KB n = 3, 3000000000 is a correct answer
48 Correct 1 ms 256 KB n = 4, 3000000001 is a correct answer
49 Correct 1 ms 256 KB n = 4, 4000000000 is a correct answer
50 Correct 1 ms 256 KB n = 5, 4000000000 is a correct answer
51 Correct 1 ms 256 KB n = 10, 1000000343 is a correct answer
52 Correct 1 ms 256 KB n = 10, 3189 is a correct answer
53 Correct 1 ms 256 KB n = 10, 7000000000 is a correct answer
54 Correct 1 ms 256 KB n = 5, 12 is a correct answer
55 Correct 1 ms 256 KB n = 5, 25 is a correct answer
56 Correct 0 ms 256 KB n = 2, 122 is a correct answer
57 Correct 1 ms 256 KB n = 10, 117 is a correct answer
58 Correct 1 ms 256 KB n = 10, 336 is a correct answer
59 Correct 1 ms 256 KB n = 10, 438 is a correct answer
60 Correct 1 ms 256 KB n = 10, 206 is a correct answer
61 Correct 1 ms 256 KB n = 10, 636 is a correct answer
62 Correct 0 ms 256 KB n = 4, 2399 is a correct answer
63 Correct 1 ms 256 KB n = 10, 10992 is a correct answer
64 Correct 1 ms 256 KB n = 10, 3112 is a correct answer
65 Correct 1487 ms 376 KB n = 100, 51000000001 is a correct answer
66 Correct 111 ms 256 KB n = 50, 197881272 is a correct answer
67 Correct 1617 ms 376 KB n = 100, 20969 is a correct answer
68 Correct 1651 ms 504 KB n = 100, 20969 is a correct answer
69 Correct 1509 ms 384 KB n = 100, 52000000000 is a correct answer
70 Correct 1694 ms 384 KB n = 100, 285 is a correct answer
71 Correct 1641 ms 504 KB n = 100, 21272 is a correct answer
72 Correct 1538 ms 380 KB n = 100, 12161 is a correct answer
73 Execution timed out 2083 ms 504 KB Time limit exceeded
74 Halted 0 ms 0 KB -

Subtask #8
0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB n = 4, 80 is a correct answer
2 Correct 1 ms 256 KB n = 9, 110 is a correct answer
3 Correct 0 ms 256 KB n = 4, 21 is a correct answer
4 Correct 1 ms 256 KB n = 3, 4 is a correct answer
5 Correct 0 ms 256 KB n = 2, 62 is a correct answer
6 Correct 1 ms 256 KB n = 2, 3 is a correct answer
7 Correct 1 ms 256 KB n = 3, 29 is a correct answer
8 Correct 1 ms 256 KB n = 2, 3 is a correct answer
9 Correct 0 ms 256 KB n = 2, 3 is a correct answer
10 Correct 1 ms 384 KB n = 2, 2000000001 is a correct answer
11 Correct 0 ms 256 KB n = 2, 3000000000 is a correct answer
12 Correct 0 ms 256 KB n = 3, 3000000000 is a correct answer
13 Correct 1 ms 256 KB n = 3, 3000000000 is a correct answer
14 Correct 0 ms 256 KB n = 4, 3000000001 is a correct answer
15 Correct 0 ms 256 KB n = 4, 4000000000 is a correct answer
16 Correct 0 ms 256 KB n = 5, 4000000000 is a correct answer
17 Correct 1 ms 256 KB n = 10, 1000000343 is a correct answer
18 Correct 1 ms 256 KB n = 10, 3189 is a correct answer
19 Correct 1 ms 256 KB n = 10, 7000000000 is a correct answer
20 Correct 1 ms 256 KB n = 5, 12 is a correct answer
21 Correct 0 ms 256 KB n = 5, 25 is a correct answer
22 Correct 0 ms 256 KB n = 2, 122 is a correct answer
23 Correct 1 ms 256 KB n = 10, 117 is a correct answer
24 Correct 1 ms 256 KB n = 10, 336 is a correct answer
25 Correct 1 ms 256 KB n = 10, 438 is a correct answer
26 Correct 1 ms 256 KB n = 10, 206 is a correct answer
27 Correct 1 ms 256 KB n = 10, 636 is a correct answer
28 Correct 0 ms 256 KB n = 4, 2399 is a correct answer
29 Correct 1 ms 256 KB n = 10, 10992 is a correct answer
30 Correct 1 ms 256 KB n = 10, 3112 is a correct answer
31 Correct 1448 ms 384 KB n = 100, 51000000001 is a correct answer
32 Correct 108 ms 372 KB n = 50, 197881272 is a correct answer
33 Correct 1634 ms 384 KB n = 100, 20969 is a correct answer
34 Correct 1626 ms 384 KB n = 100, 20969 is a correct answer
35 Correct 1452 ms 384 KB n = 100, 52000000000 is a correct answer
36 Correct 1642 ms 376 KB n = 100, 285 is a correct answer
37 Correct 1658 ms 376 KB n = 100, 21272 is a correct answer
38 Correct 1546 ms 376 KB n = 100, 12161 is a correct answer
39 Correct 0 ms 256 KB n = 2, 62 is a correct answer
40 Correct 0 ms 256 KB n = 2, 3 is a correct answer
41 Correct 1 ms 256 KB n = 3, 29 is a correct answer
42 Correct 0 ms 256 KB n = 2, 3 is a correct answer
43 Correct 1 ms 256 KB n = 2, 3 is a correct answer
44 Correct 1 ms 256 KB n = 2, 2000000001 is a correct answer
45 Correct 1 ms 256 KB n = 2, 3000000000 is a correct answer
46 Correct 1 ms 256 KB n = 3, 3000000000 is a correct answer
47 Correct 1 ms 256 KB n = 3, 3000000000 is a correct answer
48 Correct 1 ms 256 KB n = 4, 3000000001 is a correct answer
49 Correct 1 ms 256 KB n = 4, 4000000000 is a correct answer
50 Correct 1 ms 256 KB n = 5, 4000000000 is a correct answer
51 Correct 1 ms 256 KB n = 10, 1000000343 is a correct answer
52 Correct 1 ms 256 KB n = 10, 3189 is a correct answer
53 Correct 1 ms 256 KB n = 10, 7000000000 is a correct answer
54 Correct 1 ms 256 KB n = 5, 12 is a correct answer
55 Correct 1 ms 256 KB n = 5, 25 is a correct answer
56 Correct 0 ms 256 KB n = 2, 122 is a correct answer
57 Correct 1 ms 256 KB n = 10, 117 is a correct answer
58 Correct 1 ms 256 KB n = 10, 336 is a correct answer
59 Correct 1 ms 256 KB n = 10, 438 is a correct answer
60 Correct 1 ms 256 KB n = 10, 206 is a correct answer
61 Correct 1 ms 256 KB n = 10, 636 is a correct answer
62 Correct 0 ms 256 KB n = 4, 2399 is a correct answer
63 Correct 1 ms 256 KB n = 10, 10992 is a correct answer
64 Correct 1 ms 256 KB n = 10, 3112 is a correct answer
65 Correct 1487 ms 376 KB n = 100, 51000000001 is a correct answer
66 Correct 111 ms 256 KB n = 50, 197881272 is a correct answer
67 Correct 1617 ms 376 KB n = 100, 20969 is a correct answer
68 Correct 1651 ms 504 KB n = 100, 20969 is a correct answer
69 Correct 1509 ms 384 KB n = 100, 52000000000 is a correct answer
70 Correct 1694 ms 384 KB n = 100, 285 is a correct answer
71 Correct 1641 ms 504 KB n = 100, 21272 is a correct answer
72 Correct 1538 ms 380 KB n = 100, 12161 is a correct answer
73 Execution timed out 2083 ms 504 KB Time limit exceeded
74 Halted 0 ms 0 KB -