oj.uz

답안 #837428

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
837428 2023-08-25T10:46:49 Z QwertyPi 분수 공원 (IOI21_parks) C++17
70 / 100
 1174 ms 85820 KB 
#include "parks.h"
#include <bits/stdc++.h>
#define all(x) x.begin(), x.end()
using namespace std;

const int N_MAX = 2e5 + 11;

struct point{
    int x, y;
    bool operator< (const point& o) const {
        return x < o.x || (x == o.x && y < o.y);
    }
};

struct edge{
    int u, v;
};

int n;
map<point, int> mp;
vector<point> a;

struct DSU{
    int dsu[N_MAX];
    void init(int n){
        for(int i = 0; i < n; i++) dsu[i] = i;
    }
    int f(int x){ return x == dsu[x] ? x : dsu[x] = f(dsu[x]); }
    void g(int x, int y){ x = f(x), y = f(y); dsu[x] = y; }
} dsu;

vector<edge> construct_tree(){
    vector<edge> ans;
    dsu.init(n);
    vector<int> p; for(int i = 0; i < n; i++) p.push_back(i);
    sort(p.begin(), p.end(), [](int u, int v){ return a[u] < a[v]; });
    for(int j = 0; j < n; j++){
        int i = p[j];
        for(auto [dx, dy] : vector<pair<int, int>>{{0, -2}, {0, 2}, {2, 0}, {-2, 0}}){
            int nx = a[i].x + dx, ny = a[i].y + dy;
            if(mp.count({nx, ny})){
                int v = mp[{nx, ny}];
                if(dsu.f(i) != dsu.f(v)){
                    dsu.g(i, v);
                    ans.push_back({i, v});
                }
            }
        }
    }
    return ans;
}

vector<point> adj(int u, int v){
    assert(abs(a[u].x - a[v].x) + abs(a[u].y - a[v].y) == 2);
    if(a[u].x == a[v].x) return {{a[u].x - 1, (a[u].y + a[v].y) / 2}, {a[u].x + 1, (a[u].y + a[v].y) / 2}};
    else return {{(a[u].x + a[v].x) / 2, a[v].y - 1}, {(a[u].x + a[v].x) / 2, a[v].y + 1}};
}

vector<point> assign_benches(vector<edge> roads){
    vector<point> ans(roads.size());
    map<point, vector<int>> deg;
    set<point> done;
    for(int i = 0; i < (int) roads.size(); i++){
        int u = roads[i].u, v = roads[i].v;
        vector<point> p = adj(u, v);
        deg[p[0]].push_back(i);
        deg[p[1]].push_back(i);
    }
    vector<point> deg_0, deg_1;
    for(auto [p, v] : deg){
        if(v.size() == 0) deg_0.push_back(p);
        if(v.size() == 1) deg_1.push_back(p);
    }
    while(deg.size()){
        while(deg_0.size()) deg.erase(deg_0.back()), deg_0.pop_back();
        while(deg_1.size()){
            point v = deg_1.back(); deg_1.pop_back();
            if(done.count(v) || deg[v].empty()) continue; done.insert(v);

            int r = deg[v][0];
            ans[r] = v;

            int a = roads[r].u, b = roads[r].v;
            vector<point> p = adj(a, b);
            if(find(all(deg[p[0]]), r) != deg[p[0]].end()) deg[p[0]].erase(find(all(deg[p[0]]), r));
            if(find(all(deg[p[1]]), r) != deg[p[1]].end()) deg[p[1]].erase(find(all(deg[p[1]]), r));

            if(deg.count(p[0]) && deg[p[0]].size() == 0) deg_0.push_back(p[0]);
            if(deg.count(p[0]) && deg[p[0]].size() == 1) deg_1.push_back(p[0]);

            if(deg.count(p[1]) && deg[p[1]].size() == 0) deg_0.push_back(p[1]);
            if(deg.count(p[1]) && deg[p[1]].size() == 1) deg_1.push_back(p[1]);
        }
        if(deg.size()){
            auto [c, v] = *deg.begin(); 
            if(done.count(c) || deg[c].size() < 2){
                deg.erase(deg.begin());
                continue;
            }
            done.insert(c);
            int r = v[0];
            ans[r] = c;

            int a = roads[r].u, b = roads[r].v;
            vector<point> p = adj(a, b);

            deg[p[0]].clear();
            if(find(all(deg[p[1]]), r) != deg[p[1]].end()) deg[p[1]].erase(find(all(deg[p[1]]), r));

            if(deg[p[0]].size() == 0) deg_0.push_back(p[0]);
            if(deg[p[0]].size() == 1) deg_1.push_back(p[0]);

            if(deg[p[1]].size() == 0) deg_0.push_back(p[1]);
            if(deg[p[1]].size() == 1) deg_1.push_back(p[1]);
        }
    }
    return ans;
}

