oj.uz

Submission #896288

# Submission time Handle Problem Language Result Execution time Memory
896288 2024-01-01T07:47:26 Z abcvuitunggio Fountain Parks (IOI21_parks) C++17
70 / 100
 1158 ms 232972 KB 
#include "parks.h"
#include <bits/stdc++.h>
#define int long long
using namespace std;
const int INF=1e17;
struct Edge{
    int u,v,c;
    Edge(){};
    Edge (int u, int v, int c){
        this->u=u;
        this->v=v;
        this->c=c;
    }
};
struct Dinic{
    vector <Edge> s;
    vector <vector <int>> adj;
    vector <vector <int> :: iterator> cur;
    vector <int> h;
    int n, sink, source;
    void Reset(){
        s.clear();
        adj.clear();
        cur.clear();
        h.clear();
    }
    void Assign(int n){
        this->n=n;
        s.reserve(n+2);
        adj.resize(n+2);
        cur.resize(n+2);
        h.resize(n+2);
    }
    void AddEdge(int u, int v, int c){
        s.emplace_back(u,v,c);
        adj[u].emplace_back(s.size()-1);
        s.emplace_back(v,u,0);
        adj[v].emplace_back(s.size()-1);
    }
    bool bfs(){
        fill(h.begin(),h.end(),n+2);
        queue <int> q({sink});
        h[sink]=0;
        while (!q.empty()){
            int c=q.front();
            q.pop();
            for (int i:adj[c])
                if (h[s[i].v]==n+2&&s[i^1].c){
                    h[s[i].v]=h[c]+1;
                    if (s[i].v==source)
                        return true;
                    q.emplace(s[i].v);
                }
        }
        return false;
    }
    int dfs(int v, int flowin){
        if (v==sink)
            return flowin;
        int flowout=0;
        for (;cur[v]!=adj[v].end();++cur[v]){
            int i=*cur[v];
            if (!s[i].c||h[s[i].v]+1!=h[v])
                continue;
            int q=dfs(s[i].v,min(flowin,s[i].c));
            flowout+=q;
            if (flowin!=INF)
                flowin-=q;
            s[i].c-=q;
            s[i^1].c+=q;
            if (!flowin)
                break;
        }
        return flowout;
    }
    int BlockFlow(){
        for (int i=1;i<=n;i++)
            cur[i]=adj[i].begin();
        return dfs(source,INF);
    }
    int MaxFlow(int s, int t){
        source=s;
        sink=t;
        int res=0;
        while (bfs())
            res+=BlockFlow();
        return res;
    }
}g;
int n,dx[4]={1,0,-1,0},dy[4]={0,1,0,-1},p[200001],id,order[200001];
pair <int, int> bench[400001];
map <int, int> mp[300001];
vector <int32_t> px,py;
int f(int i){
    return (p[i]==i?i:p[i]=f(p[i]));
}
bool unite(int i, int j){
    i=f(i);
    j=f(j);
    if (i==j)
        return false;
    p[j]=i;
    return true;
}
int32_t construct_roads(vector <int32_t> x, vector <int32_t> y) {
    if (x.size()==1){
        build({},{},{},{});
        return 1;
    }
    vector <int32_t> u,v,a,b;
    n=x.size();
    for (int i=0;i<n;i++)
        mp[x[i]][y[i]]=i;
    iota(p,p+n,0);
    iota(order,order+n,0);
    px=x,py=y;
    sort(order,order+n,[](int i, int j){return make_pair(px[i],py[i])<make_pair(px[j],py[j]);});
    g.Assign(n*10);
    for (int it=0;it<n;it++){
        int i=order[it];
        for (int j=0;j<4;j++)
            if (mp[x[i]+dx[j]*2].count(y[i]+dy[j]*2)){
                int k=mp[x[i]+dx[j]*2][y[i]+dy[j]*2];
                if (unite(i,k)){
                    u.push_back(i);
                    v.push_back(k);
                    g.AddEdge(n*3-1,u.size(),1);
                    int X=x[i]+dx[j],Y=y[i]+dy[j];
                    for (int l=0;l<4;l++)
                        if (X+dx[l]!=x[i]&&Y+dy[l]!=y[i]){
                            if (!mp[X+dx[l]].count(Y+dy[l])){
                                id++;
                                mp[X+dx[l]][Y+dy[l]]=id;
                                bench[id]={X+dx[l],Y+dy[l]};
                                g.AddEdge(id+n-1,n*3,1);
                            }
                            g.AddEdge(u.size(),mp[X+dx[l]][Y+dy[l]]+n-1,1);
                        }
                }
            }
    }
    if (u.size()<n-1)
        return 0;
    a.assign(n-1,0);
    b.assign(n-1,0);
    int mx=g.MaxFlow(n*3-1,n*3);
    for (int i=0;i<g.s.size();i+=2)
        if (!g.s[i].c&&g.s[i].u!=n*3-1&&g.s[i].v!=n*3){
            a[g.s[i].u-1]=bench[g.s[i].v-n+1].first;
            b[g.s[i].u-1]=bench[g.s[i].v-n+1].second;
        }
    build(u,v,a,b);
    return 1;
}

