oj.uz

Submission #828888

# Submission time Handle Problem Language Result Execution time Memory
828888 2023-08-17T18:33:38 Z fatemetmhr Fountain Parks (IOI21_parks) C++17
70 / 100
 664 ms 120256 KB 
// Be Name Khoda //

//#pragma GCC optimize ("O3")
//#pragma GCC target("avx2")
//#pragma GCC optimize("unroll-loops,O3")

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

using namespace std;


mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());


typedef long long ll;

#define debug(x)  cerr << "(" << (#x) << "): " << (x) << endl;
#define all(x)    x.begin(), x.end()
#define MAX(x, y) ((x) > (y) ? (x) : (y))
#define MIN(x, y) ((x) < (y) ? (x) : (y))
#define fi        first
#define se        second
#define pb        push_back
#define mp        make_pair

const int maxn5 = 1e6 + 10;


int n, q[maxn5], cnt[maxn5], ti, par[maxn5];
bool mark[maxn5];
vector <int> ret[2], ed[2], edg[maxn5];
vector <pair<int, int>> ver, toadd;
pair<pair <int, int>, pair<int, int>> adj[maxn5];
map <pair<int, int>, int> av, num;

bool bad(int i, int j, int x, int y){
    if(i == x){
        return (num[mp(i - 1, (j + y) / 2)] > 1 || num[mp(i + 1, (j + y) / 2)] > 1);
    }
    return (num[mp((i + x) / 2, j - 1)] > 1 || num[mp((i + x) / 2, j + 1)] > 1);
}

void dfs0(int v, int x, int y){
    par[v] = ti;
    av.erase(mp(x, y));
    if(av.find(mp(x - 2, y)) != av.end() && !bad(x, y, x - 2, y)){
        int u = av[mp(x - 2, y)];
        ed[0].pb(v);
        ed[1].pb(u);
        num[mp(x - 1, y - 1)]++;
        num[mp(x - 1, y + 1)]++;
        dfs0(u, x - 2, y);
    }
    else if(av.find(mp(x - 2, y)) != av.end())
        toadd.pb(mp(v, av[mp(x - 2, y)]));
    if(av.find(mp(x + 2, y)) != av.end() && !bad(x, y, x + 2, y)){
        int u = av[mp(x + 2, y)];
        ed[0].pb(v);
        ed[1].pb(u);
        num[mp(x + 1, y - 1)]++;
        num[mp(x + 1, y + 1)]++;
        dfs0(u, x + 2, y);
    }
    else if(av.find(mp(x + 2, y)) != av.end())
        toadd.pb(mp(v, av[mp(x + 2, y)]));
    if(av.find(mp(x, y - 2)) != av.end() && !bad(x, y, x, y - 2)){
        int u = av[mp(x, y - 2)];
        ed[0].pb(v);
        ed[1].pb(u);
        num[mp(x - 1, y - 1)]++;
        num[mp(x + 1, y - 1)]++;
        dfs0(u, x, y - 2);
    }
    else if(av.find(mp(x, y - 2)) != av.end())
        toadd.pb(mp(v, av[mp(x, y - 2)]));
    if(av.find(mp(x, y + 2)) != av.end() && !bad(x, y, x, y + 2)){
        int u = av[mp(x, y + 2)];
        ed[0].pb(v);
        ed[1].pb(u);
        num[mp(x - 1, y + 1)]++;
        num[mp(x + 1, y + 1)]++;
        dfs0(u, x, y + 2);
    }
    else if(av.find(mp(x, y + 2)) != av.end())
        toadd.pb(mp(v, av[mp(x, y + 2)]));
}

void dfs2(int v){
    mark[v] = true;
    for(auto u : edg[v]) if(!mark[u]){
        mark[u] = true;
        //debug(v);
        //debug(u);
        ret[0][v] = ver[u - (n - 1)].fi;
        ret[1][v] = ver[u - (n - 1)].se;
        for(auto z : edg[u]) if(!mark[z])
            dfs2(z);
        return;
    }
}

int get_par(int a){return par[a] == -1 ? a : par[a] = get_par(par[a]);}


