oj.uz

Submission #800837

# Submission time Handle Problem Language Result Execution time Memory
800837 2023-08-01T23:51:45 Z TB_ Joker (BOI20_joker) C++17
100 / 100
 220 ms 27964 KB 
#include <bits/stdc++.h>
using namespace std;

// #undef _GLIBCXX_DEBUG                // disable run-time bound checking, etc
// #pragma GCC optimize("Ofast,inline") // Ofast = O3,fast-math,allow-store-data-races,no-protect-parens
// #pragma GCC optimize ("unroll-loops")

// #pragma GCC target("bmi,bmi2,lzcnt,popcnt")                      // bit manipulation
// #pragma GCC target("movbe")                                      // byte swap
// #pragma GCC target("aes,pclmul,rdrnd")                           // encryption
// #pragma GCC target("avx,avx2,f16c,fma,sse3,ssse3,sse4.1,sse4.2") // SIMD

// #include <bits/extc++.h>
// using namespace __gnu_pbds;
// template<class T>using ordered_set = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;
// template<class T>using ordered_multiset = tree<T, null_type, less_equal<T>, rb_tree_tag,tree_order_statistics_node_update>;

#define ll long long
#define INF (ll)1e9+7
#define fo(i, n) for(int i=0;i<((ll)n);i++)
#define deb(x) cout << #x << " = " << x << endl;
#define deb2(x, y) cout << #x << " = " << x << ", " << #y << " = " << y << endl
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define LSOne(S) ((S) & (-S))
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
inline int readint(){ int v = 0; char c; while((c = getchar()) != EOF && c != ' ' && c != '\n'){ v *= 10; v += c - '0'; } return v; }
inline int readintsigned() { int v = 0; int sign = 1; char c = getchar(); if (c == '-') { sign = -1; } else { v += c - '0'; } while ((c = getchar()) != EOF && c != ' ' && c != '\n') { v *= 10; v += c - '0'; } return v * sign; }
inline string readstring() { string s; char c; while ((c = getchar()) != EOF && c != '\n' && c != ' ') { s.push_back(c); } return s; }
template <class result_t=std::chrono::milliseconds,class clock_t=std::chrono::steady_clock,class duration_t = std::chrono::milliseconds>
auto since(std::chrono::time_point<clock_t, duration_t> const& start){return std::chrono::duration_cast<result_t>(clock_t::now() - start);}
typedef pair<int, int> pii;
typedef pair<ll, ll> pl;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<pii> vpii;
typedef vector<pl> vpl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef vector<vpii> vvpii;
typedef vector<vpl> vvpl;



struct UnionFind{
    vl degree, height, p, siz, extraHeight;
    vector<pair<pii, pii>> updates; // pUpdates, sizUpdate
    vi possibleUpdate, extraHeightUpdate;
    int n;
    int possible = 0;
    UnionFind(int n) : n(n) {
        height.assign(n, 0);
        extraHeight.assign(n, 0);
        degree.assign(n, 0); 
        p.assign(n, 0); 
        siz.assign(n, 1); 
        fo(i, n) p[i] = i;
    }

    int find(int x){
        if(x == p[x]) return x;
        int res = find(p[x]);
        height[x] = height[p[x]]+1+extraHeight[x];
        return res;
    }


    void unite(int a, int b){
        possibleUpdate.pb(possible);
        extraHeightUpdate.pb(-1);
        updates.pb({{-1, -1}, {-1, -1}});
        int a2 = find(a);
        int b2 = find(b);
        if(a2==b2){
            if(height[a]%2 == height[b]%2) possible++;
        }else{
            if(siz[b2] > siz[a2]) {
                swap(a2, b2);
                swap(a, b);
            }
            updates[updates.size()-1] = {{b2, p[b2]}, {a2, siz[a2]}};
            siz[a2] += siz[b2];
            p[b2] = a2;
            if((height[b2]%2 == height[b]%2)^(height[a2]%2 == height[a]%2)){
                extraHeight[b2]++;
                extraHeightUpdate[extraHeightUpdate.size()-1] = b2;
            }
        }
    }  


