oj.uz

Submission #955881

# Submission time Handle Problem Language Result Execution time Memory
955881 2024-03-31T16:01:05 Z alontanay Road Closures (APIO21_roads) C++14
100 / 100
 256 ms 56520 KB 
#include "roads.h"

#include <bits/stdc++.h>
// #define DEBUGGING


#ifdef DEBUGGING
#define dout(msg) cout << msg
#else
#define dout(msg) 
#endif

#define f first
#define s second

using namespace std;
using ll = long long;
using pi = pair<int,int>;
using pl = pair<ll,ll>;

const int MAX_N = 1e5 + 5;

const ll INF_LL = 1e18;
const int INF = 2e9;

struct SlowKSum {
    int _k = 0;
    multiset<int> _vals;
    int getK() { return _k; }
    void incK() {
        _k++;
    }
    void decK() {
        _k--;
    }
    void setK(int k) {
        while(_k < k) {
            incK();
        }
        while(_k > k) {
            decK();
        }
    }
    void insert(int x) {
        _vals.insert(x);
    }
    void erase(int x) {
        _vals.erase(_vals.find(x));
    }
    ll getSum() {
        if(_vals.size() < _k) { return INF_LL; }
        ll res = 0;
        auto it = _vals.begin();
        for(int i = 0; i < _k; i ++) {
            res += *it;
            it++;
        }
        return res;
    }
    ll getKSum(int k) {
        setK(k);
        return getSum();
    }
    void pre() {
    }
    void post() {
    }
};

struct KSum {
   private:
    int _k = 0;
    ll _sum = 0;
    int _overflowCount = 0;
    int _opCount = 0;
    set<pi> _vals;
    set<pi>::iterator sep = _vals.end();

    void incSep() {
        if (sep == _vals.end()) {
            _overflowCount++;
            return;
        }
        _sum += sep->f;
        sep++;
    };
    void decSep() {
        if (_overflowCount) {
            _overflowCount--;
            return;
        }
        assert(sep != _vals.begin());
        sep--;
        _sum -= sep->f;
    }
    int sepVal() {
        if(_overflowCount || sep == _vals.end()) { return INF; }
        return sep->f;
    }
   public:
    int getK() { return _k; }
    void incK() {
        _k++;
        incSep();
    }
    void decK() {
        _k--;
        decSep();
    }
    void setK(int k) {
        while(_k < k) {
            incK();
        }
        while(_k > k) {
            decK();
        }
    }
    void insert(int x) {
        _vals.insert({x,_opCount++});
        if(x < sepVal()) {
            _sum += x;
            decSep();
        }
    }
    void erase(int x) {
        if(x <= sepVal()) {
            _sum -= x;
            incSep();
        }
        _vals.erase(_vals.lower_bound({x,-INF}));
    }
    ll getSum() {
        return _overflowCount ? INF_LL : _sum;
    }
    ll getKSum(int k) {
        setK(k);
        return getSum();
    }
    void pre() {
        _k = INF;
        _overflowCount = INF;
    }
    void post() {
        _k = 0;
        _overflowCount = 0;
        _sum = 0;
        sep = _vals.begin();
    }
};

template<const int BOUND>
struct BoundKSum {
   private:
    int _k = 0;
    vector<ll> hist = vector<ll>(BOUND);
   public:
    int getK() { return _k; }
    void incK() {
        _k++;
    }
    void decK() {
        _k--;
    }
    void setK(int k) {
        while(_k < k) {
            incK();
        }
        while(_k > k) {
            decK();
        }
    }
    void insert(int x) {
        hist[x]++;
    }
    void erase(int x) {
        hist[x]--;
    }
    ll getSum() {
        ll lft = _k;
        ll res = 0;
        for(ll i = 0; i < BOUND; i ++) {
            ll cnt = min(lft,hist[i]);
            lft -= cnt;
            res += cnt * i;
        }
        return lft ? INF_LL : res;
    }
    ll getKSum(int k) {
        setK(k);
        return getSum();
    }
    void pre() {
    }
    void post() {
    }
};


vector<pi> nei[MAX_N];
int isBig[MAX_N];
vector<pi> bigNei[MAX_N];
int vis[MAX_N];
KSum smalls[MAX_N];
int _N;

int _dfs_count = 0;

