oj.uz

Submission #916777

# Submission time Handle Problem Language Result Execution time Memory
916777 2024-01-26T13:57:37 Z green_gold_dog Road Closures (APIO21_roads) C++17
100 / 100
 140 ms 52736 KB 
//#pragma GCC optimize("Ofast")
//#pragma GCC target("avx,avx2,sse,sse2,sse3,ssse3,sse4,abm,popcnt,mmx")
#include <bits/stdc++.h>
#include "roads.h"

using namespace std;

typedef long long ll;
typedef double db;
typedef long double ldb;
typedef complex<double> cd;

constexpr ll INF64 = 9'000'000'000'000'000'000, INF32 = 2'000'000'000, MOD = 1'000'000'007;
constexpr db PI = acos(-1);
constexpr bool IS_FILE = false, IS_TEST_CASES = false;

random_device rd;
mt19937 rnd32(rd());
mt19937_64 rnd64(rd());

template<typename T>
bool assign_max(T& a, T b) {
        if (b > a) {
                a = b;
                return true;
        }
        return false;
}

template<typename T>
bool assign_min(T& a, T b) {
        if (b < a) {
                a = b;
                return true;
        }
        return false;
}

template<typename T>
T square(T a) {
        return a * a;
}

template<>
struct std::hash<pair<ll, ll>> {
        ll operator() (pair<ll, ll> p) const {
                return ((__int128)p.first * MOD + p.second) % INF64;
        }
};

void dfs(ll v, ll p, vector<vector<pair<ll, ll>>>& tree, vector<pair<vector<ll>, vector<ll>>>& dp) {
        ll rpc = INF32;
        ll nx = 0;
        ll ms = 0;
        for (auto[a, b] : tree[v]) {
                if (a == p) {
                      rpc = b;
                } else {
                      dfs(a, v, tree, dp);
                      assign_max(ms, (ll)dp[a].first.size());
                }
        }
        for (auto[a, b] : tree[v]) {
                if (a != p) {
                      if (dp[a].first.size() == ms) {
                        swap(dp[a], dp[v]);
                        nx = b;
                        break;
                      }
                }
        }
        while (dp[v].first.size() < tree[v].size()) {
                dp[v].first.push_back(0);
        }
        while (dp[v].second.size() < tree[v].size()) {
                dp[v].second.push_back(dp[v].first[dp[v].second.size()] + nx);
        }
        while (dp[v].second.size() > tree[v].size()) {
                dp[v].second.pop_back();
        }
        vector<pair<ll, ll>> sons;
        if (nx != 0) {
                sons.emplace_back(v, nx);
        }
        for (auto[a, b] : tree[v]) {
                if (!dp[a].first.empty()) {
                      sons.emplace_back(a, b);
                      for (ll j = tree[v].size(); j < dp[a].first.size(); j++) {
                        dp[v].first[j] += dp[a].first[j];
                      }
                }
        }
        multiset<ll> all;
        ll ns = 0;
        for (ll i = 0; i < tree[v].size(); i++) {
                vector<pair<ll, ll>> nsons;
                vector<ll> nall;
                ll na = 0;
                for (auto[a, b] : sons) {
                      if (dp[a].first.size() > i) {
                        na += dp[a].first[i];
                      }
                      if (dp[a].second.size() > i) {
                        nall.push_back(dp[a].second[i] - dp[a].first[i]);
                        nsons.emplace_back(a, b);
                      } else {
                        if (dp[a].first.size() <= i) {
                                all.insert(b);
                                ns += b;
                        } else {
                                nall.push_back(b);
                                nsons.emplace_back(a, b);
                        }
                      }
                }
                while (all.size() > (tree[v].size() - i)) {
                      ns -= *all.rbegin();
                      all.erase(all.find(*all.rbegin()));
                }
                auto it = all.rbegin();
                ll x = all.size();
                sort(nall.begin(), nall.end());
                na += ns;
                ll mx = 0;
                for (auto j : nall) {
                      if (x < (tree[v].size() - i)) {
                        assign_max(mx, j);
                        x++;
                        na += j;
                      } else {
                        if (it != all.rend() && *it > j) {
                                na += j;
                                na -= *it;
                                it++;
                                assign_max(mx, j);
                        }
                      }
                }
                if (it != all.rend()) {
                      assign_max(mx, *it);
                }
                if (i == 0) {
                      mx = 0;
                }
                dp[v].first[i] = na;
                dp[v].second[i] = na - mx + rpc;
                assign_min(dp[v].first[i], dp[v].second[i]);
                sons = nsons;
        }
}