    void rollback(){
        possible = possibleUpdate[possibleUpdate.size()-1];
        int heightupdate = extraHeightUpdate[extraHeightUpdate.size()-1];
        if(heightupdate != -1) extraHeight[heightupdate]--;
        pair<pl, pl> up = updates[updates.size()-1];
        if(up.F.F != -1){
            p[up.F.F] = up.F.S;
            siz[up.S.F] = up.S.S;

        }
        updates.pop_back();
        possibleUpdate.pop_back();
        extraHeightUpdate.pop_back();
    }  
};

UnionFind uf(200001);
vpl edges;
vi ans(200001, -1);

void solve(int lo, int hi, int r){
    if(hi < lo) return;

    int mid = (lo + hi) / 2;
    int preSizeLo = uf.updates.size();
    fo(i, mid-lo){
        uf.unite(edges[lo+i].F, edges[lo+i].S);
        if(uf.possible){
            for(int j = mid; j <= hi; j++) ans[j] = r; 
            while(uf.updates.size() != preSizeLo) uf.rollback();
            solve(lo, mid-1, r);
            return;
        }
    }
    int preSizeHi = uf.updates.size();
    for(int i = r; i >= lo; i--){
        if(uf.possible){
            ans[mid] = i;
            break;
        }
        if(i <= lo) continue;
        uf.unite(edges[i].F, edges[i].S);
    }
    while(uf.updates.size() != preSizeHi) uf.rollback();
    uf.unite(edges[mid].F, edges[mid].S);
    solve(mid+1, hi, r);
    while(uf.updates.size() != preSizeLo) uf.rollback();
    for(int i = r; i > max(lo, ans[mid]); i--){
        uf.unite(edges[i].F, edges[i].S);
        if(uf.possible){
            for(int j = lo; j < mid; j++) ans[j] = ans[mid];
            return;
        }
    }
    solve(lo, mid-1, ans[mid]);
}


int main() {
    // cout << fixed << setprecision(20);
    // auto start = std::chrono::steady_clock::now(); // since(start).count()
    cin.tie(0)->sync_with_stdio(0);

    int n, m, q, from, to, que;
    cin >> n >> m >> q;
    fo(i, m){
        cin >> from >> to;
        edges.pb({from-1, to-1});
    }

    solve(0, m-1, m-1);

    fo(x, q){
        cin >> from >> to;
        cout << (ans[from-1]>=to-1?"YES\n":"NO\n");      
    }
    


    exit(0);
}

Compilation message

Joker.cpp: In function 'void solve(int, int, int)':
Joker.cpp:124:37: warning: comparison of integer expressions of different signedness: 'std::vector<std::pair<std::pair<int, int>, std::pair<int, int> > >::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  124 |             while(uf.updates.size() != preSizeLo) uf.rollback();
      |                   ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
Joker.cpp:138:29: warning: comparison of integer expressions of different signedness: 'std::vector<std::pair<std::pair<int, int>, std::pair<int, int> > >::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  138 |     while(uf.updates.size() != preSizeHi) uf.rollback();
      |           ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
Joker.cpp:141:29: warning: comparison of integer expressions of different signedness: 'std::vector<std::pair<std::pair<int, int>, std::pair<int, int> > >::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  141 |     while(uf.updates.size() != preSizeLo) uf.rollback();
      |           ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~