int construct_roads(vector<int> x, vector<int> y) {
    n = x.size();
    for(int i = 0; i < n; i++){
        a.push_back({x[i], y[i]});
        mp[a[i]] = i;
    }

    vector<edge> edges = construct_tree();
    if((int) edges.size() < n - 1) return 0;
    vector<point> benches = assign_benches(edges);
    vector<int> u(n - 1), v(n - 1), a(n - 1), b(n - 1);
    for(int i = 0; i < n - 1; i++){
        u[i] = edges[i].u, v[i] = edges[i].v;
        a[i] = benches[i].x, b[i] = benches[i].y;
    }
    build(u, v, a, b);
    return 1;
}

Compilation message

parks.cpp: In function 'std::vector<point> assign_benches(std::vector<edge>)':
parks.cpp:78:13: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
   78 |             if(done.count(v) || deg[v].empty()) continue; done.insert(v);
      |             ^~
parks.cpp:78:59: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
   78 |             if(done.count(v) || deg[v].empty()) continue; done.insert(v);
      |                                                           ^~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 480 ms 41364 KB Output is correct
10 Correct 34 ms 4460 KB Output is correct
11 Correct 234 ms 22444 KB Output is correct
12 Correct 53 ms 6384 KB Output is correct
13 Correct 37 ms 5444 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 2 ms 468 KB Output is correct
16 Correct 531 ms 41360 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 480 ms 41364 KB Output is correct
10 Correct 34 ms 4460 KB Output is correct
11 Correct 234 ms 22444 KB Output is correct
12 Correct 53 ms 6384 KB Output is correct
13 Correct 37 ms 5444 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 2 ms 468 KB Output is correct
16 Correct 531 ms 41360 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 915 ms 58160 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 3 ms 596 KB Output is correct
26 Correct 3 ms 596 KB Output is correct
27 Correct 3 ms 724 KB Output is correct
28 Correct 314 ms 23376 KB Output is correct
29 Correct 515 ms 35156 KB Output is correct
30 Correct 699 ms 46688 KB Output is correct
31 Correct 921 ms 58172 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 0 ms 212 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 0 ms 212 KB Output is correct
37 Correct 0 ms 212 KB Output is correct
38 Correct 0 ms 212 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 0 ms 212 KB Output is correct
41 Correct 0 ms 212 KB Output is correct
42 Correct 0 ms 212 KB Output is correct
43 Correct 2 ms 468 KB Output is correct
44 Correct 2 ms 596 KB Output is correct
45 Correct 386 ms 33776 KB Output is correct
46 Correct 604 ms 47872 KB Output is correct
47 Correct 596 ms 47868 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 480 ms 41364 KB Output is correct
10 Correct 34 ms 4460 KB Output is correct
11 Correct 234 ms 22444 KB Output is correct
12 Correct 53 ms 6384 KB Output is correct
13 Correct 37 ms 5444 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 2 ms 468 KB Output is correct
16 Correct 531 ms 41360 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 915 ms 58160 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 3 ms 596 KB Output is correct
26 Correct 3 ms 596 KB Output is correct
27 Correct 3 ms 724 KB Output is correct
28 Correct 314 ms 23376 KB Output is correct
29 Correct 515 ms 35156 KB Output is correct
30 Correct 699 ms 46688 KB Output is correct
31 Correct 921 ms 58172 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 0 ms 212 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 0 ms 212 KB Output is correct
37 Correct 0 ms 212 KB Output is correct
38 Correct 0 ms 212 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 0 ms 212 KB Output is correct
41 Correct 0 ms 212 KB Output is correct
42 Correct 0 ms 212 KB Output is correct
43 Correct 2 ms 468 KB Output is correct
44 Correct 2 ms 596 KB Output is correct
45 Correct 386 ms 33776 KB Output is correct
46 Correct 604 ms 47872 KB Output is correct
47 Correct 596 ms 47868 KB Output is correct
48 Correct 1 ms 212 KB Output is correct
49 Correct 1 ms 212 KB Output is correct
50 Correct 0 ms 212 KB Output is correct
51 Correct 0 ms 212 KB Output is correct
52 Correct 1 ms 212 KB Output is correct
53 Correct 1 ms 328 KB Output is correct
54 Correct 1 ms 212 KB Output is correct
55 Correct 894 ms 59048 KB Output is correct
56 Correct 1 ms 212 KB Output is correct
57 Correct 5 ms 724 KB Output is correct
58 Correct 17 ms 2008 KB Output is correct
59 Correct 9 ms 1492 KB Output is correct
60 Correct 387 ms 29560 KB Output is correct
61 Correct 579 ms 40752 KB Output is correct
62 Correct 723 ms 48852 KB Output is correct
63 Correct 884 ms 59144 KB Output is correct
64 Correct 1 ms 308 KB Output is correct
65 Correct 0 ms 212 KB Output is correct
66 Correct 0 ms 312 KB Output is correct
67 Correct 1088 ms 84160 KB Output is correct
68 Correct 1073 ms 85788 KB Output is correct
69 Correct 1020 ms 84476 KB Output is correct
70 Correct 4 ms 724 KB Output is correct
71 Correct 8 ms 1236 KB Output is correct
72 Correct 411 ms 32936 KB Output is correct
73 Correct 686 ms 49412 KB Output is correct
74 Correct 915 ms 65724 KB Output is correct
75 Correct 997 ms 70692 KB Output is correct
76 Correct 1128 ms 85736 KB Output is correct
77 Correct 4 ms 852 KB Output is correct
78 Correct 10 ms 1364 KB Output is correct
79 Correct 388 ms 32736 KB Output is correct
80 Correct 645 ms 49176 KB Output is correct
81 Correct 954 ms 65440 KB Output is correct

