oj.uz

Submission #727644

# Submission time Handle Problem Language Result Execution time Memory
727644 2023-04-21T04:48:30 Z marvinthang Road Closures (APIO21_roads) C++17
100 / 100
 327 ms 71752 KB 
/*************************************
*    author: marvinthang             *
*    created: 21.04.2023 10:12:13    *
*************************************/

#include "roads.h"
#include <bits/stdc++.h>

using namespace std;

#define                  fi  first
#define                  se  second
#define                left  ___left
#define               right  ___right
#define                TIME  (1.0 * clock() / CLOCKS_PER_SEC)
#define             MASK(i)  (1LL << (i))
#define           BIT(x, i)  ((x) >> (i) & 1)
#define  __builtin_popcount  __builtin_popcountll
#define              ALL(v)  (v).begin(), (v).end()
#define           REP(i, n)  for (int i = 0, _n = (n); i < _n; ++i)
#define          REPD(i, n)  for (int i = (n); i--; )
#define        FOR(i, a, b)  for (int i = (a), _b = (b); i < _b; ++i) 
#define       FORD(i, b, a)  for (int i = (b), _a = (a); --i >= _a; ) 
#define       FORE(i, a, b)  for (int i = (a), _b = (b); i <= _b; ++i) 
#define      FORDE(i, b, a)  for (int i = (b), _a = (a); i >= _a; --i) 
#define        scan_op(...)  istream & operator >> (istream &in, __VA_ARGS__ &u)
#define       print_op(...)  ostream & operator << (ostream &out, const __VA_ARGS__ &u)
#ifdef LOCAL
    #include "debug.h"
#else
    #define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
    #define DB(...) 23
    #define db(...) 23
    #define debug(...) 23
#endif

template <class U, class V> scan_op(pair <U, V>)  { return in >> u.first >> u.second; }
template <class T> scan_op(vector <T>)  { for (size_t i = 0; i < u.size(); ++i) in >> u[i]; return in; }
template <class U, class V> print_op(pair <U, V>)  { return out << '(' << u.first << ", " << u.second << ')'; }
template <size_t i, class T> ostream & print_tuple_utils(ostream &out, const T &tup) { if constexpr(i == tuple_size<T>::value) return out << ")";  else return print_tuple_utils<i + 1, T>(out << (i ? ", " : "(") << get<i>(tup), tup); }
template <class ...U> print_op(tuple<U...>) { return print_tuple_utils<0, tuple<U...>>(out, u); }
template <class Con, class = decltype(begin(declval<Con>()))> typename enable_if <!is_same<Con, string>::value, ostream&>::type operator << (ostream &out, const Con &con) { out << '{'; for (__typeof(con.begin()) it = con.begin(); it != con.end(); ++it) out << (it == con.begin() ? "" : ", ") << *it; return out << '}'; }
template <class A, class B> bool minimize(A &a, B b)  { if (a > b) { a = b; return true; } return false; }
template <class A, class B> bool maximize(A &a, B b)  { if (a < b) { a = b; return true; } return false; }

// index from 0
template <class T = int>
    struct Fenwick {

        T *bit = nullptr;
        int n;

        Fenwick(int _n = 0) {
            resize(_n);
        }

        void reset(void) {
            fill(bit, bit + 1 + n, T(0));
        }

        void resize(int _n) {
            if (bit != nullptr) delete[] bit;
            n = _n;
            bit = new T[n + 1];
            reset();
        }

        void update(int i, T val) {
            assert(0 <= i);
            ++i;
            for (; i <= n; i += i & -i) bit[i] += val;
        }

        T get(int i) {
            if (i < 0) return T(0);
            ++i;
            i = min(i, n);
            T res(0);
            for (; i > 0; i -= i & -i)
                res += bit[i];
            return res;
        }

        int upper_bound(T val) {
            int res = 0;
            for (int i = __lg(n); i >= 0; --i) {
                if ((res | MASK(i)) <= n && val >= bit[res | MASK(i)]) {
                    res |= MASK(i);
                    val -= bit[res];
                }
            }
            return res;
        }

        int lower_bound(T val) {
            int res = 0;
            for (int i = __lg(n); i >= 0; --i) {
                if ((res | MASK(i)) <= n && val > bit[res | MASK(i)]) {
                    res |= MASK(i);
                    val -= bit[res];
                }
            }
            return res;
        }

    };

// end of template

