oj.uz

Submission #897330

# Submission time Handle Problem Language Result Execution time Memory
897330 2024-01-02T23:31:14 Z ksujay2 Closing Time (IOI23_closing) C++17
100 / 100
 176 ms 40984 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = 2e18;

vector<vector<pair<int, int>>> adj;
vector<ll> d[2];
vector<int> p;

void dfs(int s, int e, ll cd, vector<ll>& dv) {
	dv[s] = cd;
    p[s] = e;
	for(pair<int, int> edge : adj[s]) {
		if(edge.first == e) continue;
		dfs(edge.first, s, cd + edge.second, dv);
	}
};

int max_score(int N, int X, int Y, ll K, vector<int> U, vector<int> V, vector<int> W) {
    adj = vector<vector<pair<int, int>>>(N);
	for(int i = 0; i < N - 1; i++) {
		adj[U[i]].push_back({V[i], W[i]});
		adj[V[i]].push_back({U[i], W[i]});
	}
    d[0] = d[1] = vector<ll>(N);
    p = vector<int>(N);

	dfs(X, -1, 0, d[0]);
	dfs(Y, -1, 0, d[1]);

    int ans = 0;
    // solve no double case
    {
        vector<ll> e;
        for(int i = 0; i < N; i++) {
            e.push_back(d[0][i]);
            e.push_back(d[1][i]);
        }
        sort(e.begin(), e.end());
        ll sm = 0;
        for(int i = 0; i < e.size(); i++) {
            if(sm > K) {
                break;
            }
            ans = i;
            sm += e[i];
        }

        if(sm <= K) ans = e.size();
    }
    // solve double case
    {
        vector<bool> onXY(N);
        for(int i = X; i != -1; i = p[i]) onXY[i] = true;
        vector<int> A, B;
        for(int i = 0; i < N; i++) {
            // ignore nodes on X to Y, we can merge them at the end (with two pointers!)
            if(onXY[i]) continue;
            // split the nodes into two groups, A and B
            // A nodes are nodes whose greedy method is to repeatedly select the smallest
            // This is due to the fact that the difference between max and min is >= min
            // B nodes are nodes whose greedy method is to select nodes to be connected from both paths
            // and if necessary pick one from to just have one path
            if(2 * min(d[0][i], d[1][i]) <= max(d[0][i], d[1][i])) {
                A.push_back(i);
            } else {
                B.push_back(i);
            }
        }
        // A case
        vector<ll> Ares[2];
        {
            vector<ll> deltas;
            for(int i : A) {
                deltas.push_back(min(d[0][i], d[1][i]));
                deltas.push_back(llabs(d[0][i] - d[1][i]));
            }
            sort(deltas.begin(), deltas.end());
            Ares[0].push_back(0);
            int k = 0;
            // solve greedly by picking smallest "delta"
            for(ll delta : deltas) {
                Ares[k ^ 1].push_back(Ares[k].back() + delta);
                k ^= 1;
            }
        }
        // B case
        vector<ll> Bres[2];
        {
            sort(B.begin(), B.end(), [&] (int a, int b) { return max(d[0][a], d[1][a]) < max(d[0][b], d[1][b]); });
            Bres[0].push_back(0);
            // solve even case greedly by picking smallest max distance
            for(int i : B) {
                Bres[0].push_back(Bres[0].back() + max(d[0][i], d[1][i]));
            }
            vector<ll> addmn(B.size() + 1);
            addmn[B.size()] = INF;
            for(int i = B.size() - 1; i >= 0; i--) {
                addmn[i] = min(addmn[i + 1], min(d[0][B[i]], d[1][B[i]]));
            }
            // solve odd case greedly by picking max for the first n - 1 (which is even case) and then smallest min distance after
            ll submx = 0;
            for(int i = 0; i < B.size(); i++) {
                submx = max(submx, llabs(d[0][B[i]] - d[1][B[i]]));
                Bres[1].push_back(min(Bres[0][i + 1] - submx, Bres[0][i] + addmn[i]));
            }
        }

        // two pointer merging (requirement: a[i] - a[i - 1] must grow while i increases (for both a and b))
        auto merge2p = [&] (vector<ll> a, vector<ll> b) {
            if(a.size() == 0) return vector<ll>(0);
            if(b.size() == 0) return vector<ll>(0);
            int i = 0, j = 0;
            vector<ll> c(a.size() + b.size() - 1);
            while(i < a.size() && j < b.size()) {
                c[i + j] = a[i] + b[j];
                if(i == a.size() - 1) j++;
                else if(j == b.size() - 1) i++;
                else if(a[i + 1] + b[j] <= a[i] + b[j + 1]) i++;
                else j++;
            }
            return c;
        };

        vector<ll> res((A.size() + B.size()) * 2 + 1, INF);
        // merge all evens & odds togethor 
        // node: evens and odds differences are increasing and such we can merge them with 2p merging
        for(int i = 0; i < 2; i++) {
            for(int j = 0; j < 2; j++) {
                vector<ll> c = merge2p(Ares[i], Bres[j]);
                for(int k = 0; k < c.size(); k++) {
                    res[i ^ j + 2 * k] = min(res[i ^ j + 2 * k], c[k]);
                }
            }
        }

        // compute XY case
        // XY case is all the nodes on the path between X and Y
        ll sm = 0;
        int cnt = 0;
        vector<ll> res2;
        {
            vector<ll> deltas;
            for(int i = 0; i < N; i++) {
                if(onXY[i]) {
                    cnt++;
                    sm += min(d[0][i], d[1][i]);
                    deltas.push_back(llabs(d[0][i] - d[1][i]));
                }
            }
            sort(deltas.begin(), deltas.end());
            res2.push_back(0);
            // solve greedly again by picking smallest delta
            for(ll delta : deltas) {
                res2.push_back(res2.back() + delta);
            }
        }
        
        // final step is to lazily merge res & res2 (essentially to only calculate the results for K via two pointers)
        int j = res.size() - 1;
        for(int i = 0; i < res2.size(); i++) {
            while(j > 0 && res[j] + res2[i] + sm > K) j--;
            if(res[j] + res2[i] + sm <= K) ans = max(ans, i + j + cnt);
        }
        // reason we cant merge res & res2 via two pointer merging is due to the fact that res & res2 have no 
        // special properties (like previously the even and odd splitting) to merge them.
    }
    return ans;
}