Subtask #4
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 480 ms 41364 KB Output is correct
10 Correct 34 ms 4460 KB Output is correct
11 Correct 234 ms 22444 KB Output is correct
12 Correct 53 ms 6384 KB Output is correct
13 Correct 37 ms 5444 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 2 ms 468 KB Output is correct
16 Correct 531 ms 41360 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 856 ms 55824 KB Output is correct
21 Correct 860 ms 55764 KB Output is correct
22 Correct 913 ms 55932 KB Output is correct
23 Correct 811 ms 70748 KB Output is correct
24 Correct 226 ms 20036 KB Output is correct
25 Correct 304 ms 23104 KB Output is correct
26 Correct 213 ms 23116 KB Output is correct
27 Correct 830 ms 82316 KB Output is correct
28 Correct 814 ms 82412 KB Output is correct
29 Correct 1047 ms 82412 KB Output is correct
30 Correct 1051 ms 82408 KB Output is correct
31 Correct 0 ms 212 KB Output is correct
32 Correct 49 ms 4684 KB Output is correct
33 Correct 101 ms 11440 KB Output is correct
34 Correct 848 ms 58336 KB Output is correct
35 Correct 9 ms 1620 KB Output is correct
36 Correct 52 ms 6540 KB Output is correct
37 Correct 120 ms 12968 KB Output is correct
38 Correct 322 ms 24992 KB Output is correct
39 Correct 434 ms 34076 KB Output is correct
40 Correct 605 ms 43840 KB Output is correct
41 Correct 765 ms 52640 KB Output is correct
42 Correct 881 ms 61760 KB Output is correct
43 Correct 1 ms 212 KB Output is correct
44 Correct 1 ms 212 KB Output is correct
45 Correct 0 ms 312 KB Output is correct
46 Correct 1 ms 212 KB Output is correct
47 Correct 0 ms 212 KB Output is correct
48 Correct 1 ms 212 KB Output is correct
49 Correct 0 ms 212 KB Output is correct
50 Correct 0 ms 312 KB Output is correct
51 Correct 1 ms 316 KB Output is correct
52 Correct 1 ms 212 KB Output is correct
53 Correct 0 ms 212 KB Output is correct
54 Correct 2 ms 448 KB Output is correct
55 Correct 3 ms 596 KB Output is correct
56 Correct 440 ms 34692 KB Output is correct
57 Correct 621 ms 49128 KB Output is correct
58 Correct 646 ms 49144 KB Output is correct
59 Correct 1 ms 212 KB Output is correct
60 Correct 0 ms 212 KB Output is correct
61 Correct 0 ms 312 KB Output is correct
62 Correct 1129 ms 84116 KB Output is correct
63 Correct 1033 ms 85820 KB Output is correct
64 Correct 1016 ms 84436 KB Output is correct
65 Correct 3 ms 724 KB Output is correct
66 Correct 7 ms 1236 KB Output is correct
67 Correct 405 ms 32916 KB Output is correct
68 Correct 686 ms 49304 KB Output is correct
69 Correct 930 ms 65756 KB Output is correct