int construct_roads(std::vector<int> x, std::vector<int> y) {
    n = x.size();
    for(int i = 0; i < n; i++){
        av[mp(x[i], y[i])] = i;
    }
    for(int i = 0; i < n; i++) if(av.find(mp(x[i], y[i])) != av.end()){
        ti = i;
        dfs0(i, x[i], y[i]);
        par[i] = -1;
    }
    shuffle(all(toadd), rng);
    for(auto [u, v] : toadd){
        int a = get_par(u);
        int b = get_par(v);
        if(a == b)
            continue;
        ed[0].pb(u);
        ed[1].pb(v);
        par[a] = b;
    }
    if(int(ed[0].size()) < n - 1)
        return 0;

    for(int i = 0; i < n - 1; i++){
        if(x[ed[0][i]] == x[ed[1][i]]){
            adj[i].fi = mp(x[ed[0][i]] - 1, (y[ed[0][i]] + y[ed[1][i]]) / 2);
            adj[i].se = mp(x[ed[0][i]] + 1, (y[ed[0][i]] + y[ed[1][i]]) / 2);
        }
        else{
            adj[i].fi = mp((x[ed[0][i]] + x[ed[1][i]]) / 2, y[ed[0][i]] - 1);
            adj[i].se = mp((x[ed[0][i]] + x[ed[1][i]]) / 2, y[ed[0][i]] + 1);
        }
        ver.pb(adj[i].fi);
        ver.pb(adj[i].se);
    }
    sort(all(ver));
    ver.resize(unique(all(ver)) - ver.begin());
    for(int i = 0; i < n - 1; i++){
        int pt = lower_bound(all(ver), adj[i].fi) - ver.begin();
        edg[i].pb(pt + n - 1);
        pt = lower_bound(all(ver), adj[i].se) - ver.begin();
        edg[i].pb(pt + n - 1);
        edg[edg[i][0]].pb(i);
        edg[edg[i][1]].pb(i);
        cnt[edg[i][0]]++;
        cnt[edg[i][1]]++;
    }
    /*
    for(int i = 0; i < int(ver.size()) + n - 1; i++){
        //debug(i);
        for(auto u : edg[i])
            cout << u << ' ';
        cout << endl;
    }
    //*/
    int l = 0, r = 0;
    for(int i = 0; i < int(ver.size()); i++) if(edg[i + n - 1].size() == 1){
        q[r++] = i + n - 1;
        mark[i + n - 1] = true;
    }
    ret[0].resize(n - 1);
    ret[1].resize(n - 1);
    //debug(r);
    while(l < r){
        int v = q[l++];
        for(auto u : edg[v]) if(!mark[u]){
            mark[u] = true;
            //debug(v);
            //debug(u);
            for(auto z : edg[u]){
                cnt[z]--;
                if(!mark[z] && cnt[z] == 1){
                    q[r++] = z;
                    mark[z] = true;
                }
            }
            ret[0][u] = ver[v - (n - 1)].fi;
            ret[1][u] = ver[v - (n - 1)].se;
        }
    }
    //return 0;
    //cout << ed[0].size() << ' ' << ed[1].size() << ' ' << ret[0].size() << ' ' << ret[1].size() << endl;
    for(int i = 0; i < n - 1; i++) if(!mark[i])
        dfs2(i);
    build(ed[0], ed[1], ret[0], ret[1]);
    return 1;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 23800 KB Output is correct
2 Correct 12 ms 23764 KB Output is correct
3 Correct 11 ms 23764 KB Output is correct
4 Correct 11 ms 23836 KB Output is correct
5 Correct 13 ms 23764 KB Output is correct
6 Correct 12 ms 23740 KB Output is correct
7 Correct 12 ms 23764 KB Output is correct
8 Correct 12 ms 23808 KB Output is correct
9 Correct 237 ms 70988 KB Output is correct
10 Correct 27 ms 28648 KB Output is correct
11 Correct 119 ms 49764 KB Output is correct
12 Correct 37 ms 31056 KB Output is correct
13 Correct 66 ms 34680 KB Output is correct
14 Correct 13 ms 24020 KB Output is correct
15 Correct 13 ms 24080 KB Output is correct
16 Correct 205 ms 65796 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 23800 KB Output is correct
2 Correct 12 ms 23764 KB Output is correct
3 Correct 11 ms 23764 KB Output is correct
4 Correct 11 ms 23836 KB Output is correct
5 Correct 13 ms 23764 KB Output is correct
6 Correct 12 ms 23740 KB Output is correct
7 Correct 12 ms 23764 KB Output is correct
8 Correct 12 ms 23808 KB Output is correct
9 Correct 237 ms 70988 KB Output is correct
10 Correct 27 ms 28648 KB Output is correct
11 Correct 119 ms 49764 KB Output is correct
12 Correct 37 ms 31056 KB Output is correct
13 Correct 66 ms 34680 KB Output is correct
14 Correct 13 ms 24020 KB Output is correct
15 Correct 13 ms 24080 KB Output is correct
16 Correct 205 ms 65796 KB Output is correct
17 Correct 12 ms 23788 KB Output is correct
18 Correct 13 ms 23712 KB Output is correct
19 Correct 12 ms 23804 KB Output is correct
20 Correct 12 ms 23764 KB Output is correct
21 Correct 12 ms 23780 KB Output is correct
22 Correct 12 ms 23724 KB Output is correct
23 Correct 641 ms 96672 KB Output is correct
24 Correct 12 ms 23764 KB Output is correct
25 Correct 14 ms 24192 KB Output is correct
26 Correct 15 ms 24276 KB Output is correct
27 Correct 17 ms 24316 KB Output is correct
28 Correct 219 ms 53660 KB Output is correct
29 Correct 347 ms 66444 KB Output is correct
30 Correct 483 ms 82700 KB Output is correct
31 Correct 663 ms 94912 KB Output is correct
32 Correct 12 ms 23764 KB Output is correct
33 Correct 12 ms 23764 KB Output is correct
34 Correct 13 ms 23824 KB Output is correct
35 Correct 12 ms 23780 KB Output is correct
36 Correct 13 ms 23712 KB Output is correct
37 Correct 12 ms 23720 KB Output is correct
38 Correct 12 ms 23788 KB Output is correct
39 Correct 12 ms 23800 KB Output is correct
40 Correct 12 ms 23800 KB Output is correct
41 Correct 14 ms 23764 KB Output is correct
42 Correct 12 ms 23764 KB Output is correct
43 Correct 15 ms 24132 KB Output is correct
44 Correct 15 ms 24200 KB Output is correct
45 Correct 210 ms 60828 KB Output is correct
46 Correct 302 ms 78252 KB Output is correct
47 Correct 312 ms 77464 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 23800 KB Output is correct
2 Correct 12 ms 23764 KB Output is correct
3 Correct 11 ms 23764 KB Output is correct
4 Correct 11 ms 23836 KB Output is correct
5 Correct 13 ms 23764 KB Output is correct
6 Correct 12 ms 23740 KB Output is correct
7 Correct 12 ms 23764 KB Output is correct
8 Correct 12 ms 23808 KB Output is correct
9 Correct 237 ms 70988 KB Output is correct
10 Correct 27 ms 28648 KB Output is correct
11 Correct 119 ms 49764 KB Output is correct
12 Correct 37 ms 31056 KB Output is correct
13 Correct 66 ms 34680 KB Output is correct
14 Correct 13 ms 24020 KB Output is correct
15 Correct 13 ms 24080 KB Output is correct
16 Correct 205 ms 65796 KB Output is correct
17 Correct 12 ms 23788 KB Output is correct
18 Correct 13 ms 23712 KB Output is correct
19 Correct 12 ms 23804 KB Output is correct
20 Correct 12 ms 23764 KB Output is correct
21 Correct 12 ms 23780 KB Output is correct
22 Correct 12 ms 23724 KB Output is correct
23 Correct 641 ms 96672 KB Output is correct
24 Correct 12 ms 23764 KB Output is correct
25 Correct 14 ms 24192 KB Output is correct
26 Correct 15 ms 24276 KB Output is correct
27 Correct 17 ms 24316 KB Output is correct
28 Correct 219 ms 53660 KB Output is correct
29 Correct 347 ms 66444 KB Output is correct
30 Correct 483 ms 82700 KB Output is correct
31 Correct 663 ms 94912 KB Output is correct
32 Correct 12 ms 23764 KB Output is correct
33 Correct 12 ms 23764 KB Output is correct
34 Correct 13 ms 23824 KB Output is correct
35 Correct 12 ms 23780 KB Output is correct
36 Correct 13 ms 23712 KB Output is correct
37 Correct 12 ms 23720 KB Output is correct
38 Correct 12 ms 23788 KB Output is correct
39 Correct 12 ms 23800 KB Output is correct
40 Correct 12 ms 23800 KB Output is correct
41 Correct 14 ms 23764 KB Output is correct
42 Correct 12 ms 23764 KB Output is correct
43 Correct 15 ms 24132 KB Output is correct
44 Correct 15 ms 24200 KB Output is correct
45 Correct 210 ms 60828 KB Output is correct
46 Correct 302 ms 78252 KB Output is correct
47 Correct 312 ms 77464 KB Output is correct
48 Correct 12 ms 23776 KB Output is correct
49 Correct 12 ms 23764 KB Output is correct
50 Correct 18 ms 23800 KB Output is correct
51 Correct 12 ms 23764 KB Output is correct
52 Correct 12 ms 23764 KB Output is correct
53 Correct 12 ms 23764 KB Output is correct
54 Correct 13 ms 23764 KB Output is correct
55 Correct 560 ms 90668 KB Output is correct
56 Correct 14 ms 23764 KB Output is correct
57 Correct 16 ms 24456 KB Output is correct
58 Correct 23 ms 25932 KB Output is correct
59 Correct 24 ms 25244 KB Output is correct
60 Correct 244 ms 59036 KB Output is correct
61 Correct 365 ms 70896 KB Output is correct
62 Correct 438 ms 79636 KB Output is correct
63 Correct 547 ms 89988 KB Output is correct
64 Correct 15 ms 23804 KB Output is correct
65 Correct 12 ms 23724 KB Output is correct
66 Correct 12 ms 23804 KB Output is correct
67 Correct 446 ms 112544 KB Output is correct
68 Correct 441 ms 112980 KB Output is correct
69 Correct 446 ms 115360 KB Output is correct
70 Correct 15 ms 24404 KB Output is correct
71 Correct 20 ms 24836 KB Output is correct
72 Correct 222 ms 56596 KB Output is correct
73 Correct 348 ms 76312 KB Output is correct
74 Correct 491 ms 89576 KB Output is correct
75 Correct 455 ms 101912 KB Output is correct
76 Correct 481 ms 119904 KB Output is correct
77 Correct 17 ms 24548 KB Output is correct
78 Correct 21 ms 25220 KB Output is correct
79 Correct 227 ms 59140 KB Output is correct
80 Correct 361 ms 77792 KB Output is correct
81 Correct 505 ms 95856 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 23800 KB Output is correct
2 Correct 12 ms 23764 KB Output is correct
3 Correct 11 ms 23764 KB Output is correct
4 Correct 11 ms 23836 KB Output is correct
5 Correct 13 ms 23764 KB Output is correct
6 Correct 12 ms 23740 KB Output is correct
7 Correct 12 ms 23764 KB Output is correct
8 Correct 12 ms 23808 KB Output is correct
9 Correct 237 ms 70988 KB Output is correct
10 Correct 27 ms 28648 KB Output is correct
11 Correct 119 ms 49764 KB Output is correct
12 Correct 37 ms 31056 KB Output is correct
13 Correct 66 ms 34680 KB Output is correct
14 Correct 13 ms 24020 KB Output is correct
15 Correct 13 ms 24080 KB Output is correct
16 Correct 205 ms 65796 KB Output is correct
17 Correct 12 ms 23764 KB Output is correct
18 Correct 12 ms 23764 KB Output is correct
19 Correct 12 ms 23764 KB Output is correct
20 Correct 346 ms 99620 KB Output is correct
21 Correct 438 ms 94568 KB Output is correct
22 Correct 440 ms 91924 KB Output is correct
23 Correct 372 ms 98212 KB Output is correct
24 Correct 354 ms 41308 KB Output is correct
25 Correct 543 ms 55552 KB Output is correct
26 Correct 266 ms 55436 KB Output is correct
27 Correct 421 ms 94980 KB Output is correct
28 Correct 446 ms 94780 KB Output is correct
29 Correct 664 ms 94932 KB Output is correct
30 Correct 654 ms 94880 KB Output is correct
31 Correct 11 ms 23796 KB Output is correct
32 Correct 41 ms 28820 KB Output is correct
33 Correct 137 ms 33144 KB Output is correct
34 Correct 356 ms 95512 KB Output is correct
35 Correct 25 ms 25036 KB Output is correct
36 Correct 83 ms 29460 KB Output is correct
37 Correct 148 ms 35120 KB Output is correct
38 Correct 199 ms 46464 KB Output is correct
39 Correct 282 ms 54560 KB Output is correct
40 Correct 358 ms 62664 KB Output is correct
41 Correct 450 ms 70912 KB Output is correct
42 Correct 542 ms 79104 KB Output is correct
43 Correct 12 ms 23764 KB Output is correct
44 Correct 14 ms 23752 KB Output is correct
45 Correct 15 ms 23740 KB Output is correct
46 Correct 12 ms 23764 KB Output is correct
47 Correct 12 ms 23728 KB Output is correct
48 Correct 11 ms 23728 KB Output is correct
49 Correct 11 ms 23780 KB Output is correct
50 Correct 11 ms 23732 KB Output is correct
51 Correct 12 ms 23764 KB Output is correct
52 Correct 11 ms 23716 KB Output is correct
53 Correct 12 ms 23764 KB Output is correct
54 Correct 13 ms 24096 KB Output is correct
55 Correct 14 ms 24148 KB Output is correct
56 Correct 202 ms 60864 KB Output is correct
57 Correct 314 ms 78248 KB Output is correct
58 Correct 344 ms 77516 KB Output is correct
59 Correct 11 ms 23764 KB Output is correct
60 Correct 11 ms 23804 KB Output is correct
61 Correct 12 ms 23800 KB Output is correct
62 Correct 449 ms 112576 KB Output is correct
63 Correct 445 ms 113024 KB Output is correct
64 Correct 444 ms 115348 KB Output is correct
65 Correct 15 ms 24404 KB Output is correct
66 Correct 19 ms 24804 KB Output is correct
67 Correct 217 ms 56548 KB Output is correct
68 Correct 355 ms 76340 KB Output is correct
69 Correct 489 ms 89576 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 23800 KB Output is correct
2 Correct 12 ms 23764 KB Output is correct
3 Correct 11 ms 23764 KB Output is correct
4 Correct 11 ms 23836 KB Output is correct
5 Correct 13 ms 23764 KB Output is correct
6 Correct 12 ms 23740 KB Output is correct
7 Correct 12 ms 23764 KB Output is correct
8 Correct 12 ms 23808 KB Output is correct
9 Correct 237 ms 70988 KB Output is correct
10 Correct 27 ms 28648 KB Output is correct
11 Correct 119 ms 49764 KB Output is correct
12 Correct 37 ms 31056 KB Output is correct
13 Correct 66 ms 34680 KB Output is correct
14 Correct 13 ms 24020 KB Output is correct
15 Correct 13 ms 24080 KB Output is correct
16 Correct 205 ms 65796 KB Output is correct
17 Correct 432 ms 120256 KB Output is correct
18 Correct 429 ms 117900 KB Output is correct
19 Correct 401 ms 99912 KB Output is correct
20 Correct 615 ms 93988 KB Output is correct
21 Correct 482 ms 91480 KB Output is correct
22 Correct 13 ms 23764 KB Output is correct
23 Correct 78 ms 33860 KB Output is correct
24 Correct 38 ms 26828 KB Output is correct
25 Correct 121 ms 33112 KB Output is correct
26 Correct 195 ms 38452 KB Output is correct
27 Correct 261 ms 58136 KB Output is correct
28 Correct 352 ms 66828 KB Output is correct
29 Correct 431 ms 75012 KB Output is correct
30 Correct 492 ms 83348 KB Output is correct
31 Correct 569 ms 91700 KB Output is correct
32 Correct 469 ms 102000 KB Output is correct
33 Correct 447 ms 119820 KB Output is correct
34 Correct 17 ms 24532 KB Output is correct
35 Correct 21 ms 25160 KB Output is correct
36 Correct 220 ms 59032 KB Output is correct
37 Correct 365 ms 77904 KB Output is correct
38 Correct 500 ms 95832 KB Output is correct

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 23800 KB Output is correct
2 Correct 12 ms 23764 KB Output is correct
3 Correct 11 ms 23764 KB Output is correct
4 Correct 11 ms 23836 KB Output is correct
5 Correct 13 ms 23764 KB Output is correct
6 Correct 12 ms 23740 KB Output is correct
7 Correct 12 ms 23764 KB Output is correct
8 Correct 12 ms 23808 KB Output is correct
9 Correct 237 ms 70988 KB Output is correct
10 Correct 27 ms 28648 KB Output is correct
11 Correct 119 ms 49764 KB Output is correct
12 Correct 37 ms 31056 KB Output is correct
13 Correct 66 ms 34680 KB Output is correct
14 Correct 13 ms 24020 KB Output is correct
15 Correct 13 ms 24080 KB Output is correct
16 Correct 205 ms 65796 KB Output is correct
17 Correct 12 ms 23788 KB Output is correct
18 Correct 13 ms 23712 KB Output is correct
19 Correct 12 ms 23804 KB Output is correct
20 Correct 12 ms 23764 KB Output is correct
21 Correct 12 ms 23780 KB Output is correct
22 Correct 12 ms 23724 KB Output is correct
23 Correct 641 ms 96672 KB Output is correct
24 Correct 12 ms 23764 KB Output is correct
25 Correct 14 ms 24192 KB Output is correct
26 Correct 15 ms 24276 KB Output is correct
27 Correct 17 ms 24316 KB Output is correct
28 Correct 219 ms 53660 KB Output is correct
29 Correct 347 ms 66444 KB Output is correct
30 Correct 483 ms 82700 KB Output is correct
31 Correct 663 ms 94912 KB Output is correct
32 Correct 12 ms 23764 KB Output is correct
33 Correct 12 ms 23764 KB Output is correct
34 Correct 13 ms 23824 KB Output is correct
35 Correct 12 ms 23780 KB Output is correct
36 Correct 13 ms 23712 KB Output is correct
37 Correct 12 ms 23720 KB Output is correct
38 Correct 12 ms 23788 KB Output is correct
39 Correct 12 ms 23800 KB Output is correct
40 Correct 12 ms 23800 KB Output is correct
41 Correct 14 ms 23764 KB Output is correct
42 Correct 12 ms 23764 KB Output is correct
43 Correct 15 ms 24132 KB Output is correct
44 Correct 15 ms 24200 KB Output is correct
45 Correct 210 ms 60828 KB Output is correct
46 Correct 302 ms 78252 KB Output is correct
47 Correct 312 ms 77464 KB Output is correct
48 Correct 12 ms 23776 KB Output is correct
49 Correct 12 ms 23764 KB Output is correct
50 Correct 18 ms 23800 KB Output is correct
51 Correct 12 ms 23764 KB Output is correct
52 Correct 12 ms 23764 KB Output is correct
53 Correct 12 ms 23764 KB Output is correct
54 Correct 13 ms 23764 KB Output is correct
55 Correct 560 ms 90668 KB Output is correct
56 Correct 14 ms 23764 KB Output is correct
57 Correct 16 ms 24456 KB Output is correct
58 Correct 23 ms 25932 KB Output is correct
59 Correct 24 ms 25244 KB Output is correct
60 Correct 244 ms 59036 KB Output is correct
61 Correct 365 ms 70896 KB Output is correct
62 Correct 438 ms 79636 KB Output is correct
63 Correct 547 ms 89988 KB Output is correct
64 Correct 15 ms 23804 KB Output is correct
65 Correct 12 ms 23724 KB Output is correct
66 Correct 12 ms 23804 KB Output is correct
67 Correct 446 ms 112544 KB Output is correct
68 Correct 441 ms 112980 KB Output is correct
69 Correct 446 ms 115360 KB Output is correct
70 Correct 15 ms 24404 KB Output is correct
71 Correct 20 ms 24836 KB Output is correct
72 Correct 222 ms 56596 KB Output is correct
73 Correct 348 ms 76312 KB Output is correct
74 Correct 491 ms 89576 KB Output is correct
75 Correct 455 ms 101912 KB Output is correct
76 Correct 481 ms 119904 KB Output is correct
77 Correct 17 ms 24548 KB Output is correct
78 Correct 21 ms 25220 KB Output is correct
79 Correct 227 ms 59140 KB Output is correct
80 Correct 361 ms 77792 KB Output is correct
81 Correct 505 ms 95856 KB Output is correct
82 Correct 12 ms 23764 KB Output is correct
83 Correct 12 ms 23764 KB Output is correct
84 Correct 12 ms 23764 KB Output is correct
85 Correct 346 ms 99620 KB Output is correct
86 Correct 438 ms 94568 KB Output is correct
87 Correct 440 ms 91924 KB Output is correct
88 Correct 372 ms 98212 KB Output is correct
89 Correct 354 ms 41308 KB Output is correct
90 Correct 543 ms 55552 KB Output is correct
91 Correct 266 ms 55436 KB Output is correct
92 Correct 421 ms 94980 KB Output is correct
93 Correct 446 ms 94780 KB Output is correct
94 Correct 664 ms 94932 KB Output is correct
95 Correct 654 ms 94880 KB Output is correct
96 Correct 11 ms 23796 KB Output is correct
97 Correct 41 ms 28820 KB Output is correct
98 Correct 137 ms 33144 KB Output is correct
99 Correct 356 ms 95512 KB Output is correct
100 Correct 25 ms 25036 KB Output is correct
101 Correct 83 ms 29460 KB Output is correct
102 Correct 148 ms 35120 KB Output is correct
103 Correct 199 ms 46464 KB Output is correct
104 Correct 282 ms 54560 KB Output is correct
105 Correct 358 ms 62664 KB Output is correct
106 Correct 450 ms 70912 KB Output is correct
107 Correct 542 ms 79104 KB Output is correct
108 Correct 12 ms 23764 KB Output is correct
109 Correct 14 ms 23752 KB Output is correct
110 Correct 15 ms 23740 KB Output is correct
111 Correct 12 ms 23764 KB Output is correct
112 Correct 12 ms 23728 KB Output is correct
113 Correct 11 ms 23728 KB Output is correct
114 Correct 11 ms 23780 KB Output is correct
115 Correct 11 ms 23732 KB Output is correct
116 Correct 12 ms 23764 KB Output is correct
117 Correct 11 ms 23716 KB Output is correct
118 Correct 12 ms 23764 KB Output is correct
119 Correct 13 ms 24096 KB Output is correct
120 Correct 14 ms 24148 KB Output is correct
121 Correct 202 ms 60864 KB Output is correct
122 Correct 314 ms 78248 KB Output is correct
123 Correct 344 ms 77516 KB Output is correct
124 Correct 11 ms 23764 KB Output is correct
125 Correct 11 ms 23804 KB Output is correct
126 Correct 12 ms 23800 KB Output is correct
127 Correct 449 ms 112576 KB Output is correct
128 Correct 445 ms 113024 KB Output is correct
129 Correct 444 ms 115348 KB Output is correct
130 Correct 15 ms 24404 KB Output is correct
131 Correct 19 ms 24804 KB Output is correct
132 Correct 217 ms 56548 KB Output is correct
133 Correct 355 ms 76340 KB Output is correct
134 Correct 489 ms 89576 KB Output is correct
135 Correct 432 ms 120256 KB Output is correct
136 Correct 429 ms 117900 KB Output is correct
137 Correct 401 ms 99912 KB Output is correct
138 Correct 615 ms 93988 KB Output is correct
139 Correct 482 ms 91480 KB Output is correct
140 Correct 13 ms 23764 KB Output is correct
141 Correct 78 ms 33860 KB Output is correct
142 Correct 38 ms 26828 KB Output is correct
143 Correct 121 ms 33112 KB Output is correct
144 Correct 195 ms 38452 KB Output is correct
145 Correct 261 ms 58136 KB Output is correct
146 Correct 352 ms 66828 KB Output is correct
147 Correct 431 ms 75012 KB Output is correct
148 Correct 492 ms 83348 KB Output is correct
149 Correct 569 ms 91700 KB Output is correct
150 Correct 469 ms 102000 KB Output is correct
151 Correct 447 ms 119820 KB Output is correct
152 Correct 17 ms 24532 KB Output is correct
153 Correct 21 ms 25160 KB Output is correct
154 Correct 220 ms 59032 KB Output is correct
155 Correct 365 ms 77904 KB Output is correct
156 Correct 500 ms 95832 KB Output is correct
157 Correct 12 ms 23764 KB Output is correct
158 Correct 11 ms 23764 KB Output is correct
159 Correct 11 ms 23736 KB Output is correct
160 Correct 12 ms 23720 KB Output is correct
161 Incorrect 662 ms 82836 KB a[38892] = 0 is not an odd integer
162 Halted 0 ms 0 KB -