oj.uz

Submission #443487

# Submission time Handle Problem Language Result Execution time Memory
443487 2021-07-10T15:11:59 Z leinad2 Fountain Parks (IOI21_parks) C++17
70 / 100
 503 ms 74760 KB 
#include "parks.h"
#include<bits/stdc++.h>
using namespace std;
int par[400010], chk[400010], chk2[400010], A[400010][2], vis[400010];
int Find(int v){return v==par[v]?v:par[v]=Find(par[v]);}
vector<pair<int, int> >v;
int cnt;
map<pair<int, int>, int>mp;
vector<pair<int, int> >adj[400010];
vector<int>_u, _v, _a, _b;
void dfs(int v)
{
    for(int i=0;i<adj[v].size();i++)
    {
        int p=adj[v][i].first;
        if(!vis[p])vis[p]=1,dfs(p),_a[adj[v][i].second]=p;
    }
}
int construct_roads(vector<int>x, vector<int>y)
{
    int n, i, j, k, a, b;
    n=x.size();
    vector<pair<pair<int, int>, int> >V;
    for(i=0;i<n;i++)
    {
        V.push_back({{x[i], y[i]}, i});
    }
    sort(V.begin(), V.end());
    for(i=1;i<V.size();i++)
    {
        if(V[i].first.first==V[i-1].first.first&&V[i].first.second==V[i-1].first.second+2)
        {
            v.push_back({V[i].second, V[i-1].second});
        }
    }
    for(i=0;i<n;i++)
    {
        swap(V[i].first.first, V[i].first.second);
    }
    sort(V.begin(), V.end());
    for(i=1;i<V.size();i++)
    {
        if(V[i].first.first==V[i-1].first.first&&V[i].first.second==V[i-1].first.second+2)
        {
            v.push_back({V[i].second, V[i-1].second});
        }
    }
    for(int rng=0;rng<1;rng++)
    {
        for(i=0;i<n;i++)par[i]=i;
        _u.clear();_v.clear();_a.clear();_b.clear();cnt=0;mp.clear();for(i=1;i<=2*n;i++)vis[i]=chk[i]=chk2[i]=0,adj[i].clear();
        for(i=0;i<v.size();i++)
        {
            if(Find(v[i].first)!=Find(v[i].second))
            {
                _u.push_back(v[i].first);
                _v.push_back(v[i].second);
                par[Find(v[i].first)]=Find(v[i].second);
            }
        }
        if(_u.size()!=n-1)return 0;
        vector<pair<int, int> >edge;
        _a.resize(n-1);_b.resize(n-1);
        for(i=0;i<_u.size();i++)
        {
            int a=_u[i], b=_v[i], q, w, e, r;
            if(x[a]==x[b])
            {
                q=x[a]-1;e=x[a]+1;
                w=r=(y[a]+y[b])/2;
            }
            else
            {
                w=y[a]-1;r=y[a]+1;
                q=e=(x[a]+x[b])/2;
            }
            if(mp.find({q, w})==mp.end())mp[{q, w}]=++cnt,A[cnt][0]=q,A[cnt][1]=w;
            if(mp.find({e, r})==mp.end())mp[{e, r}]=++cnt,A[cnt][0]=e,A[cnt][1]=r;
            int x=mp[{q, w}];int y=mp[{e, r}];
            edge.push_back({x, y});
        }
        for(i=0;i++<cnt;)par[i]=i;
        for(i=0;i<edge.size();i++)par[Find(edge[i].first)]=Find(edge[i].second);
        for(i=0;i++<cnt;)chk[Find(i)]++;
        for(i=0;i<edge.size();i++)chk2[Find(edge[i].first)]++;
        for(i=0;i<edge.size();i++)
        {
            adj[edge[i].first].push_back({edge[i].second, i});
            adj[edge[i].second].push_back({edge[i].first, i});
        }
        bool flag=true;
        for(i=0;i++<cnt;)
        {
            if(chk[i])
            {
                if(chk[i]<chk2[i]){flag=false;break;}
                else vis[i]=1,dfs(i);
            }
        }
        if(!flag)continue;
        for(i=0;i<_a.size();i++)
        {
            if(_a[i]==0)_a[i]=Find(edge[i].first);
            int a=_a[i];
            _a[i]=A[a][0];_b[i]=A[a][1];
        }
        build(_u, _v, _a, _b);
        return 1;
    }
    return 0;
}