Subtask #5
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 480 ms 41364 KB Output is correct
10 Correct 34 ms 4460 KB Output is correct
11 Correct 234 ms 22444 KB Output is correct
12 Correct 53 ms 6384 KB Output is correct
13 Correct 37 ms 5444 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 2 ms 468 KB Output is correct
16 Correct 531 ms 41360 KB Output is correct
17 Correct 1029 ms 83296 KB Output is correct
18 Correct 965 ms 82856 KB Output is correct
19 Correct 853 ms 58108 KB Output is correct
20 Correct 861 ms 65008 KB Output is correct
21 Correct 732 ms 69400 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 110 ms 10444 KB Output is correct
24 Correct 20 ms 2836 KB Output is correct
25 Correct 80 ms 9556 KB Output is correct
26 Correct 164 ms 15208 KB Output is correct
27 Correct 410 ms 32904 KB Output is correct
28 Correct 577 ms 41164 KB Output is correct
29 Correct 670 ms 49348 KB Output is correct
30 Correct 789 ms 57176 KB Output is correct
31 Correct 854 ms 65448 KB Output is correct
32 Correct 971 ms 70624 KB Output is correct
33 Correct 1174 ms 85712 KB Output is correct
34 Correct 4 ms 836 KB Output is correct
35 Correct 10 ms 1444 KB Output is correct
36 Correct 504 ms 32736 KB Output is correct
37 Correct 743 ms 49148 KB Output is correct
38 Correct 987 ms 65432 KB Output is correct

