oj.uz

답안 #937966

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
937966 2024-03-04T17:18:50 Z GrindMachine 봉쇄 시간 (IOI23_closing) C++17
100 / 100
 253 ms 56444 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) (int)a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x,y) ((x+y-1)/(y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a,b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a,b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif

/*

refs:
https://codeforces.com/blog/entry/121499

*/

const int MOD = 1e9 + 7;
const int N = 2e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

#include "closing.h"

template<typename T>
struct fenwick {
    int siz;
    vector<T> tree;

    fenwick() {

    }

    fenwick(int n) {
        siz = n;
        tree = vector<T>(n + 1);
    }

    int lsb(int x) {
        return x & -x;
    }

    void build(vector<T> &a, int n) {
        for (int i = 1; i <= n; ++i) {
            int par = i + lsb(i);
            tree[i] += a[i];

            if (par <= siz) {
                tree[par] += tree[i];
            }
        }
    }

    void pupd(int i, T v) {
        while (i <= siz) {
            tree[i] += v;
            i += lsb(i);
        }
    }

    T sum(int i) {
        T res = 0;

        while (i) {
            res += tree[i];
            i -= lsb(i);
        }

        return res;
    }

    T query(int l, int r) {
        if (l > r) return 0;
        T res = sum(r) - sum(l - 1);
        return res;
    }
};

vector<pll> adj[N];
ll dis[N][2];

void dfs1(ll u, ll p, ll t){
    for(auto [v,w] : adj[u]){
        if(v == p) conts;
        dis[v][t] = dis[u][t]+w;
        dfs1(v,u,t);
    }
}

vector<bool> on_path(N);
vector<ll> curr_path;

void dfs2(ll u, ll p, ll des){
    curr_path.pb(u);

    if(u == des){
        trav(v,curr_path){
            on_path[v] = 1;
        }
    }

    for(auto [v,w] : adj[u]){
        if(v == p) conts;
        dfs2(v,u,des);
    }

    curr_path.pop_back();
}

int max_score(int n, int X, int Y, long long K,
              std::vector<int> U, std::vector<int> V, std::vector<int> W)
{
    rep(i,n){
        adj[i].clear();
        on_path[i] = 0;
    }

    rep(i,n-1){
        ll u = U[i], v = V[i], w = W[i];
        adj[u].pb({v,w}), adj[v].pb({u,w});
    }

    dis[X][0] = dis[Y][1] = 0;    
    dfs1(X,-1,0);
    dfs1(Y,-1,1);
    dfs2(X,-1,Y);

    vector<ll> a(n), b(n);
    rep(i,n){
        ll dx = dis[i][0], dy = dis[i][1];
        a[i] = min(dx,dy);
        b[i] = max(dx,dy)-a[i];
    }

    ll ans = 0;

    // only 1s
    {
        vector<ll> vals;
        rep(i,n) vals.pb(a[i]);
        sort(all(vals));
        ll sum = 0;
        ll guys = 0;

        rep(i,n){
            sum += vals[i];
            if(sum > K) break;
            guys++;
        }

        amax(ans,guys);
    }

    // 1s and 2s
    // all guys on path from X to Y must be at least 1
    ll forced_cost = 0, on_path_cnt = 0;

    rep(i,n){
        if(on_path[i]){
            forced_cost += a[i];
            on_path_cnt++;
            a[i] = b[i];
            b[i] = inf2;
        }
    }

    vector<pll> c;
    rep(i,n){
        c.pb({a[i],b[i]});
    }

    auto cmp = [&](pll p1, pll p2){
        return p1.ff+p1.ss < p2.ff+p2.ss;
    };

    sort(all(c),cmp);
    c.pb({inf2,inf2});

    vector<ll> d;
    rep(i,n){
        auto [x,y] = c[i];
        d.pb(x);
        d.pb(y);
    }

    sort(all(d));
    d.resize(unique(all(d))-d.begin());
    ll m = sz(d);
    fenwick<__int128> fenw_cnt(m+5), fenw_sum(m+5);

    auto upd = [&](ll x, ll add){
        ll i = lower_bound(all(d),x)-d.begin()+1;
        fenw_cnt.pupd(i,add);
        fenw_sum.pupd(i,x*add);
    };

    rep(i,n){
        auto [x,y] = c[i];
        upd(x,1);
    }

    rep(i,n+1){
        // i = first 0
        // everybody to the left = 1/2
        // everybody to the right = 0/1
            
        if(forced_cost > K) break;

        auto [x,y] = c[i];
        upd(x,-1);

        ll l = 1, r = m;
        ll pos = 0;

        while(l <= r){
            ll mid = (l+r) >> 1;
            if(forced_cost+fenw_sum.query(1,mid) <= K){
                pos = mid;
                l = mid+1;
            }
            else{
                r = mid-1;
            }
        }

        ll cnt = i+on_path_cnt+fenw_cnt.query(1,pos);
        ll extra_sum = K-forced_cost-fenw_sum.query(1,pos);
        assert(extra_sum >= 0);
        if(pos < m){
            cnt += extra_sum/d[pos];
        }

        amax(ans,cnt);

        upd(y,1);
        forced_cost += x;
    }

    return ans;
}

Subtask #0
0.0 / 0.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 5976 KB Output is correct

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 172 ms 44860 KB Output is correct
2 Correct 209 ms 51648 KB Output is correct
3 Correct 89 ms 8772 KB Output is correct

Subtask #2
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 5980 KB Output is correct
2 Correct 2 ms 5980 KB Output is correct
3 Correct 2 ms 5980 KB Output is correct
4 Correct 2 ms 5976 KB Output is correct
5 Correct 3 ms 5976 KB Output is correct
6 Correct 2 ms 5980 KB Output is correct
7 Correct 2 ms 6060 KB Output is correct
8 Correct 2 ms 5980 KB Output is correct
9 Correct 2 ms 5976 KB Output is correct
10 Correct 2 ms 5976 KB Output is correct
11 Correct 2 ms 5980 KB Output is correct

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 5980 KB Output is correct
2 Correct 2 ms 5980 KB Output is correct
3 Correct 2 ms 5980 KB Output is correct
4 Correct 2 ms 5976 KB Output is correct
5 Correct 3 ms 5976 KB Output is correct
6 Correct 2 ms 5980 KB Output is correct
7 Correct 2 ms 6060 KB Output is correct
8 Correct 2 ms 5980 KB Output is correct
9 Correct 2 ms 5976 KB Output is correct
10 Correct 2 ms 5976 KB Output is correct
11 Correct 2 ms 5980 KB Output is correct
12 Correct 2 ms 5980 KB Output is correct
13 Correct 2 ms 5980 KB Output is correct
14 Correct 2 ms 5980 KB Output is correct
15 Correct 2 ms 5980 KB Output is correct
16 Correct 2 ms 5980 KB Output is correct
17 Correct 2 ms 5980 KB Output is correct
18 Correct 2 ms 5980 KB Output is correct
19 Correct 2 ms 5980 KB Output is correct
20 Correct 2 ms 5980 KB Output is correct
21 Correct 2 ms 5976 KB Output is correct
22 Correct 2 ms 5976 KB Output is correct
23 Correct 2 ms 5976 KB Output is correct
24 Correct 2 ms 5980 KB Output is correct

Subtask #4
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 5980 KB Output is correct
2 Correct 2 ms 5980 KB Output is correct
3 Correct 2 ms 5980 KB Output is correct
4 Correct 2 ms 5976 KB Output is correct
5 Correct 3 ms 5976 KB Output is correct
6 Correct 2 ms 5980 KB Output is correct
7 Correct 2 ms 6060 KB Output is correct
8 Correct 2 ms 5980 KB Output is correct
9 Correct 2 ms 5976 KB Output is correct
10 Correct 2 ms 5976 KB Output is correct
11 Correct 2 ms 5980 KB Output is correct
12 Correct 2 ms 5980 KB Output is correct
13 Correct 2 ms 5980 KB Output is correct
14 Correct 2 ms 5980 KB Output is correct
15 Correct 2 ms 5980 KB Output is correct
16 Correct 2 ms 5980 KB Output is correct
17 Correct 2 ms 5980 KB Output is correct
18 Correct 2 ms 5980 KB Output is correct
19 Correct 2 ms 5980 KB Output is correct
20 Correct 2 ms 5980 KB Output is correct
21 Correct 2 ms 5976 KB Output is correct
22 Correct 2 ms 5976 KB Output is correct
23 Correct 2 ms 5976 KB Output is correct
24 Correct 2 ms 5980 KB Output is correct
25 Correct 3 ms 5976 KB Output is correct
26 Correct 4 ms 6744 KB Output is correct
27 Correct 3 ms 6492 KB Output is correct
28 Correct 4 ms 6748 KB Output is correct
29 Correct 4 ms 6748 KB Output is correct
30 Correct 3 ms 6492 KB Output is correct
31 Correct 3 ms 6748 KB Output is correct
32 Correct 4 ms 6744 KB Output is correct

Subtask #5
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 5976 KB Output is correct
2 Correct 2 ms 5980 KB Output is correct
3 Correct 2 ms 5980 KB Output is correct
4 Correct 2 ms 5980 KB Output is correct
5 Correct 2 ms 5976 KB Output is correct
6 Correct 3 ms 5976 KB Output is correct
7 Correct 2 ms 6128 KB Output is correct
8 Correct 2 ms 5980 KB Output is correct
9 Correct 2 ms 6072 KB Output is correct
10 Correct 2 ms 5980 KB Output is correct
11 Correct 1 ms 5980 KB Output is correct
12 Correct 4 ms 5980 KB Output is correct
13 Correct 2 ms 5980 KB Output is correct
14 Correct 2 ms 5980 KB Output is correct
15 Correct 2 ms 5980 KB Output is correct
16 Correct 2 ms 5980 KB Output is correct
17 Correct 2 ms 5980 KB Output is correct
18 Correct 2 ms 5980 KB Output is correct
19 Correct 2 ms 5976 KB Output is correct
20 Correct 2 ms 5980 KB Output is correct
21 Correct 2 ms 5980 KB Output is correct
22 Correct 2 ms 5980 KB Output is correct
23 Correct 2 ms 5976 KB Output is correct
24 Correct 2 ms 5976 KB Output is correct

Subtask #6
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 5976 KB Output is correct
2 Correct 2 ms 5980 KB Output is correct
3 Correct 2 ms 5980 KB Output is correct
4 Correct 2 ms 5980 KB Output is correct
5 Correct 2 ms 5976 KB Output is correct
6 Correct 3 ms 5976 KB Output is correct
7 Correct 2 ms 5980 KB Output is correct
8 Correct 2 ms 6060 KB Output is correct
9 Correct 2 ms 5980 KB Output is correct
10 Correct 2 ms 5976 KB Output is correct
11 Correct 2 ms 5976 KB Output is correct
12 Correct 2 ms 5980 KB Output is correct
13 Correct 2 ms 5980 KB Output is correct
14 Correct 2 ms 5980 KB Output is correct
15 Correct 2 ms 5980 KB Output is correct
16 Correct 2 ms 5980 KB Output is correct
17 Correct 2 ms 5980 KB Output is correct
18 Correct 2 ms 5980 KB Output is correct
19 Correct 2 ms 6128 KB Output is correct
20 Correct 2 ms 5980 KB Output is correct
21 Correct 2 ms 6072 KB Output is correct
22 Correct 2 ms 5980 KB Output is correct
23 Correct 1 ms 5980 KB Output is correct
24 Correct 4 ms 5980 KB Output is correct
25 Correct 2 ms 5980 KB Output is correct
26 Correct 2 ms 5980 KB Output is correct
27 Correct 2 ms 5980 KB Output is correct
28 Correct 2 ms 5980 KB Output is correct
29 Correct 2 ms 5980 KB Output is correct
30 Correct 2 ms 5980 KB Output is correct
31 Correct 2 ms 5976 KB Output is correct
32 Correct 2 ms 5980 KB Output is correct
33 Correct 2 ms 5980 KB Output is correct
34 Correct 2 ms 5980 KB Output is correct
35 Correct 2 ms 5976 KB Output is correct
36 Correct 2 ms 5976 KB Output is correct
37 Correct 2 ms 5980 KB Output is correct
38 Correct 2 ms 5980 KB Output is correct
39 Correct 2 ms 5980 KB Output is correct
40 Correct 2 ms 5980 KB Output is correct
41 Correct 2 ms 5980 KB Output is correct
42 Correct 2 ms 5976 KB Output is correct
43 Correct 2 ms 5980 KB Output is correct
44 Correct 2 ms 5976 KB Output is correct
45 Correct 2 ms 5980 KB Output is correct
46 Correct 2 ms 5980 KB Output is correct
47 Correct 2 ms 5976 KB Output is correct
48 Correct 2 ms 5980 KB Output is correct
49 Correct 2 ms 5980 KB Output is correct
50 Correct 2 ms 5976 KB Output is correct

Subtask #7
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 5976 KB Output is correct
2 Correct 2 ms 5980 KB Output is correct
3 Correct 2 ms 5980 KB Output is correct
4 Correct 2 ms 5980 KB Output is correct
5 Correct 2 ms 5976 KB Output is correct
6 Correct 3 ms 5976 KB Output is correct
7 Correct 2 ms 5980 KB Output is correct
8 Correct 2 ms 6060 KB Output is correct
9 Correct 2 ms 5980 KB Output is correct
10 Correct 2 ms 5976 KB Output is correct
11 Correct 2 ms 5976 KB Output is correct
12 Correct 2 ms 5980 KB Output is correct
13 Correct 2 ms 5980 KB Output is correct
14 Correct 2 ms 5980 KB Output is correct
15 Correct 2 ms 5980 KB Output is correct
16 Correct 2 ms 5980 KB Output is correct
17 Correct 2 ms 5980 KB Output is correct
18 Correct 2 ms 5980 KB Output is correct
19 Correct 2 ms 5980 KB Output is correct
20 Correct 2 ms 5980 KB Output is correct
21 Correct 2 ms 5980 KB Output is correct
22 Correct 2 ms 5976 KB Output is correct
23 Correct 2 ms 5976 KB Output is correct
24 Correct 2 ms 5976 KB Output is correct
25 Correct 2 ms 5980 KB Output is correct
26 Correct 2 ms 6128 KB Output is correct
27 Correct 2 ms 5980 KB Output is correct
28 Correct 2 ms 6072 KB Output is correct
29 Correct 2 ms 5980 KB Output is correct
30 Correct 1 ms 5980 KB Output is correct
31 Correct 4 ms 5980 KB Output is correct
32 Correct 2 ms 5980 KB Output is correct
33 Correct 2 ms 5980 KB Output is correct
34 Correct 2 ms 5980 KB Output is correct
35 Correct 2 ms 5980 KB Output is correct
36 Correct 2 ms 5980 KB Output is correct
37 Correct 2 ms 5980 KB Output is correct
38 Correct 2 ms 5976 KB Output is correct
39 Correct 2 ms 5980 KB Output is correct
40 Correct 2 ms 5980 KB Output is correct
41 Correct 2 ms 5980 KB Output is correct
42 Correct 2 ms 5976 KB Output is correct
43 Correct 2 ms 5976 KB Output is correct
44 Correct 2 ms 5980 KB Output is correct
45 Correct 2 ms 5980 KB Output is correct
46 Correct 2 ms 5980 KB Output is correct
47 Correct 2 ms 5980 KB Output is correct
48 Correct 2 ms 5980 KB Output is correct
49 Correct 2 ms 5976 KB Output is correct
50 Correct 2 ms 5980 KB Output is correct
51 Correct 2 ms 5976 KB Output is correct
52 Correct 2 ms 5980 KB Output is correct
53 Correct 2 ms 5980 KB Output is correct
54 Correct 2 ms 5976 KB Output is correct
55 Correct 2 ms 5980 KB Output is correct
56 Correct 2 ms 5980 KB Output is correct
57 Correct 2 ms 5976 KB Output is correct
58 Correct 2 ms 5980 KB Output is correct
59 Correct 2 ms 5976 KB Output is correct
60 Correct 2 ms 5980 KB Output is correct
61 Correct 2 ms 5980 KB Output is correct
62 Correct 2 ms 5980 KB Output is correct
63 Correct 2 ms 5980 KB Output is correct
64 Correct 2 ms 5980 KB Output is correct
65 Correct 2 ms 5980 KB Output is correct
66 Correct 2 ms 5976 KB Output is correct
67 Correct 3 ms 5980 KB Output is correct
68 Correct 2 ms 5980 KB Output is correct
69 Correct 2 ms 5980 KB Output is correct
70 Correct 2 ms 5980 KB Output is correct
71 Correct 2 ms 6092 KB Output is correct
72 Correct 2 ms 5980 KB Output is correct
73 Correct 2 ms 5976 KB Output is correct
74 Correct 2 ms 5976 KB Output is correct
75 Correct 2 ms 5980 KB Output is correct

Subtask #8
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 5976 KB Output is correct
2 Correct 2 ms 5980 KB Output is correct
3 Correct 2 ms 5980 KB Output is correct
4 Correct 2 ms 5980 KB Output is correct
5 Correct 2 ms 5976 KB Output is correct
6 Correct 3 ms 5976 KB Output is correct
7 Correct 2 ms 5980 KB Output is correct
8 Correct 2 ms 6060 KB Output is correct
9 Correct 2 ms 5980 KB Output is correct
10 Correct 2 ms 5976 KB Output is correct
11 Correct 2 ms 5976 KB Output is correct
12 Correct 2 ms 5980 KB Output is correct
13 Correct 2 ms 5980 KB Output is correct
14 Correct 2 ms 5980 KB Output is correct
15 Correct 2 ms 5980 KB Output is correct
16 Correct 2 ms 5980 KB Output is correct
17 Correct 2 ms 5980 KB Output is correct
18 Correct 2 ms 5980 KB Output is correct
19 Correct 2 ms 5980 KB Output is correct
20 Correct 2 ms 5980 KB Output is correct
21 Correct 2 ms 5980 KB Output is correct
22 Correct 2 ms 5976 KB Output is correct
23 Correct 2 ms 5976 KB Output is correct
24 Correct 2 ms 5976 KB Output is correct
25 Correct 2 ms 5980 KB Output is correct
26 Correct 3 ms 5976 KB Output is correct
27 Correct 4 ms 6744 KB Output is correct
28 Correct 3 ms 6492 KB Output is correct
29 Correct 4 ms 6748 KB Output is correct
30 Correct 4 ms 6748 KB Output is correct
31 Correct 3 ms 6492 KB Output is correct
32 Correct 3 ms 6748 KB Output is correct
33 Correct 4 ms 6744 KB Output is correct
34 Correct 2 ms 6128 KB Output is correct
35 Correct 2 ms 5980 KB Output is correct
36 Correct 2 ms 6072 KB Output is correct
37 Correct 2 ms 5980 KB Output is correct
38 Correct 1 ms 5980 KB Output is correct
39 Correct 4 ms 5980 KB Output is correct
40 Correct 2 ms 5980 KB Output is correct
41 Correct 2 ms 5980 KB Output is correct
42 Correct 2 ms 5980 KB Output is correct
43 Correct 2 ms 5980 KB Output is correct
44 Correct 2 ms 5980 KB Output is correct
45 Correct 2 ms 5980 KB Output is correct
46 Correct 2 ms 5976 KB Output is correct
47 Correct 2 ms 5980 KB Output is correct
48 Correct 2 ms 5980 KB Output is correct
49 Correct 2 ms 5980 KB Output is correct
50 Correct 2 ms 5976 KB Output is correct
51 Correct 2 ms 5976 KB Output is correct
52 Correct 2 ms 5980 KB Output is correct
53 Correct 2 ms 5980 KB Output is correct
54 Correct 2 ms 5980 KB Output is correct
55 Correct 2 ms 5980 KB Output is correct
56 Correct 2 ms 5980 KB Output is correct
57 Correct 2 ms 5976 KB Output is correct
58 Correct 2 ms 5980 KB Output is correct
59 Correct 2 ms 5976 KB Output is correct
60 Correct 2 ms 5980 KB Output is correct
61 Correct 2 ms 5980 KB Output is correct
62 Correct 2 ms 5976 KB Output is correct
63 Correct 2 ms 5980 KB Output is correct
64 Correct 2 ms 5980 KB Output is correct
65 Correct 2 ms 5976 KB Output is correct
66 Correct 2 ms 5980 KB Output is correct
67 Correct 2 ms 5976 KB Output is correct
68 Correct 2 ms 5980 KB Output is correct
69 Correct 2 ms 5980 KB Output is correct
70 Correct 2 ms 5980 KB Output is correct
71 Correct 2 ms 5980 KB Output is correct
72 Correct 2 ms 5980 KB Output is correct
73 Correct 2 ms 5980 KB Output is correct
74 Correct 2 ms 5976 KB Output is correct
75 Correct 3 ms 5980 KB Output is correct
76 Correct 2 ms 5980 KB Output is correct
77 Correct 2 ms 5980 KB Output is correct
78 Correct 2 ms 5980 KB Output is correct
79 Correct 2 ms 6092 KB Output is correct
80 Correct 2 ms 5980 KB Output is correct
81 Correct 2 ms 5976 KB Output is correct
82 Correct 2 ms 5976 KB Output is correct
83 Correct 2 ms 5980 KB Output is correct
84 Correct 3 ms 5976 KB Output is correct
85 Correct 3 ms 5976 KB Output is correct
86 Correct 3 ms 5980 KB Output is correct
87 Correct 3 ms 5980 KB Output is correct
88 Correct 3 ms 5980 KB Output is correct
89 Correct 4 ms 6492 KB Output is correct
90 Correct 4 ms 6492 KB Output is correct
91 Correct 4 ms 6488 KB Output is correct
92 Correct 4 ms 6492 KB Output is correct
93 Correct 3 ms 6488 KB Output is correct
94 Correct 3 ms 6488 KB Output is correct
95 Correct 3 ms 6744 KB Output is correct
96 Correct 3 ms 6492 KB Output is correct
97 Correct 4 ms 6488 KB Output is correct
98 Correct 3 ms 6488 KB Output is correct
99 Correct 3 ms 6488 KB Output is correct
100 Correct 3 ms 6236 KB Output is correct
101 Correct 3 ms 5980 KB Output is correct

Subtask #9
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 5976 KB Output is correct
2 Correct 2 ms 5980 KB Output is correct
3 Correct 2 ms 5980 KB Output is correct
4 Correct 2 ms 5980 KB Output is correct
5 Correct 2 ms 5976 KB Output is correct
6 Correct 3 ms 5976 KB Output is correct
7 Correct 2 ms 5980 KB Output is correct
8 Correct 2 ms 6060 KB Output is correct
9 Correct 2 ms 5980 KB Output is correct
10 Correct 2 ms 5976 KB Output is correct
11 Correct 2 ms 5976 KB Output is correct
12 Correct 2 ms 5980 KB Output is correct
13 Correct 2 ms 5980 KB Output is correct
14 Correct 2 ms 5980 KB Output is correct
15 Correct 2 ms 5980 KB Output is correct
16 Correct 2 ms 5980 KB Output is correct
17 Correct 2 ms 5980 KB Output is correct
18 Correct 2 ms 5980 KB Output is correct
19 Correct 2 ms 5980 KB Output is correct
20 Correct 2 ms 5980 KB Output is correct
21 Correct 2 ms 5980 KB Output is correct
22 Correct 2 ms 5976 KB Output is correct
23 Correct 2 ms 5976 KB Output is correct
24 Correct 2 ms 5976 KB Output is correct
25 Correct 2 ms 5980 KB Output is correct
26 Correct 3 ms 5976 KB Output is correct
27 Correct 4 ms 6744 KB Output is correct
28 Correct 3 ms 6492 KB Output is correct
29 Correct 4 ms 6748 KB Output is correct
30 Correct 4 ms 6748 KB Output is correct
31 Correct 3 ms 6492 KB Output is correct
32 Correct 3 ms 6748 KB Output is correct
33 Correct 4 ms 6744 KB Output is correct
34 Correct 2 ms 6128 KB Output is correct
35 Correct 2 ms 5980 KB Output is correct
36 Correct 2 ms 6072 KB Output is correct
37 Correct 2 ms 5980 KB Output is correct
38 Correct 1 ms 5980 KB Output is correct
39 Correct 4 ms 5980 KB Output is correct
40 Correct 2 ms 5980 KB Output is correct
41 Correct 2 ms 5980 KB Output is correct
42 Correct 2 ms 5980 KB Output is correct
43 Correct 2 ms 5980 KB Output is correct
44 Correct 2 ms 5980 KB Output is correct
45 Correct 2 ms 5980 KB Output is correct
46 Correct 2 ms 5976 KB Output is correct
47 Correct 2 ms 5980 KB Output is correct
48 Correct 2 ms 5980 KB Output is correct
49 Correct 2 ms 5980 KB Output is correct
50 Correct 2 ms 5976 KB Output is correct
51 Correct 2 ms 5976 KB Output is correct
52 Correct 2 ms 5980 KB Output is correct
53 Correct 2 ms 5980 KB Output is correct
54 Correct 2 ms 5980 KB Output is correct
55 Correct 2 ms 5980 KB Output is correct
56 Correct 2 ms 5980 KB Output is correct
57 Correct 2 ms 5976 KB Output is correct
58 Correct 2 ms 5980 KB Output is correct
59 Correct 2 ms 5976 KB Output is correct
60 Correct 2 ms 5980 KB Output is correct
61 Correct 2 ms 5980 KB Output is correct
62 Correct 2 ms 5976 KB Output is correct
63 Correct 2 ms 5980 KB Output is correct
64 Correct 2 ms 5980 KB Output is correct
65 Correct 2 ms 5976 KB Output is correct
66 Correct 2 ms 5980 KB Output is correct
67 Correct 2 ms 5976 KB Output is correct
68 Correct 2 ms 5980 KB Output is correct
69 Correct 2 ms 5980 KB Output is correct
70 Correct 2 ms 5980 KB Output is correct
71 Correct 2 ms 5980 KB Output is correct
72 Correct 2 ms 5980 KB Output is correct
73 Correct 2 ms 5980 KB Output is correct
74 Correct 2 ms 5976 KB Output is correct
75 Correct 3 ms 5980 KB Output is correct
76 Correct 2 ms 5980 KB Output is correct
77 Correct 2 ms 5980 KB Output is correct
78 Correct 2 ms 5980 KB Output is correct
79 Correct 2 ms 6092 KB Output is correct
80 Correct 2 ms 5980 KB Output is correct
81 Correct 2 ms 5976 KB Output is correct
82 Correct 2 ms 5976 KB Output is correct
83 Correct 2 ms 5980 KB Output is correct
84 Correct 3 ms 5976 KB Output is correct
85 Correct 3 ms 5976 KB Output is correct
86 Correct 3 ms 5980 KB Output is correct
87 Correct 3 ms 5980 KB Output is correct
88 Correct 3 ms 5980 KB Output is correct
89 Correct 4 ms 6492 KB Output is correct
90 Correct 4 ms 6492 KB Output is correct
91 Correct 4 ms 6488 KB Output is correct
92 Correct 4 ms 6492 KB Output is correct
93 Correct 3 ms 6488 KB Output is correct
94 Correct 3 ms 6488 KB Output is correct
95 Correct 3 ms 6744 KB Output is correct
96 Correct 3 ms 6492 KB Output is correct
97 Correct 4 ms 6488 KB Output is correct
98 Correct 3 ms 6488 KB Output is correct
99 Correct 3 ms 6488 KB Output is correct
100 Correct 3 ms 6236 KB Output is correct
101 Correct 3 ms 5980 KB Output is correct
102 Correct 85 ms 8728 KB Output is correct
103 Correct 83 ms 8564 KB Output is correct
104 Correct 253 ms 51632 KB Output is correct
105 Correct 102 ms 13176 KB Output is correct
106 Correct 131 ms 12888 KB Output is correct
107 Correct 79 ms 35632 KB Output is correct
108 Correct 77 ms 36624 KB Output is correct
109 Correct 124 ms 56444 KB Output is correct
110 Correct 242 ms 44452 KB Output is correct
111 Correct 181 ms 51344 KB Output is correct
112 Correct 193 ms 42704 KB Output is correct
113 Correct 179 ms 41592 KB Output is correct
114 Correct 162 ms 40272 KB Output is correct
115 Correct 182 ms 54340 KB Output is correct
116 Correct 236 ms 46232 KB Output is correct
117 Correct 219 ms 48012 KB Output is correct
118 Correct 214 ms 43868 KB Output is correct
119 Correct 106 ms 18260 KB Output is correct
120 Correct 90 ms 10836 KB Output is correct