oj.uz

답안 #550019

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
550019 2022-04-17T05:00:31 Z Theo830 분수 공원 (IOI21_parks) C++17
70 / 100
 1154 ms 106156 KB 
#include <bits/stdc++.h>
using namespace std;
typedef int ll;
const ll INF = 1e9+7;
const ll MOD = 998244353;
typedef pair<ll,ll> ii;
#define iii pair<ll,ii>
#define iii2 pair<ii,ll>
#define f(i,a,b) for(ll i = a;i < b;i++)
#define pb push_back
#define vll vector<ll>
#define F first
#define S second
#define all(x) (x).begin(), (x).end()
///I hope I will get uprating and don't make mistakes
///I will never stop programming
///sqrt(-1) Love C++
///Please don't hack me
///@TheofanisOrfanou Theo830
///Think different approaches (bs,dp,greedy,graphs,shortest paths,mst)
///Stay Calm
///Look for special cases
///Beware of overflow and array bounds
///Think the problem backwards
///Training
#include "parks.h"
//void build(std::vector<int> u, std::vector<int> v, std::vector<int> a, std::vector<int> b);
ll dx[4] = {2,-2,0,0};
ll dy[4] = {0,0,2,-2};
map<ii,ll>mp;
ll p[200005];
ll find_par(ll a){
    if(p[a] == a){
        return a;
    }
    return p[a] = find_par(p[a]);
}
void enose(ll a,ll b){
    ll p1 = find_par(a);
    ll p2 = find_par(b);
    p[p1] = p2;
}
int construct_roads(std::vector<int> x, std::vector<int> y) {
    ll n = x.size();
    f(i,0,n){
        mp[ii(x[i],y[i])] = i+1;
        p[i+1] = i+1;
    }
    vector<int>u,v,a,b;
    vector<iii2>w;
    f(i,0,n){
        w.pb(iii2(ii(x[i],y[i]),i));
    }
    sort(all(w));
    f(i,0,n){
        f(j,0,4){
            ll X = w[i].F.F + dx[j];
            ll Y = w[i].F.S + dy[j];
            ll pos = mp[ii(X,Y)];
            if(pos && find_par(w[i].S + 1) != find_par(pos)){
                enose(w[i].S + 1,pos);
                u.pb(w[i].S);
                v.pb(pos-1);
            }
        }
    }
    a.assign(n-1,0);
    b.assign(n-1,0);
    if((ll)u.size() != n-1){
        return 0;
    }
    mp.clear();
    map<ii,vll>ex;
    set<iii>s;
    f(i,0,n-1){
        ll A = (x[u[i]] + x[v[i]]) / 2;
        ll B = (y[u[i]] + y[v[i]]) / 2;
        if(A % 2 == 0){
            mp[ii(A+1,B)]++;
            mp[ii(A-1,B)]++;
            ex[ii(A+1,B)].pb(i);
            ex[ii(A-1,B)].pb(i);
        }
        else{
            mp[ii(A,B+1)]++;
            mp[ii(A,B-1)]++;
            ex[ii(A,B+1)].pb(i);
            ex[ii(A,B-1)].pb(i);
        }
    }
    for(auto x:mp){
        s.insert(iii(x.S,x.F));
    }
    while(!s.empty()){
        auto it = s.begin();
        for(auto z:ex[(*it).S]){
            if(a[z] == 0){
                ll A = (x[u[z]] + x[v[z]]) / 2;
                ll B = (y[u[z]] + y[v[z]]) / 2;
                a[z] = (*it).S.F;
                b[z] = (*it).S.S;
                if(A % 2 == 0){
                    if(A + 1 == a[z]){
                        A -= 1;
                    }
                    else{
                        A += 1;
                    }
                    mp[ii(A,B)]--;
                    s.erase(iii(mp[ii(A,B)] + 1,ii(A,B)));
                    s.insert(iii(mp[ii(A,B)],ii(A,B)));
                }
                else{
                    if((B + 1) == b[z]){
                        B -= 1;
                    }
                    else{
                        B += 1;
                    }
                    mp[ii(A,B)]--;
                    s.erase(iii(mp[ii(A,B)] + 1,ii(A,B)));
                    s.insert(iii(mp[ii(A,B)],ii(A,B)));
                }
                break;
            }
        }
        s.erase((*it));
    }
    build(u,v,a,b);
    return 1;
}
/*
static void check(bool cond, string message) {
    if (!cond) {
        printf("%s\n", message.c_str());
        fclose(stdout);
        exit(0);
    }
}

static int n;
static bool build_called;
static int m;
static vector<int> _u, _v, _a, _b;
void build(vector<int> u, vector<int> v, vector<int> a, vector<int> b) {
    check(!build_called, "build is called more than once");
    build_called = true;
    m = u.size();
    check(int(v.size()) == m, "u.size() != v.size()");
    check(int(a.size()) == m, "u.size() != a.size()");
    check(int(b.size()) == m, "u.size() != b.size()");
    _u = u;
    _v = v;
    _a = a;
    _b = b;
}

int main() {
    assert(scanf("%d", &n) == 1);
    vector<int> x(n), y(n);
    for (int i = 0; i < n; i++) {
        assert(scanf("%d%d", &x[i], &y[i]) == 2);
    }
    fclose(stdin);

    build_called = false;
    const int possible = construct_roads(x, y);

    check(possible == 0 || possible == 1, "Invalid return value of construct_roads()");
    if (possible == 1) {
        check(build_called, "construct_roads() returned 1 without calling build()");
    } else {
        check(!build_called, "construct_roads() called build() but returned 0");
    }

    printf("%d\n", possible);
    if (possible == 1) {
        printf("%d\n", m);
        for (int j = 0; j < m; j++) {
            printf("%d %d %d %d\n", _u[j], _v[j], _a[j], _b[j]);
        }
    }
    fclose(stdout);
    return 0;
}
*/

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 480 ms 52024 KB Output is correct
10 Correct 33 ms 5516 KB Output is correct
11 Correct 231 ms 28568 KB Output is correct
12 Correct 56 ms 8120 KB Output is correct
13 Correct 58 ms 11012 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 2 ms 724 KB Output is correct
16 Correct 483 ms 52368 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 480 ms 52024 KB Output is correct
10 Correct 33 ms 5516 KB Output is correct
11 Correct 231 ms 28568 KB Output is correct
12 Correct 56 ms 8120 KB Output is correct
13 Correct 58 ms 11012 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 2 ms 724 KB Output is correct
16 Correct 483 ms 52368 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 312 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 0 ms 316 KB Output is correct
23 Correct 876 ms 57780 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 3 ms 596 KB Output is correct
26 Correct 3 ms 852 KB Output is correct
27 Correct 4 ms 980 KB Output is correct
28 Correct 278 ms 23512 KB Output is correct
29 Correct 452 ms 35016 KB Output is correct
30 Correct 655 ms 46520 KB Output is correct
31 Correct 824 ms 57888 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 1 ms 212 KB Output is correct
37 Correct 1 ms 212 KB Output is correct
38 Correct 1 ms 316 KB Output is correct
39 Correct 1 ms 312 KB Output is correct
40 Correct 1 ms 212 KB Output is correct
41 Correct 1 ms 212 KB Output is correct
42 Correct 1 ms 212 KB Output is correct
43 Correct 2 ms 596 KB Output is correct
44 Correct 4 ms 876 KB Output is correct
45 Correct 406 ms 37764 KB Output is correct
46 Correct 614 ms 54764 KB Output is correct
47 Correct 604 ms 54644 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 480 ms 52024 KB Output is correct
10 Correct 33 ms 5516 KB Output is correct
11 Correct 231 ms 28568 KB Output is correct
12 Correct 56 ms 8120 KB Output is correct
13 Correct 58 ms 11012 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 2 ms 724 KB Output is correct
16 Correct 483 ms 52368 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 312 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 0 ms 316 KB Output is correct
23 Correct 876 ms 57780 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 3 ms 596 KB Output is correct
26 Correct 3 ms 852 KB Output is correct
27 Correct 4 ms 980 KB Output is correct
28 Correct 278 ms 23512 KB Output is correct
29 Correct 452 ms 35016 KB Output is correct
30 Correct 655 ms 46520 KB Output is correct
31 Correct 824 ms 57888 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 1 ms 212 KB Output is correct
37 Correct 1 ms 212 KB Output is correct
38 Correct 1 ms 316 KB Output is correct
39 Correct 1 ms 312 KB Output is correct
40 Correct 1 ms 212 KB Output is correct
41 Correct 1 ms 212 KB Output is correct
42 Correct 1 ms 212 KB Output is correct
43 Correct 2 ms 596 KB Output is correct
44 Correct 4 ms 876 KB Output is correct
45 Correct 406 ms 37764 KB Output is correct
46 Correct 614 ms 54764 KB Output is correct
47 Correct 604 ms 54644 KB Output is correct
48 Correct 1 ms 212 KB Output is correct
49 Correct 1 ms 340 KB Output is correct
50 Correct 1 ms 212 KB Output is correct
51 Correct 1 ms 212 KB Output is correct
52 Correct 1 ms 212 KB Output is correct
53 Correct 1 ms 212 KB Output is correct
54 Correct 1 ms 212 KB Output is correct
55 Correct 792 ms 57408 KB Output is correct
56 Correct 1 ms 212 KB Output is correct
57 Correct 4 ms 832 KB Output is correct
58 Correct 14 ms 2124 KB Output is correct
59 Correct 10 ms 1928 KB Output is correct
60 Correct 344 ms 29516 KB Output is correct
61 Correct 493 ms 39804 KB Output is correct
62 Correct 606 ms 48368 KB Output is correct
63 Correct 790 ms 58808 KB Output is correct
64 Correct 1 ms 212 KB Output is correct
65 Correct 1 ms 308 KB Output is correct
66 Correct 0 ms 212 KB Output is correct
67 Correct 1038 ms 105268 KB Output is correct
68 Correct 1034 ms 106156 KB Output is correct
69 Correct 1000 ms 105160 KB Output is correct
70 Correct 4 ms 980 KB Output is correct
71 Correct 8 ms 1800 KB Output is correct
72 Correct 393 ms 37020 KB Output is correct
73 Correct 629 ms 55672 KB Output is correct
74 Correct 862 ms 74084 KB Output is correct
75 Correct 911 ms 77796 KB Output is correct
76 Correct 1025 ms 105816 KB Output is correct
77 Correct 5 ms 1236 KB Output is correct
78 Correct 11 ms 1928 KB Output is correct
79 Correct 397 ms 36908 KB Output is correct
80 Correct 625 ms 55488 KB Output is correct
81 Correct 853 ms 73956 KB Output is correct