vector<ll> minimum_closure_costs(int n, vector<int> u, vector<int> v, vector<int> w) {
        vector<vector<pair<ll, ll>>> tree(n);
        for (ll i = 0; i < u.size(); i++) {
                tree[u[i]].emplace_back(v[i], w[i]);
                tree[v[i]].emplace_back(u[i], w[i]);
        }
        vector<pair<vector<ll>, vector<ll>>> dp(n);
        dfs(0, 0, tree, dp);
        dp[0].first.resize(n, 0);
        return dp[0].first;
}

#ifdef LOCAL
int main() {
  int N;
  assert(1 == scanf("%d", &N));

  std::vector<int> U(N - 1), V(N - 1), W(N - 1);
  for (int i = 0; i < N - 1; ++i) {
    assert(3 == scanf("%d %d %d", &U[i], &V[i], &W[i]));
  }

  std::vector<long long> closure_costs = minimum_closure_costs(N, U, V, W);
  for (int i = 0; i < static_cast<int>(closure_costs.size()); ++i) {
    if (i > 0) {
      printf(" ");
    }
    printf("%lld",closure_costs[i]);
  }
  printf("\n");
  return 0;
}
#endif

Compilation message

roads.cpp: In function 'void dfs(ll, ll, std::vector<std::vector<std::pair<long long int, long long int> > >&, std::vector<std::pair<std::vector<long long int>, std::vector<long long int> > >&)':
roads.cpp:65:46: warning: comparison of integer expressions of different signedness: 'std::vector<long long int>::size_type' {aka 'long unsigned int'} and 'll' {aka 'long long int'} [-Wsign-compare]
   65 |                       if (dp[a].first.size() == ms) {
      |                           ~~~~~~~~~~~~~~~~~~~^~~~~
roads.cpp:88:53: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   88 |                       for (ll j = tree[v].size(); j < dp[a].first.size(); j++) {
      |                                                   ~~^~~~~~~~~~~~~~~~~~~~
roads.cpp:95:26: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   95 |         for (ll i = 0; i < tree[v].size(); i++) {
      |                        ~~^~~~~~~~~~~~~~~~
roads.cpp:100:46: warning: comparison of integer expressions of different signedness: 'std::vector<long long int>::size_type' {aka 'long unsigned int'} and 'll' {aka 'long long int'} [-Wsign-compare]
  100 |                       if (dp[a].first.size() > i) {
      |                           ~~~~~~~~~~~~~~~~~~~^~~
roads.cpp:103:47: warning: comparison of integer expressions of different signedness: 'std::vector<long long int>::size_type' {aka 'long unsigned int'} and 'll' {aka 'long long int'} [-Wsign-compare]
  103 |                       if (dp[a].second.size() > i) {
      |                           ~~~~~~~~~~~~~~~~~~~~^~~
roads.cpp:107:48: warning: comparison of integer expressions of different signedness: 'std::vector<long long int>::size_type' {aka 'long unsigned int'} and 'll' {aka 'long long int'} [-Wsign-compare]
  107 |                         if (dp[a].first.size() <= i) {
      |                             ~~~~~~~~~~~~~~~~~~~^~~~
roads.cpp:126:29: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'long long unsigned int' [-Wsign-compare]
  126 |                       if (x < (tree[v].size() - i)) {
      |                           ~~^~~~~~~~~~~~~~~~~~~~~~
roads.cpp: In function 'std::vector<long long int> minimum_closure_costs(int, std::vector<int>, std::vector<int>, std::vector<int>)':
roads.cpp:154:26: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  154 |         for (ll i = 0; i < u.size(); i++) {
      |                        ~~^~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 2 ms 860 KB Output is correct
3 Correct 2 ms 860 KB Output is correct
4 Correct 2 ms 856 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 2 ms 860 KB Output is correct
9 Correct 2 ms 860 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 56 ms 17348 KB Output is correct
13 Correct 110 ms 28612 KB Output is correct
14 Correct 111 ms 26048 KB Output is correct
15 Correct 114 ms 28352 KB Output is correct
16 Correct 119 ms 28860 KB Output is correct
17 Correct 140 ms 28612 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 91 ms 26276 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 64 ms 42024 KB Output is correct
3 Correct 72 ms 47184 KB Output is correct
4 Correct 79 ms 50508 KB Output is correct
5 Correct 77 ms 50512 KB Output is correct
6 Correct 2 ms 1116 KB Output is correct
7 Correct 2 ms 1368 KB Output is correct
8 Correct 2 ms 1116 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 44 ms 30324 KB Output is correct
13 Correct 82 ms 50508 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 68 ms 45784 KB Output is correct
16 Correct 74 ms 50512 KB Output is correct

Subtask #3
14.0 / 14.0

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

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 372 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 1 ms 680 KB Output is correct
24 Correct 2 ms 856 KB Output is correct
25 Correct 2 ms 856 KB Output is correct
26 Correct 2 ms 860 KB Output is correct
27 Correct 2 ms 860 KB Output is correct
28 Correct 2 ms 856 KB Output is correct
29 Correct 2 ms 604 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 1012 KB Output is correct
33 Correct 2 ms 1116 KB Output is correct
34 Correct 2 ms 1372 KB Output is correct
35 Correct 2 ms 1112 KB Output is correct
36 Correct 2 ms 860 KB Output is correct
37 Correct 2 ms 860 KB Output is correct
38 Correct 2 ms 856 KB Output is correct
39 Correct 0 ms 344 KB Output is correct
40 Correct 0 ms 348 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 1 ms 344 KB Output is correct
45 Correct 0 ms 348 KB Output is correct
46 Correct 1 ms 348 KB Output is correct
47 Correct 1 ms 344 KB Output is correct
48 Correct 1 ms 348 KB Output is correct
49 Correct 1 ms 348 KB Output is correct
50 Correct 1 ms 348 KB Output is correct
51 Correct 1 ms 348 KB Output is correct
52 Correct 1 ms 348 KB Output is correct
53 Correct 2 ms 600 KB Output is correct
54 Correct 2 ms 860 KB Output is correct
55 Correct 2 ms 948 KB Output is correct
56 Correct 2 ms 856 KB Output is correct
57 Correct 3 ms 860 KB Output is correct
58 Correct 0 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 0 ms 348 KB Output is correct
64 Correct 2 ms 604 KB Output is correct
65 Correct 2 ms 604 KB Output is correct
66 Correct 2 ms 860 KB Output is correct
67 Correct 2 ms 860 KB Output is correct
68 Correct 2 ms 860 KB Output is correct

Subtask #5
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 83 ms 18768 KB Output is correct
2 Correct 93 ms 18516 KB Output is correct
3 Correct 107 ms 24600 KB Output is correct
4 Correct 100 ms 19152 KB Output is correct
5 Correct 99 ms 25676 KB Output is correct
6 Correct 96 ms 23876 KB Output is correct
7 Correct 100 ms 23376 KB Output is correct
8 Correct 96 ms 28132 KB Output is correct
9 Correct 99 ms 33440 KB Output is correct
10 Correct 115 ms 21264 KB Output is correct
11 Correct 128 ms 25504 KB Output is correct
12 Correct 113 ms 26448 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 71 ms 46544 KB Output is correct
15 Correct 77 ms 51796 KB Output is correct
16 Correct 2 ms 860 KB Output is correct
17 Correct 2 ms 860 KB Output is correct
18 Correct 2 ms 856 KB Output is correct
19 Correct 2 ms 860 KB Output is correct
20 Correct 2 ms 860 KB Output is correct
21 Correct 91 ms 27084 KB Output is correct

Subtask #6
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 83 ms 18768 KB Output is correct
2 Correct 93 ms 18516 KB Output is correct
3 Correct 107 ms 24600 KB Output is correct
4 Correct 100 ms 19152 KB Output is correct
5 Correct 99 ms 25676 KB Output is correct
6 Correct 96 ms 23876 KB Output is correct
7 Correct 100 ms 23376 KB Output is correct
8 Correct 96 ms 28132 KB Output is correct
9 Correct 99 ms 33440 KB Output is correct
10 Correct 115 ms 21264 KB Output is correct
11 Correct 128 ms 25504 KB Output is correct
12 Correct 113 ms 26448 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 71 ms 46544 KB Output is correct
15 Correct 77 ms 51796 KB Output is correct
16 Correct 2 ms 860 KB Output is correct
17 Correct 2 ms 860 KB Output is correct
18 Correct 2 ms 856 KB Output is correct
19 Correct 2 ms 860 KB Output is correct
20 Correct 2 ms 860 KB Output is correct
21 Correct 91 ms 27084 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 452 KB Output is correct
25 Correct 106 ms 17708 KB Output is correct
26 Correct 72 ms 16156 KB Output is correct
27 Correct 94 ms 20816 KB Output is correct
28 Correct 106 ms 25792 KB Output is correct
29 Correct 98 ms 25088 KB Output is correct
30 Correct 99 ms 24404 KB Output is correct
31 Correct 102 ms 25388 KB Output is correct
32 Correct 86 ms 19744 KB Output is correct
33 Correct 114 ms 28608 KB Output is correct
34 Correct 94 ms 23376 KB Output is correct
35 Correct 116 ms 33776 KB Output is correct
36 Correct 128 ms 25424 KB Output is correct
37 Correct 104 ms 25160 KB Output is correct
38 Correct 45 ms 31060 KB Output is correct
39 Correct 74 ms 51880 KB Output is correct
40 Correct 2 ms 604 KB Output is correct
41 Correct 2 ms 860 KB Output is correct
42 Correct 2 ms 860 KB Output is correct
43 Correct 2 ms 860 KB Output is correct
44 Correct 2 ms 860 KB Output is correct
45 Correct 1 ms 348 KB Output is correct
46 Correct 1 ms 348 KB Output is correct
47 Correct 1 ms 348 KB Output is correct
48 Correct 1 ms 348 KB Output is correct
49 Correct 1 ms 348 KB Output is correct
50 Correct 58 ms 17872 KB Output is correct
51 Correct 113 ms 29632 KB Output is correct
52 Correct 81 ms 19976 KB Output is correct
53 Correct 78 ms 19540 KB Output is correct
54 Correct 107 ms 25864 KB Output is correct
55 Correct 88 ms 20612 KB Output is correct
56 Correct 98 ms 27112 KB Output is correct
57 Correct 110 ms 25396 KB Output is correct
58 Correct 93 ms 23376 KB Output is correct
59 Correct 94 ms 28132 KB Output is correct
60 Correct 103 ms 33364 KB Output is correct
61 Correct 86 ms 21012 KB Output is correct
62 Correct 95 ms 25416 KB Output is correct
63 Correct 97 ms 26620 KB Output is correct
64 Correct 0 ms 344 KB Output is correct
65 Correct 67 ms 46744 KB Output is correct
66 Correct 75 ms 51792 KB Output is correct
67 Correct 2 ms 856 KB Output is correct
68 Correct 2 ms 860 KB Output is correct
69 Correct 2 ms 860 KB Output is correct
70 Correct 2 ms 860 KB Output is correct
71 Correct 2 ms 860 KB Output is correct
72 Correct 91 ms 27092 KB Output is correct

Subtask #7
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 2 ms 860 KB Output is correct
3 Correct 2 ms 860 KB Output is correct
4 Correct 2 ms 856 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 2 ms 860 KB Output is correct
9 Correct 2 ms 860 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 56 ms 17348 KB Output is correct
13 Correct 110 ms 28612 KB Output is correct
14 Correct 111 ms 26048 KB Output is correct
15 Correct 114 ms 28352 KB Output is correct
16 Correct 119 ms 28860 KB Output is correct
17 Correct 140 ms 28612 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 91 ms 26276 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 64 ms 42024 KB Output is correct
22 Correct 72 ms 47184 KB Output is correct
23 Correct 79 ms 50508 KB Output is correct
24 Correct 77 ms 50512 KB Output is correct
25 Correct 2 ms 1116 KB Output is correct
26 Correct 2 ms 1368 KB Output is correct
27 Correct 2 ms 1116 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 1 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 44 ms 30324 KB Output is correct
32 Correct 82 ms 50508 KB Output is correct
33 Correct 0 ms 344 KB Output is correct
34 Correct 68 ms 45784 KB Output is correct
35 Correct 74 ms 50512 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 1 ms 348 KB Output is correct
40 Correct 1 ms 344 KB Output is correct
41 Correct 1 ms 348 KB Output is correct
42 Correct 1 ms 348 KB Output is correct
43 Correct 1 ms 344 KB Output is correct
44 Correct 1 ms 344 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 1 ms 348 KB Output is correct
49 Correct 1 ms 348 KB Output is correct
50 Correct 1 ms 348 KB Output is correct
51 Correct 0 ms 348 KB Output is correct
52 Correct 1 ms 372 KB Output is correct
53 Correct 1 ms 344 KB Output is correct
54 Correct 1 ms 348 KB Output is correct
55 Correct 0 ms 348 KB Output is correct
56 Correct 1 ms 348 KB Output is correct
57 Correct 0 ms 348 KB Output is correct
58 Correct 1 ms 680 KB Output is correct
59 Correct 2 ms 856 KB Output is correct
60 Correct 2 ms 856 KB Output is correct
61 Correct 2 ms 860 KB Output is correct
62 Correct 2 ms 860 KB Output is correct
63 Correct 2 ms 856 KB Output is correct
64 Correct 2 ms 604 KB Output is correct
65 Correct 2 ms 860 KB Output is correct
66 Correct 2 ms 860 KB Output is correct
67 Correct 2 ms 1012 KB Output is correct
68 Correct 2 ms 1116 KB Output is correct
69 Correct 2 ms 1372 KB Output is correct
70 Correct 2 ms 1112 KB Output is correct
71 Correct 2 ms 860 KB Output is correct
72 Correct 2 ms 860 KB Output is correct
73 Correct 2 ms 856 KB Output is correct
74 Correct 0 ms 344 KB Output is correct
75 Correct 0 ms 348 KB Output is correct
76 Correct 1 ms 348 KB Output is correct
77 Correct 0 ms 348 KB Output is correct
78 Correct 0 ms 348 KB Output is correct
79 Correct 1 ms 344 KB Output is correct
80 Correct 0 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 1 ms 348 KB Output is correct
85 Correct 1 ms 348 KB Output is correct
86 Correct 1 ms 348 KB Output is correct
87 Correct 1 ms 348 KB Output is correct
88 Correct 2 ms 600 KB Output is correct
89 Correct 2 ms 860 KB Output is correct
90 Correct 2 ms 948 KB Output is correct
91 Correct 2 ms 856 KB Output is correct
92 Correct 3 ms 860 KB Output is correct
93 Correct 0 ms 348 KB Output is correct
94 Correct 1 ms 348 KB Output is correct
95 Correct 1 ms 348 KB Output is correct
96 Correct 0 ms 348 KB Output is correct
97 Correct 1 ms 348 KB Output is correct
98 Correct 0 ms 348 KB Output is correct
99 Correct 2 ms 604 KB Output is correct
100 Correct 2 ms 604 KB Output is correct
101 Correct 2 ms 860 KB Output is correct
102 Correct 2 ms 860 KB Output is correct
103 Correct 2 ms 860 KB Output is correct
104 Correct 83 ms 18768 KB Output is correct
105 Correct 93 ms 18516 KB Output is correct
106 Correct 107 ms 24600 KB Output is correct
107 Correct 100 ms 19152 KB Output is correct
108 Correct 99 ms 25676 KB Output is correct
109 Correct 96 ms 23876 KB Output is correct
110 Correct 100 ms 23376 KB Output is correct
111 Correct 96 ms 28132 KB Output is correct
112 Correct 99 ms 33440 KB Output is correct
113 Correct 115 ms 21264 KB Output is correct
114 Correct 128 ms 25504 KB Output is correct
115 Correct 113 ms 26448 KB Output is correct
116 Correct 0 ms 344 KB Output is correct
117 Correct 71 ms 46544 KB Output is correct
118 Correct 77 ms 51796 KB Output is correct
119 Correct 2 ms 860 KB Output is correct
120 Correct 2 ms 860 KB Output is correct
121 Correct 2 ms 856 KB Output is correct
122 Correct 2 ms 860 KB Output is correct
123 Correct 2 ms 860 KB Output is correct
124 Correct 91 ms 27084 KB Output is correct
125 Correct 1 ms 348 KB Output is correct
126 Correct 0 ms 348 KB Output is correct
127 Correct 0 ms 452 KB Output is correct
128 Correct 106 ms 17708 KB Output is correct
129 Correct 72 ms 16156 KB Output is correct
130 Correct 94 ms 20816 KB Output is correct
131 Correct 106 ms 25792 KB Output is correct
132 Correct 98 ms 25088 KB Output is correct
133 Correct 99 ms 24404 KB Output is correct
134 Correct 102 ms 25388 KB Output is correct
135 Correct 86 ms 19744 KB Output is correct
136 Correct 114 ms 28608 KB Output is correct
137 Correct 94 ms 23376 KB Output is correct
138 Correct 116 ms 33776 KB Output is correct
139 Correct 128 ms 25424 KB Output is correct
140 Correct 104 ms 25160 KB Output is correct
141 Correct 45 ms 31060 KB Output is correct
142 Correct 74 ms 51880 KB Output is correct
143 Correct 2 ms 604 KB Output is correct
144 Correct 2 ms 860 KB Output is correct
145 Correct 2 ms 860 KB Output is correct
146 Correct 2 ms 860 KB Output is correct
147 Correct 2 ms 860 KB Output is correct
148 Correct 1 ms 348 KB Output is correct
149 Correct 1 ms 348 KB Output is correct
150 Correct 1 ms 348 KB Output is correct
151 Correct 1 ms 348 KB Output is correct
152 Correct 1 ms 348 KB Output is correct
153 Correct 58 ms 17872 KB Output is correct
154 Correct 113 ms 29632 KB Output is correct
155 Correct 81 ms 19976 KB Output is correct
156 Correct 78 ms 19540 KB Output is correct
157 Correct 107 ms 25864 KB Output is correct
158 Correct 88 ms 20612 KB Output is correct
159 Correct 98 ms 27112 KB Output is correct
160 Correct 110 ms 25396 KB Output is correct
161 Correct 93 ms 23376 KB Output is correct
162 Correct 94 ms 28132 KB Output is correct
163 Correct 103 ms 33364 KB Output is correct
164 Correct 86 ms 21012 KB Output is correct
165 Correct 95 ms 25416 KB Output is correct
166 Correct 97 ms 26620 KB Output is correct
167 Correct 0 ms 344 KB Output is correct
168 Correct 67 ms 46744 KB Output is correct
169 Correct 75 ms 51792 KB Output is correct
170 Correct 2 ms 856 KB Output is correct
171 Correct 2 ms 860 KB Output is correct
172 Correct 2 ms 860 KB Output is correct
173 Correct 2 ms 860 KB Output is correct
174 Correct 2 ms 860 KB Output is correct
175 Correct 91 ms 27092 KB Output is correct
176 Correct 1 ms 348 KB Output is correct
177 Correct 87 ms 21208 KB Output is correct
178 Correct 67 ms 16632 KB Output is correct
179 Correct 100 ms 25940 KB Output is correct
180 Correct 98 ms 26196 KB Output is correct
181 Correct 135 ms 28360 KB Output is correct
182 Correct 100 ms 28072 KB Output is correct
183 Correct 95 ms 23484 KB Output is correct
184 Correct 95 ms 25696 KB Output is correct
185 Correct 99 ms 25328 KB Output is correct
186 Correct 93 ms 23964 KB Output is correct
187 Correct 119 ms 30660 KB Output is correct
188 Correct 86 ms 19640 KB Output is correct
189 Correct 88 ms 20816 KB Output is correct
190 Correct 107 ms 26244 KB Output is correct
191 Correct 92 ms 25424 KB Output is correct
192 Correct 106 ms 26940 KB Output is correct
193 Correct 107 ms 26944 KB Output is correct
194 Correct 103 ms 26508 KB Output is correct
195 Correct 65 ms 43600 KB Output is correct
196 Correct 79 ms 49248 KB Output is correct
197 Correct 78 ms 52560 KB Output is correct
198 Correct 79 ms 52736 KB Output is correct
199 Correct 1 ms 604 KB Output is correct
200 Correct 2 ms 860 KB Output is correct
201 Correct 2 ms 740 KB Output is correct
202 Correct 2 ms 712 KB Output is correct
203 Correct 2 ms 860 KB Output is correct
204 Correct 2 ms 860 KB Output is correct
205 Correct 2 ms 604 KB Output is correct
206 Correct 2 ms 860 KB Output is correct
207 Correct 2 ms 860 KB Output is correct
208 Correct 2 ms 972 KB Output is correct
209 Correct 2 ms 1112 KB Output is correct
210 Correct 2 ms 1372 KB Output is correct
211 Correct 2 ms 1352 KB Output is correct
212 Correct 2 ms 860 KB Output is correct
213 Correct 2 ms 860 KB Output is correct
214 Correct 2 ms 860 KB Output is correct
215 Correct 0 ms 348 KB Output is correct
216 Correct 0 ms 348 KB Output is correct
217 Correct 1 ms 348 KB Output is correct
218 Correct 1 ms 348 KB Output is correct
219 Correct 1 ms 348 KB Output is correct
220 Correct 1 ms 348 KB Output is correct
221 Correct 1 ms 348 KB Output is correct
222 Correct 1 ms 348 KB Output is correct
223 Correct 0 ms 348 KB Output is correct
224 Correct 0 ms 348 KB Output is correct
225 Correct 1 ms 388 KB Output is correct
226 Correct 1 ms 348 KB Output is correct
227 Correct 1 ms 348 KB Output is correct
228 Correct 1 ms 348 KB Output is correct
229 Correct 73 ms 17728 KB Output is correct
230 Correct 64 ms 15956 KB Output is correct
231 Correct 103 ms 20820 KB Output is correct
232 Correct 98 ms 25936 KB Output is correct
233 Correct 93 ms 24912 KB Output is correct
234 Correct 94 ms 24420 KB Output is correct
235 Correct 110 ms 25424 KB Output is correct
236 Correct 96 ms 19800 KB Output is correct
237 Correct 102 ms 28612 KB Output is correct
238 Correct 98 ms 23440 KB Output is correct
239 Correct 118 ms 33876 KB Output is correct
240 Correct 111 ms 25428 KB Output is correct
241 Correct 100 ms 25120 KB Output is correct
242 Correct 47 ms 31056 KB Output is correct
243 Correct 77 ms 51796 KB Output is correct
244 Correct 2 ms 860 KB Output is correct
245 Correct 2 ms 860 KB Output is correct
246 Correct 2 ms 860 KB Output is correct
247 Correct 2 ms 712 KB Output is correct
248 Correct 2 ms 804 KB Output is correct
249 Correct 1 ms 344 KB Output is correct
250 Correct 1 ms 348 KB Output is correct
251 Correct 1 ms 348 KB Output is correct
252 Correct 1 ms 348 KB Output is correct
253 Correct 1 ms 348 KB Output is correct
254 Correct 56 ms 17864 KB Output is correct
255 Correct 112 ms 29636 KB Output is correct
256 Correct 101 ms 27368 KB Output is correct
257 Correct 113 ms 30144 KB Output is correct
258 Correct 117 ms 30404 KB Output is correct
259 Correct 128 ms 30868 KB Output is correct
260 Correct 97 ms 20072 KB Output is correct
261 Correct 86 ms 19664 KB Output is correct
262 Correct 96 ms 25944 KB Output is correct
263 Correct 99 ms 20552 KB Output is correct
264 Correct 98 ms 27048 KB Output is correct
265 Correct 100 ms 25368 KB Output is correct
266 Correct 107 ms 23376 KB Output is correct
267 Correct 95 ms 28096 KB Output is correct
268 Correct 106 ms 33244 KB Output is correct
269 Correct 114 ms 21076 KB Output is correct
270 Correct 94 ms 25424 KB Output is correct
271 Correct 100 ms 26532 KB Output is correct
272 Correct 0 ms 348 KB Output is correct
273 Correct 85 ms 46676 KB Output is correct
274 Correct 75 ms 51796 KB Output is correct
275 Correct 2 ms 856 KB Output is correct
276 Correct 2 ms 860 KB Output is correct
277 Correct 2 ms 860 KB Output is correct
278 Correct 2 ms 860 KB Output is correct
279 Correct 2 ms 860 KB Output is correct
280 Correct 90 ms 27144 KB Output is correct