oj.uz

Submission #896365

# Submission time Handle Problem Language Result Execution time Memory
896365 2024-01-01T10:18:41 Z abcvuitunggio Fountain Parks (IOI21_parks) C++17
70 / 100
 1487 ms 231548 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 px[i]+py[i]<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 15192 KB Output is correct
2 Correct 3 ms 19036 KB Output is correct
3 Correct 3 ms 19036 KB Output is correct
4 Correct 3 ms 19064 KB Output is correct
5 Correct 3 ms 19036 KB Output is correct
6 Correct 3 ms 19036 KB Output is correct
7 Correct 3 ms 19036 KB Output is correct
8 Correct 3 ms 19032 KB Output is correct
9 Correct 262 ms 126248 KB Output is correct
10 Correct 26 ms 29272 KB Output is correct
11 Correct 124 ms 76508 KB Output is correct
12 Correct 34 ms 36476 KB Output is correct
13 Correct 82 ms 64320 KB Output is correct
14 Correct 5 ms 20056 KB Output is correct
15 Correct 7 ms 20856 KB Output is correct
16 Correct 259 ms 126184 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 15192 KB Output is correct
2 Correct 3 ms 19036 KB Output is correct
3 Correct 3 ms 19036 KB Output is correct
4 Correct 3 ms 19064 KB Output is correct
5 Correct 3 ms 19036 KB Output is correct
6 Correct 3 ms 19036 KB Output is correct
7 Correct 3 ms 19036 KB Output is correct
8 Correct 3 ms 19032 KB Output is correct
9 Correct 262 ms 126248 KB Output is correct
10 Correct 26 ms 29272 KB Output is correct
11 Correct 124 ms 76508 KB Output is correct
12 Correct 34 ms 36476 KB Output is correct
13 Correct 82 ms 64320 KB Output is correct
14 Correct 5 ms 20056 KB Output is correct
15 Correct 7 ms 20856 KB Output is correct
16 Correct 259 ms 126184 KB Output is correct
17 Correct 4 ms 19036 KB Output is correct
18 Correct 4 ms 19036 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 4 ms 19036 KB Output is correct
23 Correct 546 ms 210456 KB Output is correct
24 Correct 3 ms 19032 KB Output is correct
25 Correct 5 ms 20060 KB Output is correct
26 Correct 8 ms 21600 KB Output is correct
27 Correct 12 ms 22408 KB Output is correct
28 Correct 210 ms 97504 KB Output is correct
29 Correct 318 ms 133892 KB Output is correct
30 Correct 423 ms 173288 KB Output is correct
31 Correct 535 ms 211800 KB Output is correct
32 Correct 3 ms 19032 KB Output is correct
33 Correct 3 ms 19036 KB Output is correct
34 Correct 3 ms 19036 KB Output is correct
35 Correct 3 ms 19036 KB Output is correct
36 Correct 3 ms 19032 KB Output is correct
37 Correct 3 ms 19036 KB Output is correct
38 Correct 4 ms 19036 KB Output is correct
39 Correct 4 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 7 ms 20828 KB Output is correct
44 Correct 10 ms 21604 KB Output is correct
45 Correct 261 ms 118492 KB Output is correct
46 Correct 393 ms 162500 KB Output is correct
47 Correct 392 ms 162908 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 15192 KB Output is correct
2 Correct 3 ms 19036 KB Output is correct
3 Correct 3 ms 19036 KB Output is correct
4 Correct 3 ms 19064 KB Output is correct
5 Correct 3 ms 19036 KB Output is correct
6 Correct 3 ms 19036 KB Output is correct
7 Correct 3 ms 19036 KB Output is correct
8 Correct 3 ms 19032 KB Output is correct
9 Correct 262 ms 126248 KB Output is correct
10 Correct 26 ms 29272 KB Output is correct
11 Correct 124 ms 76508 KB Output is correct
12 Correct 34 ms 36476 KB Output is correct
13 Correct 82 ms 64320 KB Output is correct
14 Correct 5 ms 20056 KB Output is correct
15 Correct 7 ms 20856 KB Output is correct
16 Correct 259 ms 126184 KB Output is correct
17 Correct 4 ms 19036 KB Output is correct
18 Correct 4 ms 19036 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 4 ms 19036 KB Output is correct
23 Correct 546 ms 210456 KB Output is correct
24 Correct 3 ms 19032 KB Output is correct
25 Correct 5 ms 20060 KB Output is correct
26 Correct 8 ms 21600 KB Output is correct
27 Correct 12 ms 22408 KB Output is correct
28 Correct 210 ms 97504 KB Output is correct
29 Correct 318 ms 133892 KB Output is correct
30 Correct 423 ms 173288 KB Output is correct
31 Correct 535 ms 211800 KB Output is correct
32 Correct 3 ms 19032 KB Output is correct
33 Correct 3 ms 19036 KB Output is correct
34 Correct 3 ms 19036 KB Output is correct
35 Correct 3 ms 19036 KB Output is correct
36 Correct 3 ms 19032 KB Output is correct
37 Correct 3 ms 19036 KB Output is correct
38 Correct 4 ms 19036 KB Output is correct
39 Correct 4 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 7 ms 20828 KB Output is correct
44 Correct 10 ms 21604 KB Output is correct
45 Correct 261 ms 118492 KB Output is correct
46 Correct 393 ms 162500 KB Output is correct
47 Correct 392 ms 162908 KB Output is correct
48 Correct 3 ms 19036 KB Output is correct
49 Correct 3 ms 19036 KB Output is correct
50 Correct 3 ms 19036 KB Output is correct
51 Correct 4 ms 19036 KB Output is correct
52 Correct 4 ms 19036 KB Output is correct
53 Correct 3 ms 19032 KB Output is correct
54 Correct 4 ms 19032 KB Output is correct
55 Correct 563 ms 209020 KB Output is correct
56 Correct 4 ms 19036 KB Output is correct
57 Correct 7 ms 20640 KB Output is correct
58 Correct 16 ms 24412 KB Output is correct
59 Correct 21 ms 27480 KB Output is correct
60 Correct 264 ms 114608 KB Output is correct
61 Correct 371 ms 146568 KB Output is correct
62 Correct 460 ms 175696 KB Output is correct
63 Correct 563 ms 208300 KB Output is correct
64 Correct 3 ms 19036 KB Output is correct
65 Correct 3 ms 19064 KB Output is correct
66 Correct 3 ms 19036 KB Output is correct
67 Correct 619 ms 231016 KB Output is correct
68 Correct 611 ms 231080 KB Output is correct
69 Correct 583 ms 229124 KB Output is correct
70 Correct 10 ms 22652 KB Output is correct
71 Correct 17 ms 26076 KB Output is correct
72 Correct 491 ms 115908 KB Output is correct
73 Correct 788 ms 166404 KB Output is correct
74 Correct 1047 ms 213732 KB Output is correct
75 Correct 563 ms 218252 KB Output is correct
76 Correct 562 ms 230152 KB Output is correct
77 Correct 11 ms 23388 KB Output is correct
78 Correct 18 ms 26972 KB Output is correct
79 Correct 489 ms 116780 KB Output is correct
80 Correct 696 ms 166224 KB Output is correct
81 Correct 1055 ms 215436 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 15192 KB Output is correct
2 Correct 3 ms 19036 KB Output is correct
3 Correct 3 ms 19036 KB Output is correct
4 Correct 3 ms 19064 KB Output is correct
5 Correct 3 ms 19036 KB Output is correct
6 Correct 3 ms 19036 KB Output is correct
7 Correct 3 ms 19036 KB Output is correct
8 Correct 3 ms 19032 KB Output is correct
9 Correct 262 ms 126248 KB Output is correct
10 Correct 26 ms 29272 KB Output is correct
11 Correct 124 ms 76508 KB Output is correct
12 Correct 34 ms 36476 KB Output is correct
13 Correct 82 ms 64320 KB Output is correct
14 Correct 5 ms 20056 KB Output is correct
15 Correct 7 ms 20856 KB Output is correct
16 Correct 259 ms 126184 KB Output is correct
17 Correct 4 ms 19032 KB Output is correct
18 Correct 4 ms 19036 KB Output is correct
19 Correct 4 ms 19028 KB Output is correct
20 Correct 1487 ms 205108 KB Output is correct
21 Correct 331 ms 205116 KB Output is correct
22 Correct 1380 ms 205940 KB Output is correct
23 Correct 441 ms 199916 KB Output is correct
24 Correct 175 ms 115284 KB Output is correct
25 Correct 557 ms 219764 KB Output is correct
26 Correct 494 ms 219392 KB Output is correct
27 Correct 609 ms 230804 KB Output is correct
28 Correct 598 ms 230784 KB Output is correct
29 Correct 707 ms 231532 KB Output is correct
30 Correct 641 ms 230932 KB Output is correct
31 Correct 3 ms 19032 KB Output is correct
32 Correct 37 ms 32336 KB Output is correct
33 Correct 74 ms 66644 KB Output is correct
34 Correct 316 ms 205840 KB Output is correct
35 Correct 18 ms 27736 KB Output is correct
36 Correct 81 ms 66480 KB Output is correct
37 Correct 204 ms 108988 KB Output is correct
38 Correct 464 ms 96208 KB Output is correct
39 Correct 655 ms 123712 KB Output is correct
40 Correct 860 ms 154512 KB Output is correct
41 Correct 1178 ms 183420 KB Output is correct
42 Correct 1388 ms 210876 KB Output is correct
43 Correct 3 ms 19036 KB Output is correct
44 Correct 3 ms 19036 KB Output is correct
45 Correct 3 ms 19036 KB Output is correct
46 Correct 4 ms 19036 KB Output is correct
47 Correct 3 ms 19036 KB Output is correct
48 Correct 4 ms 19036 KB Output is correct
49 Correct 3 ms 19036 KB Output is correct
50 Correct 4 ms 19036 KB Output is correct
51 Correct 4 ms 19036 KB Output is correct
52 Correct 4 ms 19036 KB Output is correct
53 Correct 3 ms 19036 KB Output is correct
54 Correct 7 ms 20828 KB Output is correct
55 Correct 9 ms 21600 KB Output is correct
56 Correct 267 ms 117288 KB Output is correct
57 Correct 395 ms 162724 KB Output is correct
58 Correct 384 ms 162532 KB Output is correct
59 Correct 3 ms 19036 KB Output is correct
60 Correct 4 ms 19036 KB Output is correct
61 Correct 4 ms 19036 KB Output is correct
62 Correct 567 ms 230620 KB Output is correct
63 Correct 566 ms 230200 KB Output is correct
64 Correct 580 ms 229196 KB Output is correct
65 Correct 11 ms 22616 KB Output is correct
66 Correct 17 ms 26204 KB Output is correct
67 Correct 479 ms 115928 KB Output is correct
68 Correct 754 ms 167576 KB Output is correct
69 Correct 1014 ms 214420 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 15192 KB Output is correct
2 Correct 3 ms 19036 KB Output is correct
3 Correct 3 ms 19036 KB Output is correct
4 Correct 3 ms 19064 KB Output is correct
5 Correct 3 ms 19036 KB Output is correct
6 Correct 3 ms 19036 KB Output is correct
7 Correct 3 ms 19036 KB Output is correct
8 Correct 3 ms 19032 KB Output is correct
9 Correct 262 ms 126248 KB Output is correct
10 Correct 26 ms 29272 KB Output is correct
11 Correct 124 ms 76508 KB Output is correct
12 Correct 34 ms 36476 KB Output is correct
13 Correct 82 ms 64320 KB Output is correct
14 Correct 5 ms 20056 KB Output is correct
15 Correct 7 ms 20856 KB Output is correct
16 Correct 259 ms 126184 KB Output is correct
17 Correct 506 ms 231548 KB Output is correct
18 Correct 488 ms 230764 KB Output is correct
19 Correct 1181 ms 214140 KB Output is correct
20 Correct 640 ms 210872 KB Output is correct
21 Correct 592 ms 202188 KB Output is correct
22 Correct 4 ms 19032 KB Output is correct
23 Correct 94 ms 50416 KB Output is correct
24 Correct 36 ms 36752 KB Output is correct
25 Correct 127 ms 84708 KB Output is correct
26 Correct 214 ms 127836 KB Output is correct
27 Correct 515 ms 115828 KB Output is correct
28 Correct 622 ms 141628 KB Output is correct
29 Correct 900 ms 165204 KB Output is correct
30 Correct 934 ms 189520 KB Output is correct
31 Correct 1188 ms 213136 KB Output is correct
32 Correct 580 ms 218952 KB Output is correct
33 Correct 595 ms 230272 KB Output is correct
34 Correct 12 ms 23384 KB Output is correct
35 Correct 19 ms 26972 KB Output is correct
36 Correct 478 ms 116124 KB Output is correct
37 Correct 689 ms 167328 KB Output is correct
38 Correct 1166 ms 215060 KB Output is correct

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 15192 KB Output is correct
2 Correct 3 ms 19036 KB Output is correct
3 Correct 3 ms 19036 KB Output is correct
4 Correct 3 ms 19064 KB Output is correct
5 Correct 3 ms 19036 KB Output is correct
6 Correct 3 ms 19036 KB Output is correct
7 Correct 3 ms 19036 KB Output is correct
8 Correct 3 ms 19032 KB Output is correct
9 Correct 262 ms 126248 KB Output is correct
10 Correct 26 ms 29272 KB Output is correct
11 Correct 124 ms 76508 KB Output is correct
12 Correct 34 ms 36476 KB Output is correct
13 Correct 82 ms 64320 KB Output is correct
14 Correct 5 ms 20056 KB Output is correct
15 Correct 7 ms 20856 KB Output is correct
16 Correct 259 ms 126184 KB Output is correct
17 Correct 4 ms 19036 KB Output is correct
18 Correct 4 ms 19036 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 4 ms 19036 KB Output is correct
23 Correct 546 ms 210456 KB Output is correct
24 Correct 3 ms 19032 KB Output is correct
25 Correct 5 ms 20060 KB Output is correct
26 Correct 8 ms 21600 KB Output is correct
27 Correct 12 ms 22408 KB Output is correct
28 Correct 210 ms 97504 KB Output is correct
29 Correct 318 ms 133892 KB Output is correct
30 Correct 423 ms 173288 KB Output is correct
31 Correct 535 ms 211800 KB Output is correct
32 Correct 3 ms 19032 KB Output is correct
33 Correct 3 ms 19036 KB Output is correct
34 Correct 3 ms 19036 KB Output is correct
35 Correct 3 ms 19036 KB Output is correct
36 Correct 3 ms 19032 KB Output is correct
37 Correct 3 ms 19036 KB Output is correct
38 Correct 4 ms 19036 KB Output is correct
39 Correct 4 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 7 ms 20828 KB Output is correct
44 Correct 10 ms 21604 KB Output is correct
45 Correct 261 ms 118492 KB Output is correct
46 Correct 393 ms 162500 KB Output is correct
47 Correct 392 ms 162908 KB Output is correct
48 Correct 3 ms 19036 KB Output is correct
49 Correct 3 ms 19036 KB Output is correct
50 Correct 3 ms 19036 KB Output is correct
51 Correct 4 ms 19036 KB Output is correct
52 Correct 4 ms 19036 KB Output is correct
53 Correct 3 ms 19032 KB Output is correct
54 Correct 4 ms 19032 KB Output is correct
55 Correct 563 ms 209020 KB Output is correct
56 Correct 4 ms 19036 KB Output is correct
57 Correct 7 ms 20640 KB Output is correct
58 Correct 16 ms 24412 KB Output is correct
59 Correct 21 ms 27480 KB Output is correct
60 Correct 264 ms 114608 KB Output is correct
61 Correct 371 ms 146568 KB Output is correct
62 Correct 460 ms 175696 KB Output is correct
63 Correct 563 ms 208300 KB Output is correct
64 Correct 3 ms 19036 KB Output is correct
65 Correct 3 ms 19064 KB Output is correct
66 Correct 3 ms 19036 KB Output is correct
67 Correct 619 ms 231016 KB Output is correct
68 Correct 611 ms 231080 KB Output is correct
69 Correct 583 ms 229124 KB Output is correct
70 Correct 10 ms 22652 KB Output is correct
71 Correct 17 ms 26076 KB Output is correct
72 Correct 491 ms 115908 KB Output is correct
73 Correct 788 ms 166404 KB Output is correct
74 Correct 1047 ms 213732 KB Output is correct
75 Correct 563 ms 218252 KB Output is correct
76 Correct 562 ms 230152 KB Output is correct
77 Correct 11 ms 23388 KB Output is correct
78 Correct 18 ms 26972 KB Output is correct
79 Correct 489 ms 116780 KB Output is correct
80 Correct 696 ms 166224 KB Output is correct
81 Correct 1055 ms 215436 KB Output is correct
82 Correct 4 ms 19032 KB Output is correct
83 Correct 4 ms 19036 KB Output is correct
84 Correct 4 ms 19028 KB Output is correct
85 Correct 1487 ms 205108 KB Output is correct
86 Correct 331 ms 205116 KB Output is correct
87 Correct 1380 ms 205940 KB Output is correct
88 Correct 441 ms 199916 KB Output is correct
89 Correct 175 ms 115284 KB Output is correct
90 Correct 557 ms 219764 KB Output is correct
91 Correct 494 ms 219392 KB Output is correct
92 Correct 609 ms 230804 KB Output is correct
93 Correct 598 ms 230784 KB Output is correct
94 Correct 707 ms 231532 KB Output is correct
95 Correct 641 ms 230932 KB Output is correct
96 Correct 3 ms 19032 KB Output is correct
97 Correct 37 ms 32336 KB Output is correct
98 Correct 74 ms 66644 KB Output is correct
99 Correct 316 ms 205840 KB Output is correct
100 Correct 18 ms 27736 KB Output is correct
101 Correct 81 ms 66480 KB Output is correct
102 Correct 204 ms 108988 KB Output is correct
103 Correct 464 ms 96208 KB Output is correct
104 Correct 655 ms 123712 KB Output is correct
105 Correct 860 ms 154512 KB Output is correct
106 Correct 1178 ms 183420 KB Output is correct
107 Correct 1388 ms 210876 KB Output is correct
108 Correct 3 ms 19036 KB Output is correct
109 Correct 3 ms 19036 KB Output is correct
110 Correct 3 ms 19036 KB Output is correct
111 Correct 4 ms 19036 KB Output is correct
112 Correct 3 ms 19036 KB Output is correct
113 Correct 4 ms 19036 KB Output is correct
114 Correct 3 ms 19036 KB Output is correct
115 Correct 4 ms 19036 KB Output is correct
116 Correct 4 ms 19036 KB Output is correct
117 Correct 4 ms 19036 KB Output is correct
118 Correct 3 ms 19036 KB Output is correct
119 Correct 7 ms 20828 KB Output is correct
120 Correct 9 ms 21600 KB Output is correct
121 Correct 267 ms 117288 KB Output is correct
122 Correct 395 ms 162724 KB Output is correct
123 Correct 384 ms 162532 KB Output is correct
124 Correct 3 ms 19036 KB Output is correct
125 Correct 4 ms 19036 KB Output is correct
126 Correct 4 ms 19036 KB Output is correct
127 Correct 567 ms 230620 KB Output is correct
128 Correct 566 ms 230200 KB Output is correct
129 Correct 580 ms 229196 KB Output is correct
130 Correct 11 ms 22616 KB Output is correct
131 Correct 17 ms 26204 KB Output is correct
132 Correct 479 ms 115928 KB Output is correct
133 Correct 754 ms 167576 KB Output is correct
134 Correct 1014 ms 214420 KB Output is correct
135 Correct 506 ms 231548 KB Output is correct
136 Correct 488 ms 230764 KB Output is correct
137 Correct 1181 ms 214140 KB Output is correct
138 Correct 640 ms 210872 KB Output is correct
139 Correct 592 ms 202188 KB Output is correct
140 Correct 4 ms 19032 KB Output is correct
141 Correct 94 ms 50416 KB Output is correct
142 Correct 36 ms 36752 KB Output is correct
143 Correct 127 ms 84708 KB Output is correct
144 Correct 214 ms 127836 KB Output is correct
145 Correct 515 ms 115828 KB Output is correct
146 Correct 622 ms 141628 KB Output is correct
147 Correct 900 ms 165204 KB Output is correct
148 Correct 934 ms 189520 KB Output is correct
149 Correct 1188 ms 213136 KB Output is correct
150 Correct 580 ms 218952 KB Output is correct
151 Correct 595 ms 230272 KB Output is correct
152 Correct 12 ms 23384 KB Output is correct
153 Correct 19 ms 26972 KB Output is correct
154 Correct 478 ms 116124 KB Output is correct
155 Correct 689 ms 167328 KB Output is correct
156 Correct 1166 ms 215060 KB Output is correct
157 Correct 4 ms 19188 KB Output is correct
158 Correct 4 ms 19032 KB Output is correct
159 Correct 4 ms 19036 KB Output is correct
160 Correct 4 ms 19036 KB Output is correct
161 Correct 749 ms 204596 KB Output is correct
162 Correct 348 ms 205956 KB Output is correct
163 Correct 337 ms 203412 KB Output is correct
164 Correct 347 ms 204736 KB Output is correct
165 Correct 387 ms 204948 KB Output is correct
166 Correct 423 ms 203664 KB Output is correct
167 Incorrect 295 ms 64344 KB a[157] = 0 is not an odd integer
168 Halted 0 ms 0 KB -