Subtask #4
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 480 ms 52024 KB Output is correct
10 Correct 33 ms 5516 KB Output is correct
11 Correct 231 ms 28568 KB Output is correct
12 Correct 56 ms 8120 KB Output is correct
13 Correct 58 ms 11012 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 2 ms 724 KB Output is correct
16 Correct 483 ms 52368 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 0 ms 316 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 697 ms 57092 KB Output is correct
21 Correct 683 ms 57164 KB Output is correct
22 Correct 680 ms 58080 KB Output is correct
23 Correct 788 ms 89164 KB Output is correct
24 Correct 291 ms 46064 KB Output is correct
25 Correct 285 ms 35128 KB Output is correct
26 Correct 274 ms 35108 KB Output is correct
27 Correct 798 ms 104392 KB Output is correct
28 Correct 798 ms 104164 KB Output is correct
29 Correct 909 ms 104176 KB Output is correct
30 Correct 895 ms 104168 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 47 ms 5480 KB Output is correct
33 Correct 128 ms 23648 KB Output is correct
34 Correct 664 ms 57196 KB Output is correct
35 Correct 11 ms 1944 KB Output is correct
36 Correct 60 ms 8648 KB Output is correct
37 Correct 132 ms 16432 KB Output is correct
38 Correct 277 ms 27376 KB Output is correct
39 Correct 409 ms 37304 KB Output is correct
40 Correct 520 ms 47292 KB Output is correct
41 Correct 634 ms 57376 KB Output is correct
42 Correct 768 ms 67348 KB Output is correct
43 Correct 0 ms 212 KB Output is correct
44 Correct 1 ms 312 KB Output is correct
45 Correct 1 ms 212 KB Output is correct
46 Correct 0 ms 212 KB Output is correct
47 Correct 1 ms 308 KB Output is correct
48 Correct 1 ms 316 KB Output is correct
49 Correct 1 ms 212 KB Output is correct
50 Correct 1 ms 212 KB Output is correct
51 Correct 1 ms 308 KB Output is correct
52 Correct 1 ms 212 KB Output is correct
53 Correct 1 ms 212 KB Output is correct
54 Correct 2 ms 596 KB Output is correct
55 Correct 4 ms 832 KB Output is correct
56 Correct 414 ms 37868 KB Output is correct
57 Correct 613 ms 54772 KB Output is correct
58 Correct 603 ms 54764 KB Output is correct
59 Correct 0 ms 212 KB Output is correct
60 Correct 1 ms 212 KB Output is correct
61 Correct 1 ms 212 KB Output is correct
62 Correct 1132 ms 104148 KB Output is correct
63 Correct 1154 ms 105068 KB Output is correct
64 Correct 1142 ms 104308 KB Output is correct
65 Correct 5 ms 980 KB Output is correct
66 Correct 12 ms 1736 KB Output is correct
67 Correct 440 ms 36992 KB Output is correct
68 Correct 750 ms 55040 KB Output is correct
69 Correct 1025 ms 73124 KB Output is correct