const int MAX = 1e5 + 5;
const long long INF = 1e18;

int N, K, visited[MAX];
long long dp[MAX][2];
set <pair <int, int>, greater <pair <int, int>>> adj[MAX];
vector <int> values[MAX];
Fenwick <int> cnt[MAX];
Fenwick <long long> sum[MAX];
map <int, int> id[MAX];

void dfs(int u) {
    dp[u][0] = INF; dp[u][1] = 0;
    visited[u] = K;
    vector <long long> change;
    for (auto [w, v]: adj[u]) if (visited[v] != K) {
        dfs(v);
        dp[u][1] += dp[v][1] + w;
        if (dp[v][0] < dp[v][1] + w) change.push_back(dp[v][0] - dp[v][1] - w);
    }
    sort(ALL(change));
    if (K) {
        dp[u][1] += sum[u].get(values[u].size());
        long long res = INF;
        REP(i, min((int) change.size(), K) + 1) {
            int need = K - i;
            int p = cnt[u].lower_bound(need);
            long long cur = dp[u][1] - sum[u].get(p);
            long long ma = -INF;
            if (p && p <= values[u].size()) ma = -values[u][p - 1];
            else ma = 0;
            if (i) maximize(ma, change[i - 1]);
            if (i == K) ma = change[i - 1];
            minimize(res, cur);
            minimize(dp[u][0], cur - ma);
            if (i < change.size()) dp[u][1] += change[i];
        }
        dp[u][1] = res;
    }
}

vector <long long> minimum_closure_costs(int n, vector<int> U, vector<int> V, vector<int> W) {
    N = n;
    REP(i, N - 1) {
        adj[U[i]].insert(make_pair(W[i], V[i]));
        adj[V[i]].insert(make_pair(W[i], U[i]));
    }
    vector <pair <int, int>> pos;
    REP(i, N) pos.emplace_back(adj[i].size(), i);
    sort(ALL(pos));
    vector <long long> res(N);
    int ptr = 0;
    memset(visited, -1, N * sizeof(int));
    REP(u, N) {
        int c = 0;
        set <pair <int, int>> nxt;
        for (auto [w, v]: adj[u]) {
            values[u].push_back(w);
            id[u][v] = ++c;
        }
        cnt[u].resize(c + 1);
        sum[u].resize(c + 1);
    }
    REP(k, N) {
        K = k;
        while (ptr < N && pos[ptr].fi <= K) {
            int u = pos[ptr++].se;
            for (auto [w, v]: adj[u]) {
                adj[v].erase(make_pair(w, u));
                int x = id[v][u];
                cnt[v].update(x, +1);
                sum[v].update(x, +w);
            }
        }
        FOR(i, ptr, N) {
            int u = pos[i].se;
            if (visited[u] == K) continue;
            dfs(u);
            res[K] += dp[u][1];
        }
    }
    return res;
}

#ifdef LOCAL
#include "roads.h"

#include <cassert>
#include <cstdio>

#include <vector>