Joker.cpp: In function 'int main()':
Joker.cpp:158:28: warning: unused variable 'que' [-Wunused-variable]
  158 |     int n, m, q, from, to, que;
      |                            ^~~

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 8916 KB Output is correct
2 Correct 5 ms 8916 KB Output is correct
3 Correct 3 ms 8916 KB Output is correct
4 Correct 5 ms 8916 KB Output is correct
5 Correct 4 ms 8860 KB Output is correct
6 Correct 4 ms 8916 KB Output is correct
7 Correct 4 ms 8888 KB Output is correct
8 Correct 4 ms 8856 KB Output is correct
9 Correct 3 ms 8916 KB Output is correct
10 Correct 5 ms 8916 KB Output is correct
11 Correct 4 ms 8916 KB Output is correct
12 Correct 4 ms 8916 KB Output is correct
13 Correct 4 ms 8916 KB Output is correct
14 Correct 4 ms 8916 KB Output is correct
15 Correct 4 ms 8916 KB Output is correct
16 Correct 4 ms 8916 KB Output is correct
17 Correct 3 ms 8916 KB Output is correct
18 Correct 3 ms 8916 KB Output is correct
19 Correct 5 ms 8916 KB Output is correct
20 Correct 5 ms 8916 KB Output is correct
21 Correct 4 ms 8916 KB Output is correct
22 Correct 4 ms 8916 KB Output is correct
23 Correct 4 ms 8916 KB Output is correct
24 Correct 3 ms 8896 KB Output is correct
25 Correct 3 ms 8916 KB Output is correct
26 Correct 3 ms 8916 KB Output is correct
27 Correct 4 ms 8916 KB Output is correct
28 Correct 4 ms 8916 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 8916 KB Output is correct
2 Correct 5 ms 8916 KB Output is correct
3 Correct 3 ms 8916 KB Output is correct
4 Correct 5 ms 8916 KB Output is correct
5 Correct 4 ms 8860 KB Output is correct
6 Correct 4 ms 8916 KB Output is correct
7 Correct 4 ms 8888 KB Output is correct
8 Correct 4 ms 8856 KB Output is correct
9 Correct 3 ms 8916 KB Output is correct
10 Correct 5 ms 8916 KB Output is correct
11 Correct 4 ms 8916 KB Output is correct
12 Correct 4 ms 8916 KB Output is correct
13 Correct 4 ms 8916 KB Output is correct
14 Correct 4 ms 8916 KB Output is correct
15 Correct 4 ms 8916 KB Output is correct
16 Correct 4 ms 8916 KB Output is correct
17 Correct 3 ms 8916 KB Output is correct
18 Correct 3 ms 8916 KB Output is correct
19 Correct 5 ms 8916 KB Output is correct
20 Correct 5 ms 8916 KB Output is correct
21 Correct 4 ms 8916 KB Output is correct
22 Correct 4 ms 8916 KB Output is correct
23 Correct 4 ms 8916 KB Output is correct
24 Correct 3 ms 8896 KB Output is correct
25 Correct 3 ms 8916 KB Output is correct
26 Correct 3 ms 8916 KB Output is correct
27 Correct 4 ms 8916 KB Output is correct
28 Correct 4 ms 8916 KB Output is correct
29 Correct 4 ms 8916 KB Output is correct
30 Correct 4 ms 9044 KB Output is correct
31 Correct 4 ms 8916 KB Output is correct
32 Correct 4 ms 8924 KB Output is correct
33 Correct 4 ms 8916 KB Output is correct
34 Correct 5 ms 9044 KB Output is correct
35 Correct 5 ms 9044 KB Output is correct
36 Correct 4 ms 8916 KB Output is correct
37 Correct 5 ms 9044 KB Output is correct
38 Correct 5 ms 9044 KB Output is correct
39 Correct 5 ms 9088 KB Output is correct
40 Correct 4 ms 8916 KB Output is correct
41 Correct 4 ms 8916 KB Output is correct
42 Correct 4 ms 8916 KB Output is correct
43 Correct 4 ms 8916 KB Output is correct
44 Correct 4 ms 8916 KB Output is correct
45 Correct 4 ms 8916 KB Output is correct
46 Correct 5 ms 9064 KB Output is correct
47 Correct 4 ms 8916 KB Output is correct
48 Correct 4 ms 8916 KB Output is correct
49 Correct 6 ms 9044 KB Output is correct
50 Correct 4 ms 9044 KB Output is correct
51 Correct 4 ms 8916 KB Output is correct
52 Correct 10 ms 8916 KB Output is correct
53 Correct 7 ms 9032 KB Output is correct
54 Correct 4 ms 9044 KB Output is correct

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 8916 KB Output is correct
2 Correct 5 ms 8916 KB Output is correct
3 Correct 128 ms 17140 KB Output is correct
4 Correct 161 ms 27392 KB Output is correct
5 Correct 84 ms 21608 KB Output is correct
6 Correct 108 ms 17424 KB Output is correct
7 Correct 94 ms 17376 KB Output is correct
8 Correct 96 ms 17584 KB Output is correct
9 Correct 112 ms 18020 KB Output is correct
10 Correct 172 ms 18068 KB Output is correct
11 Correct 147 ms 17820 KB Output is correct
12 Correct 129 ms 17972 KB Output is correct
13 Correct 107 ms 17768 KB Output is correct
14 Correct 104 ms 17832 KB Output is correct
15 Correct 149 ms 17828 KB Output is correct
16 Correct 159 ms 17848 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 8916 KB Output is correct
2 Correct 5 ms 8916 KB Output is correct
3 Correct 3 ms 8916 KB Output is correct
4 Correct 5 ms 8916 KB Output is correct
5 Correct 4 ms 8860 KB Output is correct
6 Correct 4 ms 8916 KB Output is correct
7 Correct 4 ms 8888 KB Output is correct
8 Correct 4 ms 8856 KB Output is correct
9 Correct 3 ms 8916 KB Output is correct
10 Correct 5 ms 8916 KB Output is correct
11 Correct 4 ms 8916 KB Output is correct
12 Correct 4 ms 8916 KB Output is correct
13 Correct 4 ms 8916 KB Output is correct
14 Correct 4 ms 8916 KB Output is correct
15 Correct 4 ms 8916 KB Output is correct
16 Correct 4 ms 8916 KB Output is correct
17 Correct 3 ms 8916 KB Output is correct
18 Correct 3 ms 8916 KB Output is correct
19 Correct 5 ms 8916 KB Output is correct
20 Correct 5 ms 8916 KB Output is correct
21 Correct 4 ms 8916 KB Output is correct
22 Correct 4 ms 8916 KB Output is correct
23 Correct 4 ms 8916 KB Output is correct
24 Correct 3 ms 8896 KB Output is correct
25 Correct 3 ms 8916 KB Output is correct
26 Correct 3 ms 8916 KB Output is correct
27 Correct 4 ms 8916 KB Output is correct
28 Correct 4 ms 8916 KB Output is correct
29 Correct 128 ms 17140 KB Output is correct
30 Correct 161 ms 27392 KB Output is correct
31 Correct 84 ms 21608 KB Output is correct
32 Correct 108 ms 17424 KB Output is correct
33 Correct 94 ms 17376 KB Output is correct
34 Correct 96 ms 17584 KB Output is correct
35 Correct 112 ms 18020 KB Output is correct
36 Correct 172 ms 18068 KB Output is correct
37 Correct 147 ms 17820 KB Output is correct
38 Correct 129 ms 17972 KB Output is correct
39 Correct 107 ms 17768 KB Output is correct
40 Correct 104 ms 17832 KB Output is correct
41 Correct 149 ms 17828 KB Output is correct
42 Correct 159 ms 17848 KB Output is correct
43 Correct 129 ms 17832 KB Output is correct
44 Correct 154 ms 27964 KB Output is correct
45 Correct 165 ms 22296 KB Output is correct
46 Correct 94 ms 17852 KB Output is correct
47 Correct 92 ms 17892 KB Output is correct
48 Correct 147 ms 18016 KB Output is correct
49 Correct 161 ms 18108 KB Output is correct
50 Correct 139 ms 17756 KB Output is correct
51 Correct 138 ms 17768 KB Output is correct
52 Correct 138 ms 17924 KB Output is correct
53 Correct 126 ms 17776 KB Output is correct
54 Correct 135 ms 17784 KB Output is correct
55 Correct 149 ms 17888 KB Output is correct
56 Correct 157 ms 17956 KB Output is correct