Compilation message

parks.cpp: In function 'void dfs(int)':
parks.cpp:13:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   13 |     for(int i=0;i<adj[v].size();i++)
      |                 ~^~~~~~~~~~~~~~
parks.cpp: In function 'int construct_roads(std::vector<int>, std::vector<int>)':
parks.cpp:29:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<std::pair<int, int>, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   29 |     for(i=1;i<V.size();i++)
      |             ~^~~~~~~~~
parks.cpp:41:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<std::pair<int, int>, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   41 |     for(i=1;i<V.size();i++)
      |             ~^~~~~~~~~
parks.cpp:52:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   52 |         for(i=0;i<v.size();i++)
      |                 ~^~~~~~~~~
parks.cpp:61:21: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   61 |         if(_u.size()!=n-1)return 0;
      |            ~~~~~~~~~^~~~~
parks.cpp:64:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   64 |         for(i=0;i<_u.size();i++)
      |                 ~^~~~~~~~~~
parks.cpp:83:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   83 |         for(i=0;i<edge.size();i++)par[Find(edge[i].first)]=Find(edge[i].second);
      |                 ~^~~~~~~~~~~~
parks.cpp:85:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   85 |         for(i=0;i<edge.size();i++)chk2[Find(edge[i].first)]++;
      |                 ~^~~~~~~~~~~~
parks.cpp:86:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   86 |         for(i=0;i<edge.size();i++)
      |                 ~^~~~~~~~~~~~
parks.cpp:101:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  101 |         for(i=0;i<_a.size();i++)
      |                 ~^~~~~~~~~~
parks.cpp:21:15: warning: unused variable 'j' [-Wunused-variable]
   21 |     int n, i, j, k, a, b;
      |               ^
parks.cpp:21:18: warning: unused variable 'k' [-Wunused-variable]
   21 |     int n, i, j, k, a, b;
      |                  ^
parks.cpp:21:21: warning: unused variable 'a' [-Wunused-variable]
   21 |     int n, i, j, k, a, b;
      |                     ^
