oj.uz

Submission #896296

# Submission time Handle Problem Language Result Execution time Memory
896296 2024-01-01T07:53:53 Z abcvuitunggio Fountain Parks (IOI21_parks) C++17
70 / 100
 3500 ms 245180 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(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;
        iota(p,p+n,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 29124 KB Output is correct
2 Correct 7 ms 33372 KB Output is correct
3 Correct 7 ms 33372 KB Output is correct
4 Correct 7 ms 33368 KB Output is correct
5 Correct 7 ms 33368 KB Output is correct
6 Correct 8 ms 33372 KB Output is correct
7 Correct 8 ms 33372 KB Output is correct
8 Correct 8 ms 33368 KB Output is correct
9 Correct 267 ms 139796 KB Output is correct
10 Correct 27 ms 43604 KB Output is correct
11 Correct 134 ms 90400 KB Output is correct
12 Correct 38 ms 49180 KB Output is correct
13 Correct 88 ms 78992 KB Output is correct
14 Correct 10 ms 34652 KB Output is correct
15 Correct 10 ms 35160 KB Output is correct
16 Correct 264 ms 139752 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 29124 KB Output is correct
2 Correct 7 ms 33372 KB Output is correct
3 Correct 7 ms 33372 KB Output is correct
4 Correct 7 ms 33368 KB Output is correct
5 Correct 7 ms 33368 KB Output is correct
6 Correct 8 ms 33372 KB Output is correct
7 Correct 8 ms 33372 KB Output is correct
8 Correct 8 ms 33368 KB Output is correct
9 Correct 267 ms 139796 KB Output is correct
10 Correct 27 ms 43604 KB Output is correct
11 Correct 134 ms 90400 KB Output is correct
12 Correct 38 ms 49180 KB Output is correct
13 Correct 88 ms 78992 KB Output is correct
14 Correct 10 ms 34652 KB Output is correct
15 Correct 10 ms 35160 KB Output is correct
16 Correct 264 ms 139752 KB Output is correct
17 Correct 8 ms 33368 KB Output is correct
18 Correct 8 ms 33220 KB Output is correct
19 Correct 7 ms 33400 KB Output is correct
20 Correct 7 ms 33372 KB Output is correct
21 Correct 7 ms 33372 KB Output is correct
22 Correct 7 ms 33372 KB Output is correct
23 Correct 529 ms 215408 KB Output is correct
24 Correct 7 ms 33368 KB Output is correct
25 Correct 9 ms 34396 KB Output is correct
26 Correct 11 ms 35936 KB Output is correct
27 Correct 13 ms 36700 KB Output is correct
28 Correct 184 ms 106020 KB Output is correct
29 Correct 290 ms 143092 KB Output is correct
30 Correct 439 ms 178616 KB Output is correct
31 Correct 563 ms 215928 KB Output is correct
32 Correct 7 ms 33376 KB Output is correct
33 Correct 7 ms 33376 KB Output is correct
34 Correct 7 ms 33396 KB Output is correct
35 Correct 7 ms 33368 KB Output is correct
36 Correct 7 ms 33372 KB Output is correct
37 Correct 7 ms 33404 KB Output is correct
38 Correct 7 ms 33404 KB Output is correct
39 Correct 7 ms 33372 KB Output is correct
40 Correct 7 ms 33372 KB Output is correct
41 Correct 7 ms 33204 KB Output is correct
42 Correct 8 ms 33368 KB Output is correct
43 Correct 11 ms 35164 KB Output is correct
44 Correct 13 ms 36164 KB Output is correct
45 Correct 271 ms 131112 KB Output is correct
46 Correct 417 ms 176148 KB Output is correct
47 Correct 438 ms 175852 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 29124 KB Output is correct
2 Correct 7 ms 33372 KB Output is correct
3 Correct 7 ms 33372 KB Output is correct
4 Correct 7 ms 33368 KB Output is correct
5 Correct 7 ms 33368 KB Output is correct
6 Correct 8 ms 33372 KB Output is correct
7 Correct 8 ms 33372 KB Output is correct
8 Correct 8 ms 33368 KB Output is correct
9 Correct 267 ms 139796 KB Output is correct
10 Correct 27 ms 43604 KB Output is correct
11 Correct 134 ms 90400 KB Output is correct
12 Correct 38 ms 49180 KB Output is correct
13 Correct 88 ms 78992 KB Output is correct
14 Correct 10 ms 34652 KB Output is correct
15 Correct 10 ms 35160 KB Output is correct
16 Correct 264 ms 139752 KB Output is correct
17 Correct 8 ms 33368 KB Output is correct
18 Correct 8 ms 33220 KB Output is correct
19 Correct 7 ms 33400 KB Output is correct
20 Correct 7 ms 33372 KB Output is correct
21 Correct 7 ms 33372 KB Output is correct
22 Correct 7 ms 33372 KB Output is correct
23 Correct 529 ms 215408 KB Output is correct
24 Correct 7 ms 33368 KB Output is correct
25 Correct 9 ms 34396 KB Output is correct
26 Correct 11 ms 35936 KB Output is correct
27 Correct 13 ms 36700 KB Output is correct
28 Correct 184 ms 106020 KB Output is correct
29 Correct 290 ms 143092 KB Output is correct
30 Correct 439 ms 178616 KB Output is correct
31 Correct 563 ms 215928 KB Output is correct
32 Correct 7 ms 33376 KB Output is correct
33 Correct 7 ms 33376 KB Output is correct
34 Correct 7 ms 33396 KB Output is correct
35 Correct 7 ms 33368 KB Output is correct
36 Correct 7 ms 33372 KB Output is correct
37 Correct 7 ms 33404 KB Output is correct
38 Correct 7 ms 33404 KB Output is correct
39 Correct 7 ms 33372 KB Output is correct
40 Correct 7 ms 33372 KB Output is correct
41 Correct 7 ms 33204 KB Output is correct
42 Correct 8 ms 33368 KB Output is correct
43 Correct 11 ms 35164 KB Output is correct
44 Correct 13 ms 36164 KB Output is correct
45 Correct 271 ms 131112 KB Output is correct
46 Correct 417 ms 176148 KB Output is correct
47 Correct 438 ms 175852 KB Output is correct
48 Correct 7 ms 33372 KB Output is correct
49 Correct 8 ms 33372 KB Output is correct
50 Correct 6 ms 33624 KB Output is correct
51 Correct 8 ms 33400 KB Output is correct
52 Correct 7 ms 33376 KB Output is correct
53 Correct 7 ms 33380 KB Output is correct
54 Correct 7 ms 33380 KB Output is correct
55 Correct 544 ms 215600 KB Output is correct
56 Correct 8 ms 33368 KB Output is correct
57 Correct 12 ms 34908 KB Output is correct
58 Correct 18 ms 38744 KB Output is correct
59 Correct 23 ms 41816 KB Output is correct
60 Correct 250 ms 127512 KB Output is correct
61 Correct 339 ms 156136 KB Output is correct
62 Correct 451 ms 184056 KB Output is correct
63 Correct 524 ms 216020 KB Output is correct
64 Correct 7 ms 33368 KB Output is correct
65 Correct 8 ms 33368 KB Output is correct
66 Correct 7 ms 33372 KB Output is correct
67 Correct 558 ms 243980 KB Output is correct
68 Correct 596 ms 243356 KB Output is correct
69 Correct 545 ms 243104 KB Output is correct
70 Correct 13 ms 36956 KB Output is correct
71 Correct 21 ms 40540 KB Output is correct
72 Correct 312 ms 129776 KB Output is correct
73 Correct 487 ms 180612 KB Output is correct
74 Correct 740 ms 227148 KB Output is correct
75 Correct 648 ms 228992 KB Output is correct
76 Correct 585 ms 243512 KB Output is correct
77 Correct 18 ms 37800 KB Output is correct
78 Correct 25 ms 41480 KB Output is correct
79 Correct 320 ms 130088 KB Output is correct
80 Correct 499 ms 180116 KB Output is correct
81 Correct 698 ms 228968 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 29124 KB Output is correct
2 Correct 7 ms 33372 KB Output is correct
3 Correct 7 ms 33372 KB Output is correct
4 Correct 7 ms 33368 KB Output is correct
5 Correct 7 ms 33368 KB Output is correct
6 Correct 8 ms 33372 KB Output is correct
7 Correct 8 ms 33372 KB Output is correct
8 Correct 8 ms 33368 KB Output is correct
9 Correct 267 ms 139796 KB Output is correct
10 Correct 27 ms 43604 KB Output is correct
11 Correct 134 ms 90400 KB Output is correct
12 Correct 38 ms 49180 KB Output is correct
13 Correct 88 ms 78992 KB Output is correct
14 Correct 10 ms 34652 KB Output is correct
15 Correct 10 ms 35160 KB Output is correct
16 Correct 264 ms 139752 KB Output is correct
17 Correct 7 ms 33372 KB Output is correct
18 Correct 7 ms 33372 KB Output is correct
19 Correct 7 ms 33372 KB Output is correct
20 Correct 392 ms 219124 KB Output is correct
21 Correct 365 ms 218720 KB Output is correct
22 Correct 416 ms 220180 KB Output is correct
23 Correct 375 ms 213692 KB Output is correct
24 Correct 183 ms 132228 KB Output is correct
25 Correct 404 ms 237120 KB Output is correct
26 Correct 374 ms 236964 KB Output is correct
27 Correct 492 ms 244852 KB Output is correct
28 Correct 495 ms 245144 KB Output is correct
29 Correct 511 ms 243888 KB Output is correct
30 Correct 485 ms 245180 KB Output is correct
31 Correct 7 ms 33372 KB Output is correct
32 Correct 47 ms 46852 KB Output is correct
33 Correct 76 ms 82948 KB Output is correct
34 Correct 327 ms 220524 KB Output is correct
35 Correct 22 ms 42320 KB Output is correct
36 Correct 87 ms 81780 KB Output is correct
37 Correct 168 ms 124728 KB Output is correct
38 Correct 396 ms 110888 KB Output is correct
39 Correct 646 ms 138268 KB Output is correct
40 Correct 749 ms 167456 KB Output is correct
41 Correct 993 ms 197928 KB Output is correct
42 Correct 1159 ms 225084 KB Output is correct
43 Correct 7 ms 33372 KB Output is correct
44 Correct 7 ms 33412 KB Output is correct
45 Correct 7 ms 33372 KB Output is correct
46 Correct 7 ms 33372 KB Output is correct
47 Correct 7 ms 33392 KB Output is correct
48 Correct 7 ms 33372 KB Output is correct
49 Correct 7 ms 33368 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 33372 KB Output is correct
53 Correct 7 ms 33424 KB Output is correct
54 Correct 12 ms 35164 KB Output is correct
55 Correct 12 ms 36188 KB Output is correct
56 Correct 270 ms 132572 KB Output is correct
57 Correct 431 ms 177768 KB Output is correct
58 Correct 408 ms 175444 KB Output is correct
59 Correct 7 ms 33368 KB Output is correct
60 Correct 7 ms 33372 KB Output is correct
61 Correct 7 ms 33372 KB Output is correct
62 Correct 569 ms 244176 KB Output is correct
63 Correct 562 ms 244204 KB Output is correct
64 Correct 573 ms 243916 KB Output is correct
65 Correct 14 ms 36956 KB Output is correct
66 Correct 21 ms 40540 KB Output is correct
67 Correct 307 ms 130692 KB Output is correct
68 Correct 471 ms 179840 KB Output is correct
69 Correct 671 ms 227828 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 29124 KB Output is correct
2 Correct 7 ms 33372 KB Output is correct
3 Correct 7 ms 33372 KB Output is correct
4 Correct 7 ms 33368 KB Output is correct
5 Correct 7 ms 33368 KB Output is correct
6 Correct 8 ms 33372 KB Output is correct
7 Correct 8 ms 33372 KB Output is correct
8 Correct 8 ms 33368 KB Output is correct
9 Correct 267 ms 139796 KB Output is correct
10 Correct 27 ms 43604 KB Output is correct
11 Correct 134 ms 90400 KB Output is correct
12 Correct 38 ms 49180 KB Output is correct
13 Correct 88 ms 78992 KB Output is correct
14 Correct 10 ms 34652 KB Output is correct
15 Correct 10 ms 35160 KB Output is correct
16 Correct 264 ms 139752 KB Output is correct
17 Correct 481 ms 244680 KB Output is correct
18 Correct 527 ms 245036 KB Output is correct
19 Correct 435 ms 224420 KB Output is correct
20 Correct 531 ms 223748 KB Output is correct
21 Correct 500 ms 215440 KB Output is correct
22 Correct 7 ms 33372 KB Output is correct
23 Correct 99 ms 63164 KB Output is correct
24 Correct 40 ms 51724 KB Output is correct
25 Correct 120 ms 100372 KB Output is correct
26 Correct 203 ms 145000 KB Output is correct
27 Correct 428 ms 132092 KB Output is correct
28 Correct 568 ms 154556 KB Output is correct
29 Correct 770 ms 180548 KB Output is correct
30 Correct 857 ms 203708 KB Output is correct
31 Correct 1012 ms 228056 KB Output is correct
32 Correct 630 ms 230652 KB Output is correct
33 Correct 623 ms 244168 KB Output is correct
34 Correct 17 ms 37976 KB Output is correct
35 Correct 23 ms 41576 KB Output is correct
36 Correct 344 ms 129472 KB Output is correct
37 Correct 518 ms 180960 KB Output is correct
38 Correct 713 ms 228416 KB Output is correct

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 29124 KB Output is correct
2 Correct 7 ms 33372 KB Output is correct
3 Correct 7 ms 33372 KB Output is correct
4 Correct 7 ms 33368 KB Output is correct
5 Correct 7 ms 33368 KB Output is correct
6 Correct 8 ms 33372 KB Output is correct
7 Correct 8 ms 33372 KB Output is correct
8 Correct 8 ms 33368 KB Output is correct
9 Correct 267 ms 139796 KB Output is correct
10 Correct 27 ms 43604 KB Output is correct
11 Correct 134 ms 90400 KB Output is correct
12 Correct 38 ms 49180 KB Output is correct
13 Correct 88 ms 78992 KB Output is correct
14 Correct 10 ms 34652 KB Output is correct
15 Correct 10 ms 35160 KB Output is correct
16 Correct 264 ms 139752 KB Output is correct
17 Correct 8 ms 33368 KB Output is correct
18 Correct 8 ms 33220 KB Output is correct
19 Correct 7 ms 33400 KB Output is correct
20 Correct 7 ms 33372 KB Output is correct
21 Correct 7 ms 33372 KB Output is correct
22 Correct 7 ms 33372 KB Output is correct
23 Correct 529 ms 215408 KB Output is correct
24 Correct 7 ms 33368 KB Output is correct
25 Correct 9 ms 34396 KB Output is correct
26 Correct 11 ms 35936 KB Output is correct
27 Correct 13 ms 36700 KB Output is correct
28 Correct 184 ms 106020 KB Output is correct
29 Correct 290 ms 143092 KB Output is correct
30 Correct 439 ms 178616 KB Output is correct
31 Correct 563 ms 215928 KB Output is correct
32 Correct 7 ms 33376 KB Output is correct
33 Correct 7 ms 33376 KB Output is correct
34 Correct 7 ms 33396 KB Output is correct
35 Correct 7 ms 33368 KB Output is correct
36 Correct 7 ms 33372 KB Output is correct
37 Correct 7 ms 33404 KB Output is correct
38 Correct 7 ms 33404 KB Output is correct
39 Correct 7 ms 33372 KB Output is correct
40 Correct 7 ms 33372 KB Output is correct
41 Correct 7 ms 33204 KB Output is correct
42 Correct 8 ms 33368 KB Output is correct
43 Correct 11 ms 35164 KB Output is correct
44 Correct 13 ms 36164 KB Output is correct
45 Correct 271 ms 131112 KB Output is correct
46 Correct 417 ms 176148 KB Output is correct
47 Correct 438 ms 175852 KB Output is correct
48 Correct 7 ms 33372 KB Output is correct
49 Correct 8 ms 33372 KB Output is correct
50 Correct 6 ms 33624 KB Output is correct
51 Correct 8 ms 33400 KB Output is correct
52 Correct 7 ms 33376 KB Output is correct
53 Correct 7 ms 33380 KB Output is correct
54 Correct 7 ms 33380 KB Output is correct
55 Correct 544 ms 215600 KB Output is correct
56 Correct 8 ms 33368 KB Output is correct
57 Correct 12 ms 34908 KB Output is correct
58 Correct 18 ms 38744 KB Output is correct
59 Correct 23 ms 41816 KB Output is correct
60 Correct 250 ms 127512 KB Output is correct
61 Correct 339 ms 156136 KB Output is correct
62 Correct 451 ms 184056 KB Output is correct
63 Correct 524 ms 216020 KB Output is correct
64 Correct 7 ms 33368 KB Output is correct
65 Correct 8 ms 33368 KB Output is correct
66 Correct 7 ms 33372 KB Output is correct
67 Correct 558 ms 243980 KB Output is correct
68 Correct 596 ms 243356 KB Output is correct
69 Correct 545 ms 243104 KB Output is correct
70 Correct 13 ms 36956 KB Output is correct
71 Correct 21 ms 40540 KB Output is correct
72 Correct 312 ms 129776 KB Output is correct
73 Correct 487 ms 180612 KB Output is correct
74 Correct 740 ms 227148 KB Output is correct
75 Correct 648 ms 228992 KB Output is correct
76 Correct 585 ms 243512 KB Output is correct
77 Correct 18 ms 37800 KB Output is correct
78 Correct 25 ms 41480 KB Output is correct
79 Correct 320 ms 130088 KB Output is correct
80 Correct 499 ms 180116 KB Output is correct
81 Correct 698 ms 228968 KB Output is correct
82 Correct 7 ms 33372 KB Output is correct
83 Correct 7 ms 33372 KB Output is correct
84 Correct 7 ms 33372 KB Output is correct
85 Correct 392 ms 219124 KB Output is correct
86 Correct 365 ms 218720 KB Output is correct
87 Correct 416 ms 220180 KB Output is correct
88 Correct 375 ms 213692 KB Output is correct
89 Correct 183 ms 132228 KB Output is correct
90 Correct 404 ms 237120 KB Output is correct
91 Correct 374 ms 236964 KB Output is correct
92 Correct 492 ms 244852 KB Output is correct
93 Correct 495 ms 245144 KB Output is correct
94 Correct 511 ms 243888 KB Output is correct
95 Correct 485 ms 245180 KB Output is correct
96 Correct 7 ms 33372 KB Output is correct
97 Correct 47 ms 46852 KB Output is correct
98 Correct 76 ms 82948 KB Output is correct
99 Correct 327 ms 220524 KB Output is correct
100 Correct 22 ms 42320 KB Output is correct
101 Correct 87 ms 81780 KB Output is correct
102 Correct 168 ms 124728 KB Output is correct
103 Correct 396 ms 110888 KB Output is correct
104 Correct 646 ms 138268 KB Output is correct
105 Correct 749 ms 167456 KB Output is correct
106 Correct 993 ms 197928 KB Output is correct
107 Correct 1159 ms 225084 KB Output is correct
108 Correct 7 ms 33372 KB Output is correct
109 Correct 7 ms 33412 KB Output is correct
110 Correct 7 ms 33372 KB Output is correct
111 Correct 7 ms 33372 KB Output is correct
112 Correct 7 ms 33392 KB Output is correct
113 Correct 7 ms 33372 KB Output is correct
114 Correct 7 ms 33368 KB Output is correct
115 Correct 7 ms 33372 KB Output is correct
116 Correct 7 ms 33372 KB Output is correct
117 Correct 8 ms 33372 KB Output is correct
118 Correct 7 ms 33424 KB Output is correct
119 Correct 12 ms 35164 KB Output is correct
120 Correct 12 ms 36188 KB Output is correct
121 Correct 270 ms 132572 KB Output is correct
122 Correct 431 ms 177768 KB Output is correct
123 Correct 408 ms 175444 KB Output is correct
124 Correct 7 ms 33368 KB Output is correct
125 Correct 7 ms 33372 KB Output is correct
126 Correct 7 ms 33372 KB Output is correct
127 Correct 569 ms 244176 KB Output is correct
128 Correct 562 ms 244204 KB Output is correct
129 Correct 573 ms 243916 KB Output is correct
130 Correct 14 ms 36956 KB Output is correct
131 Correct 21 ms 40540 KB Output is correct
132 Correct 307 ms 130692 KB Output is correct
133 Correct 471 ms 179840 KB Output is correct
134 Correct 671 ms 227828 KB Output is correct
135 Correct 481 ms 244680 KB Output is correct
136 Correct 527 ms 245036 KB Output is correct
137 Correct 435 ms 224420 KB Output is correct
138 Correct 531 ms 223748 KB Output is correct
139 Correct 500 ms 215440 KB Output is correct
140 Correct 7 ms 33372 KB Output is correct
141 Correct 99 ms 63164 KB Output is correct
142 Correct 40 ms 51724 KB Output is correct
143 Correct 120 ms 100372 KB Output is correct
144 Correct 203 ms 145000 KB Output is correct
145 Correct 428 ms 132092 KB Output is correct
146 Correct 568 ms 154556 KB Output is correct
147 Correct 770 ms 180548 KB Output is correct
148 Correct 857 ms 203708 KB Output is correct
149 Correct 1012 ms 228056 KB Output is correct
150 Correct 630 ms 230652 KB Output is correct
151 Correct 623 ms 244168 KB Output is correct
152 Correct 17 ms 37976 KB Output is correct
153 Correct 23 ms 41576 KB Output is correct
154 Correct 344 ms 129472 KB Output is correct
155 Correct 518 ms 180960 KB Output is correct
156 Correct 713 ms 228416 KB Output is correct
157 Correct 7 ms 33372 KB Output is correct
158 Correct 7 ms 33368 KB Output is correct
159 Correct 8 ms 33372 KB Output is correct
160 Correct 8 ms 33424 KB Output is correct
161 Correct 475 ms 221152 KB Output is correct
162 Correct 361 ms 220660 KB Output is correct
163 Correct 426 ms 220116 KB Output is correct
164 Correct 429 ms 220020 KB Output is correct
165 Correct 481 ms 219380 KB Output is correct
166 Correct 515 ms 219668 KB Output is correct
167 Execution timed out 3563 ms 77168 KB Time limit exceeded
168 Halted 0 ms 0 KB -