Compilation message

closing.cpp: In function 'int max_score(int, int, int, ll, std::vector<int>, std::vector<int>, std::vector<int>)':
closing.cpp:41:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   41 |         for(int i = 0; i < e.size(); i++) {
      |                        ~~^~~~~~~~~~
closing.cpp:103:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  103 |             for(int i = 0; i < B.size(); i++) {
      |                            ~~^~~~~~~~~~
closing.cpp: In lambda function:
closing.cpp:115:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  115 |             while(i < a.size() && j < b.size()) {
      |                   ~~^~~~~~~~~~
closing.cpp:115:37: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  115 |             while(i < a.size() && j < b.size()) {
      |                                   ~~^~~~~~~~~~
closing.cpp:117:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  117 |                 if(i == a.size() - 1) j++;
      |                    ~~^~~~~~~~~~~~~~~
closing.cpp:118:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  118 |                 else if(j == b.size() - 1) i++;
      |                         ~~^~~~~~~~~~~~~~~
closing.cpp: In function 'int max_score(int, int, int, ll, std::vector<int>, std::vector<int>, std::vector<int>)':
closing.cpp:131:34: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  131 |                 for(int k = 0; k < c.size(); k++) {
      |                                ~~^~~~~~~~~~
closing.cpp:132:31: warning: suggest parentheses around arithmetic in operand of '^' [-Wparentheses]
  132 |                     res[i ^ j + 2 * k] = min(res[i ^ j + 2 * k], c[k]);
      |                             ~~^~~~~~~
closing.cpp:132:56: warning: suggest parentheses around arithmetic in operand of '^' [-Wparentheses]
  132 |                     res[i ^ j + 2 * k] = min(res[i ^ j + 2 * k], c[k]);
      |                                                      ~~^~~~~~~
closing.cpp:161:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  161 |         for(int i = 0; i < res2.size(); i++) {
      |                        ~~^~~~~~~~~~~~~

Subtask #0
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 150 ms 36976 KB Output is correct
2 Correct 143 ms 40344 KB Output is correct
3 Correct 86 ms 5636 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 0 ms 348 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 436 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 440 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 440 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 436 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 440 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 440 KB Output is correct
25 Correct 2 ms 348 KB Output is correct
26 Correct 2 ms 956 KB Output is correct
27 Correct 2 ms 860 KB Output is correct
28 Correct 2 ms 860 KB Output is correct
29 Correct 2 ms 860 KB Output is correct
30 Correct 2 ms 860 KB Output is correct
31 Correct 2 ms 860 KB Output is correct
32 Correct 2 ms 1280 KB Output is correct

Subtask #5
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 436 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 344 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct

Subtask #6
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 436 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 344 KB Output is correct
20 Correct 0 ms 436 KB Output is correct
21 Correct 1 ms 344 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 344 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 0 ms 344 KB Output is correct
39 Correct 0 ms 344 KB Output is correct
40 Correct 0 ms 344 KB Output is correct
41 Correct 1 ms 348 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 0 ms 348 KB Output is correct
45 Correct 0 ms 348 KB Output is correct
46 Correct 1 ms 348 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Correct 0 ms 412 KB Output is correct
49 Correct 0 ms 344 KB Output is correct
50 Correct 0 ms 348 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 436 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 440 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 440 KB Output is correct
26 Correct 0 ms 344 KB Output is correct
27 Correct 0 ms 436 KB Output is correct
28 Correct 1 ms 344 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 0 ms 344 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 0 ms 348 KB Output is correct
41 Correct 0 ms 348 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 0 ms 348 KB Output is correct
45 Correct 0 ms 344 KB Output is correct
46 Correct 0 ms 344 KB Output is correct
47 Correct 0 ms 344 KB Output is correct
48 Correct 1 ms 348 KB Output is correct
49 Correct 0 ms 348 KB Output is correct
50 Correct 0 ms 348 KB Output is correct
51 Correct 0 ms 348 KB Output is correct
52 Correct 0 ms 348 KB Output is correct
53 Correct 1 ms 348 KB Output is correct
54 Correct 0 ms 348 KB Output is correct
55 Correct 0 ms 412 KB Output is correct
56 Correct 0 ms 344 KB Output is correct
57 Correct 0 ms 348 KB Output is correct
58 Correct 1 ms 348 KB Output is correct
59 Correct 1 ms 348 KB Output is correct
60 Correct 1 ms 348 KB Output is correct
61 Correct 0 ms 348 KB Output is correct
62 Correct 1 ms 348 KB Output is correct
63 Correct 1 ms 348 KB Output is correct
64 Correct 1 ms 344 KB Output is correct
65 Correct 1 ms 348 KB Output is correct
66 Correct 1 ms 348 KB Output is correct
67 Correct 1 ms 348 KB Output is correct
68 Correct 1 ms 348 KB Output is correct
69 Correct 1 ms 348 KB Output is correct
70 Correct 1 ms 344 KB Output is correct
71 Correct 1 ms 348 KB Output is correct
72 Correct 1 ms 348 KB Output is correct
73 Correct 1 ms 348 KB Output is correct
74 Correct 1 ms 344 KB Output is correct
75 Correct 1 ms 348 KB Output is correct

Subtask #8
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 436 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 440 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 440 KB Output is correct
26 Correct 2 ms 348 KB Output is correct
27 Correct 2 ms 956 KB Output is correct
28 Correct 2 ms 860 KB Output is correct
29 Correct 2 ms 860 KB Output is correct
30 Correct 2 ms 860 KB Output is correct
31 Correct 2 ms 860 KB Output is correct
32 Correct 2 ms 860 KB Output is correct
33 Correct 2 ms 1280 KB Output is correct
34 Correct 0 ms 344 KB Output is correct
35 Correct 0 ms 436 KB Output is correct
36 Correct 1 ms 344 KB Output is correct
37 Correct 1 ms 348 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 0 ms 348 KB Output is correct
41 Correct 0 ms 348 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 0 ms 344 KB Output is correct
45 Correct 0 ms 348 KB Output is correct
46 Correct 0 ms 348 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 0 ms 348 KB Output is correct
50 Correct 0 ms 348 KB Output is correct
51 Correct 0 ms 348 KB Output is correct
52 Correct 0 ms 348 KB Output is correct
53 Correct 0 ms 344 KB Output is correct
54 Correct 0 ms 344 KB Output is correct
55 Correct 0 ms 344 KB Output is correct
56 Correct 1 ms 348 KB Output is correct
57 Correct 0 ms 348 KB Output is correct
58 Correct 0 ms 348 KB Output is correct
59 Correct 0 ms 348 KB Output is correct
60 Correct 0 ms 348 KB Output is correct
61 Correct 1 ms 348 KB Output is correct
62 Correct 0 ms 348 KB Output is correct
63 Correct 0 ms 412 KB Output is correct
64 Correct 0 ms 344 KB Output is correct
65 Correct 0 ms 348 KB Output is correct
66 Correct 1 ms 348 KB Output is correct
67 Correct 1 ms 348 KB Output is correct
68 Correct 1 ms 348 KB Output is correct
69 Correct 0 ms 348 KB Output is correct
70 Correct 1 ms 348 KB Output is correct
71 Correct 1 ms 348 KB Output is correct
72 Correct 1 ms 344 KB Output is correct
73 Correct 1 ms 348 KB Output is correct
74 Correct 1 ms 348 KB Output is correct
75 Correct 1 ms 348 KB Output is correct
76 Correct 1 ms 348 KB Output is correct
77 Correct 1 ms 348 KB Output is correct
78 Correct 1 ms 344 KB Output is correct
79 Correct 1 ms 348 KB Output is correct
80 Correct 1 ms 348 KB Output is correct
81 Correct 1 ms 348 KB Output is correct
82 Correct 1 ms 344 KB Output is correct
83 Correct 1 ms 348 KB Output is correct
84 Correct 2 ms 344 KB Output is correct
85 Correct 1 ms 344 KB Output is correct
86 Correct 2 ms 344 KB Output is correct
87 Correct 2 ms 344 KB Output is correct
88 Correct 2 ms 348 KB Output is correct
89 Correct 2 ms 860 KB Output is correct
90 Correct 2 ms 860 KB Output is correct
91 Correct 2 ms 772 KB Output is correct
92 Correct 2 ms 860 KB Output is correct
93 Correct 2 ms 860 KB Output is correct
94 Correct 2 ms 860 KB Output is correct
95 Correct 2 ms 860 KB Output is correct
96 Correct 2 ms 948 KB Output is correct
97 Correct 2 ms 860 KB Output is correct
98 Correct 2 ms 900 KB Output is correct
99 Correct 2 ms 860 KB Output is correct
100 Correct 2 ms 860 KB Output is correct
101 Correct 2 ms 348 KB Output is correct

Subtask #9
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 436 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 440 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 1 ms 440 KB Output is correct
26 Correct 2 ms 348 KB Output is correct
27 Correct 2 ms 956 KB Output is correct
28 Correct 2 ms 860 KB Output is correct
29 Correct 2 ms 860 KB Output is correct
30 Correct 2 ms 860 KB Output is correct
31 Correct 2 ms 860 KB Output is correct
32 Correct 2 ms 860 KB Output is correct
33 Correct 2 ms 1280 KB Output is correct
34 Correct 0 ms 344 KB Output is correct
35 Correct 0 ms 436 KB Output is correct
36 Correct 1 ms 344 KB Output is correct
37 Correct 1 ms 348 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 0 ms 348 KB Output is correct
41 Correct 0 ms 348 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 0 ms 344 KB Output is correct
45 Correct 0 ms 348 KB Output is correct
46 Correct 0 ms 348 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 0 ms 348 KB Output is correct
50 Correct 0 ms 348 KB Output is correct
51 Correct 0 ms 348 KB Output is correct
52 Correct 0 ms 348 KB Output is correct
53 Correct 0 ms 344 KB Output is correct
54 Correct 0 ms 344 KB Output is correct
55 Correct 0 ms 344 KB Output is correct
56 Correct 1 ms 348 KB Output is correct
57 Correct 0 ms 348 KB Output is correct
58 Correct 0 ms 348 KB Output is correct
59 Correct 0 ms 348 KB Output is correct
60 Correct 0 ms 348 KB Output is correct
61 Correct 1 ms 348 KB Output is correct
62 Correct 0 ms 348 KB Output is correct
63 Correct 0 ms 412 KB Output is correct
64 Correct 0 ms 344 KB Output is correct
65 Correct 0 ms 348 KB Output is correct
66 Correct 1 ms 348 KB Output is correct
67 Correct 1 ms 348 KB Output is correct
68 Correct 1 ms 348 KB Output is correct
69 Correct 0 ms 348 KB Output is correct
70 Correct 1 ms 348 KB Output is correct
71 Correct 1 ms 348 KB Output is correct
72 Correct 1 ms 344 KB Output is correct
73 Correct 1 ms 348 KB Output is correct
74 Correct 1 ms 348 KB Output is correct
75 Correct 1 ms 348 KB Output is correct
76 Correct 1 ms 348 KB Output is correct
77 Correct 1 ms 348 KB Output is correct
78 Correct 1 ms 344 KB Output is correct
79 Correct 1 ms 348 KB Output is correct
80 Correct 1 ms 348 KB Output is correct
81 Correct 1 ms 348 KB Output is correct
82 Correct 1 ms 344 KB Output is correct
83 Correct 1 ms 348 KB Output is correct
84 Correct 2 ms 344 KB Output is correct
85 Correct 1 ms 344 KB Output is correct
86 Correct 2 ms 344 KB Output is correct
87 Correct 2 ms 344 KB Output is correct
88 Correct 2 ms 348 KB Output is correct
89 Correct 2 ms 860 KB Output is correct
90 Correct 2 ms 860 KB Output is correct
91 Correct 2 ms 772 KB Output is correct
92 Correct 2 ms 860 KB Output is correct
93 Correct 2 ms 860 KB Output is correct
94 Correct 2 ms 860 KB Output is correct
95 Correct 2 ms 860 KB Output is correct
96 Correct 2 ms 948 KB Output is correct
97 Correct 2 ms 860 KB Output is correct
98 Correct 2 ms 900 KB Output is correct
99 Correct 2 ms 860 KB Output is correct
100 Correct 2 ms 860 KB Output is correct
101 Correct 2 ms 348 KB Output is correct
102 Correct 80 ms 5468 KB Output is correct
103 Correct 79 ms 5456 KB Output is correct
104 Correct 139 ms 38016 KB Output is correct
105 Correct 91 ms 6744 KB Output is correct
106 Correct 95 ms 6660 KB Output is correct
107 Correct 65 ms 33108 KB Output is correct
108 Correct 67 ms 34044 KB Output is correct
109 Correct 97 ms 39156 KB Output is correct
110 Correct 159 ms 37136 KB Output is correct
111 Correct 102 ms 40984 KB Output is correct
112 Correct 154 ms 35364 KB Output is correct
113 Correct 144 ms 35296 KB Output is correct
114 Correct 141 ms 36312 KB Output is correct
115 Correct 88 ms 39880 KB Output is correct
116 Correct 159 ms 39360 KB Output is correct
117 Correct 176 ms 35400 KB Output is correct
118 Correct 156 ms 37764 KB Output is correct
119 Correct 105 ms 9952 KB Output is correct
120 Correct 79 ms 4944 KB Output is correct