pl dfs(int node, int K, int par = -1) {
    _dfs_count++;
    assert(_dfs_count < 4*_N);
    // assert(_dfs_count < 4*_N);
    assert(nei[node].size() > K);
    vis[node] = true;

    int deg = bigNei[node].size();
    int dif = nei[node].size()-K;
    dout(node << ' ' << K << ' ' << par << endl);
    assert(dif > 0);
    ll total = 0;
    vector<ll> bigCosts;
    bigCosts.reserve(deg - (par != -1));
    ll parentWeight = INF_LL;
    for(pi edge : bigNei[node]) {
        int ne = edge.f, w = edge.s;
        if(ne == par) {
            parentWeight = w;
            continue;
        }
        pl parts = dfs(ne, K, node);
        total += parts.f;
        bigCosts.push_back(parts.s);
    }
    sort(bigCosts.begin(),bigCosts.end());
    if(bigCosts.size() > dif) {
        bigCosts.resize(dif);
    }
    dout(bigCosts.size() << endl);
    // vector<ll> smallCosts(dif+1);
    // for(int i = dif; i >= 0; i --) {
    //     smallCosts[i] = smalls[node].getKSum(dif-i);
    // }
    dout("NODE " << node << endl);
    dout("DIF " << dif  << endl);
    for(int i = 0; i <= dif; i ++) {
        dout(smallCosts[i] << ' ');
    }
    dout(endl);
    ll best = smalls[node].getKSum(dif-0);
    ll bestWithParent = smalls[node].getKSum(dif-1) + parentWeight;
    ll preSum = 0;
    for(int i = 0; i < bigCosts.size(); i ++) {
        dout("cost " << bigCosts[i] << endl);
        preSum += bigCosts[i];
        best = min(best, preSum + smalls[node].getKSum(dif-i-1));
        if(i < dif-1) { 
            bestWithParent = min(bestWithParent, preSum + parentWeight + smalls[node].getKSum(dif-i-2));
        }
    }
    best = min(best,bestWithParent);
    dout("BEST " << best << endl);
    return {best+total,bestWithParent-best};
}

vector<ll> minimum_closure_costs(int N, vector<int> U, vector<int> V,
                                 vector<int> W) {
    _N = N;
    vector<ll> ans(N);

    for(int i = 0; i < N; i ++) {
        smalls[i].pre();
    }
    for (int i = 0; i < N - 1; i++) {
        int a = U[i], b = V[i], h = W[i];
        nei[a].push_back({b,h});
        nei[b].push_back({a,h});
        smalls[a].insert(h);
        smalls[b].insert(h);
    }
    for(int i = 0; i < N; i ++) {
        smalls[i].post();
    }
    vector<vector<int>> degHist(N);
    for (int i = 0; i < N; i++) {
        int d = nei[i].size();
        degHist[d].push_back(i);
        bigNei[i].reserve(d);
    }
    vector<int> bigs;
    bigs.reserve(N);
    for (int K = N - 1; K >= 0; K--) {
        dout("~~~~~~~~ " << K << endl);
        ll res = 0;
        for(int big : bigs) {
            if(!vis[big]) {
                res += dfs(big,K).f;
            }
        }
        ans[K] = res;
        for(int big : bigs) {
            vis[big] = false;
        }
        for (int node : degHist[K]) {
            dout(" + " << node << endl);
            isBig[node] = true;
            bigs.push_back(node);
            for (pi edge : nei[node]) {
                int ne = edge.f, weight = edge.s;
                if (!isBig[ne]) {
                    continue;
                }
                bigNei[node].push_back({ne,weight});
                bigNei[ne].push_back({node,weight});
                smalls[node].erase(weight);
                smalls[ne].erase(weight);
            }
        }
    }
    return ans;
}

Compilation message

roads.cpp: In member function 'll SlowKSum::getSum()':
roads.cpp:51:25: warning: comparison of integer expressions of different signedness: 'std::multiset<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   51 |         if(_vals.size() < _k) { return INF_LL; }
      |            ~~~~~~~~~~~~~^~~~
In file included from /usr/include/c++/10/cassert:44,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:33,
                 from roads.cpp:3:
roads.cpp: In function 'pl dfs(int, int, int)':
roads.cpp:212:29: warning: comparison of integer expressions of different signedness: 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  212 |     assert(nei[node].size() > K);
      |            ~~~~~~~~~~~~~~~~~^~~
roads.cpp:234:24: warning: comparison of integer expressions of different signedness: 'std::vector<long long int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  234 |     if(bigCosts.size() > dif) {
      |        ~~~~~~~~~~~~~~~~^~~~~