Subtask #6
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 480 ms 41364 KB Output is correct
10 Correct 34 ms 4460 KB Output is correct
11 Correct 234 ms 22444 KB Output is correct
12 Correct 53 ms 6384 KB Output is correct
13 Correct 37 ms 5444 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 2 ms 468 KB Output is correct
16 Correct 531 ms 41360 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 915 ms 58160 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 3 ms 596 KB Output is correct
26 Correct 3 ms 596 KB Output is correct
27 Correct 3 ms 724 KB Output is correct
28 Correct 314 ms 23376 KB Output is correct
29 Correct 515 ms 35156 KB Output is correct
30 Correct 699 ms 46688 KB Output is correct
31 Correct 921 ms 58172 KB Output is correct
32 Correct 0 ms 212 KB Output is correct
33 Correct 0 ms 212 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 0 ms 212 KB Output is correct
37 Correct 0 ms 212 KB Output is correct
38 Correct 0 ms 212 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 0 ms 212 KB Output is correct
41 Correct 0 ms 212 KB Output is correct
42 Correct 0 ms 212 KB Output is correct
43 Correct 2 ms 468 KB Output is correct
44 Correct 2 ms 596 KB Output is correct
45 Correct 386 ms 33776 KB Output is correct
46 Correct 604 ms 47872 KB Output is correct
47 Correct 596 ms 47868 KB Output is correct
48 Correct 1 ms 212 KB Output is correct
49 Correct 1 ms 212 KB Output is correct
50 Correct 0 ms 212 KB Output is correct
51 Correct 0 ms 212 KB Output is correct
52 Correct 1 ms 212 KB Output is correct
53 Correct 1 ms 328 KB Output is correct
54 Correct 1 ms 212 KB Output is correct
55 Correct 894 ms 59048 KB Output is correct
56 Correct 1 ms 212 KB Output is correct
57 Correct 5 ms 724 KB Output is correct
58 Correct 17 ms 2008 KB Output is correct
59 Correct 9 ms 1492 KB Output is correct
60 Correct 387 ms 29560 KB Output is correct
61 Correct 579 ms 40752 KB Output is correct
62 Correct 723 ms 48852 KB Output is correct
63 Correct 884 ms 59144 KB Output is correct
64 Correct 1 ms 308 KB Output is correct
65 Correct 0 ms 212 KB Output is correct
66 Correct 0 ms 312 KB Output is correct
67 Correct 1088 ms 84160 KB Output is correct
68 Correct 1073 ms 85788 KB Output is correct
69 Correct 1020 ms 84476 KB Output is correct
70 Correct 4 ms 724 KB Output is correct
71 Correct 8 ms 1236 KB Output is correct
72 Correct 411 ms 32936 KB Output is correct
73 Correct 686 ms 49412 KB Output is correct
74 Correct 915 ms 65724 KB Output is correct
75 Correct 997 ms 70692 KB Output is correct
76 Correct 1128 ms 85736 KB Output is correct
77 Correct 4 ms 852 KB Output is correct
78 Correct 10 ms 1364 KB Output is correct
79 Correct 388 ms 32736 KB Output is correct
80 Correct 645 ms 49176 KB Output is correct
81 Correct 954 ms 65440 KB Output is correct
82 Correct 0 ms 212 KB Output is correct
83 Correct 0 ms 212 KB Output is correct
84 Correct 0 ms 212 KB Output is correct
85 Correct 856 ms 55824 KB Output is correct
86 Correct 860 ms 55764 KB Output is correct
87 Correct 913 ms 55932 KB Output is correct
88 Correct 811 ms 70748 KB Output is correct
89 Correct 226 ms 20036 KB Output is correct
90 Correct 304 ms 23104 KB Output is correct
91 Correct 213 ms 23116 KB Output is correct
92 Correct 830 ms 82316 KB Output is correct
93 Correct 814 ms 82412 KB Output is correct
94 Correct 1047 ms 82412 KB Output is correct
95 Correct 1051 ms 82408 KB Output is correct
96 Correct 0 ms 212 KB Output is correct
97 Correct 49 ms 4684 KB Output is correct
98 Correct 101 ms 11440 KB Output is correct
99 Correct 848 ms 58336 KB Output is correct
100 Correct 9 ms 1620 KB Output is correct
101 Correct 52 ms 6540 KB Output is correct
102 Correct 120 ms 12968 KB Output is correct
103 Correct 322 ms 24992 KB Output is correct
104 Correct 434 ms 34076 KB Output is correct
105 Correct 605 ms 43840 KB Output is correct
106 Correct 765 ms 52640 KB Output is correct
107 Correct 881 ms 61760 KB Output is correct
108 Correct 1 ms 212 KB Output is correct
109 Correct 1 ms 212 KB Output is correct
110 Correct 0 ms 312 KB Output is correct
111 Correct 1 ms 212 KB Output is correct
112 Correct 0 ms 212 KB Output is correct
113 Correct 1 ms 212 KB Output is correct
114 Correct 0 ms 212 KB Output is correct
115 Correct 0 ms 312 KB Output is correct
116 Correct 1 ms 316 KB Output is correct
117 Correct 1 ms 212 KB Output is correct
118 Correct 0 ms 212 KB Output is correct
119 Correct 2 ms 448 KB Output is correct
120 Correct 3 ms 596 KB Output is correct
121 Correct 440 ms 34692 KB Output is correct
122 Correct 621 ms 49128 KB Output is correct
123 Correct 646 ms 49144 KB Output is correct
124 Correct 1 ms 212 KB Output is correct
125 Correct 0 ms 212 KB Output is correct
126 Correct 0 ms 312 KB Output is correct
127 Correct 1129 ms 84116 KB Output is correct
128 Correct 1033 ms 85820 KB Output is correct
129 Correct 1016 ms 84436 KB Output is correct
130 Correct 3 ms 724 KB Output is correct
131 Correct 7 ms 1236 KB Output is correct
132 Correct 405 ms 32916 KB Output is correct
133 Correct 686 ms 49304 KB Output is correct
134 Correct 930 ms 65756 KB Output is correct
135 Correct 1029 ms 83296 KB Output is correct
136 Correct 965 ms 82856 KB Output is correct
137 Correct 853 ms 58108 KB Output is correct
138 Correct 861 ms 65008 KB Output is correct
139 Correct 732 ms 69400 KB Output is correct
140 Correct 1 ms 212 KB Output is correct
141 Correct 110 ms 10444 KB Output is correct
142 Correct 20 ms 2836 KB Output is correct
143 Correct 80 ms 9556 KB Output is correct
144 Correct 164 ms 15208 KB Output is correct
145 Correct 410 ms 32904 KB Output is correct
146 Correct 577 ms 41164 KB Output is correct
147 Correct 670 ms 49348 KB Output is correct
148 Correct 789 ms 57176 KB Output is correct
149 Correct 854 ms 65448 KB Output is correct
150 Correct 971 ms 70624 KB Output is correct
151 Correct 1174 ms 85712 KB Output is correct
152 Correct 4 ms 836 KB Output is correct
153 Correct 10 ms 1444 KB Output is correct
154 Correct 504 ms 32736 KB Output is correct
155 Correct 743 ms 49148 KB Output is correct
156 Correct 987 ms 65432 KB Output is correct
157 Correct 0 ms 212 KB Output is correct
158 Correct 0 ms 212 KB Output is correct
159 Correct 0 ms 260 KB Output is correct
160 Correct 1 ms 212 KB Output is correct
161 Correct 977 ms 57956 KB Output is correct
162 Correct 870 ms 58368 KB Output is correct
163 Correct 801 ms 58820 KB Output is correct
164 Correct 748 ms 58768 KB Output is correct
165 Correct 867 ms 58328 KB Output is correct
166 Correct 973 ms 57908 KB Output is correct
167 Incorrect 196 ms 13976 KB a[32] = 0 is not an odd integer
168 Halted 0 ms 0 KB -