Subtask #5
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 8916 KB Output is correct
2 Correct 5 ms 8916 KB Output is correct
3 Correct 3 ms 8916 KB Output is correct
4 Correct 5 ms 8916 KB Output is correct
5 Correct 4 ms 8860 KB Output is correct
6 Correct 4 ms 8916 KB Output is correct
7 Correct 4 ms 8888 KB Output is correct
8 Correct 4 ms 8856 KB Output is correct
9 Correct 3 ms 8916 KB Output is correct
10 Correct 5 ms 8916 KB Output is correct
11 Correct 4 ms 8916 KB Output is correct
12 Correct 4 ms 8916 KB Output is correct
13 Correct 4 ms 8916 KB Output is correct
14 Correct 4 ms 8916 KB Output is correct
15 Correct 4 ms 8916 KB Output is correct
16 Correct 4 ms 8916 KB Output is correct
17 Correct 3 ms 8916 KB Output is correct
18 Correct 3 ms 8916 KB Output is correct
19 Correct 5 ms 8916 KB Output is correct
20 Correct 5 ms 8916 KB Output is correct
21 Correct 4 ms 8916 KB Output is correct
22 Correct 4 ms 8916 KB Output is correct
23 Correct 4 ms 8916 KB Output is correct
24 Correct 3 ms 8896 KB Output is correct
25 Correct 3 ms 8916 KB Output is correct
26 Correct 3 ms 8916 KB Output is correct
27 Correct 4 ms 8916 KB Output is correct
28 Correct 4 ms 8916 KB Output is correct
29 Correct 4 ms 8916 KB Output is correct
30 Correct 4 ms 9044 KB Output is correct
31 Correct 4 ms 8916 KB Output is correct
32 Correct 4 ms 8924 KB Output is correct
33 Correct 4 ms 8916 KB Output is correct
34 Correct 5 ms 9044 KB Output is correct
35 Correct 5 ms 9044 KB Output is correct
36 Correct 4 ms 8916 KB Output is correct
37 Correct 5 ms 9044 KB Output is correct
38 Correct 5 ms 9044 KB Output is correct
39 Correct 5 ms 9088 KB Output is correct
40 Correct 4 ms 8916 KB Output is correct
41 Correct 4 ms 8916 KB Output is correct
42 Correct 4 ms 8916 KB Output is correct
43 Correct 4 ms 8916 KB Output is correct
44 Correct 4 ms 8916 KB Output is correct
45 Correct 4 ms 8916 KB Output is correct
46 Correct 5 ms 9064 KB Output is correct
47 Correct 4 ms 8916 KB Output is correct
48 Correct 4 ms 8916 KB Output is correct
49 Correct 6 ms 9044 KB Output is correct
50 Correct 4 ms 9044 KB Output is correct
51 Correct 4 ms 8916 KB Output is correct
52 Correct 10 ms 8916 KB Output is correct
53 Correct 7 ms 9032 KB Output is correct
54 Correct 4 ms 9044 KB Output is correct
55 Correct 101 ms 16568 KB Output is correct
56 Correct 134 ms 27396 KB Output is correct
57 Correct 58 ms 21376 KB Output is correct
58 Correct 73 ms 17216 KB Output is correct
59 Correct 118 ms 17248 KB Output is correct
60 Correct 160 ms 17248 KB Output is correct
61 Correct 120 ms 17216 KB Output is correct
62 Correct 105 ms 17328 KB Output is correct
63 Correct 79 ms 17312 KB Output is correct
64 Correct 109 ms 17228 KB Output is correct
65 Correct 143 ms 17236 KB Output is correct