roads.cpp:251:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  251 |     for(int i = 0; i < bigCosts.size(); i ++) {
      |                    ~~^~~~~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 13656 KB Output is correct
2 Correct 6 ms 14172 KB Output is correct
3 Correct 5 ms 14172 KB Output is correct
4 Correct 5 ms 14168 KB Output is correct
5 Correct 3 ms 13660 KB Output is correct
6 Correct 4 ms 13660 KB Output is correct
7 Correct 3 ms 13660 KB Output is correct
8 Correct 4 ms 13916 KB Output is correct
9 Correct 6 ms 13988 KB Output is correct
10 Correct 3 ms 13660 KB Output is correct
11 Correct 3 ms 13660 KB Output is correct
12 Correct 63 ms 28108 KB Output is correct
13 Correct 129 ms 38856 KB Output is correct
14 Correct 161 ms 36784 KB Output is correct
15 Correct 165 ms 39368 KB Output is correct
16 Correct 188 ms 39616 KB Output is correct
17 Correct 121 ms 39712 KB Output is correct
18 Correct 3 ms 13660 KB Output is correct
19 Correct 121 ms 36544 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 13660 KB Output is correct
2 Correct 75 ms 47412 KB Output is correct
3 Correct 88 ms 51916 KB Output is correct
4 Correct 91 ms 54216 KB Output is correct
5 Correct 92 ms 54220 KB Output is correct
6 Correct 4 ms 14428 KB Output is correct
7 Correct 5 ms 14428 KB Output is correct
8 Correct 4 ms 14428 KB Output is correct
9 Correct 4 ms 13660 KB Output is correct
10 Correct 3 ms 13660 KB Output is correct
11 Correct 3 ms 13660 KB Output is correct
12 Correct 60 ms 38208 KB Output is correct
13 Correct 88 ms 54220 KB Output is correct
14 Correct 4 ms 13660 KB Output is correct
15 Correct 79 ms 50248 KB Output is correct
16 Correct 90 ms 54472 KB Output is correct

Subtask #3
14.0 / 14.0

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

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 13660 KB Output is correct
2 Correct 4 ms 13660 KB Output is correct
3 Correct 4 ms 13660 KB Output is correct
4 Correct 3 ms 13656 KB Output is correct
5 Correct 4 ms 13660 KB Output is correct
6 Correct 4 ms 13660 KB Output is correct
7 Correct 4 ms 13660 KB Output is correct
8 Correct 3 ms 13660 KB Output is correct
9 Correct 4 ms 13916 KB Output is correct
10 Correct 3 ms 13660 KB Output is correct
11 Correct 3 ms 13660 KB Output is correct
12 Correct 3 ms 13660 KB Output is correct
13 Correct 3 ms 13660 KB Output is correct
14 Correct 3 ms 13660 KB Output is correct
15 Correct 3 ms 13660 KB Output is correct
16 Correct 3 ms 13660 KB Output is correct
17 Correct 3 ms 13752 KB Output is correct
18 Correct 3 ms 13660 KB Output is correct
19 Correct 4 ms 13660 KB Output is correct
20 Correct 4 ms 13660 KB Output is correct
21 Correct 3 ms 13660 KB Output is correct
22 Correct 3 ms 13660 KB Output is correct
23 Correct 4 ms 13992 KB Output is correct
24 Correct 5 ms 13976 KB Output is correct
25 Correct 5 ms 14168 KB Output is correct
26 Correct 5 ms 14172 KB Output is correct
27 Correct 5 ms 14168 KB Output is correct
28 Correct 5 ms 14172 KB Output is correct
29 Correct 5 ms 14004 KB Output is correct
30 Correct 5 ms 14172 KB Output is correct
31 Correct 5 ms 14172 KB Output is correct
32 Correct 7 ms 14244 KB Output is correct
33 Correct 6 ms 14424 KB Output is correct
34 Correct 5 ms 14428 KB Output is correct
35 Correct 4 ms 14424 KB Output is correct
36 Correct 6 ms 14204 KB Output is correct
37 Correct 5 ms 14504 KB Output is correct
38 Correct 4 ms 14172 KB Output is correct
39 Correct 4 ms 13660 KB Output is correct
40 Correct 3 ms 13660 KB Output is correct
41 Correct 3 ms 13656 KB Output is correct
42 Correct 3 ms 13660 KB Output is correct
43 Correct 3 ms 13660 KB Output is correct
44 Correct 4 ms 13660 KB Output is correct
45 Correct 3 ms 13660 KB Output is correct
46 Correct 3 ms 13660 KB Output is correct
47 Correct 4 ms 14096 KB Output is correct
48 Correct 3 ms 13660 KB Output is correct
49 Correct 3 ms 13660 KB Output is correct
50 Correct 4 ms 13660 KB Output is correct
51 Correct 3 ms 13660 KB Output is correct
52 Correct 3 ms 13660 KB Output is correct
53 Correct 4 ms 14072 KB Output is correct
54 Correct 6 ms 14172 KB Output is correct
55 Correct 5 ms 14172 KB Output is correct
56 Correct 4 ms 13916 KB Output is correct
57 Correct 6 ms 14172 KB Output is correct
58 Correct 3 ms 13660 KB Output is correct
59 Correct 3 ms 13660 KB Output is correct
60 Correct 3 ms 13660 KB Output is correct
61 Correct 4 ms 13724 KB Output is correct
62 Correct 4 ms 13656 KB Output is correct
63 Correct 3 ms 13660 KB Output is correct
64 Correct 5 ms 14172 KB Output is correct
65 Correct 5 ms 14168 KB Output is correct
66 Correct 6 ms 14168 KB Output is correct
67 Correct 5 ms 14172 KB Output is correct
68 Correct 5 ms 14080 KB Output is correct

Subtask #5
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 179 ms 35696 KB Output is correct
2 Correct 170 ms 35280 KB Output is correct
3 Correct 185 ms 37764 KB Output is correct
4 Correct 185 ms 36172 KB Output is correct
5 Correct 161 ms 37576 KB Output is correct
6 Correct 180 ms 37064 KB Output is correct
7 Correct 176 ms 36900 KB Output is correct
8 Correct 105 ms 36036 KB Output is correct
9 Correct 186 ms 43656 KB Output is correct
10 Correct 168 ms 37128 KB Output is correct
11 Correct 160 ms 38856 KB Output is correct
12 Correct 121 ms 39084 KB Output is correct
13 Correct 3 ms 13656 KB Output is correct
14 Correct 76 ms 51404 KB Output is correct
15 Correct 90 ms 55752 KB Output is correct
16 Correct 5 ms 14172 KB Output is correct
17 Correct 5 ms 14172 KB Output is correct
18 Correct 5 ms 14044 KB Output is correct
19 Correct 5 ms 14172 KB Output is correct
20 Correct 5 ms 14172 KB Output is correct
21 Correct 101 ms 36332 KB Output is correct

Subtask #6
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 179 ms 35696 KB Output is correct
2 Correct 170 ms 35280 KB Output is correct
3 Correct 185 ms 37764 KB Output is correct
4 Correct 185 ms 36172 KB Output is correct
5 Correct 161 ms 37576 KB Output is correct
6 Correct 180 ms 37064 KB Output is correct
7 Correct 176 ms 36900 KB Output is correct
8 Correct 105 ms 36036 KB Output is correct
9 Correct 186 ms 43656 KB Output is correct
10 Correct 168 ms 37128 KB Output is correct
11 Correct 160 ms 38856 KB Output is correct
12 Correct 121 ms 39084 KB Output is correct
13 Correct 3 ms 13656 KB Output is correct
14 Correct 76 ms 51404 KB Output is correct
15 Correct 90 ms 55752 KB Output is correct
16 Correct 5 ms 14172 KB Output is correct
17 Correct 5 ms 14172 KB Output is correct
18 Correct 5 ms 14044 KB Output is correct
19 Correct 5 ms 14172 KB Output is correct
20 Correct 5 ms 14172 KB Output is correct
21 Correct 101 ms 36332 KB Output is correct
22 Correct 3 ms 13660 KB Output is correct
23 Correct 3 ms 13748 KB Output is correct
24 Correct 3 ms 13660 KB Output is correct
25 Correct 158 ms 34092 KB Output is correct
26 Correct 119 ms 32340 KB Output is correct
27 Correct 191 ms 37608 KB Output is correct
28 Correct 195 ms 39088 KB Output is correct
29 Correct 167 ms 37004 KB Output is correct
30 Correct 169 ms 37516 KB Output is correct
31 Correct 156 ms 38388 KB Output is correct
32 Correct 185 ms 36060 KB Output is correct
33 Correct 115 ms 37828 KB Output is correct
34 Correct 184 ms 38080 KB Output is correct
35 Correct 223 ms 44360 KB Output is correct
36 Correct 195 ms 38816 KB Output is correct
37 Correct 140 ms 39188 KB Output is correct
38 Correct 57 ms 39116 KB Output is correct
39 Correct 89 ms 55752 KB Output is correct
40 Correct 4 ms 13916 KB Output is correct
41 Correct 5 ms 14260 KB Output is correct
42 Correct 5 ms 14172 KB Output is correct
43 Correct 4 ms 13992 KB Output is correct
44 Correct 5 ms 14172 KB Output is correct
45 Correct 3 ms 13656 KB Output is correct
46 Correct 3 ms 13660 KB Output is correct
47 Correct 3 ms 13660 KB Output is correct
48 Correct 4 ms 13660 KB Output is correct
49 Correct 3 ms 13656 KB Output is correct
50 Correct 62 ms 28876 KB Output is correct
51 Correct 121 ms 38856 KB Output is correct
52 Correct 209 ms 36944 KB Output is correct
53 Correct 198 ms 36412 KB Output is correct
54 Correct 196 ms 38860 KB Output is correct
55 Correct 173 ms 37556 KB Output is correct
56 Correct 172 ms 39108 KB Output is correct
57 Correct 137 ms 38604 KB Output is correct
58 Correct 178 ms 38092 KB Output is correct
59 Correct 100 ms 37576 KB Output is correct
60 Correct 185 ms 43596 KB Output is correct
61 Correct 179 ms 37192 KB Output is correct
62 Correct 187 ms 39104 KB Output is correct
63 Correct 147 ms 39124 KB Output is correct
64 Correct 3 ms 13660 KB Output is correct
65 Correct 80 ms 51404 KB Output is correct
66 Correct 88 ms 55676 KB Output is correct
67 Correct 5 ms 14168 KB Output is correct
68 Correct 5 ms 14172 KB Output is correct
69 Correct 5 ms 14172 KB Output is correct
70 Correct 6 ms 14248 KB Output is correct
71 Correct 5 ms 14252 KB Output is correct
72 Correct 97 ms 36500 KB Output is correct

Subtask #7
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 13656 KB Output is correct
2 Correct 6 ms 14172 KB Output is correct
3 Correct 5 ms 14172 KB Output is correct
4 Correct 5 ms 14168 KB Output is correct
5 Correct 3 ms 13660 KB Output is correct
6 Correct 4 ms 13660 KB Output is correct
7 Correct 3 ms 13660 KB Output is correct
8 Correct 4 ms 13916 KB Output is correct
9 Correct 6 ms 13988 KB Output is correct
10 Correct 3 ms 13660 KB Output is correct
11 Correct 3 ms 13660 KB Output is correct
12 Correct 63 ms 28108 KB Output is correct
13 Correct 129 ms 38856 KB Output is correct
14 Correct 161 ms 36784 KB Output is correct
15 Correct 165 ms 39368 KB Output is correct
16 Correct 188 ms 39616 KB Output is correct
17 Correct 121 ms 39712 KB Output is correct
18 Correct 3 ms 13660 KB Output is correct
19 Correct 121 ms 36544 KB Output is correct
20 Correct 3 ms 13660 KB Output is correct
21 Correct 75 ms 47412 KB Output is correct
22 Correct 88 ms 51916 KB Output is correct
23 Correct 91 ms 54216 KB Output is correct
24 Correct 92 ms 54220 KB Output is correct
25 Correct 4 ms 14428 KB Output is correct
26 Correct 5 ms 14428 KB Output is correct
27 Correct 4 ms 14428 KB Output is correct
28 Correct 4 ms 13660 KB Output is correct
29 Correct 3 ms 13660 KB Output is correct
30 Correct 3 ms 13660 KB Output is correct
31 Correct 60 ms 38208 KB Output is correct
32 Correct 88 ms 54220 KB Output is correct
33 Correct 4 ms 13660 KB Output is correct
34 Correct 79 ms 50248 KB Output is correct
35 Correct 90 ms 54472 KB Output is correct
36 Correct 3 ms 13660 KB Output is correct
37 Correct 4 ms 13660 KB Output is correct
38 Correct 4 ms 13660 KB Output is correct
39 Correct 3 ms 13656 KB Output is correct
40 Correct 4 ms 13660 KB Output is correct
41 Correct 4 ms 13660 KB Output is correct
42 Correct 4 ms 13660 KB Output is correct
43 Correct 3 ms 13660 KB Output is correct
44 Correct 4 ms 13916 KB Output is correct
45 Correct 3 ms 13660 KB Output is correct
46 Correct 3 ms 13660 KB Output is correct
47 Correct 3 ms 13660 KB Output is correct
48 Correct 3 ms 13660 KB Output is correct
49 Correct 3 ms 13660 KB Output is correct
50 Correct 3 ms 13660 KB Output is correct
51 Correct 3 ms 13660 KB Output is correct
52 Correct 3 ms 13752 KB Output is correct
53 Correct 3 ms 13660 KB Output is correct
54 Correct 4 ms 13660 KB Output is correct
55 Correct 4 ms 13660 KB Output is correct
56 Correct 3 ms 13660 KB Output is correct
57 Correct 3 ms 13660 KB Output is correct
58 Correct 4 ms 13992 KB Output is correct
59 Correct 5 ms 13976 KB Output is correct
60 Correct 5 ms 14168 KB Output is correct
61 Correct 5 ms 14172 KB Output is correct
62 Correct 5 ms 14168 KB Output is correct
63 Correct 5 ms 14172 KB Output is correct
64 Correct 5 ms 14004 KB Output is correct
65 Correct 5 ms 14172 KB Output is correct
66 Correct 5 ms 14172 KB Output is correct
67 Correct 7 ms 14244 KB Output is correct
68 Correct 6 ms 14424 KB Output is correct
69 Correct 5 ms 14428 KB Output is correct
70 Correct 4 ms 14424 KB Output is correct
71 Correct 6 ms 14204 KB Output is correct
72 Correct 5 ms 14504 KB Output is correct
73 Correct 4 ms 14172 KB Output is correct
74 Correct 4 ms 13660 KB Output is correct
75 Correct 3 ms 13660 KB Output is correct
76 Correct 3 ms 13656 KB Output is correct
77 Correct 3 ms 13660 KB Output is correct
78 Correct 3 ms 13660 KB Output is correct
79 Correct 4 ms 13660 KB Output is correct
80 Correct 3 ms 13660 KB Output is correct
81 Correct 3 ms 13660 KB Output is correct
82 Correct 4 ms 14096 KB Output is correct
83 Correct 3 ms 13660 KB Output is correct
84 Correct 3 ms 13660 KB Output is correct
85 Correct 4 ms 13660 KB Output is correct
86 Correct 3 ms 13660 KB Output is correct
87 Correct 3 ms 13660 KB Output is correct
88 Correct 4 ms 14072 KB Output is correct
89 Correct 6 ms 14172 KB Output is correct
90 Correct 5 ms 14172 KB Output is correct
91 Correct 4 ms 13916 KB Output is correct
92 Correct 6 ms 14172 KB Output is correct
93 Correct 3 ms 13660 KB Output is correct
94 Correct 3 ms 13660 KB Output is correct
95 Correct 3 ms 13660 KB Output is correct
96 Correct 4 ms 13724 KB Output is correct
97 Correct 4 ms 13656 KB Output is correct
98 Correct 3 ms 13660 KB Output is correct
99 Correct 5 ms 14172 KB Output is correct
100 Correct 5 ms 14168 KB Output is correct
101 Correct 6 ms 14168 KB Output is correct
102 Correct 5 ms 14172 KB Output is correct
103 Correct 5 ms 14080 KB Output is correct
104 Correct 179 ms 35696 KB Output is correct
105 Correct 170 ms 35280 KB Output is correct
106 Correct 185 ms 37764 KB Output is correct
107 Correct 185 ms 36172 KB Output is correct
108 Correct 161 ms 37576 KB Output is correct
109 Correct 180 ms 37064 KB Output is correct
110 Correct 176 ms 36900 KB Output is correct
111 Correct 105 ms 36036 KB Output is correct
112 Correct 186 ms 43656 KB Output is correct
113 Correct 168 ms 37128 KB Output is correct
114 Correct 160 ms 38856 KB Output is correct
115 Correct 121 ms 39084 KB Output is correct
116 Correct 3 ms 13656 KB Output is correct
117 Correct 76 ms 51404 KB Output is correct
118 Correct 90 ms 55752 KB Output is correct
119 Correct 5 ms 14172 KB Output is correct
120 Correct 5 ms 14172 KB Output is correct
121 Correct 5 ms 14044 KB Output is correct
122 Correct 5 ms 14172 KB Output is correct
123 Correct 5 ms 14172 KB Output is correct
124 Correct 101 ms 36332 KB Output is correct
125 Correct 3 ms 13660 KB Output is correct
126 Correct 3 ms 13748 KB Output is correct
127 Correct 3 ms 13660 KB Output is correct
128 Correct 158 ms 34092 KB Output is correct
129 Correct 119 ms 32340 KB Output is correct
130 Correct 191 ms 37608 KB Output is correct
131 Correct 195 ms 39088 KB Output is correct
132 Correct 167 ms 37004 KB Output is correct
133 Correct 169 ms 37516 KB Output is correct
134 Correct 156 ms 38388 KB Output is correct
135 Correct 185 ms 36060 KB Output is correct
136 Correct 115 ms 37828 KB Output is correct
137 Correct 184 ms 38080 KB Output is correct
138 Correct 223 ms 44360 KB Output is correct
139 Correct 195 ms 38816 KB Output is correct
140 Correct 140 ms 39188 KB Output is correct
141 Correct 57 ms 39116 KB Output is correct
142 Correct 89 ms 55752 KB Output is correct
143 Correct 4 ms 13916 KB Output is correct
144 Correct 5 ms 14260 KB Output is correct
145 Correct 5 ms 14172 KB Output is correct
146 Correct 4 ms 13992 KB Output is correct
147 Correct 5 ms 14172 KB Output is correct
148 Correct 3 ms 13656 KB Output is correct
149 Correct 3 ms 13660 KB Output is correct
150 Correct 3 ms 13660 KB Output is correct
151 Correct 4 ms 13660 KB Output is correct
152 Correct 3 ms 13656 KB Output is correct
153 Correct 62 ms 28876 KB Output is correct
154 Correct 121 ms 38856 KB Output is correct
155 Correct 209 ms 36944 KB Output is correct
156 Correct 198 ms 36412 KB Output is correct
157 Correct 196 ms 38860 KB Output is correct
158 Correct 173 ms 37556 KB Output is correct
159 Correct 172 ms 39108 KB Output is correct
160 Correct 137 ms 38604 KB Output is correct
161 Correct 178 ms 38092 KB Output is correct
162 Correct 100 ms 37576 KB Output is correct
163 Correct 185 ms 43596 KB Output is correct
164 Correct 179 ms 37192 KB Output is correct
165 Correct 187 ms 39104 KB Output is correct
166 Correct 147 ms 39124 KB Output is correct
167 Correct 3 ms 13660 KB Output is correct
168 Correct 80 ms 51404 KB Output is correct
169 Correct 88 ms 55676 KB Output is correct
170 Correct 5 ms 14168 KB Output is correct
171 Correct 5 ms 14172 KB Output is correct
172 Correct 5 ms 14172 KB Output is correct
173 Correct 6 ms 14248 KB Output is correct
174 Correct 5 ms 14252 KB Output is correct
175 Correct 97 ms 36500 KB Output is correct
176 Correct 3 ms 13660 KB Output is correct
177 Correct 186 ms 38188 KB Output is correct
178 Correct 129 ms 33108 KB Output is correct
179 Correct 185 ms 38952 KB Output is correct
180 Correct 180 ms 38144 KB Output is correct
181 Correct 155 ms 39940 KB Output is correct
182 Correct 158 ms 39576 KB Output is correct
183 Correct 177 ms 38352 KB Output is correct
184 Correct 166 ms 37812 KB Output is correct
185 Correct 167 ms 38384 KB Output is correct
186 Correct 177 ms 37580 KB Output is correct
187 Correct 171 ms 39872 KB Output is correct
188 Correct 162 ms 36424 KB Output is correct
189 Correct 178 ms 36696 KB Output is correct
190 Correct 195 ms 39880 KB Output is correct
191 Correct 180 ms 38860 KB Output is correct
192 Correct 174 ms 39868 KB Output is correct
193 Correct 199 ms 40264 KB Output is correct
194 Correct 170 ms 39628 KB Output is correct
195 Correct 74 ms 49096 KB Output is correct
196 Correct 85 ms 53864 KB Output is correct
197 Correct 93 ms 56480 KB Output is correct
198 Correct 89 ms 56520 KB Output is correct
199 Correct 5 ms 14004 KB Output is correct
200 Correct 6 ms 14424 KB Output is correct
201 Correct 5 ms 14168 KB Output is correct
202 Correct 8 ms 14172 KB Output is correct
203 Correct 5 ms 14172 KB Output is correct
204 Correct 5 ms 14048 KB Output is correct
205 Correct 5 ms 14172 KB Output is correct
206 Correct 6 ms 14172 KB Output is correct
207 Correct 7 ms 14172 KB Output is correct
208 Correct 5 ms 14272 KB Output is correct
209 Correct 4 ms 14424 KB Output is correct
210 Correct 5 ms 14428 KB Output is correct
211 Correct 4 ms 14428 KB Output is correct
212 Correct 6 ms 14168 KB Output is correct
213 Correct 6 ms 14172 KB Output is correct
214 Correct 5 ms 14256 KB Output is correct
215 Correct 3 ms 13856 KB Output is correct
216 Correct 3 ms 13660 KB Output is correct
217 Correct 3 ms 13660 KB Output is correct
218 Correct 3 ms 13660 KB Output is correct
219 Correct 3 ms 13660 KB Output is correct
220 Correct 3 ms 13660 KB Output is correct
221 Correct 4 ms 13660 KB Output is correct
222 Correct 5 ms 13660 KB Output is correct
223 Correct 3 ms 13660 KB Output is correct
224 Correct 3 ms 13752 KB Output is correct
225 Correct 5 ms 13660 KB Output is correct
226 Correct 3 ms 13660 KB Output is correct
227 Correct 3 ms 13660 KB Output is correct
228 Correct 4 ms 13660 KB Output is correct
229 Correct 139 ms 34336 KB Output is correct
230 Correct 115 ms 32336 KB Output is correct
231 Correct 177 ms 37840 KB Output is correct
232 Correct 206 ms 39060 KB Output is correct
233 Correct 147 ms 36940 KB Output is correct
234 Correct 155 ms 37576 KB Output is correct
235 Correct 165 ms 38372 KB Output is correct
236 Correct 186 ms 35876 KB Output is correct
237 Correct 135 ms 37828 KB Output is correct
238 Correct 185 ms 38132 KB Output is correct
239 Correct 256 ms 44360 KB Output is correct
240 Correct 186 ms 38840 KB Output is correct
241 Correct 144 ms 39224 KB Output is correct
242 Correct 53 ms 39216 KB Output is correct
243 Correct 87 ms 55756 KB Output is correct
244 Correct 5 ms 13916 KB Output is correct
245 Correct 5 ms 14044 KB Output is correct
246 Correct 5 ms 14168 KB Output is correct
247 Correct 4 ms 14168 KB Output is correct
248 Correct 5 ms 14004 KB Output is correct
249 Correct 3 ms 13744 KB Output is correct
250 Correct 3 ms 13656 KB Output is correct
251 Correct 3 ms 13660 KB Output is correct
252 Correct 3 ms 13656 KB Output is correct
253 Correct 3 ms 13912 KB Output is correct
254 Correct 75 ms 28872 KB Output is correct
255 Correct 128 ms 38788 KB Output is correct
256 Correct 151 ms 36808 KB Output is correct
257 Correct 155 ms 39364 KB Output is correct
258 Correct 163 ms 39624 KB Output is correct
259 Correct 114 ms 39624 KB Output is correct
260 Correct 211 ms 36860 KB Output is correct
261 Correct 174 ms 36420 KB Output is correct
262 Correct 184 ms 39124 KB Output is correct
263 Correct 179 ms 37708 KB Output is correct
264 Correct 169 ms 39108 KB Output is correct
265 Correct 137 ms 38500 KB Output is correct
266 Correct 183 ms 38176 KB Output is correct
267 Correct 102 ms 37320 KB Output is correct
268 Correct 182 ms 43684 KB Output is correct
269 Correct 194 ms 37132 KB Output is correct
270 Correct 172 ms 38860 KB Output is correct
271 Correct 128 ms 39048 KB Output is correct
272 Correct 3 ms 13656 KB Output is correct
273 Correct 82 ms 51720 KB Output is correct
274 Correct 88 ms 55752 KB Output is correct
275 Correct 6 ms 14172 KB Output is correct
276 Correct 6 ms 14172 KB Output is correct
277 Correct 5 ms 14172 KB Output is correct
278 Correct 5 ms 14172 KB Output is correct
279 Correct 5 ms 14160 KB Output is correct
280 Correct 103 ms 36552 KB Output is correct