Compilation message

parks.cpp: In function 'int32_t construct_roads(std::vector<int>, std::vector<int>)':
parks.cpp:142:17: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'long long int' [-Wsign-compare]
  142 |     if (u.size()<n-1)
      |         ~~~~~~~~^~~~
parks.cpp:147:19: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<Edge>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  147 |     for (int i=0;i<g.s.size();i+=2)
      |                  ~^~~~~~~~~~~
parks.cpp:146:9: warning: unused variable 'mx' [-Wunused-variable]
  146 |     int mx=g.MaxFlow(n*3-1,n*3);
      |         ^~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 14936 KB Output is correct
2 Correct 4 ms 19032 KB Output is correct
3 Correct 4 ms 19036 KB Output is correct
4 Correct 4 ms 19032 KB Output is correct
5 Correct 3 ms 19032 KB Output is correct
6 Correct 4 ms 19036 KB Output is correct
7 Correct 3 ms 19036 KB Output is correct
8 Correct 3 ms 19036 KB Output is correct
9 Correct 280 ms 126200 KB Output is correct
10 Correct 23 ms 29276 KB Output is correct
11 Correct 125 ms 76612 KB Output is correct
12 Correct 34 ms 36572 KB Output is correct
13 Correct 90 ms 64320 KB Output is correct
14 Correct 5 ms 20056 KB Output is correct
15 Correct 6 ms 20828 KB Output is correct
16 Correct 258 ms 126072 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 14936 KB Output is correct
2 Correct 4 ms 19032 KB Output is correct
3 Correct 4 ms 19036 KB Output is correct
4 Correct 4 ms 19032 KB Output is correct
5 Correct 3 ms 19032 KB Output is correct
6 Correct 4 ms 19036 KB Output is correct
7 Correct 3 ms 19036 KB Output is correct
8 Correct 3 ms 19036 KB Output is correct
9 Correct 280 ms 126200 KB Output is correct
10 Correct 23 ms 29276 KB Output is correct
11 Correct 125 ms 76612 KB Output is correct
12 Correct 34 ms 36572 KB Output is correct
13 Correct 90 ms 64320 KB Output is correct
14 Correct 5 ms 20056 KB Output is correct
15 Correct 6 ms 20828 KB Output is correct
16 Correct 258 ms 126072 KB Output is correct
17 Correct 4 ms 19036 KB Output is correct
18 Correct 4 ms 19032 KB Output is correct
19 Correct 3 ms 19036 KB Output is correct
20 Correct 3 ms 19036 KB Output is correct
21 Correct 3 ms 19036 KB Output is correct
22 Correct 3 ms 19048 KB Output is correct
23 Correct 524 ms 202136 KB Output is correct
24 Correct 3 ms 19036 KB Output is correct
25 Correct 5 ms 20052 KB Output is correct
26 Correct 8 ms 21500 KB Output is correct
27 Correct 9 ms 22616 KB Output is correct
28 Correct 182 ms 92752 KB Output is correct
29 Correct 296 ms 129552 KB Output is correct
30 Correct 409 ms 167468 KB Output is correct
31 Correct 508 ms 202640 KB Output is correct
32 Correct 4 ms 19036 KB Output is correct
33 Correct 3 ms 19036 KB Output is correct
34 Correct 4 ms 19036 KB Output is correct
35 Correct 3 ms 19036 KB Output is correct
36 Correct 3 ms 19036 KB Output is correct
37 Correct 3 ms 19036 KB Output is correct
38 Correct 4 ms 19036 KB Output is correct
39 Correct 3 ms 19036 KB Output is correct
40 Correct 3 ms 19036 KB Output is correct
41 Correct 3 ms 19036 KB Output is correct
42 Correct 4 ms 19036 KB Output is correct
43 Correct 6 ms 20828 KB Output is correct
44 Correct 10 ms 21592 KB Output is correct
45 Correct 265 ms 118308 KB Output is correct
46 Correct 422 ms 163012 KB Output is correct
47 Correct 408 ms 162496 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 14936 KB Output is correct
2 Correct 4 ms 19032 KB Output is correct
3 Correct 4 ms 19036 KB Output is correct
4 Correct 4 ms 19032 KB Output is correct
5 Correct 3 ms 19032 KB Output is correct
6 Correct 4 ms 19036 KB Output is correct
7 Correct 3 ms 19036 KB Output is correct
8 Correct 3 ms 19036 KB Output is correct
9 Correct 280 ms 126200 KB Output is correct
10 Correct 23 ms 29276 KB Output is correct
11 Correct 125 ms 76612 KB Output is correct
12 Correct 34 ms 36572 KB Output is correct
13 Correct 90 ms 64320 KB Output is correct
14 Correct 5 ms 20056 KB Output is correct
15 Correct 6 ms 20828 KB Output is correct
16 Correct 258 ms 126072 KB Output is correct
17 Correct 4 ms 19036 KB Output is correct
18 Correct 4 ms 19032 KB Output is correct
19 Correct 3 ms 19036 KB Output is correct
20 Correct 3 ms 19036 KB Output is correct
21 Correct 3 ms 19036 KB Output is correct
22 Correct 3 ms 19048 KB Output is correct
23 Correct 524 ms 202136 KB Output is correct
24 Correct 3 ms 19036 KB Output is correct
25 Correct 5 ms 20052 KB Output is correct
26 Correct 8 ms 21500 KB Output is correct
27 Correct 9 ms 22616 KB Output is correct
28 Correct 182 ms 92752 KB Output is correct
29 Correct 296 ms 129552 KB Output is correct
30 Correct 409 ms 167468 KB Output is correct
31 Correct 508 ms 202640 KB Output is correct
32 Correct 4 ms 19036 KB Output is correct
33 Correct 3 ms 19036 KB Output is correct
34 Correct 4 ms 19036 KB Output is correct
35 Correct 3 ms 19036 KB Output is correct
36 Correct 3 ms 19036 KB Output is correct
37 Correct 3 ms 19036 KB Output is correct
38 Correct 4 ms 19036 KB Output is correct
39 Correct 3 ms 19036 KB Output is correct
40 Correct 3 ms 19036 KB Output is correct
41 Correct 3 ms 19036 KB Output is correct
42 Correct 4 ms 19036 KB Output is correct
43 Correct 6 ms 20828 KB Output is correct
44 Correct 10 ms 21592 KB Output is correct
45 Correct 265 ms 118308 KB Output is correct
46 Correct 422 ms 163012 KB Output is correct
47 Correct 408 ms 162496 KB Output is correct
48 Correct 3 ms 19036 KB Output is correct
49 Correct 4 ms 18860 KB Output is correct
50 Correct 5 ms 19036 KB Output is correct
51 Correct 3 ms 19036 KB Output is correct
52 Correct 3 ms 19036 KB Output is correct
53 Correct 4 ms 19036 KB Output is correct
54 Correct 4 ms 19036 KB Output is correct
55 Correct 537 ms 203808 KB Output is correct
56 Correct 3 ms 19032 KB Output is correct
57 Correct 7 ms 20572 KB Output is correct
58 Correct 15 ms 24412 KB Output is correct
59 Correct 18 ms 27736 KB Output is correct
60 Correct 262 ms 115788 KB Output is correct
61 Correct 327 ms 145304 KB Output is correct
62 Correct 422 ms 172584 KB Output is correct
63 Correct 513 ms 204948 KB Output is correct
64 Correct 5 ms 19288 KB Output is correct
65 Correct 4 ms 19036 KB Output is correct
66 Correct 4 ms 19036 KB Output is correct
67 Correct 558 ms 231824 KB Output is correct
68 Correct 547 ms 231944 KB Output is correct
69 Correct 566 ms 230904 KB Output is correct
70 Correct 11 ms 22652 KB Output is correct
71 Correct 17 ms 26272 KB Output is correct
72 Correct 300 ms 117964 KB Output is correct
73 Correct 474 ms 167712 KB Output is correct
74 Correct 671 ms 217308 KB Output is correct
75 Correct 607 ms 218200 KB Output is correct
76 Correct 592 ms 232108 KB Output is correct
77 Correct 15 ms 23388 KB Output is correct
78 Correct 24 ms 26952 KB Output is correct
79 Correct 322 ms 116128 KB Output is correct
80 Correct 512 ms 167668 KB Output is correct
81 Correct 727 ms 216312 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 14936 KB Output is correct
2 Correct 4 ms 19032 KB Output is correct
3 Correct 4 ms 19036 KB Output is correct
4 Correct 4 ms 19032 KB Output is correct
5 Correct 3 ms 19032 KB Output is correct
6 Correct 4 ms 19036 KB Output is correct
7 Correct 3 ms 19036 KB Output is correct
8 Correct 3 ms 19036 KB Output is correct
9 Correct 280 ms 126200 KB Output is correct
10 Correct 23 ms 29276 KB Output is correct
11 Correct 125 ms 76612 KB Output is correct
12 Correct 34 ms 36572 KB Output is correct
13 Correct 90 ms 64320 KB Output is correct
14 Correct 5 ms 20056 KB Output is correct
15 Correct 6 ms 20828 KB Output is correct
16 Correct 258 ms 126072 KB Output is correct
17 Correct 4 ms 19032 KB Output is correct
18 Correct 5 ms 19044 KB Output is correct
19 Correct 5 ms 19044 KB Output is correct
20 Correct 389 ms 206716 KB Output is correct
21 Correct 416 ms 207932 KB Output is correct
22 Correct 429 ms 207376 KB Output is correct
23 Correct 405 ms 201784 KB Output is correct
24 Correct 188 ms 116668 KB Output is correct
25 Correct 417 ms 220712 KB Output is correct
26 Correct 387 ms 220684 KB Output is correct
27 Correct 529 ms 232324 KB Output is correct
28 Correct 482 ms 232356 KB Output is correct
29 Correct 505 ms 231764 KB Output is correct
30 Correct 518 ms 232172 KB Output is correct
31 Correct 3 ms 19032 KB Output is correct
32 Correct 41 ms 32500 KB Output is correct
33 Correct 58 ms 67700 KB Output is correct
34 Correct 363 ms 208144 KB Output is correct
35 Correct 19 ms 27992 KB Output is correct
36 Correct 88 ms 65932 KB Output is correct
37 Correct 164 ms 110136 KB Output is correct
38 Correct 358 ms 96900 KB Output is correct
39 Correct 687 ms 125888 KB Output is correct
40 Correct 786 ms 156680 KB Output is correct
41 Correct 991 ms 184416 KB Output is correct
42 Correct 1158 ms 213188 KB Output is correct
43 Correct 4 ms 19036 KB Output is correct
44 Correct 4 ms 19036 KB Output is correct
45 Correct 3 ms 19036 KB Output is correct
46 Correct 3 ms 19036 KB Output is correct
47 Correct 4 ms 19036 KB Output is correct
48 Correct 4 ms 19036 KB Output is correct
49 Correct 4 ms 19036 KB Output is correct
50 Correct 4 ms 19036 KB Output is correct
51 Correct 3 ms 19036 KB Output is correct
52 Correct 3 ms 19032 KB Output is correct
53 Correct 4 ms 19036 KB Output is correct
54 Correct 7 ms 20828 KB Output is correct
55 Correct 8 ms 21744 KB Output is correct
56 Correct 278 ms 117164 KB Output is correct
57 Correct 433 ms 163480 KB Output is correct
58 Correct 426 ms 162320 KB Output is correct
59 Correct 4 ms 19036 KB Output is correct
60 Correct 3 ms 19036 KB Output is correct
61 Correct 3 ms 19036 KB Output is correct
62 Correct 561 ms 231688 KB Output is correct
63 Correct 561 ms 231728 KB Output is correct
64 Correct 572 ms 230872 KB Output is correct
65 Correct 10 ms 22616 KB Output is correct
66 Correct 17 ms 26204 KB Output is correct
67 Correct 310 ms 116940 KB Output is correct
68 Correct 473 ms 168288 KB Output is correct
69 Correct 657 ms 216108 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 14936 KB Output is correct
2 Correct 4 ms 19032 KB Output is correct
3 Correct 4 ms 19036 KB Output is correct
4 Correct 4 ms 19032 KB Output is correct
5 Correct 3 ms 19032 KB Output is correct
6 Correct 4 ms 19036 KB Output is correct
7 Correct 3 ms 19036 KB Output is correct
8 Correct 3 ms 19036 KB Output is correct
9 Correct 280 ms 126200 KB Output is correct
10 Correct 23 ms 29276 KB Output is correct
11 Correct 125 ms 76612 KB Output is correct
12 Correct 34 ms 36572 KB Output is correct
13 Correct 90 ms 64320 KB Output is correct
14 Correct 5 ms 20056 KB Output is correct
15 Correct 6 ms 20828 KB Output is correct
16 Correct 258 ms 126072 KB Output is correct
17 Correct 485 ms 232972 KB Output is correct
18 Correct 500 ms 232456 KB Output is correct
19 Correct 435 ms 212316 KB Output is correct
20 Correct 585 ms 210840 KB Output is correct
21 Correct 521 ms 201376 KB Output is correct
22 Correct 4 ms 19032 KB Output is correct
23 Correct 102 ms 51272 KB Output is correct
24 Correct 34 ms 36816 KB Output is correct
25 Correct 124 ms 84292 KB Output is correct
26 Correct 230 ms 128804 KB Output is correct
27 Correct 423 ms 117688 KB Output is correct
28 Correct 633 ms 144724 KB Output is correct
29 Correct 759 ms 167100 KB Output is correct
30 Correct 879 ms 191576 KB Output is correct
31 Correct 972 ms 214928 KB Output is correct
32 Correct 608 ms 218396 KB Output is correct
33 Correct 567 ms 232128 KB Output is correct
34 Correct 12 ms 23384 KB Output is correct
35 Correct 19 ms 26948 KB Output is correct
36 Correct 320 ms 116332 KB Output is correct
37 Correct 479 ms 168476 KB Output is correct
38 Correct 696 ms 215364 KB Output is correct

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 14936 KB Output is correct
2 Correct 4 ms 19032 KB Output is correct
3 Correct 4 ms 19036 KB Output is correct
4 Correct 4 ms 19032 KB Output is correct
5 Correct 3 ms 19032 KB Output is correct
6 Correct 4 ms 19036 KB Output is correct
7 Correct 3 ms 19036 KB Output is correct
8 Correct 3 ms 19036 KB Output is correct
9 Correct 280 ms 126200 KB Output is correct
10 Correct 23 ms 29276 KB Output is correct
11 Correct 125 ms 76612 KB Output is correct
12 Correct 34 ms 36572 KB Output is correct
13 Correct 90 ms 64320 KB Output is correct
14 Correct 5 ms 20056 KB Output is correct
15 Correct 6 ms 20828 KB Output is correct
16 Correct 258 ms 126072 KB Output is correct
17 Correct 4 ms 19036 KB Output is correct
18 Correct 4 ms 19032 KB Output is correct
19 Correct 3 ms 19036 KB Output is correct
20 Correct 3 ms 19036 KB Output is correct
21 Correct 3 ms 19036 KB Output is correct
22 Correct 3 ms 19048 KB Output is correct
23 Correct 524 ms 202136 KB Output is correct
24 Correct 3 ms 19036 KB Output is correct
25 Correct 5 ms 20052 KB Output is correct
26 Correct 8 ms 21500 KB Output is correct
27 Correct 9 ms 22616 KB Output is correct
28 Correct 182 ms 92752 KB Output is correct
29 Correct 296 ms 129552 KB Output is correct
30 Correct 409 ms 167468 KB Output is correct
31 Correct 508 ms 202640 KB Output is correct
32 Correct 4 ms 19036 KB Output is correct
33 Correct 3 ms 19036 KB Output is correct
34 Correct 4 ms 19036 KB Output is correct
35 Correct 3 ms 19036 KB Output is correct
36 Correct 3 ms 19036 KB Output is correct
37 Correct 3 ms 19036 KB Output is correct
38 Correct 4 ms 19036 KB Output is correct
39 Correct 3 ms 19036 KB Output is correct
40 Correct 3 ms 19036 KB Output is correct
41 Correct 3 ms 19036 KB Output is correct
42 Correct 4 ms 19036 KB Output is correct
43 Correct 6 ms 20828 KB Output is correct
44 Correct 10 ms 21592 KB Output is correct
45 Correct 265 ms 118308 KB Output is correct
46 Correct 422 ms 163012 KB Output is correct
47 Correct 408 ms 162496 KB Output is correct
48 Correct 3 ms 19036 KB Output is correct
49 Correct 4 ms 18860 KB Output is correct
50 Correct 5 ms 19036 KB Output is correct
51 Correct 3 ms 19036 KB Output is correct
52 Correct 3 ms 19036 KB Output is correct
53 Correct 4 ms 19036 KB Output is correct
54 Correct 4 ms 19036 KB Output is correct
55 Correct 537 ms 203808 KB Output is correct
56 Correct 3 ms 19032 KB Output is correct
57 Correct 7 ms 20572 KB Output is correct
58 Correct 15 ms 24412 KB Output is correct
59 Correct 18 ms 27736 KB Output is correct
60 Correct 262 ms 115788 KB Output is correct
61 Correct 327 ms 145304 KB Output is correct
62 Correct 422 ms 172584 KB Output is correct
63 Correct 513 ms 204948 KB Output is correct
64 Correct 5 ms 19288 KB Output is correct
65 Correct 4 ms 19036 KB Output is correct
66 Correct 4 ms 19036 KB Output is correct
67 Correct 558 ms 231824 KB Output is correct
68 Correct 547 ms 231944 KB Output is correct
69 Correct 566 ms 230904 KB Output is correct
70 Correct 11 ms 22652 KB Output is correct
71 Correct 17 ms 26272 KB Output is correct
72 Correct 300 ms 117964 KB Output is correct
73 Correct 474 ms 167712 KB Output is correct
74 Correct 671 ms 217308 KB Output is correct
75 Correct 607 ms 218200 KB Output is correct
76 Correct 592 ms 232108 KB Output is correct
77 Correct 15 ms 23388 KB Output is correct
78 Correct 24 ms 26952 KB Output is correct
79 Correct 322 ms 116128 KB Output is correct
80 Correct 512 ms 167668 KB Output is correct
81 Correct 727 ms 216312 KB Output is correct
82 Correct 4 ms 19032 KB Output is correct
83 Correct 5 ms 19044 KB Output is correct
84 Correct 5 ms 19044 KB Output is correct
85 Correct 389 ms 206716 KB Output is correct
86 Correct 416 ms 207932 KB Output is correct
87 Correct 429 ms 207376 KB Output is correct
88 Correct 405 ms 201784 KB Output is correct
89 Correct 188 ms 116668 KB Output is correct
90 Correct 417 ms 220712 KB Output is correct
91 Correct 387 ms 220684 KB Output is correct
92 Correct 529 ms 232324 KB Output is correct
93 Correct 482 ms 232356 KB Output is correct
94 Correct 505 ms 231764 KB Output is correct
95 Correct 518 ms 232172 KB Output is correct
96 Correct 3 ms 19032 KB Output is correct
97 Correct 41 ms 32500 KB Output is correct
98 Correct 58 ms 67700 KB Output is correct
99 Correct 363 ms 208144 KB Output is correct
100 Correct 19 ms 27992 KB Output is correct
101 Correct 88 ms 65932 KB Output is correct
102 Correct 164 ms 110136 KB Output is correct
103 Correct 358 ms 96900 KB Output is correct
104 Correct 687 ms 125888 KB Output is correct
105 Correct 786 ms 156680 KB Output is correct
106 Correct 991 ms 184416 KB Output is correct
107 Correct 1158 ms 213188 KB Output is correct
108 Correct 4 ms 19036 KB Output is correct
109 Correct 4 ms 19036 KB Output is correct
110 Correct 3 ms 19036 KB Output is correct
111 Correct 3 ms 19036 KB Output is correct
112 Correct 4 ms 19036 KB Output is correct
113 Correct 4 ms 19036 KB Output is correct
114 Correct 4 ms 19036 KB Output is correct
115 Correct 4 ms 19036 KB Output is correct
116 Correct 3 ms 19036 KB Output is correct
117 Correct 3 ms 19032 KB Output is correct
118 Correct 4 ms 19036 KB Output is correct
119 Correct 7 ms 20828 KB Output is correct
120 Correct 8 ms 21744 KB Output is correct
121 Correct 278 ms 117164 KB Output is correct
122 Correct 433 ms 163480 KB Output is correct
123 Correct 426 ms 162320 KB Output is correct
124 Correct 4 ms 19036 KB Output is correct
125 Correct 3 ms 19036 KB Output is correct
126 Correct 3 ms 19036 KB Output is correct
127 Correct 561 ms 231688 KB Output is correct
128 Correct 561 ms 231728 KB Output is correct
129 Correct 572 ms 230872 KB Output is correct
130 Correct 10 ms 22616 KB Output is correct
131 Correct 17 ms 26204 KB Output is correct
132 Correct 310 ms 116940 KB Output is correct
133 Correct 473 ms 168288 KB Output is correct
134 Correct 657 ms 216108 KB Output is correct
135 Correct 485 ms 232972 KB Output is correct
136 Correct 500 ms 232456 KB Output is correct
137 Correct 435 ms 212316 KB Output is correct
138 Correct 585 ms 210840 KB Output is correct
139 Correct 521 ms 201376 KB Output is correct
140 Correct 4 ms 19032 KB Output is correct
141 Correct 102 ms 51272 KB Output is correct
142 Correct 34 ms 36816 KB Output is correct
143 Correct 124 ms 84292 KB Output is correct
144 Correct 230 ms 128804 KB Output is correct
145 Correct 423 ms 117688 KB Output is correct
146 Correct 633 ms 144724 KB Output is correct
147 Correct 759 ms 167100 KB Output is correct
148 Correct 879 ms 191576 KB Output is correct
149 Correct 972 ms 214928 KB Output is correct
150 Correct 608 ms 218396 KB Output is correct
151 Correct 567 ms 232128 KB Output is correct
152 Correct 12 ms 23384 KB Output is correct
153 Correct 19 ms 26948 KB Output is correct
154 Correct 320 ms 116332 KB Output is correct
155 Correct 479 ms 168476 KB Output is correct
156 Correct 696 ms 215364 KB Output is correct
157 Correct 3 ms 19036 KB Output is correct
158 Correct 4 ms 19036 KB Output is correct
159 Correct 3 ms 19032 KB Output is correct
160 Correct 4 ms 19288 KB Output is correct
161 Correct 508 ms 208372 KB Output is correct
162 Correct 374 ms 207712 KB Output is correct
163 Correct 404 ms 208012 KB Output is correct
164 Correct 416 ms 206328 KB Output is correct
165 Correct 458 ms 207888 KB Output is correct
166 Correct 487 ms 207440 KB Output is correct
167 Incorrect 474 ms 65700 KB a[11] = 0 is not an odd integer
168 Halted 0 ms 0 KB -