Subtask #6
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 8916 KB Output is correct
2 Correct 5 ms 8916 KB Output is correct
3 Correct 3 ms 8916 KB Output is correct
4 Correct 5 ms 8916 KB Output is correct
5 Correct 4 ms 8860 KB Output is correct
6 Correct 4 ms 8916 KB Output is correct
7 Correct 4 ms 8888 KB Output is correct
8 Correct 4 ms 8856 KB Output is correct
9 Correct 3 ms 8916 KB Output is correct
10 Correct 5 ms 8916 KB Output is correct
11 Correct 4 ms 8916 KB Output is correct
12 Correct 4 ms 8916 KB Output is correct
13 Correct 4 ms 8916 KB Output is correct
14 Correct 4 ms 8916 KB Output is correct
15 Correct 4 ms 8916 KB Output is correct
16 Correct 4 ms 8916 KB Output is correct
17 Correct 3 ms 8916 KB Output is correct
18 Correct 3 ms 8916 KB Output is correct
19 Correct 5 ms 8916 KB Output is correct
20 Correct 5 ms 8916 KB Output is correct
21 Correct 4 ms 8916 KB Output is correct
22 Correct 4 ms 8916 KB Output is correct
23 Correct 4 ms 8916 KB Output is correct
24 Correct 3 ms 8896 KB Output is correct
25 Correct 3 ms 8916 KB Output is correct
26 Correct 3 ms 8916 KB Output is correct
27 Correct 4 ms 8916 KB Output is correct
28 Correct 4 ms 8916 KB Output is correct
29 Correct 4 ms 8916 KB Output is correct
30 Correct 4 ms 9044 KB Output is correct
31 Correct 4 ms 8916 KB Output is correct
32 Correct 4 ms 8924 KB Output is correct
33 Correct 4 ms 8916 KB Output is correct
34 Correct 5 ms 9044 KB Output is correct
35 Correct 5 ms 9044 KB Output is correct
36 Correct 4 ms 8916 KB Output is correct
37 Correct 5 ms 9044 KB Output is correct
38 Correct 5 ms 9044 KB Output is correct
39 Correct 5 ms 9088 KB Output is correct
40 Correct 4 ms 8916 KB Output is correct
41 Correct 4 ms 8916 KB Output is correct
42 Correct 4 ms 8916 KB Output is correct
43 Correct 4 ms 8916 KB Output is correct
44 Correct 4 ms 8916 KB Output is correct
45 Correct 4 ms 8916 KB Output is correct
46 Correct 5 ms 9064 KB Output is correct
47 Correct 4 ms 8916 KB Output is correct
48 Correct 4 ms 8916 KB Output is correct
49 Correct 6 ms 9044 KB Output is correct
50 Correct 4 ms 9044 KB Output is correct
51 Correct 4 ms 8916 KB Output is correct
52 Correct 10 ms 8916 KB Output is correct
53 Correct 7 ms 9032 KB Output is correct
54 Correct 4 ms 9044 KB Output is correct
55 Correct 128 ms 17140 KB Output is correct
56 Correct 161 ms 27392 KB Output is correct
57 Correct 84 ms 21608 KB Output is correct
58 Correct 108 ms 17424 KB Output is correct
59 Correct 94 ms 17376 KB Output is correct
60 Correct 96 ms 17584 KB Output is correct
61 Correct 112 ms 18020 KB Output is correct
62 Correct 172 ms 18068 KB Output is correct
63 Correct 147 ms 17820 KB Output is correct
64 Correct 129 ms 17972 KB Output is correct
65 Correct 107 ms 17768 KB Output is correct
66 Correct 104 ms 17832 KB Output is correct
67 Correct 149 ms 17828 KB Output is correct
68 Correct 159 ms 17848 KB Output is correct
69 Correct 129 ms 17832 KB Output is correct
70 Correct 154 ms 27964 KB Output is correct
71 Correct 165 ms 22296 KB Output is correct
72 Correct 94 ms 17852 KB Output is correct
73 Correct 92 ms 17892 KB Output is correct
74 Correct 147 ms 18016 KB Output is correct
75 Correct 161 ms 18108 KB Output is correct
76 Correct 139 ms 17756 KB Output is correct
77 Correct 138 ms 17768 KB Output is correct
78 Correct 138 ms 17924 KB Output is correct
79 Correct 126 ms 17776 KB Output is correct
80 Correct 135 ms 17784 KB Output is correct
81 Correct 149 ms 17888 KB Output is correct
82 Correct 157 ms 17956 KB Output is correct
83 Correct 101 ms 16568 KB Output is correct
84 Correct 134 ms 27396 KB Output is correct
85 Correct 58 ms 21376 KB Output is correct
86 Correct 73 ms 17216 KB Output is correct
87 Correct 118 ms 17248 KB Output is correct
88 Correct 160 ms 17248 KB Output is correct
89 Correct 120 ms 17216 KB Output is correct
90 Correct 105 ms 17328 KB Output is correct
91 Correct 79 ms 17312 KB Output is correct
92 Correct 109 ms 17228 KB Output is correct
93 Correct 143 ms 17236 KB Output is correct
94 Correct 133 ms 17912 KB Output is correct
95 Correct 196 ms 25568 KB Output is correct
96 Correct 90 ms 26428 KB Output is correct
97 Correct 91 ms 22236 KB Output is correct
98 Correct 103 ms 22204 KB Output is correct
99 Correct 117 ms 22236 KB Output is correct
100 Correct 142 ms 22548 KB Output is correct
101 Correct 162 ms 22232 KB Output is correct
102 Correct 146 ms 22400 KB Output is correct
103 Correct 166 ms 22716 KB Output is correct
104 Correct 113 ms 22104 KB Output is correct
105 Correct 143 ms 22232 KB Output is correct
106 Correct 220 ms 22352 KB Output is correct
107 Correct 78 ms 26984 KB Output is correct
108 Correct 137 ms 22136 KB Output is correct
109 Correct 124 ms 21972 KB Output is correct
110 Correct 129 ms 22024 KB Output is correct
111 Correct 126 ms 21948 KB Output is correct
112 Correct 135 ms 21976 KB Output is correct
113 Correct 128 ms 21940 KB Output is correct
114 Correct 142 ms 21972 KB Output is correct
115 Correct 137 ms 21984 KB Output is correct
116 Correct 140 ms 22008 KB Output is correct