Subtask #5
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 480 ms 52024 KB Output is correct
10 Correct 33 ms 5516 KB Output is correct
11 Correct 231 ms 28568 KB Output is correct
12 Correct 56 ms 8120 KB Output is correct
13 Correct 58 ms 11012 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 2 ms 724 KB Output is correct
16 Correct 483 ms 52368 KB Output is correct
17 Correct 1052 ms 104484 KB Output is correct
18 Correct 963 ms 105252 KB Output is correct
19 Correct 682 ms 58304 KB Output is correct
20 Correct 729 ms 71912 KB Output is correct
21 Correct 714 ms 82752 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 104 ms 11964 KB Output is correct
24 Correct 20 ms 3380 KB Output is correct
25 Correct 85 ms 11156 KB Output is correct
26 Correct 160 ms 18124 KB Output is correct
27 Correct 348 ms 36560 KB Output is correct
28 Correct 451 ms 45496 KB Output is correct
29 Correct 584 ms 54600 KB Output is correct
30 Correct 683 ms 63132 KB Output is correct
31 Correct 797 ms 72232 KB Output is correct
32 Correct 935 ms 76908 KB Output is correct
33 Correct 1077 ms 104904 KB Output is correct
34 Correct 6 ms 1236 KB Output is correct
35 Correct 11 ms 1940 KB Output is correct
36 Correct 390 ms 36560 KB Output is correct
37 Correct 636 ms 54904 KB Output is correct
38 Correct 875 ms 72972 KB Output is correct

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 480 ms 52024 KB Output is correct
10 Correct 33 ms 5516 KB Output is correct
11 Correct 231 ms 28568 KB Output is correct
12 Correct 56 ms 8120 KB Output is correct
13 Correct 58 ms 11012 KB Output is correct
14 Correct 1 ms 468 KB Output is correct
15 Correct 2 ms 724 KB Output is correct
16 Correct 483 ms 52368 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 312 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 0 ms 316 KB Output is correct
23 Correct 876 ms 57780 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 3 ms 596 KB Output is correct
26 Correct 3 ms 852 KB Output is correct
27 Correct 4 ms 980 KB Output is correct
28 Correct 278 ms 23512 KB Output is correct
29 Correct 452 ms 35016 KB Output is correct
30 Correct 655 ms 46520 KB Output is correct
31 Correct 824 ms 57888 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 1 ms 212 KB Output is correct
37 Correct 1 ms 212 KB Output is correct
38 Correct 1 ms 316 KB Output is correct
39 Correct 1 ms 312 KB Output is correct
40 Correct 1 ms 212 KB Output is correct
41 Correct 1 ms 212 KB Output is correct
42 Correct 1 ms 212 KB Output is correct
43 Correct 2 ms 596 KB Output is correct
44 Correct 4 ms 876 KB Output is correct
45 Correct 406 ms 37764 KB Output is correct
46 Correct 614 ms 54764 KB Output is correct
47 Correct 604 ms 54644 KB Output is correct
48 Correct 1 ms 212 KB Output is correct
49 Correct 1 ms 340 KB Output is correct
50 Correct 1 ms 212 KB Output is correct
51 Correct 1 ms 212 KB Output is correct
52 Correct 1 ms 212 KB Output is correct
53 Correct 1 ms 212 KB Output is correct
54 Correct 1 ms 212 KB Output is correct
55 Correct 792 ms 57408 KB Output is correct
56 Correct 1 ms 212 KB Output is correct
57 Correct 4 ms 832 KB Output is correct
58 Correct 14 ms 2124 KB Output is correct
59 Correct 10 ms 1928 KB Output is correct
60 Correct 344 ms 29516 KB Output is correct
61 Correct 493 ms 39804 KB Output is correct
62 Correct 606 ms 48368 KB Output is correct
63 Correct 790 ms 58808 KB Output is correct
64 Correct 1 ms 212 KB Output is correct
65 Correct 1 ms 308 KB Output is correct
66 Correct 0 ms 212 KB Output is correct
67 Correct 1038 ms 105268 KB Output is correct
68 Correct 1034 ms 106156 KB Output is correct
69 Correct 1000 ms 105160 KB Output is correct
70 Correct 4 ms 980 KB Output is correct
71 Correct 8 ms 1800 KB Output is correct
72 Correct 393 ms 37020 KB Output is correct
73 Correct 629 ms 55672 KB Output is correct
74 Correct 862 ms 74084 KB Output is correct
75 Correct 911 ms 77796 KB Output is correct
76 Correct 1025 ms 105816 KB Output is correct
77 Correct 5 ms 1236 KB Output is correct
78 Correct 11 ms 1928 KB Output is correct
79 Correct 397 ms 36908 KB Output is correct
80 Correct 625 ms 55488 KB Output is correct
81 Correct 853 ms 73956 KB Output is correct
82 Correct 1 ms 212 KB Output is correct
83 Correct 0 ms 316 KB Output is correct
84 Correct 1 ms 212 KB Output is correct
85 Correct 697 ms 57092 KB Output is correct
86 Correct 683 ms 57164 KB Output is correct
87 Correct 680 ms 58080 KB Output is correct
88 Correct 788 ms 89164 KB Output is correct
89 Correct 291 ms 46064 KB Output is correct
90 Correct 285 ms 35128 KB Output is correct
91 Correct 274 ms 35108 KB Output is correct
92 Correct 798 ms 104392 KB Output is correct
93 Correct 798 ms 104164 KB Output is correct
94 Correct 909 ms 104176 KB Output is correct
95 Correct 895 ms 104168 KB Output is correct
96 Correct 1 ms 212 KB Output is correct
97 Correct 47 ms 5480 KB Output is correct
98 Correct 128 ms 23648 KB Output is correct
99 Correct 664 ms 57196 KB Output is correct
100 Correct 11 ms 1944 KB Output is correct
101 Correct 60 ms 8648 KB Output is correct
102 Correct 132 ms 16432 KB Output is correct
103 Correct 277 ms 27376 KB Output is correct
104 Correct 409 ms 37304 KB Output is correct
105 Correct 520 ms 47292 KB Output is correct
106 Correct 634 ms 57376 KB Output is correct
107 Correct 768 ms 67348 KB Output is correct
108 Correct 0 ms 212 KB Output is correct
109 Correct 1 ms 312 KB Output is correct
110 Correct 1 ms 212 KB Output is correct
111 Correct 0 ms 212 KB Output is correct
112 Correct 1 ms 308 KB Output is correct
113 Correct 1 ms 316 KB Output is correct
114 Correct 1 ms 212 KB Output is correct
115 Correct 1 ms 212 KB Output is correct
116 Correct 1 ms 308 KB Output is correct
117 Correct 1 ms 212 KB Output is correct
118 Correct 1 ms 212 KB Output is correct
119 Correct 2 ms 596 KB Output is correct
120 Correct 4 ms 832 KB Output is correct
121 Correct 414 ms 37868 KB Output is correct
122 Correct 613 ms 54772 KB Output is correct
123 Correct 603 ms 54764 KB Output is correct
124 Correct 0 ms 212 KB Output is correct
125 Correct 1 ms 212 KB Output is correct
126 Correct 1 ms 212 KB Output is correct
127 Correct 1132 ms 104148 KB Output is correct
128 Correct 1154 ms 105068 KB Output is correct
129 Correct 1142 ms 104308 KB Output is correct
130 Correct 5 ms 980 KB Output is correct
131 Correct 12 ms 1736 KB Output is correct
132 Correct 440 ms 36992 KB Output is correct
133 Correct 750 ms 55040 KB Output is correct
134 Correct 1025 ms 73124 KB Output is correct
135 Correct 1052 ms 104484 KB Output is correct
136 Correct 963 ms 105252 KB Output is correct
137 Correct 682 ms 58304 KB Output is correct
138 Correct 729 ms 71912 KB Output is correct
139 Correct 714 ms 82752 KB Output is correct
140 Correct 1 ms 212 KB Output is correct
141 Correct 104 ms 11964 KB Output is correct
142 Correct 20 ms 3380 KB Output is correct
143 Correct 85 ms 11156 KB Output is correct
144 Correct 160 ms 18124 KB Output is correct
145 Correct 348 ms 36560 KB Output is correct
146 Correct 451 ms 45496 KB Output is correct
147 Correct 584 ms 54600 KB Output is correct
148 Correct 683 ms 63132 KB Output is correct
149 Correct 797 ms 72232 KB Output is correct
150 Correct 935 ms 76908 KB Output is correct
151 Correct 1077 ms 104904 KB Output is correct
152 Correct 6 ms 1236 KB Output is correct
153 Correct 11 ms 1940 KB Output is correct
154 Correct 390 ms 36560 KB Output is correct
155 Correct 636 ms 54904 KB Output is correct
156 Correct 875 ms 72972 KB Output is correct
157 Correct 0 ms 212 KB Output is correct
158 Correct 0 ms 212 KB Output is correct
159 Correct 1 ms 212 KB Output is correct
160 Correct 1 ms 212 KB Output is correct
161 Correct 670 ms 58784 KB Output is correct
162 Correct 688 ms 59248 KB Output is correct
163 Correct 763 ms 60204 KB Output is correct
164 Correct 685 ms 60384 KB Output is correct
165 Correct 677 ms 59880 KB Output is correct
166 Correct 747 ms 59404 KB Output is correct
167 Incorrect 154 ms 14952 KB a[32] = 0 is not an odd integer
168 Halted 0 ms 0 KB -