int main() {
    file("roads");
  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(int)':
roads.cpp:139:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  139 |             if (p && p <= values[u].size()) ma = -values[u][p - 1];
      |                      ~~^~~~~~~~~~~~~~~~~~~
roads.cpp:145:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  145 |             if (i < change.size()) dp[u][1] += change[i];
      |                 ~~^~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 21332 KB Output is correct
2 Correct 17 ms 22020 KB Output is correct
3 Correct 17 ms 22104 KB Output is correct
4 Correct 18 ms 22020 KB Output is correct
5 Correct 14 ms 21480 KB Output is correct
6 Correct 16 ms 21424 KB Output is correct
7 Correct 16 ms 21492 KB Output is correct
8 Correct 18 ms 21972 KB Output is correct
9 Correct 17 ms 21948 KB Output is correct
10 Correct 16 ms 21432 KB Output is correct
11 Correct 16 ms 21456 KB Output is correct
12 Correct 129 ms 39436 KB Output is correct
13 Correct 227 ms 51776 KB Output is correct
14 Correct 263 ms 49200 KB Output is correct
15 Correct 285 ms 52236 KB Output is correct
16 Correct 287 ms 52424 KB Output is correct
17 Correct 211 ms 52556 KB Output is correct
18 Correct 15 ms 21332 KB Output is correct
19 Correct 189 ms 48880 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 21376 KB Output is correct
2 Correct 114 ms 61760 KB Output is correct
3 Correct 125 ms 68460 KB Output is correct
4 Correct 133 ms 71744 KB Output is correct
5 Correct 133 ms 71744 KB Output is correct
6 Correct 16 ms 22220 KB Output is correct
7 Correct 17 ms 22356 KB Output is correct
8 Correct 16 ms 22236 KB Output is correct
9 Correct 14 ms 21456 KB Output is correct
10 Correct 15 ms 21452 KB Output is correct
11 Correct 15 ms 21532 KB Output is correct
12 Correct 80 ms 51012 KB Output is correct
13 Correct 126 ms 70820 KB Output is correct
14 Correct 16 ms 21432 KB Output is correct
15 Correct 117 ms 65948 KB Output is correct
16 Correct 130 ms 70924 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 21332 KB Output is correct
2 Correct 13 ms 21460 KB Output is correct
3 Correct 14 ms 21444 KB Output is correct
4 Correct 14 ms 21460 KB Output is correct
5 Correct 14 ms 21448 KB Output is correct
6 Correct 15 ms 21416 KB Output is correct
7 Correct 22 ms 21472 KB Output is correct
8 Correct 14 ms 21452 KB Output is correct
9 Correct 20 ms 21452 KB Output is correct
10 Correct 14 ms 21460 KB Output is correct
11 Correct 15 ms 21496 KB Output is correct
12 Correct 14 ms 21456 KB Output is correct
13 Correct 15 ms 21452 KB Output is correct
14 Correct 14 ms 21452 KB Output is correct
15 Correct 16 ms 21468 KB Output is correct
16 Correct 14 ms 21460 KB Output is correct
17 Correct 16 ms 21472 KB Output is correct
18 Correct 15 ms 21444 KB Output is correct
19 Correct 16 ms 21460 KB Output is correct
20 Correct 16 ms 21460 KB Output is correct
21 Correct 21 ms 21368 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 21332 KB Output is correct
2 Correct 13 ms 21460 KB Output is correct
3 Correct 14 ms 21444 KB Output is correct
4 Correct 14 ms 21460 KB Output is correct
5 Correct 14 ms 21448 KB Output is correct
6 Correct 15 ms 21416 KB Output is correct
7 Correct 22 ms 21472 KB Output is correct
8 Correct 14 ms 21452 KB Output is correct
9 Correct 20 ms 21452 KB Output is correct
10 Correct 14 ms 21460 KB Output is correct
11 Correct 15 ms 21496 KB Output is correct
12 Correct 14 ms 21456 KB Output is correct
13 Correct 15 ms 21452 KB Output is correct
14 Correct 14 ms 21452 KB Output is correct
15 Correct 16 ms 21468 KB Output is correct
16 Correct 14 ms 21460 KB Output is correct
17 Correct 16 ms 21472 KB Output is correct
18 Correct 15 ms 21444 KB Output is correct
19 Correct 16 ms 21460 KB Output is correct
20 Correct 16 ms 21460 KB Output is correct
21 Correct 21 ms 21368 KB Output is correct
22 Correct 23 ms 21408 KB Output is correct
23 Correct 16 ms 21720 KB Output is correct
24 Correct 17 ms 22092 KB Output is correct
25 Correct 25 ms 21952 KB Output is correct
26 Correct 18 ms 21972 KB Output is correct
27 Correct 17 ms 21972 KB Output is correct
28 Correct 16 ms 21972 KB Output is correct
29 Correct 18 ms 21968 KB Output is correct
30 Correct 20 ms 21980 KB Output is correct
31 Correct 18 ms 22072 KB Output is correct
32 Correct 18 ms 21972 KB Output is correct
33 Correct 17 ms 22264 KB Output is correct
34 Correct 19 ms 22356 KB Output is correct
35 Correct 16 ms 22228 KB Output is correct
36 Correct 20 ms 21964 KB Output is correct
37 Correct 18 ms 22100 KB Output is correct
38 Correct 17 ms 22100 KB Output is correct
39 Correct 14 ms 21452 KB Output is correct
40 Correct 14 ms 21364 KB Output is correct
41 Correct 14 ms 21468 KB Output is correct
42 Correct 14 ms 21460 KB Output is correct
43 Correct 14 ms 21440 KB Output is correct
44 Correct 16 ms 21432 KB Output is correct
45 Correct 19 ms 21452 KB Output is correct
46 Correct 15 ms 21460 KB Output is correct
47 Correct 16 ms 21448 KB Output is correct
48 Correct 17 ms 21452 KB Output is correct
49 Correct 17 ms 21536 KB Output is correct
50 Correct 22 ms 21460 KB Output is correct
51 Correct 17 ms 21436 KB Output is correct
52 Correct 19 ms 21520 KB Output is correct
53 Correct 18 ms 21852 KB Output is correct
54 Correct 18 ms 21972 KB Output is correct
55 Correct 20 ms 22004 KB Output is correct
56 Correct 26 ms 21848 KB Output is correct
57 Correct 23 ms 22020 KB Output is correct
58 Correct 20 ms 21460 KB Output is correct
59 Correct 15 ms 21500 KB Output is correct
60 Correct 16 ms 21464 KB Output is correct
61 Correct 14 ms 21452 KB Output is correct
62 Correct 14 ms 21444 KB Output is correct
63 Correct 15 ms 21420 KB Output is correct
64 Correct 18 ms 21976 KB Output is correct
65 Correct 18 ms 21972 KB Output is correct
66 Correct 21 ms 21944 KB Output is correct
67 Correct 21 ms 21968 KB Output is correct
68 Correct 21 ms 22056 KB Output is correct

Subtask #5
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 287 ms 50120 KB Output is correct
2 Correct 278 ms 49520 KB Output is correct
3 Correct 280 ms 51532 KB Output is correct
4 Correct 300 ms 51008 KB Output is correct
5 Correct 271 ms 51428 KB Output is correct
6 Correct 244 ms 51232 KB Output is correct
7 Correct 267 ms 52096 KB Output is correct
8 Correct 203 ms 49820 KB Output is correct
9 Correct 255 ms 56964 KB Output is correct
10 Correct 267 ms 50972 KB Output is correct
11 Correct 259 ms 52176 KB Output is correct
12 Correct 230 ms 52160 KB Output is correct
13 Correct 15 ms 21452 KB Output is correct
14 Correct 114 ms 65964 KB Output is correct
15 Correct 125 ms 70908 KB Output is correct
16 Correct 17 ms 22012 KB Output is correct
17 Correct 17 ms 21972 KB Output is correct
18 Correct 19 ms 21996 KB Output is correct
19 Correct 17 ms 21996 KB Output is correct
20 Correct 17 ms 21972 KB Output is correct
21 Correct 183 ms 48836 KB Output is correct

Subtask #6
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 287 ms 50120 KB Output is correct
2 Correct 278 ms 49520 KB Output is correct
3 Correct 280 ms 51532 KB Output is correct
4 Correct 300 ms 51008 KB Output is correct
5 Correct 271 ms 51428 KB Output is correct
6 Correct 244 ms 51232 KB Output is correct
7 Correct 267 ms 52096 KB Output is correct
8 Correct 203 ms 49820 KB Output is correct
9 Correct 255 ms 56964 KB Output is correct
10 Correct 267 ms 50972 KB Output is correct
11 Correct 259 ms 52176 KB Output is correct
12 Correct 230 ms 52160 KB Output is correct
13 Correct 15 ms 21452 KB Output is correct
14 Correct 114 ms 65964 KB Output is correct
15 Correct 125 ms 70908 KB Output is correct
16 Correct 17 ms 22012 KB Output is correct
17 Correct 17 ms 21972 KB Output is correct
18 Correct 19 ms 21996 KB Output is correct
19 Correct 17 ms 21996 KB Output is correct
20 Correct 17 ms 21972 KB Output is correct
21 Correct 183 ms 48836 KB Output is correct
22 Correct 15 ms 21460 KB Output is correct
23 Correct 15 ms 21460 KB Output is correct
24 Correct 17 ms 21332 KB Output is correct
25 Correct 232 ms 47504 KB Output is correct
26 Correct 197 ms 44988 KB Output is correct
27 Correct 285 ms 51912 KB Output is correct
28 Correct 279 ms 52372 KB Output is correct
29 Correct 255 ms 49864 KB Output is correct
30 Correct 236 ms 50948 KB Output is correct
31 Correct 232 ms 51780 KB Output is correct
32 Correct 252 ms 49224 KB Output is correct
33 Correct 223 ms 50368 KB Output is correct
34 Correct 298 ms 52156 KB Output is correct
35 Correct 299 ms 60352 KB Output is correct
36 Correct 273 ms 52288 KB Output is correct
37 Correct 234 ms 52220 KB Output is correct
38 Correct 83 ms 51048 KB Output is correct
39 Correct 124 ms 70844 KB Output is correct
40 Correct 16 ms 21848 KB Output is correct
41 Correct 16 ms 21972 KB Output is correct
42 Correct 17 ms 21972 KB Output is correct
43 Correct 17 ms 21948 KB Output is correct
44 Correct 17 ms 22100 KB Output is correct
45 Correct 16 ms 21460 KB Output is correct
46 Correct 16 ms 21476 KB Output is correct
47 Correct 15 ms 21408 KB Output is correct
48 Correct 16 ms 21488 KB Output is correct
49 Correct 14 ms 21460 KB Output is correct
50 Correct 127 ms 39620 KB Output is correct
51 Correct 231 ms 51900 KB Output is correct
52 Correct 260 ms 50812 KB Output is correct
53 Correct 252 ms 50372 KB Output is correct
54 Correct 253 ms 52304 KB Output is correct
55 Correct 269 ms 51820 KB Output is correct
56 Correct 264 ms 52364 KB Output is correct
57 Correct 233 ms 52032 KB Output is correct
58 Correct 257 ms 52048 KB Output is correct
59 Correct 190 ms 49852 KB Output is correct
60 Correct 253 ms 56912 KB Output is correct
61 Correct 257 ms 50992 KB Output is correct
62 Correct 252 ms 52232 KB Output is correct
63 Correct 227 ms 52048 KB Output is correct
64 Correct 14 ms 21332 KB Output is correct
65 Correct 118 ms 65976 KB Output is correct
66 Correct 130 ms 70848 KB Output is correct
67 Correct 21 ms 22024 KB Output is correct
68 Correct 18 ms 22056 KB Output is correct
69 Correct 17 ms 21976 KB Output is correct
70 Correct 18 ms 21972 KB Output is correct
71 Correct 17 ms 21972 KB Output is correct
72 Correct 187 ms 48868 KB Output is correct

Subtask #7
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 21332 KB Output is correct
2 Correct 17 ms 22020 KB Output is correct
3 Correct 17 ms 22104 KB Output is correct
4 Correct 18 ms 22020 KB Output is correct
5 Correct 14 ms 21480 KB Output is correct
6 Correct 16 ms 21424 KB Output is correct
7 Correct 16 ms 21492 KB Output is correct
8 Correct 18 ms 21972 KB Output is correct
9 Correct 17 ms 21948 KB Output is correct
10 Correct 16 ms 21432 KB Output is correct
11 Correct 16 ms 21456 KB Output is correct
12 Correct 129 ms 39436 KB Output is correct
13 Correct 227 ms 51776 KB Output is correct
14 Correct 263 ms 49200 KB Output is correct
15 Correct 285 ms 52236 KB Output is correct
16 Correct 287 ms 52424 KB Output is correct
17 Correct 211 ms 52556 KB Output is correct
18 Correct 15 ms 21332 KB Output is correct
19 Correct 189 ms 48880 KB Output is correct
20 Correct 15 ms 21376 KB Output is correct
21 Correct 114 ms 61760 KB Output is correct
22 Correct 125 ms 68460 KB Output is correct
23 Correct 133 ms 71744 KB Output is correct
24 Correct 133 ms 71744 KB Output is correct
25 Correct 16 ms 22220 KB Output is correct
26 Correct 17 ms 22356 KB Output is correct
27 Correct 16 ms 22236 KB Output is correct
28 Correct 14 ms 21456 KB Output is correct
29 Correct 15 ms 21452 KB Output is correct
30 Correct 15 ms 21532 KB Output is correct
31 Correct 80 ms 51012 KB Output is correct
32 Correct 126 ms 70820 KB Output is correct
33 Correct 16 ms 21432 KB Output is correct
34 Correct 117 ms 65948 KB Output is correct
35 Correct 130 ms 70924 KB Output is correct
36 Correct 13 ms 21332 KB Output is correct
37 Correct 13 ms 21460 KB Output is correct
38 Correct 14 ms 21444 KB Output is correct
39 Correct 14 ms 21460 KB Output is correct
40 Correct 14 ms 21448 KB Output is correct
41 Correct 15 ms 21416 KB Output is correct
42 Correct 22 ms 21472 KB Output is correct
43 Correct 14 ms 21452 KB Output is correct
44 Correct 20 ms 21452 KB Output is correct
45 Correct 14 ms 21460 KB Output is correct
46 Correct 15 ms 21496 KB Output is correct
47 Correct 14 ms 21456 KB Output is correct
48 Correct 15 ms 21452 KB Output is correct
49 Correct 14 ms 21452 KB Output is correct
50 Correct 16 ms 21468 KB Output is correct
51 Correct 14 ms 21460 KB Output is correct
52 Correct 16 ms 21472 KB Output is correct
53 Correct 15 ms 21444 KB Output is correct
54 Correct 16 ms 21460 KB Output is correct
55 Correct 16 ms 21460 KB Output is correct
56 Correct 21 ms 21368 KB Output is correct
57 Correct 23 ms 21408 KB Output is correct
58 Correct 16 ms 21720 KB Output is correct
59 Correct 17 ms 22092 KB Output is correct
60 Correct 25 ms 21952 KB Output is correct
61 Correct 18 ms 21972 KB Output is correct
62 Correct 17 ms 21972 KB Output is correct
63 Correct 16 ms 21972 KB Output is correct
64 Correct 18 ms 21968 KB Output is correct
65 Correct 20 ms 21980 KB Output is correct
66 Correct 18 ms 22072 KB Output is correct
67 Correct 18 ms 21972 KB Output is correct
68 Correct 17 ms 22264 KB Output is correct
69 Correct 19 ms 22356 KB Output is correct
70 Correct 16 ms 22228 KB Output is correct
71 Correct 20 ms 21964 KB Output is correct
72 Correct 18 ms 22100 KB Output is correct
73 Correct 17 ms 22100 KB Output is correct
74 Correct 14 ms 21452 KB Output is correct
75 Correct 14 ms 21364 KB Output is correct
76 Correct 14 ms 21468 KB Output is correct
77 Correct 14 ms 21460 KB Output is correct
78 Correct 14 ms 21440 KB Output is correct
79 Correct 16 ms 21432 KB Output is correct
80 Correct 19 ms 21452 KB Output is correct
81 Correct 15 ms 21460 KB Output is correct
82 Correct 16 ms 21448 KB Output is correct
83 Correct 17 ms 21452 KB Output is correct
84 Correct 17 ms 21536 KB Output is correct
85 Correct 22 ms 21460 KB Output is correct
86 Correct 17 ms 21436 KB Output is correct
87 Correct 19 ms 21520 KB Output is correct
88 Correct 18 ms 21852 KB Output is correct
89 Correct 18 ms 21972 KB Output is correct
90 Correct 20 ms 22004 KB Output is correct
91 Correct 26 ms 21848 KB Output is correct
92 Correct 23 ms 22020 KB Output is correct
93 Correct 20 ms 21460 KB Output is correct
94 Correct 15 ms 21500 KB Output is correct
95 Correct 16 ms 21464 KB Output is correct
96 Correct 14 ms 21452 KB Output is correct
97 Correct 14 ms 21444 KB Output is correct
98 Correct 15 ms 21420 KB Output is correct
99 Correct 18 ms 21976 KB Output is correct
100 Correct 18 ms 21972 KB Output is correct
101 Correct 21 ms 21944 KB Output is correct
102 Correct 21 ms 21968 KB Output is correct
103 Correct 21 ms 22056 KB Output is correct
104 Correct 287 ms 50120 KB Output is correct
105 Correct 278 ms 49520 KB Output is correct
106 Correct 280 ms 51532 KB Output is correct
107 Correct 300 ms 51008 KB Output is correct
108 Correct 271 ms 51428 KB Output is correct
109 Correct 244 ms 51232 KB Output is correct
110 Correct 267 ms 52096 KB Output is correct
111 Correct 203 ms 49820 KB Output is correct
112 Correct 255 ms 56964 KB Output is correct
113 Correct 267 ms 50972 KB Output is correct
114 Correct 259 ms 52176 KB Output is correct
115 Correct 230 ms 52160 KB Output is correct
116 Correct 15 ms 21452 KB Output is correct
117 Correct 114 ms 65964 KB Output is correct
118 Correct 125 ms 70908 KB Output is correct
119 Correct 17 ms 22012 KB Output is correct
120 Correct 17 ms 21972 KB Output is correct
121 Correct 19 ms 21996 KB Output is correct
122 Correct 17 ms 21996 KB Output is correct
123 Correct 17 ms 21972 KB Output is correct
124 Correct 183 ms 48836 KB Output is correct
125 Correct 15 ms 21460 KB Output is correct
126 Correct 15 ms 21460 KB Output is correct
127 Correct 17 ms 21332 KB Output is correct
128 Correct 232 ms 47504 KB Output is correct
129 Correct 197 ms 44988 KB Output is correct
130 Correct 285 ms 51912 KB Output is correct
131 Correct 279 ms 52372 KB Output is correct
132 Correct 255 ms 49864 KB Output is correct
133 Correct 236 ms 50948 KB Output is correct
134 Correct 232 ms 51780 KB Output is correct
135 Correct 252 ms 49224 KB Output is correct
136 Correct 223 ms 50368 KB Output is correct
137 Correct 298 ms 52156 KB Output is correct
138 Correct 299 ms 60352 KB Output is correct
139 Correct 273 ms 52288 KB Output is correct
140 Correct 234 ms 52220 KB Output is correct
141 Correct 83 ms 51048 KB Output is correct
142 Correct 124 ms 70844 KB Output is correct
143 Correct 16 ms 21848 KB Output is correct
144 Correct 16 ms 21972 KB Output is correct
145 Correct 17 ms 21972 KB Output is correct
146 Correct 17 ms 21948 KB Output is correct
147 Correct 17 ms 22100 KB Output is correct
148 Correct 16 ms 21460 KB Output is correct
149 Correct 16 ms 21476 KB Output is correct
150 Correct 15 ms 21408 KB Output is correct
151 Correct 16 ms 21488 KB Output is correct
152 Correct 14 ms 21460 KB Output is correct
153 Correct 127 ms 39620 KB Output is correct
154 Correct 231 ms 51900 KB Output is correct
155 Correct 260 ms 50812 KB Output is correct
156 Correct 252 ms 50372 KB Output is correct
157 Correct 253 ms 52304 KB Output is correct
158 Correct 269 ms 51820 KB Output is correct
159 Correct 264 ms 52364 KB Output is correct
160 Correct 233 ms 52032 KB Output is correct
161 Correct 257 ms 52048 KB Output is correct
162 Correct 190 ms 49852 KB Output is correct
163 Correct 253 ms 56912 KB Output is correct
164 Correct 257 ms 50992 KB Output is correct
165 Correct 252 ms 52232 KB Output is correct
166 Correct 227 ms 52048 KB Output is correct
167 Correct 14 ms 21332 KB Output is correct
168 Correct 118 ms 65976 KB Output is correct
169 Correct 130 ms 70848 KB Output is correct
170 Correct 21 ms 22024 KB Output is correct
171 Correct 18 ms 22056 KB Output is correct
172 Correct 17 ms 21976 KB Output is correct
173 Correct 18 ms 21972 KB Output is correct
174 Correct 17 ms 21972 KB Output is correct
175 Correct 187 ms 48868 KB Output is correct
176 Correct 14 ms 21332 KB Output is correct
177 Correct 273 ms 52284 KB Output is correct
178 Correct 204 ms 45628 KB Output is correct
179 Correct 296 ms 52292 KB Output is correct
180 Correct 266 ms 51196 KB Output is correct
181 Correct 252 ms 53180 KB Output is correct
182 Correct 258 ms 52728 KB Output is correct
183 Correct 271 ms 52156 KB Output is correct
184 Correct 253 ms 51012 KB Output is correct
185 Correct 262 ms 51656 KB Output is correct
186 Correct 267 ms 50356 KB Output is correct
187 Correct 319 ms 52720 KB Output is correct
188 Correct 256 ms 50580 KB Output is correct
189 Correct 253 ms 50384 KB Output is correct
190 Correct 271 ms 52948 KB Output is correct
191 Correct 249 ms 52212 KB Output is correct
192 Correct 288 ms 52944 KB Output is correct
193 Correct 294 ms 52932 KB Output is correct
194 Correct 241 ms 53056 KB Output is correct
195 Correct 110 ms 63100 KB Output is correct
196 Correct 128 ms 68408 KB Output is correct
197 Correct 133 ms 71656 KB Output is correct
198 Correct 136 ms 71752 KB Output is correct
199 Correct 16 ms 21704 KB Output is correct
200 Correct 16 ms 21972 KB Output is correct
201 Correct 17 ms 21904 KB Output is correct
202 Correct 17 ms 21976 KB Output is correct
203 Correct 17 ms 21972 KB Output is correct
204 Correct 16 ms 21976 KB Output is correct
205 Correct 16 ms 21972 KB Output is correct
206 Correct 17 ms 21972 KB Output is correct
207 Correct 17 ms 22040 KB Output is correct
208 Correct 17 ms 21972 KB Output is correct
209 Correct 16 ms 22236 KB Output is correct
210 Correct 17 ms 22356 KB Output is correct
211 Correct 17 ms 22348 KB Output is correct
212 Correct 18 ms 21956 KB Output is correct
213 Correct 18 ms 22108 KB Output is correct
214 Correct 17 ms 22100 KB Output is correct
215 Correct 14 ms 21452 KB Output is correct
216 Correct 14 ms 21336 KB Output is correct
217 Correct 15 ms 21504 KB Output is correct
218 Correct 15 ms 21460 KB Output is correct
219 Correct 15 ms 21452 KB Output is correct
220 Correct 15 ms 21464 KB Output is correct
221 Correct 14 ms 21400 KB Output is correct
222 Correct 15 ms 21512 KB Output is correct
223 Correct 14 ms 21444 KB Output is correct
224 Correct 15 ms 21504 KB Output is correct
225 Correct 14 ms 21460 KB Output is correct
226 Correct 14 ms 21468 KB Output is correct
227 Correct 15 ms 21452 KB Output is correct
228 Correct 15 ms 21456 KB Output is correct
229 Correct 230 ms 47532 KB Output is correct
230 Correct 210 ms 45020 KB Output is correct
231 Correct 271 ms 51868 KB Output is correct
232 Correct 265 ms 52416 KB Output is correct
233 Correct 238 ms 49896 KB Output is correct
234 Correct 232 ms 50968 KB Output is correct
235 Correct 235 ms 51788 KB Output is correct
236 Correct 268 ms 49244 KB Output is correct
237 Correct 239 ms 50436 KB Output is correct
238 Correct 327 ms 52128 KB Output is correct
239 Correct 286 ms 60228 KB Output is correct
240 Correct 264 ms 52296 KB Output is correct
241 Correct 257 ms 52156 KB Output is correct
242 Correct 85 ms 51052 KB Output is correct
243 Correct 134 ms 70916 KB Output is correct
244 Correct 18 ms 21832 KB Output is correct
245 Correct 17 ms 21972 KB Output is correct
246 Correct 18 ms 22020 KB Output is correct
247 Correct 17 ms 21924 KB Output is correct
248 Correct 17 ms 21972 KB Output is correct
249 Correct 15 ms 21456 KB Output is correct
250 Correct 16 ms 21460 KB Output is correct
251 Correct 15 ms 21460 KB Output is correct
252 Correct 15 ms 21456 KB Output is correct
253 Correct 14 ms 21492 KB Output is correct
254 Correct 127 ms 39692 KB Output is correct
255 Correct 233 ms 51740 KB Output is correct
256 Correct 258 ms 49144 KB Output is correct
257 Correct 289 ms 52028 KB Output is correct
258 Correct 294 ms 52620 KB Output is correct
259 Correct 222 ms 52544 KB Output is correct
260 Correct 268 ms 50852 KB Output is correct
261 Correct 270 ms 50360 KB Output is correct
262 Correct 254 ms 52324 KB Output is correct
263 Correct 266 ms 51904 KB Output is correct
264 Correct 246 ms 52304 KB Output is correct
265 Correct 229 ms 52040 KB Output is correct
266 Correct 267 ms 52012 KB Output is correct
267 Correct 193 ms 49772 KB Output is correct
268 Correct 256 ms 57012 KB Output is correct
269 Correct 258 ms 51016 KB Output is correct
270 Correct 241 ms 52292 KB Output is correct
271 Correct 218 ms 52164 KB Output is correct
272 Correct 14 ms 21460 KB Output is correct
273 Correct 114 ms 65996 KB Output is correct
274 Correct 123 ms 70852 KB Output is correct
275 Correct 16 ms 21972 KB Output is correct
276 Correct 17 ms 21988 KB Output is correct
277 Correct 17 ms 22040 KB Output is correct
278 Correct 20 ms 21972 KB Output is correct
279 Correct 17 ms 21976 KB Output is correct
280 Correct 193 ms 48864 KB Output is correct