oj.uz

Submission #896293

# Submission time Handle Problem Language Result Execution time Memory
896293 2024-01-01T07:52:03 Z abcvuitunggio Fountain Parks (IOI21_parks) C++17
70 / 100
 1140 ms 245044 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],mp2[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]);});
    a.assign(n-1,0);
    b.assign(n-1,0);
    while (true){
        g.Reset();
        g.Assign(n*10);
        u.clear();
        v.clear();
        id=0;
        for (int i=1;i<=300000;i+=2)
            mp2[i].clear();
        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 (!mp2[X+dx[l]].count(Y+dy[l])){
                                    id++;
                                    mp2[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(),mp2[X+dx[l]][Y+dy[l]]+n-1,1);
                            }
                    }
                }
        }
        if (u.size()<n-1)
            return 0;
        int mx=g.MaxFlow(n*3-1,n*3);
        if (mx<n-1){
            random_shuffle(order,order+n);
            continue;
        }
        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:151:21: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'long long int' [-Wsign-compare]
  151 |         if (u.size()<n-1)
      |             ~~~~~~~~^~~~
parks.cpp:158:23: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<Edge>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  158 |         for (int i=0;i<g.s.size();i+=2)
      |                      ~^~~~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 29284 KB Output is correct
2 Correct 7 ms 33368 KB Output is correct
3 Correct 7 ms 33372 KB Output is correct
4 Correct 7 ms 33372 KB Output is correct
5 Correct 7 ms 33368 KB Output is correct
6 Correct 7 ms 33372 KB Output is correct
7 Correct 7 ms 33368 KB Output is correct
8 Correct 7 ms 33372 KB Output is correct
9 Correct 266 ms 140596 KB Output is correct
10 Correct 28 ms 43876 KB Output is correct
11 Correct 137 ms 90844 KB Output is correct
12 Correct 39 ms 49116 KB Output is correct
13 Correct 90 ms 79436 KB Output is correct
14 Correct 9 ms 34408 KB Output is correct
15 Correct 11 ms 35420 KB Output is correct
16 Correct 264 ms 140604 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 29284 KB Output is correct
2 Correct 7 ms 33368 KB Output is correct
3 Correct 7 ms 33372 KB Output is correct
4 Correct 7 ms 33372 KB Output is correct
5 Correct 7 ms 33368 KB Output is correct
6 Correct 7 ms 33372 KB Output is correct
7 Correct 7 ms 33368 KB Output is correct
8 Correct 7 ms 33372 KB Output is correct
9 Correct 266 ms 140596 KB Output is correct
10 Correct 28 ms 43876 KB Output is correct
11 Correct 137 ms 90844 KB Output is correct
12 Correct 39 ms 49116 KB Output is correct
13 Correct 90 ms 79436 KB Output is correct
14 Correct 9 ms 34408 KB Output is correct
15 Correct 11 ms 35420 KB Output is correct
16 Correct 264 ms 140604 KB Output is correct
17 Correct 7 ms 33368 KB Output is correct
18 Correct 7 ms 33372 KB Output is correct
19 Correct 7 ms 33372 KB Output is correct
20 Correct 7 ms 33388 KB Output is correct
21 Correct 7 ms 33404 KB Output is correct
22 Correct 7 ms 33372 KB Output is correct
23 Correct 515 ms 218108 KB Output is correct
24 Correct 7 ms 33368 KB Output is correct
25 Correct 9 ms 34396 KB Output is correct
26 Correct 12 ms 35932 KB Output is correct
27 Correct 13 ms 36708 KB Output is correct
28 Correct 186 ms 108268 KB Output is correct
29 Correct 284 ms 143720 KB Output is correct
30 Correct 396 ms 178668 KB Output is correct
31 Correct 513 ms 216608 KB Output is correct
32 Correct 7 ms 33368 KB Output is correct
33 Correct 7 ms 33376 KB Output is correct
34 Correct 7 ms 33372 KB Output is correct
35 Correct 9 ms 33372 KB Output is correct
36 Correct 7 ms 33224 KB Output is correct
37 Correct 7 ms 33372 KB Output is correct
38 Correct 7 ms 33372 KB Output is correct
39 Correct 9 ms 33372 KB Output is correct
40 Correct 7 ms 33392 KB Output is correct
41 Correct 7 ms 33372 KB Output is correct
42 Correct 8 ms 33372 KB Output is correct
43 Correct 10 ms 35160 KB Output is correct
44 Correct 12 ms 36020 KB Output is correct
45 Correct 270 ms 131068 KB Output is correct
46 Correct 405 ms 177356 KB Output is correct
47 Correct 405 ms 177264 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 29284 KB Output is correct
2 Correct 7 ms 33368 KB Output is correct
3 Correct 7 ms 33372 KB Output is correct
4 Correct 7 ms 33372 KB Output is correct
5 Correct 7 ms 33368 KB Output is correct
6 Correct 7 ms 33372 KB Output is correct
7 Correct 7 ms 33368 KB Output is correct
8 Correct 7 ms 33372 KB Output is correct
9 Correct 266 ms 140596 KB Output is correct
10 Correct 28 ms 43876 KB Output is correct
11 Correct 137 ms 90844 KB Output is correct
12 Correct 39 ms 49116 KB Output is correct
13 Correct 90 ms 79436 KB Output is correct
14 Correct 9 ms 34408 KB Output is correct
15 Correct 11 ms 35420 KB Output is correct
16 Correct 264 ms 140604 KB Output is correct
17 Correct 7 ms 33368 KB Output is correct
18 Correct 7 ms 33372 KB Output is correct
19 Correct 7 ms 33372 KB Output is correct
20 Correct 7 ms 33388 KB Output is correct
21 Correct 7 ms 33404 KB Output is correct
22 Correct 7 ms 33372 KB Output is correct
23 Correct 515 ms 218108 KB Output is correct
24 Correct 7 ms 33368 KB Output is correct
25 Correct 9 ms 34396 KB Output is correct
26 Correct 12 ms 35932 KB Output is correct
27 Correct 13 ms 36708 KB Output is correct
28 Correct 186 ms 108268 KB Output is correct
29 Correct 284 ms 143720 KB Output is correct
30 Correct 396 ms 178668 KB Output is correct
31 Correct 513 ms 216608 KB Output is correct
32 Correct 7 ms 33368 KB Output is correct
33 Correct 7 ms 33376 KB Output is correct
34 Correct 7 ms 33372 KB Output is correct
35 Correct 9 ms 33372 KB Output is correct
36 Correct 7 ms 33224 KB Output is correct
37 Correct 7 ms 33372 KB Output is correct
38 Correct 7 ms 33372 KB Output is correct
39 Correct 9 ms 33372 KB Output is correct
40 Correct 7 ms 33392 KB Output is correct
41 Correct 7 ms 33372 KB Output is correct
42 Correct 8 ms 33372 KB Output is correct
43 Correct 10 ms 35160 KB Output is correct
44 Correct 12 ms 36020 KB Output is correct
45 Correct 270 ms 131068 KB Output is correct
46 Correct 405 ms 177356 KB Output is correct
47 Correct 405 ms 177264 KB Output is correct
48 Correct 7 ms 33372 KB Output is correct
49 Correct 7 ms 33212 KB Output is correct
50 Correct 7 ms 33372 KB Output is correct
51 Correct 7 ms 33372 KB Output is correct
52 Correct 8 ms 33380 KB Output is correct
53 Correct 7 ms 33376 KB Output is correct
54 Correct 7 ms 33376 KB Output is correct
55 Correct 530 ms 217744 KB Output is correct
56 Correct 7 ms 33376 KB Output is correct
57 Correct 10 ms 34908 KB Output is correct
58 Correct 18 ms 38744 KB Output is correct
59 Correct 23 ms 41860 KB Output is correct
60 Correct 253 ms 128180 KB Output is correct
61 Correct 338 ms 157536 KB Output is correct
62 Correct 417 ms 183472 KB Output is correct
63 Correct 524 ms 217464 KB Output is correct
64 Correct 7 ms 33372 KB Output is correct
65 Correct 7 ms 33372 KB Output is correct
66 Correct 7 ms 33372 KB Output is correct
67 Correct 551 ms 243964 KB Output is correct
68 Correct 550 ms 245044 KB Output is correct
69 Correct 541 ms 242652 KB Output is correct
70 Correct 14 ms 36956 KB Output is correct
71 Correct 21 ms 40420 KB Output is correct
72 Correct 303 ms 130544 KB Output is correct
73 Correct 470 ms 179588 KB Output is correct
74 Correct 639 ms 227992 KB Output is correct
75 Correct 569 ms 230584 KB Output is correct
76 Correct 550 ms 243948 KB Output is correct
77 Correct 15 ms 37724 KB Output is correct
78 Correct 22 ms 41564 KB Output is correct
79 Correct 296 ms 131224 KB Output is correct
80 Correct 474 ms 180580 KB Output is correct
81 Correct 640 ms 228096 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 29284 KB Output is correct
2 Correct 7 ms 33368 KB Output is correct
3 Correct 7 ms 33372 KB Output is correct
4 Correct 7 ms 33372 KB Output is correct
5 Correct 7 ms 33368 KB Output is correct
6 Correct 7 ms 33372 KB Output is correct
7 Correct 7 ms 33368 KB Output is correct
8 Correct 7 ms 33372 KB Output is correct
9 Correct 266 ms 140596 KB Output is correct
10 Correct 28 ms 43876 KB Output is correct
11 Correct 137 ms 90844 KB Output is correct
12 Correct 39 ms 49116 KB Output is correct
13 Correct 90 ms 79436 KB Output is correct
14 Correct 9 ms 34408 KB Output is correct
15 Correct 11 ms 35420 KB Output is correct
16 Correct 264 ms 140604 KB Output is correct
17 Correct 8 ms 33368 KB Output is correct
18 Correct 8 ms 33628 KB Output is correct
19 Correct 7 ms 33372 KB Output is correct
20 Correct 347 ms 218192 KB Output is correct
21 Correct 374 ms 217804 KB Output is correct
22 Correct 363 ms 217844 KB Output is correct
23 Correct 369 ms 212408 KB Output is correct
24 Correct 171 ms 131112 KB Output is correct
25 Correct 392 ms 235304 KB Output is correct
26 Correct 352 ms 235304 KB Output is correct
27 Correct 483 ms 243612 KB Output is correct
28 Correct 465 ms 243636 KB Output is correct
29 Correct 481 ms 242920 KB Output is correct
30 Correct 480 ms 243792 KB Output is correct
31 Correct 7 ms 33372 KB Output is correct
32 Correct 40 ms 46652 KB Output is correct
33 Correct 66 ms 81988 KB Output is correct
34 Correct 330 ms 219208 KB Output is correct
35 Correct 23 ms 42072 KB Output is correct
36 Correct 83 ms 79520 KB Output is correct
37 Correct 169 ms 125316 KB Output is correct
38 Correct 382 ms 110192 KB Output is correct
39 Correct 653 ms 137344 KB Output is correct
40 Correct 776 ms 165916 KB Output is correct
41 Correct 946 ms 196880 KB Output is correct
42 Correct 1140 ms 223000 KB Output is correct
43 Correct 7 ms 33372 KB Output is correct
44 Correct 8 ms 33372 KB Output is correct
45 Correct 7 ms 33372 KB Output is correct
46 Correct 8 ms 33372 KB Output is correct
47 Correct 7 ms 33368 KB Output is correct
48 Correct 7 ms 33404 KB Output is correct
49 Correct 7 ms 33372 KB Output is correct
50 Correct 7 ms 33392 KB Output is correct
51 Correct 7 ms 33372 KB Output is correct
52 Correct 7 ms 33224 KB Output is correct
53 Correct 7 ms 33372 KB Output is correct
54 Correct 10 ms 35160 KB Output is correct
55 Correct 12 ms 36188 KB Output is correct
56 Correct 269 ms 132176 KB Output is correct
57 Correct 403 ms 177324 KB Output is correct
58 Correct 405 ms 174672 KB Output is correct
59 Correct 7 ms 33372 KB Output is correct
60 Correct 7 ms 33372 KB Output is correct
61 Correct 8 ms 33212 KB Output is correct
62 Correct 548 ms 243696 KB Output is correct
63 Correct 537 ms 243440 KB Output is correct
64 Correct 537 ms 242096 KB Output is correct
65 Correct 14 ms 36952 KB Output is correct
66 Correct 21 ms 40540 KB Output is correct
67 Correct 300 ms 130556 KB Output is correct
68 Correct 468 ms 180304 KB Output is correct
69 Correct 664 ms 226408 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 29284 KB Output is correct
2 Correct 7 ms 33368 KB Output is correct
3 Correct 7 ms 33372 KB Output is correct
4 Correct 7 ms 33372 KB Output is correct
5 Correct 7 ms 33368 KB Output is correct
6 Correct 7 ms 33372 KB Output is correct
7 Correct 7 ms 33368 KB Output is correct
8 Correct 7 ms 33372 KB Output is correct
9 Correct 266 ms 140596 KB Output is correct
10 Correct 28 ms 43876 KB Output is correct
11 Correct 137 ms 90844 KB Output is correct
12 Correct 39 ms 49116 KB Output is correct
13 Correct 90 ms 79436 KB Output is correct
14 Correct 9 ms 34408 KB Output is correct
15 Correct 11 ms 35420 KB Output is correct
16 Correct 264 ms 140604 KB Output is correct
17 Correct 466 ms 243700 KB Output is correct
18 Correct 493 ms 244108 KB Output is correct
19 Correct 424 ms 222708 KB Output is correct
20 Correct 501 ms 223328 KB Output is correct
21 Correct 484 ms 214428 KB Output is correct
22 Correct 7 ms 33568 KB Output is correct
23 Correct 102 ms 63308 KB Output is correct
24 Correct 39 ms 51160 KB Output is correct
25 Correct 119 ms 99132 KB Output is correct
26 Correct 210 ms 144124 KB Output is correct
27 Correct 390 ms 130224 KB Output is correct
28 Correct 543 ms 154540 KB Output is correct
29 Correct 730 ms 179028 KB Output is correct
30 Correct 831 ms 202944 KB Output is correct
31 Correct 963 ms 226932 KB Output is correct
32 Correct 572 ms 228472 KB Output is correct
33 Correct 559 ms 243952 KB Output is correct
34 Correct 15 ms 37724 KB Output is correct
35 Correct 22 ms 41304 KB Output is correct
36 Correct 319 ms 129436 KB Output is correct
37 Correct 457 ms 180360 KB Output is correct
38 Correct 643 ms 226752 KB Output is correct

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 29284 KB Output is correct
2 Correct 7 ms 33368 KB Output is correct
3 Correct 7 ms 33372 KB Output is correct
4 Correct 7 ms 33372 KB Output is correct
5 Correct 7 ms 33368 KB Output is correct
6 Correct 7 ms 33372 KB Output is correct
7 Correct 7 ms 33368 KB Output is correct
8 Correct 7 ms 33372 KB Output is correct
9 Correct 266 ms 140596 KB Output is correct
10 Correct 28 ms 43876 KB Output is correct
11 Correct 137 ms 90844 KB Output is correct
12 Correct 39 ms 49116 KB Output is correct
13 Correct 90 ms 79436 KB Output is correct
14 Correct 9 ms 34408 KB Output is correct
15 Correct 11 ms 35420 KB Output is correct
16 Correct 264 ms 140604 KB Output is correct
17 Correct 7 ms 33368 KB Output is correct
18 Correct 7 ms 33372 KB Output is correct
19 Correct 7 ms 33372 KB Output is correct
20 Correct 7 ms 33388 KB Output is correct
21 Correct 7 ms 33404 KB Output is correct
22 Correct 7 ms 33372 KB Output is correct
23 Correct 515 ms 218108 KB Output is correct
24 Correct 7 ms 33368 KB Output is correct
25 Correct 9 ms 34396 KB Output is correct
26 Correct 12 ms 35932 KB Output is correct
27 Correct 13 ms 36708 KB Output is correct
28 Correct 186 ms 108268 KB Output is correct
29 Correct 284 ms 143720 KB Output is correct
30 Correct 396 ms 178668 KB Output is correct
31 Correct 513 ms 216608 KB Output is correct
32 Correct 7 ms 33368 KB Output is correct
33 Correct 7 ms 33376 KB Output is correct
34 Correct 7 ms 33372 KB Output is correct
35 Correct 9 ms 33372 KB Output is correct
36 Correct 7 ms 33224 KB Output is correct
37 Correct 7 ms 33372 KB Output is correct
38 Correct 7 ms 33372 KB Output is correct
39 Correct 9 ms 33372 KB Output is correct
40 Correct 7 ms 33392 KB Output is correct
41 Correct 7 ms 33372 KB Output is correct
42 Correct 8 ms 33372 KB Output is correct
43 Correct 10 ms 35160 KB Output is correct
44 Correct 12 ms 36020 KB Output is correct
45 Correct 270 ms 131068 KB Output is correct
46 Correct 405 ms 177356 KB Output is correct
47 Correct 405 ms 177264 KB Output is correct
48 Correct 7 ms 33372 KB Output is correct
49 Correct 7 ms 33212 KB Output is correct
50 Correct 7 ms 33372 KB Output is correct
51 Correct 7 ms 33372 KB Output is correct
52 Correct 8 ms 33380 KB Output is correct
53 Correct 7 ms 33376 KB Output is correct
54 Correct 7 ms 33376 KB Output is correct
55 Correct 530 ms 217744 KB Output is correct
56 Correct 7 ms 33376 KB Output is correct
57 Correct 10 ms 34908 KB Output is correct
58 Correct 18 ms 38744 KB Output is correct
59 Correct 23 ms 41860 KB Output is correct
60 Correct 253 ms 128180 KB Output is correct
61 Correct 338 ms 157536 KB Output is correct
62 Correct 417 ms 183472 KB Output is correct
63 Correct 524 ms 217464 KB Output is correct
64 Correct 7 ms 33372 KB Output is correct
65 Correct 7 ms 33372 KB Output is correct
66 Correct 7 ms 33372 KB Output is correct
67 Correct 551 ms 243964 KB Output is correct
68 Correct 550 ms 245044 KB Output is correct
69 Correct 541 ms 242652 KB Output is correct
70 Correct 14 ms 36956 KB Output is correct
71 Correct 21 ms 40420 KB Output is correct
72 Correct 303 ms 130544 KB Output is correct
73 Correct 470 ms 179588 KB Output is correct
74 Correct 639 ms 227992 KB Output is correct
75 Correct 569 ms 230584 KB Output is correct
76 Correct 550 ms 243948 KB Output is correct
77 Correct 15 ms 37724 KB Output is correct
78 Correct 22 ms 41564 KB Output is correct
79 Correct 296 ms 131224 KB Output is correct
80 Correct 474 ms 180580 KB Output is correct
81 Correct 640 ms 228096 KB Output is correct
82 Correct 8 ms 33368 KB Output is correct
83 Correct 8 ms 33628 KB Output is correct
84 Correct 7 ms 33372 KB Output is correct
85 Correct 347 ms 218192 KB Output is correct
86 Correct 374 ms 217804 KB Output is correct
87 Correct 363 ms 217844 KB Output is correct
88 Correct 369 ms 212408 KB Output is correct
89 Correct 171 ms 131112 KB Output is correct
90 Correct 392 ms 235304 KB Output is correct
91 Correct 352 ms 235304 KB Output is correct
92 Correct 483 ms 243612 KB Output is correct
93 Correct 465 ms 243636 KB Output is correct
94 Correct 481 ms 242920 KB Output is correct
95 Correct 480 ms 243792 KB Output is correct
96 Correct 7 ms 33372 KB Output is correct
97 Correct 40 ms 46652 KB Output is correct
98 Correct 66 ms 81988 KB Output is correct
99 Correct 330 ms 219208 KB Output is correct
100 Correct 23 ms 42072 KB Output is correct
101 Correct 83 ms 79520 KB Output is correct
102 Correct 169 ms 125316 KB Output is correct
103 Correct 382 ms 110192 KB Output is correct
104 Correct 653 ms 137344 KB Output is correct
105 Correct 776 ms 165916 KB Output is correct
106 Correct 946 ms 196880 KB Output is correct
107 Correct 1140 ms 223000 KB Output is correct
108 Correct 7 ms 33372 KB Output is correct
109 Correct 8 ms 33372 KB Output is correct
110 Correct 7 ms 33372 KB Output is correct
111 Correct 8 ms 33372 KB Output is correct
112 Correct 7 ms 33368 KB Output is correct
113 Correct 7 ms 33404 KB Output is correct
114 Correct 7 ms 33372 KB Output is correct
115 Correct 7 ms 33392 KB Output is correct
116 Correct 7 ms 33372 KB Output is correct
117 Correct 7 ms 33224 KB Output is correct
118 Correct 7 ms 33372 KB Output is correct
119 Correct 10 ms 35160 KB Output is correct
120 Correct 12 ms 36188 KB Output is correct
121 Correct 269 ms 132176 KB Output is correct
122 Correct 403 ms 177324 KB Output is correct
123 Correct 405 ms 174672 KB Output is correct
124 Correct 7 ms 33372 KB Output is correct
125 Correct 7 ms 33372 KB Output is correct
126 Correct 8 ms 33212 KB Output is correct
127 Correct 548 ms 243696 KB Output is correct
128 Correct 537 ms 243440 KB Output is correct
129 Correct 537 ms 242096 KB Output is correct
130 Correct 14 ms 36952 KB Output is correct
131 Correct 21 ms 40540 KB Output is correct
132 Correct 300 ms 130556 KB Output is correct
133 Correct 468 ms 180304 KB Output is correct
134 Correct 664 ms 226408 KB Output is correct
135 Correct 466 ms 243700 KB Output is correct
136 Correct 493 ms 244108 KB Output is correct
137 Correct 424 ms 222708 KB Output is correct
138 Correct 501 ms 223328 KB Output is correct
139 Correct 484 ms 214428 KB Output is correct
140 Correct 7 ms 33568 KB Output is correct
141 Correct 102 ms 63308 KB Output is correct
142 Correct 39 ms 51160 KB Output is correct
143 Correct 119 ms 99132 KB Output is correct
144 Correct 210 ms 144124 KB Output is correct
145 Correct 390 ms 130224 KB Output is correct
146 Correct 543 ms 154540 KB Output is correct
147 Correct 730 ms 179028 KB Output is correct
148 Correct 831 ms 202944 KB Output is correct
149 Correct 963 ms 226932 KB Output is correct
150 Correct 572 ms 228472 KB Output is correct
151 Correct 559 ms 243952 KB Output is correct
152 Correct 15 ms 37724 KB Output is correct
153 Correct 22 ms 41304 KB Output is correct
154 Correct 319 ms 129436 KB Output is correct
155 Correct 457 ms 180360 KB Output is correct
156 Correct 643 ms 226752 KB Output is correct
157 Correct 7 ms 33368 KB Output is correct
158 Correct 7 ms 33372 KB Output is correct
159 Correct 7 ms 33372 KB Output is correct
160 Correct 7 ms 33372 KB Output is correct
161 Correct 467 ms 218232 KB Output is correct
162 Correct 324 ms 217400 KB Output is correct
163 Correct 397 ms 217800 KB Output is correct
164 Correct 399 ms 217404 KB Output is correct
165 Correct 484 ms 217796 KB Output is correct
166 Correct 490 ms 217964 KB Output is correct
167 Incorrect 497 ms 77564 KB Solution announced impossible, but it is possible.
168 Halted 0 ms 0 KB -