parks.cpp:21:24: warning: unused variable 'b' [-Wunused-variable]
   21 |     int n, i, j, k, a, b;
      |                        ^

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 9676 KB Output is correct
2 Correct 6 ms 9676 KB Output is correct
3 Correct 6 ms 9676 KB Output is correct
4 Correct 6 ms 9676 KB Output is correct
5 Correct 6 ms 9676 KB Output is correct
6 Correct 7 ms 9676 KB Output is correct
7 Correct 6 ms 9676 KB Output is correct
8 Correct 6 ms 9676 KB Output is correct
9 Correct 233 ms 42208 KB Output is correct
10 Correct 24 ms 12944 KB Output is correct
11 Correct 115 ms 27308 KB Output is correct
12 Correct 34 ms 14580 KB Output is correct
13 Correct 21 ms 13128 KB Output is correct
14 Correct 7 ms 9676 KB Output is correct
15 Correct 7 ms 9804 KB Output is correct
16 Correct 229 ms 42316 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 9676 KB Output is correct
2 Correct 6 ms 9676 KB Output is correct
3 Correct 6 ms 9676 KB Output is correct
4 Correct 6 ms 9676 KB Output is correct
5 Correct 6 ms 9676 KB Output is correct
6 Correct 7 ms 9676 KB Output is correct
7 Correct 6 ms 9676 KB Output is correct
8 Correct 6 ms 9676 KB Output is correct
9 Correct 233 ms 42208 KB Output is correct
10 Correct 24 ms 12944 KB Output is correct
11 Correct 115 ms 27308 KB Output is correct
12 Correct 34 ms 14580 KB Output is correct
13 Correct 21 ms 13128 KB Output is correct
14 Correct 7 ms 9676 KB Output is correct
15 Correct 7 ms 9804 KB Output is correct
16 Correct 229 ms 42316 KB Output is correct
17 Correct 6 ms 9676 KB Output is correct
18 Correct 6 ms 9676 KB Output is correct
19 Correct 6 ms 9676 KB Output is correct
20 Correct 6 ms 9676 KB Output is correct
21 Correct 6 ms 9676 KB Output is correct
22 Correct 6 ms 9676 KB Output is correct
23 Correct 438 ms 65212 KB Output is correct
24 Correct 6 ms 9632 KB Output is correct
25 Correct 8 ms 10060 KB Output is correct
26 Correct 7 ms 9932 KB Output is correct
27 Correct 9 ms 10060 KB Output is correct
28 Correct 166 ms 31972 KB Output is correct
29 Correct 259 ms 43012 KB Output is correct
30 Correct 355 ms 53920 KB Output is correct
31 Correct 440 ms 65204 KB Output is correct
32 Correct 6 ms 9676 KB Output is correct
33 Correct 6 ms 9676 KB Output is correct
34 Correct 6 ms 9676 KB Output is correct
35 Correct 6 ms 9676 KB Output is correct
36 Correct 6 ms 9676 KB Output is correct
37 Correct 6 ms 9676 KB Output is correct
38 Correct 6 ms 9692 KB Output is correct
39 Correct 6 ms 9676 KB Output is correct
40 Correct 6 ms 9676 KB Output is correct
41 Correct 6 ms 9676 KB Output is correct
42 Correct 6 ms 9676 KB Output is correct
43 Correct 8 ms 9780 KB Output is correct
44 Correct 7 ms 9932 KB Output is correct
45 Correct 205 ms 35764 KB Output is correct
46 Correct 298 ms 47412 KB Output is correct
47 Correct 302 ms 47412 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 9676 KB Output is correct
2 Correct 6 ms 9676 KB Output is correct
3 Correct 6 ms 9676 KB Output is correct
4 Correct 6 ms 9676 KB Output is correct
5 Correct 6 ms 9676 KB Output is correct
6 Correct 7 ms 9676 KB Output is correct
7 Correct 6 ms 9676 KB Output is correct
8 Correct 6 ms 9676 KB Output is correct
9 Correct 233 ms 42208 KB Output is correct
10 Correct 24 ms 12944 KB Output is correct
11 Correct 115 ms 27308 KB Output is correct
12 Correct 34 ms 14580 KB Output is correct
13 Correct 21 ms 13128 KB Output is correct
14 Correct 7 ms 9676 KB Output is correct
15 Correct 7 ms 9804 KB Output is correct
16 Correct 229 ms 42316 KB Output is correct
17 Correct 6 ms 9676 KB Output is correct
18 Correct 6 ms 9676 KB Output is correct
19 Correct 6 ms 9676 KB Output is correct
20 Correct 6 ms 9676 KB Output is correct
21 Correct 6 ms 9676 KB Output is correct
22 Correct 6 ms 9676 KB Output is correct
23 Correct 438 ms 65212 KB Output is correct
24 Correct 6 ms 9632 KB Output is correct
25 Correct 8 ms 10060 KB Output is correct
26 Correct 7 ms 9932 KB Output is correct
27 Correct 9 ms 10060 KB Output is correct
28 Correct 166 ms 31972 KB Output is correct
29 Correct 259 ms 43012 KB Output is correct
30 Correct 355 ms 53920 KB Output is correct
31 Correct 440 ms 65204 KB Output is correct
32 Correct 6 ms 9676 KB Output is correct
33 Correct 6 ms 9676 KB Output is correct
34 Correct 6 ms 9676 KB Output is correct
35 Correct 6 ms 9676 KB Output is correct
36 Correct 6 ms 9676 KB Output is correct
37 Correct 6 ms 9676 KB Output is correct
38 Correct 6 ms 9692 KB Output is correct
39 Correct 6 ms 9676 KB Output is correct
40 Correct 6 ms 9676 KB Output is correct
41 Correct 6 ms 9676 KB Output is correct
42 Correct 6 ms 9676 KB Output is correct
43 Correct 8 ms 9780 KB Output is correct
44 Correct 7 ms 9932 KB Output is correct
45 Correct 205 ms 35764 KB Output is correct
46 Correct 298 ms 47412 KB Output is correct
47 Correct 302 ms 47412 KB Output is correct
48 Correct 6 ms 9676 KB Output is correct
49 Correct 6 ms 9628 KB Output is correct
50 Correct 6 ms 9676 KB Output is correct
51 Correct 6 ms 9676 KB Output is correct
52 Correct 6 ms 9676 KB Output is correct
53 Correct 6 ms 9676 KB Output is correct
54 Correct 6 ms 9676 KB Output is correct
55 Correct 399 ms 61976 KB Output is correct
56 Correct 6 ms 9676 KB Output is correct
57 Correct 9 ms 10188 KB Output is correct
58 Correct 16 ms 11340 KB Output is correct
59 Correct 11 ms 10508 KB Output is correct
60 Correct 197 ms 35792 KB Output is correct
61 Correct 266 ms 44920 KB Output is correct
62 Correct 334 ms 52972 KB Output is correct
63 Correct 406 ms 62076 KB Output is correct
64 Correct 6 ms 9676 KB Output is correct
65 Correct 6 ms 9692 KB Output is correct
66 Correct 6 ms 9676 KB Output is correct
67 Correct 479 ms 74676 KB Output is correct
68 Correct 488 ms 74760 KB Output is correct
69 Correct 493 ms 74424 KB Output is correct
70 Correct 8 ms 9932 KB Output is correct
71 Correct 10 ms 10188 KB Output is correct
72 Correct 201 ms 35196 KB Output is correct
73 Correct 300 ms 47816 KB Output is correct
74 Correct 408 ms 60484 KB Output is correct
75 Correct 434 ms 66528 KB Output is correct
76 Correct 494 ms 74676 KB Output is correct
77 Correct 8 ms 10060 KB Output is correct
78 Correct 10 ms 10436 KB Output is correct
79 Correct 198 ms 36296 KB Output is correct
80 Correct 310 ms 49632 KB Output is correct
81 Correct 415 ms 62776 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 9676 KB Output is correct
2 Correct 6 ms 9676 KB Output is correct
3 Correct 6 ms 9676 KB Output is correct
4 Correct 6 ms 9676 KB Output is correct
5 Correct 6 ms 9676 KB Output is correct
6 Correct 7 ms 9676 KB Output is correct
7 Correct 6 ms 9676 KB Output is correct
8 Correct 6 ms 9676 KB Output is correct
9 Correct 233 ms 42208 KB Output is correct
10 Correct 24 ms 12944 KB Output is correct
11 Correct 115 ms 27308 KB Output is correct
12 Correct 34 ms 14580 KB Output is correct
13 Correct 21 ms 13128 KB Output is correct
14 Correct 7 ms 9676 KB Output is correct
15 Correct 7 ms 9804 KB Output is correct
16 Correct 229 ms 42316 KB Output is correct
17 Correct 6 ms 9644 KB Output is correct
18 Correct 7 ms 9676 KB Output is correct
19 Correct 6 ms 9676 KB Output is correct
20 Correct 344 ms 62864 KB Output is correct
21 Correct 375 ms 58296 KB Output is correct
22 Correct 354 ms 58164 KB Output is correct
23 Correct 350 ms 64948 KB Output is correct
24 Correct 100 ms 20680 KB Output is correct
25 Correct 110 ms 25076 KB Output is correct
26 Correct 105 ms 25072 KB Output is correct
27 Correct 401 ms 74480 KB Output is correct
28 Correct 405 ms 74584 KB Output is correct
29 Correct 418 ms 74504 KB Output is correct
30 Correct 413 ms 74680 KB Output is correct
31 Correct 6 ms 9676 KB Output is correct
32 Correct 32 ms 13204 KB Output is correct
33 Correct 46 ms 15264 KB Output is correct
34 Correct 346 ms 62992 KB Output is correct
35 Correct 11 ms 10512 KB Output is correct
36 Correct 39 ms 13496 KB Output is correct
37 Correct 75 ms 17124 KB Output is correct
38 Correct 175 ms 29008 KB Output is correct
39 Correct 259 ms 36000 KB Output is correct
40 Correct 339 ms 43292 KB Output is correct
41 Correct 398 ms 50360 KB Output is correct
42 Correct 498 ms 57460 KB Output is correct
43 Correct 7 ms 9676 KB Output is correct
44 Correct 7 ms 9732 KB Output is correct
45 Correct 7 ms 9676 KB Output is correct
46 Correct 7 ms 9608 KB Output is correct
47 Correct 7 ms 9676 KB Output is correct
48 Correct 6 ms 9724 KB Output is correct
49 Correct 7 ms 9676 KB Output is correct
50 Correct 7 ms 9624 KB Output is correct
51 Correct 6 ms 9676 KB Output is correct
52 Correct 7 ms 9676 KB Output is correct
53 Correct 6 ms 9664 KB Output is correct
54 Correct 7 ms 9804 KB Output is correct
55 Correct 8 ms 9948 KB Output is correct
56 Correct 218 ms 35704 KB Output is correct
57 Correct 303 ms 47336 KB Output is correct
58 Correct 324 ms 47364 KB Output is correct
59 Correct 6 ms 9676 KB Output is correct
60 Correct 6 ms 9684 KB Output is correct
61 Correct 6 ms 9676 KB Output is correct
62 Correct 503 ms 74588 KB Output is correct
63 Correct 482 ms 74580 KB Output is correct
64 Correct 482 ms 74352 KB Output is correct
65 Correct 8 ms 9932 KB Output is correct
66 Correct 10 ms 10188 KB Output is correct
67 Correct 205 ms 35188 KB Output is correct
68 Correct 302 ms 47796 KB Output is correct
69 Correct 411 ms 60524 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 9676 KB Output is correct
2 Correct 6 ms 9676 KB Output is correct
3 Correct 6 ms 9676 KB Output is correct
4 Correct 6 ms 9676 KB Output is correct
5 Correct 6 ms 9676 KB Output is correct
6 Correct 7 ms 9676 KB Output is correct
7 Correct 6 ms 9676 KB Output is correct
8 Correct 6 ms 9676 KB Output is correct
9 Correct 233 ms 42208 KB Output is correct
10 Correct 24 ms 12944 KB Output is correct
11 Correct 115 ms 27308 KB Output is correct
12 Correct 34 ms 14580 KB Output is correct
13 Correct 21 ms 13128 KB Output is correct
14 Correct 7 ms 9676 KB Output is correct
15 Correct 7 ms 9804 KB Output is correct
16 Correct 229 ms 42316 KB Output is correct
17 Correct 456 ms 74576 KB Output is correct
18 Correct 439 ms 74576 KB Output is correct
19 Correct 369 ms 62844 KB Output is correct
20 Correct 377 ms 60088 KB Output is correct
21 Correct 373 ms 62892 KB Output is correct
22 Correct 6 ms 9676 KB Output is correct
23 Correct 68 ms 17868 KB Output is correct
24 Correct 17 ms 11252 KB Output is correct
25 Correct 44 ms 15236 KB Output is correct
26 Correct 73 ms 18692 KB Output is correct
27 Correct 224 ms 34920 KB Output is correct
28 Correct 289 ms 42192 KB Output is correct
29 Correct 342 ms 47420 KB Output is correct
30 Correct 408 ms 53684 KB Output is correct
31 Correct 470 ms 60008 KB Output is correct
32 Correct 465 ms 66540 KB Output is correct
33 Correct 503 ms 74556 KB Output is correct
34 Correct 8 ms 10060 KB Output is correct
35 Correct 10 ms 10384 KB Output is correct
36 Correct 203 ms 36296 KB Output is correct
37 Correct 307 ms 49544 KB Output is correct
38 Correct 416 ms 62676 KB Output is correct

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 9676 KB Output is correct
2 Correct 6 ms 9676 KB Output is correct
3 Correct 6 ms 9676 KB Output is correct
4 Correct 6 ms 9676 KB Output is correct
5 Correct 6 ms 9676 KB Output is correct
6 Correct 7 ms 9676 KB Output is correct
7 Correct 6 ms 9676 KB Output is correct
8 Correct 6 ms 9676 KB Output is correct
9 Correct 233 ms 42208 KB Output is correct
10 Correct 24 ms 12944 KB Output is correct
11 Correct 115 ms 27308 KB Output is correct
12 Correct 34 ms 14580 KB Output is correct
13 Correct 21 ms 13128 KB Output is correct
14 Correct 7 ms 9676 KB Output is correct
15 Correct 7 ms 9804 KB Output is correct
16 Correct 229 ms 42316 KB Output is correct
17 Correct 6 ms 9676 KB Output is correct
18 Correct 6 ms 9676 KB Output is correct
19 Correct 6 ms 9676 KB Output is correct
20 Correct 6 ms 9676 KB Output is correct
21 Correct 6 ms 9676 KB Output is correct
22 Correct 6 ms 9676 KB Output is correct
23 Correct 438 ms 65212 KB Output is correct
24 Correct 6 ms 9632 KB Output is correct
25 Correct 8 ms 10060 KB Output is correct
26 Correct 7 ms 9932 KB Output is correct
27 Correct 9 ms 10060 KB Output is correct
28 Correct 166 ms 31972 KB Output is correct
29 Correct 259 ms 43012 KB Output is correct
30 Correct 355 ms 53920 KB Output is correct
31 Correct 440 ms 65204 KB Output is correct
32 Correct 6 ms 9676 KB Output is correct
33 Correct 6 ms 9676 KB Output is correct
34 Correct 6 ms 9676 KB Output is correct
35 Correct 6 ms 9676 KB Output is correct
36 Correct 6 ms 9676 KB Output is correct
37 Correct 6 ms 9676 KB Output is correct
38 Correct 6 ms 9692 KB Output is correct
39 Correct 6 ms 9676 KB Output is correct
40 Correct 6 ms 9676 KB Output is correct
41 Correct 6 ms 9676 KB Output is correct
42 Correct 6 ms 9676 KB Output is correct
43 Correct 8 ms 9780 KB Output is correct
44 Correct 7 ms 9932 KB Output is correct
45 Correct 205 ms 35764 KB Output is correct
46 Correct 298 ms 47412 KB Output is correct
47 Correct 302 ms 47412 KB Output is correct
48 Correct 6 ms 9676 KB Output is correct
49 Correct 6 ms 9628 KB Output is correct
50 Correct 6 ms 9676 KB Output is correct
51 Correct 6 ms 9676 KB Output is correct
52 Correct 6 ms 9676 KB Output is correct
53 Correct 6 ms 9676 KB Output is correct
54 Correct 6 ms 9676 KB Output is correct
55 Correct 399 ms 61976 KB Output is correct
56 Correct 6 ms 9676 KB Output is correct
57 Correct 9 ms 10188 KB Output is correct
58 Correct 16 ms 11340 KB Output is correct
59 Correct 11 ms 10508 KB Output is correct
60 Correct 197 ms 35792 KB Output is correct
61 Correct 266 ms 44920 KB Output is correct
62 Correct 334 ms 52972 KB Output is correct
63 Correct 406 ms 62076 KB Output is correct
64 Correct 6 ms 9676 KB Output is correct
65 Correct 6 ms 9692 KB Output is correct
66 Correct 6 ms 9676 KB Output is correct
67 Correct 479 ms 74676 KB Output is correct
68 Correct 488 ms 74760 KB Output is correct
69 Correct 493 ms 74424 KB Output is correct
70 Correct 8 ms 9932 KB Output is correct
71 Correct 10 ms 10188 KB Output is correct
72 Correct 201 ms 35196 KB Output is correct
73 Correct 300 ms 47816 KB Output is correct
74 Correct 408 ms 60484 KB Output is correct
75 Correct 434 ms 66528 KB Output is correct
76 Correct 494 ms 74676 KB Output is correct
77 Correct 8 ms 10060 KB Output is correct
78 Correct 10 ms 10436 KB Output is correct
79 Correct 198 ms 36296 KB Output is correct
80 Correct 310 ms 49632 KB Output is correct
81 Correct 415 ms 62776 KB Output is correct
82 Correct 6 ms 9644 KB Output is correct
83 Correct 7 ms 9676 KB Output is correct
84 Correct 6 ms 9676 KB Output is correct
85 Correct 344 ms 62864 KB Output is correct
86 Correct 375 ms 58296 KB Output is correct
87 Correct 354 ms 58164 KB Output is correct
88 Correct 350 ms 64948 KB Output is correct
89 Correct 100 ms 20680 KB Output is correct
90 Correct 110 ms 25076 KB Output is correct
91 Correct 105 ms 25072 KB Output is correct
92 Correct 401 ms 74480 KB Output is correct
93 Correct 405 ms 74584 KB Output is correct
94 Correct 418 ms 74504 KB Output is correct
95 Correct 413 ms 74680 KB Output is correct
96 Correct 6 ms 9676 KB Output is correct
97 Correct 32 ms 13204 KB Output is correct
98 Correct 46 ms 15264 KB Output is correct
99 Correct 346 ms 62992 KB Output is correct
100 Correct 11 ms 10512 KB Output is correct
101 Correct 39 ms 13496 KB Output is correct
102 Correct 75 ms 17124 KB Output is correct
103 Correct 175 ms 29008 KB Output is correct
104 Correct 259 ms 36000 KB Output is correct
105 Correct 339 ms 43292 KB Output is correct
106 Correct 398 ms 50360 KB Output is correct
107 Correct 498 ms 57460 KB Output is correct
108 Correct 7 ms 9676 KB Output is correct
109 Correct 7 ms 9732 KB Output is correct
110 Correct 7 ms 9676 KB Output is correct
111 Correct 7 ms 9608 KB Output is correct
112 Correct 7 ms 9676 KB Output is correct
113 Correct 6 ms 9724 KB Output is correct
114 Correct 7 ms 9676 KB Output is correct
115 Correct 7 ms 9624 KB Output is correct
116 Correct 6 ms 9676 KB Output is correct
117 Correct 7 ms 9676 KB Output is correct
118 Correct 6 ms 9664 KB Output is correct
119 Correct 7 ms 9804 KB Output is correct
120 Correct 8 ms 9948 KB Output is correct
121 Correct 218 ms 35704 KB Output is correct
122 Correct 303 ms 47336 KB Output is correct
123 Correct 324 ms 47364 KB Output is correct
124 Correct 6 ms 9676 KB Output is correct
125 Correct 6 ms 9684 KB Output is correct
126 Correct 6 ms 9676 KB Output is correct
127 Correct 503 ms 74588 KB Output is correct
128 Correct 482 ms 74580 KB Output is correct
129 Correct 482 ms 74352 KB Output is correct
130 Correct 8 ms 9932 KB Output is correct
131 Correct 10 ms 10188 KB Output is correct
132 Correct 205 ms 35188 KB Output is correct
133 Correct 302 ms 47796 KB Output is correct
134 Correct 411 ms 60524 KB Output is correct
135 Correct 456 ms 74576 KB Output is correct
136 Correct 439 ms 74576 KB Output is correct
137 Correct 369 ms 62844 KB Output is correct
138 Correct 377 ms 60088 KB Output is correct
139 Correct 373 ms 62892 KB Output is correct
140 Correct 6 ms 9676 KB Output is correct
141 Correct 68 ms 17868 KB Output is correct
142 Correct 17 ms 11252 KB Output is correct
143 Correct 44 ms 15236 KB Output is correct
144 Correct 73 ms 18692 KB Output is correct
145 Correct 224 ms 34920 KB Output is correct
146 Correct 289 ms 42192 KB Output is correct
147 Correct 342 ms 47420 KB Output is correct
148 Correct 408 ms 53684 KB Output is correct
149 Correct 470 ms 60008 KB Output is correct
150 Correct 465 ms 66540 KB Output is correct
151 Correct 503 ms 74556 KB Output is correct
152 Correct 8 ms 10060 KB Output is correct
153 Correct 10 ms 10384 KB Output is correct
154 Correct 203 ms 36296 KB Output is correct
155 Correct 307 ms 49544 KB Output is correct
156 Correct 416 ms 62676 KB Output is correct
157 Correct 6 ms 9676 KB Output is correct
158 Correct 6 ms 9676 KB Output is correct
159 Correct 6 ms 9676 KB Output is correct
160 Correct 6 ms 9676 KB Output is correct
161 Correct 390 ms 55748 KB Output is correct
162 Correct 369 ms 62836 KB Output is correct
163 Correct 341 ms 64560 KB Output is correct
164 Correct 352 ms 64508 KB Output is correct
165 Correct 395 ms 58788 KB Output is correct
166 Correct 356 ms 56492 KB Output is correct
167 Incorrect 69 ms 19132 KB Solution announced impossible, but it is possible.
168 Halted 0 ms 0 KB -