oj.uz

Submission #621091

# Submission time Handle Problem Language Result Execution time Memory
621091 2022-08-03T12:10:10 Z MKopchev Fountain Parks (IOI21_parks) C++17
70 / 100
 1235 ms 128676 KB 
#include "parks.h"
#include<bits/stdc++.h>
using namespace std;

const int nmax=2e5+42;

void build(vector<int> u, vector<int> v, vector<int> a, vector<int> b);

map< pair<int,int>, int > seen;

int ask(int x,int y)
{
    if(seen.count({x,y}))return seen[{x,y}];

    return -1;
}

int parent[nmax];

int root(int node)
{
    if(node==parent[node])return node;

    parent[node]=root(parent[node]);

    return parent[node];
}

set< pair<int,int> > benches;

struct point
{
    int x,y,id;
};

bool cmp(point a,point b)
{
    if(a.x!=b.x)return a.x<b.x;
    return a.y<b.y;
}

point inp[nmax];

map<int, set< pair<int,int> > > from;
map< pair<int,int>, set<int> > to;

priority_queue< pair<int, pair<int,int> > > pq;

int construct_roads(std::vector<int> x, std::vector<int> y) {

    int n=x.size();

    if (n == 1) {
	build({}, {}, {}, {});
        return 1;
    }

    for(int i=0;i<x.size();i++)
        seen[{x[i],y[i]}]=i;

    for(int i=0;i<n;i++)
    {
        parent[i]=i;

        inp[i].x=x[i];
        inp[i].y=y[i];
        inp[i].id=i;
    }

    sort(inp,inp+n,cmp);

    vector<int> u={},v={},a={},b={};

    for(int j=0;j<n;j++)
    {
        int pos=ask(inp[j].x+2,inp[j].y);

        if(pos!=-1&&root(pos)!=root(inp[j].id))
        {
            parent[root(pos)]=root(inp[j].id);

            from[u.size()].insert({inp[j].x+1,inp[j].y+1});
            from[u.size()].insert({inp[j].x+1,inp[j].y-1});

            to[{inp[j].x+1,inp[j].y+1}].insert(u.size());
            to[{inp[j].x+1,inp[j].y-1}].insert(u.size());

            u.push_back(inp[j].id);
            v.push_back(pos);

            a.push_back(0);
            b.push_back(0);
        }

        pos=ask(inp[j].x,inp[j].y+2);

        if(pos!=-1&&root(pos)!=root(inp[j].id))
        {
            parent[root(pos)]=root(inp[j].id);

            from[u.size()].insert({inp[j].x+1,inp[j].y+1});
            from[u.size()].insert({inp[j].x-1,inp[j].y+1});

            to[{inp[j].x+1,inp[j].y+1}].insert(u.size());
            to[{inp[j].x-1,inp[j].y+1}].insert(u.size());

            u.push_back(inp[j].id);
            v.push_back(pos);

            a.push_back(0);
            b.push_back(0);
        }
    }

    for(int i=0;i<n;i++)
        if(root(i)!=root(0))return 0;

    for(auto w:to)
        pq.push({-w.second.size(),w.first});

    while(pq.size())
    {
        //cout<<pq.size()<<endl;

        pair<int, pair<int,int> > tp=pq.top();

        pq.pop();

        pair<int,int> where=tp.second;

        for(auto w:to[where])
        {
            //cout<<"w= "<<w<<endl;

            if(a[w]==0)
            {
                //cout<<"match "<<tp.first<<" "<<tp.second.first<<" "<<tp.second.second<<" with "<<w<<endl;

                a[w]=where.first;
                b[w]=where.second;

                while(from[w].size())
                {
                    set< pair<int,int> >::iterator it=from[w].begin();

                    pair<int,int> p=(*it);

                    //cout<<"p= "<<p.first<<" "<<p.second<<endl;

                    to[p].erase(w);
                    from[w].erase(p);

                    pq.push({-to[p].size(),p});
                }

                while(to[where].size())
                {
                    set< int >::iterator it=to[where].begin();

                    int p=(*it);

                    //cout<<"p= "<<p<<endl;

                    to[where].erase(p);
                    from[p].erase(where);
                }

                break;
            }
        }

        to[where]={};
    }

    build(u,v,a,b);

    return 1;
}

/*
static void check(bool cond, string message) {
	if (!cond) {
		printf("%s\n", message.c_str());
		fclose(stdout);
		exit(0);
	}
}

static int n;
static bool build_called;
static int m;
static vector<int> _u, _v, _a, _b;

void build(vector<int> u, vector<int> v, vector<int> a, vector<int> b) {
	check(!build_called, "build is called more than once");
	build_called = true;
	m = u.size();
	check(int(v.size()) == m, "u.size() != v.size()");
	check(int(a.size()) == m, "u.size() != a.size()");
	check(int(b.size()) == m, "u.size() != b.size()");
	_u = u;
	_v = v;
	_a = a;
	_b = b;
}

int main() {
	assert(scanf("%d", &n) == 1);
	vector<int> x(n), y(n);
	for (int i = 0; i < n; i++) {
		assert(scanf("%d%d", &x[i], &y[i]) == 2);
	}
	fclose(stdin);

	build_called = false;
	const int possible = construct_roads(x, y);

	check(possible == 0 || possible == 1, "Invalid return value of construct_roads()");
	if (possible == 1) {
		check(build_called, "construct_roads() returned 1 without calling build()");
	} else {
		check(!build_called, "construct_roads() called build() but returned 0");
	}

	printf("%d\n", possible);
	if (possible == 1) {
		printf("%d\n", m);
		for (int j = 0; j < m; j++) {
			printf("%d %d %d %d\n", _u[j], _v[j], _a[j], _b[j]);
		}
	}
	fclose(stdout);
	return 0;
}
*/

Compilation message

parks.cpp: In function 'int construct_roads(std::vector<int>, std::vector<int>)':
parks.cpp:58:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   58 |     for(int i=0;i<x.size();i++)
      |                 ~^~~~~~~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 312 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 316 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 538 ms 63892 KB Output is correct
10 Correct 39 ms 6908 KB Output is correct
11 Correct 268 ms 34532 KB Output is correct
12 Correct 67 ms 10116 KB Output is correct
13 Correct 90 ms 26052 KB Output is correct
14 Correct 3 ms 852 KB Output is correct
15 Correct 4 ms 1372 KB Output is correct
16 Correct 563 ms 63824 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 312 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 316 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 538 ms 63892 KB Output is correct
10 Correct 39 ms 6908 KB Output is correct
11 Correct 268 ms 34532 KB Output is correct
12 Correct 67 ms 10116 KB Output is correct
13 Correct 90 ms 26052 KB Output is correct
14 Correct 3 ms 852 KB Output is correct
15 Correct 4 ms 1372 KB Output is correct
16 Correct 563 ms 63824 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 316 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1089 ms 106036 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 4 ms 980 KB Output is correct
26 Correct 5 ms 1748 KB Output is correct
27 Correct 6 ms 2260 KB Output is correct
28 Correct 384 ms 42740 KB Output is correct
29 Correct 620 ms 63784 KB Output is correct
30 Correct 873 ms 84988 KB Output is correct
31 Correct 1067 ms 106080 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 1 ms 316 KB Output is correct
37 Correct 1 ms 212 KB Output is correct
38 Correct 1 ms 320 KB Output is correct
39 Correct 1 ms 212 KB Output is correct
40 Correct 1 ms 212 KB Output is correct
41 Correct 1 ms 212 KB Output is correct
42 Correct 1 ms 316 KB Output is correct
43 Correct 3 ms 1364 KB Output is correct
44 Correct 5 ms 1876 KB Output is correct
45 Correct 488 ms 57376 KB Output is correct
46 Correct 680 ms 82884 KB Output is correct
47 Correct 691 ms 82928 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 312 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 316 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 538 ms 63892 KB Output is correct
10 Correct 39 ms 6908 KB Output is correct
11 Correct 268 ms 34532 KB Output is correct
12 Correct 67 ms 10116 KB Output is correct
13 Correct 90 ms 26052 KB Output is correct
14 Correct 3 ms 852 KB Output is correct
15 Correct 4 ms 1372 KB Output is correct
16 Correct 563 ms 63824 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 316 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1089 ms 106036 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 4 ms 980 KB Output is correct
26 Correct 5 ms 1748 KB Output is correct
27 Correct 6 ms 2260 KB Output is correct
28 Correct 384 ms 42740 KB Output is correct
29 Correct 620 ms 63784 KB Output is correct
30 Correct 873 ms 84988 KB Output is correct
31 Correct 1067 ms 106080 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 1 ms 316 KB Output is correct
37 Correct 1 ms 212 KB Output is correct
38 Correct 1 ms 320 KB Output is correct
39 Correct 1 ms 212 KB Output is correct
40 Correct 1 ms 212 KB Output is correct
41 Correct 1 ms 212 KB Output is correct
42 Correct 1 ms 316 KB Output is correct
43 Correct 3 ms 1364 KB Output is correct
44 Correct 5 ms 1876 KB Output is correct
45 Correct 488 ms 57376 KB Output is correct
46 Correct 680 ms 82884 KB Output is correct
47 Correct 691 ms 82928 KB Output is correct
48 Correct 1 ms 212 KB Output is correct
49 Correct 0 ms 316 KB Output is correct
50 Correct 0 ms 212 KB Output is correct
51 Correct 0 ms 212 KB Output is correct
52 Correct 1 ms 212 KB Output is correct
53 Correct 1 ms 212 KB Output is correct
54 Correct 1 ms 308 KB Output is correct
55 Correct 1083 ms 106016 KB Output is correct
56 Correct 1 ms 212 KB Output is correct
57 Correct 6 ms 1236 KB Output is correct
58 Correct 22 ms 3584 KB Output is correct
59 Correct 16 ms 5212 KB Output is correct
60 Correct 494 ms 53232 KB Output is correct
61 Correct 710 ms 71912 KB Output is correct
62 Correct 914 ms 87648 KB Output is correct
63 Correct 1076 ms 106092 KB Output is correct
64 Correct 0 ms 340 KB Output is correct
65 Correct 1 ms 212 KB Output is correct
66 Correct 1 ms 312 KB Output is correct
67 Correct 1235 ms 127152 KB Output is correct
68 Correct 1234 ms 127152 KB Output is correct
69 Correct 1177 ms 126556 KB Output is correct
70 Correct 6 ms 2300 KB Output is correct
71 Correct 12 ms 4432 KB Output is correct
72 Correct 508 ms 56748 KB Output is correct
73 Correct 729 ms 84880 KB Output is correct
74 Correct 998 ms 113068 KB Output is correct
75 Correct 1141 ms 114484 KB Output is correct
76 Correct 1164 ms 127320 KB Output is correct
77 Correct 11 ms 2900 KB Output is correct
78 Correct 20 ms 4948 KB Output is correct
79 Correct 470 ms 56688 KB Output is correct
80 Correct 755 ms 84764 KB Output is correct
81 Correct 989 ms 112884 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 312 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 316 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 538 ms 63892 KB Output is correct
10 Correct 39 ms 6908 KB Output is correct
11 Correct 268 ms 34532 KB Output is correct
12 Correct 67 ms 10116 KB Output is correct
13 Correct 90 ms 26052 KB Output is correct
14 Correct 3 ms 852 KB Output is correct
15 Correct 4 ms 1372 KB Output is correct
16 Correct 563 ms 63824 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 312 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 1030 ms 107432 KB Output is correct
21 Correct 1020 ms 106384 KB Output is correct
22 Correct 1038 ms 106552 KB Output is correct
23 Correct 894 ms 108324 KB Output is correct
24 Correct 186 ms 19164 KB Output is correct
25 Correct 476 ms 116028 KB Output is correct
26 Correct 469 ms 116004 KB Output is correct
27 Correct 956 ms 127072 KB Output is correct
28 Correct 948 ms 127184 KB Output is correct
29 Correct 1174 ms 127092 KB Output is correct
30 Correct 1110 ms 127180 KB Output is correct
31 Correct 0 ms 212 KB Output is correct
32 Correct 61 ms 8676 KB Output is correct
33 Correct 83 ms 10876 KB Output is correct
34 Correct 1002 ms 108928 KB Output is correct
35 Correct 17 ms 5460 KB Output is correct
36 Correct 104 ms 26072 KB Output is correct
37 Correct 214 ms 51872 KB Output is correct
38 Correct 372 ms 45556 KB Output is correct
39 Correct 526 ms 62124 KB Output is correct
40 Correct 675 ms 79120 KB Output is correct
41 Correct 842 ms 96080 KB Output is correct
42 Correct 971 ms 113092 KB Output is correct
43 Correct 1 ms 212 KB Output is correct
44 Correct 0 ms 212 KB Output is correct
45 Correct 1 ms 316 KB Output is correct
46 Correct 0 ms 212 KB Output is correct
47 Correct 1 ms 212 KB Output is correct
48 Correct 1 ms 212 KB Output is correct
49 Correct 1 ms 316 KB Output is correct
50 Correct 1 ms 312 KB Output is correct
51 Correct 1 ms 212 KB Output is correct
52 Correct 1 ms 212 KB Output is correct
53 Correct 1 ms 212 KB Output is correct
54 Correct 4 ms 1364 KB Output is correct
55 Correct 6 ms 1876 KB Output is correct
56 Correct 465 ms 57976 KB Output is correct
57 Correct 683 ms 83952 KB Output is correct
58 Correct 685 ms 83936 KB Output is correct
59 Correct 1 ms 212 KB Output is correct
60 Correct 1 ms 316 KB Output is correct
61 Correct 1 ms 212 KB Output is correct
62 Correct 1191 ms 128676 KB Output is correct
63 Correct 1165 ms 128676 KB Output is correct
64 Correct 1197 ms 128088 KB Output is correct
65 Correct 6 ms 2388 KB Output is correct
66 Correct 16 ms 4512 KB Output is correct
67 Correct 479 ms 57384 KB Output is correct
68 Correct 739 ms 86028 KB Output is correct
69 Correct 1048 ms 114696 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 312 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 316 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 538 ms 63892 KB Output is correct
10 Correct 39 ms 6908 KB Output is correct
11 Correct 268 ms 34532 KB Output is correct
12 Correct 67 ms 10116 KB Output is correct
13 Correct 90 ms 26052 KB Output is correct
14 Correct 3 ms 852 KB Output is correct
15 Correct 4 ms 1372 KB Output is correct
16 Correct 563 ms 63824 KB Output is correct
17 Correct 1118 ms 127212 KB Output is correct
18 Correct 1114 ms 127296 KB Output is correct
19 Correct 1085 ms 106724 KB Output is correct
20 Correct 884 ms 110896 KB Output is correct
21 Correct 867 ms 107396 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 138 ms 18232 KB Output is correct
24 Correct 35 ms 10744 KB Output is correct
25 Correct 139 ms 37084 KB Output is correct
26 Correct 260 ms 63280 KB Output is correct
27 Correct 463 ms 57528 KB Output is correct
28 Correct 603 ms 72168 KB Output is correct
29 Correct 740 ms 86584 KB Output is correct
30 Correct 901 ms 100356 KB Output is correct
31 Correct 992 ms 115136 KB Output is correct
32 Correct 1102 ms 116112 KB Output is correct
33 Correct 1214 ms 128668 KB Output is correct
34 Correct 8 ms 2900 KB Output is correct
35 Correct 16 ms 4948 KB Output is correct
36 Correct 477 ms 57268 KB Output is correct
37 Correct 720 ms 85976 KB Output is correct
38 Correct 999 ms 114456 KB Output is correct

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 312 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 316 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 538 ms 63892 KB Output is correct
10 Correct 39 ms 6908 KB Output is correct
11 Correct 268 ms 34532 KB Output is correct
12 Correct 67 ms 10116 KB Output is correct
13 Correct 90 ms 26052 KB Output is correct
14 Correct 3 ms 852 KB Output is correct
15 Correct 4 ms 1372 KB Output is correct
16 Correct 563 ms 63824 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 316 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1089 ms 106036 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 4 ms 980 KB Output is correct
26 Correct 5 ms 1748 KB Output is correct
27 Correct 6 ms 2260 KB Output is correct
28 Correct 384 ms 42740 KB Output is correct
29 Correct 620 ms 63784 KB Output is correct
30 Correct 873 ms 84988 KB Output is correct
31 Correct 1067 ms 106080 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 1 ms 316 KB Output is correct
37 Correct 1 ms 212 KB Output is correct
38 Correct 1 ms 320 KB Output is correct
39 Correct 1 ms 212 KB Output is correct
40 Correct 1 ms 212 KB Output is correct
41 Correct 1 ms 212 KB Output is correct
42 Correct 1 ms 316 KB Output is correct
43 Correct 3 ms 1364 KB Output is correct
44 Correct 5 ms 1876 KB Output is correct
45 Correct 488 ms 57376 KB Output is correct
46 Correct 680 ms 82884 KB Output is correct
47 Correct 691 ms 82928 KB Output is correct
48 Correct 1 ms 212 KB Output is correct
49 Correct 0 ms 316 KB Output is correct
50 Correct 0 ms 212 KB Output is correct
51 Correct 0 ms 212 KB Output is correct
52 Correct 1 ms 212 KB Output is correct
53 Correct 1 ms 212 KB Output is correct
54 Correct 1 ms 308 KB Output is correct
55 Correct 1083 ms 106016 KB Output is correct
56 Correct 1 ms 212 KB Output is correct
57 Correct 6 ms 1236 KB Output is correct
58 Correct 22 ms 3584 KB Output is correct
59 Correct 16 ms 5212 KB Output is correct
60 Correct 494 ms 53232 KB Output is correct
61 Correct 710 ms 71912 KB Output is correct
62 Correct 914 ms 87648 KB Output is correct
63 Correct 1076 ms 106092 KB Output is correct
64 Correct 0 ms 340 KB Output is correct
65 Correct 1 ms 212 KB Output is correct
66 Correct 1 ms 312 KB Output is correct
67 Correct 1235 ms 127152 KB Output is correct
68 Correct 1234 ms 127152 KB Output is correct
69 Correct 1177 ms 126556 KB Output is correct
70 Correct 6 ms 2300 KB Output is correct
71 Correct 12 ms 4432 KB Output is correct
72 Correct 508 ms 56748 KB Output is correct
73 Correct 729 ms 84880 KB Output is correct
74 Correct 998 ms 113068 KB Output is correct
75 Correct 1141 ms 114484 KB Output is correct
76 Correct 1164 ms 127320 KB Output is correct
77 Correct 11 ms 2900 KB Output is correct
78 Correct 20 ms 4948 KB Output is correct
79 Correct 470 ms 56688 KB Output is correct
80 Correct 755 ms 84764 KB Output is correct
81 Correct 989 ms 112884 KB Output is correct
82 Correct 1 ms 212 KB Output is correct
83 Correct 1 ms 312 KB Output is correct
84 Correct 0 ms 212 KB Output is correct
85 Correct 1030 ms 107432 KB Output is correct
86 Correct 1020 ms 106384 KB Output is correct
87 Correct 1038 ms 106552 KB Output is correct
88 Correct 894 ms 108324 KB Output is correct
89 Correct 186 ms 19164 KB Output is correct
90 Correct 476 ms 116028 KB Output is correct
91 Correct 469 ms 116004 KB Output is correct
92 Correct 956 ms 127072 KB Output is correct
93 Correct 948 ms 127184 KB Output is correct
94 Correct 1174 ms 127092 KB Output is correct
95 Correct 1110 ms 127180 KB Output is correct
96 Correct 0 ms 212 KB Output is correct
97 Correct 61 ms 8676 KB Output is correct
98 Correct 83 ms 10876 KB Output is correct
99 Correct 1002 ms 108928 KB Output is correct
100 Correct 17 ms 5460 KB Output is correct
101 Correct 104 ms 26072 KB Output is correct
102 Correct 214 ms 51872 KB Output is correct
103 Correct 372 ms 45556 KB Output is correct
104 Correct 526 ms 62124 KB Output is correct
105 Correct 675 ms 79120 KB Output is correct
106 Correct 842 ms 96080 KB Output is correct
107 Correct 971 ms 113092 KB Output is correct
108 Correct 1 ms 212 KB Output is correct
109 Correct 0 ms 212 KB Output is correct
110 Correct 1 ms 316 KB Output is correct
111 Correct 0 ms 212 KB Output is correct
112 Correct 1 ms 212 KB Output is correct
113 Correct 1 ms 212 KB Output is correct
114 Correct 1 ms 316 KB Output is correct
115 Correct 1 ms 312 KB Output is correct
116 Correct 1 ms 212 KB Output is correct
117 Correct 1 ms 212 KB Output is correct
118 Correct 1 ms 212 KB Output is correct
119 Correct 4 ms 1364 KB Output is correct
120 Correct 6 ms 1876 KB Output is correct
121 Correct 465 ms 57976 KB Output is correct
122 Correct 683 ms 83952 KB Output is correct
123 Correct 685 ms 83936 KB Output is correct
124 Correct 1 ms 212 KB Output is correct
125 Correct 1 ms 316 KB Output is correct
126 Correct 1 ms 212 KB Output is correct
127 Correct 1191 ms 128676 KB Output is correct
128 Correct 1165 ms 128676 KB Output is correct
129 Correct 1197 ms 128088 KB Output is correct
130 Correct 6 ms 2388 KB Output is correct
131 Correct 16 ms 4512 KB Output is correct
132 Correct 479 ms 57384 KB Output is correct
133 Correct 739 ms 86028 KB Output is correct
134 Correct 1048 ms 114696 KB Output is correct
135 Correct 1118 ms 127212 KB Output is correct
136 Correct 1114 ms 127296 KB Output is correct
137 Correct 1085 ms 106724 KB Output is correct
138 Correct 884 ms 110896 KB Output is correct
139 Correct 867 ms 107396 KB Output is correct
140 Correct 1 ms 212 KB Output is correct
141 Correct 138 ms 18232 KB Output is correct
142 Correct 35 ms 10744 KB Output is correct
143 Correct 139 ms 37084 KB Output is correct
144 Correct 260 ms 63280 KB Output is correct
145 Correct 463 ms 57528 KB Output is correct
146 Correct 603 ms 72168 KB Output is correct
147 Correct 740 ms 86584 KB Output is correct
148 Correct 901 ms 100356 KB Output is correct
149 Correct 992 ms 115136 KB Output is correct
150 Correct 1102 ms 116112 KB Output is correct
151 Correct 1214 ms 128668 KB Output is correct
152 Correct 8 ms 2900 KB Output is correct
153 Correct 16 ms 4948 KB Output is correct
154 Correct 477 ms 57268 KB Output is correct
155 Correct 720 ms 85976 KB Output is correct
156 Correct 999 ms 114456 KB Output is correct
157 Correct 1 ms 344 KB Output is correct
158 Correct 1 ms 316 KB Output is correct
159 Correct 0 ms 212 KB Output is correct
160 Correct 1 ms 212 KB Output is correct
161 Correct 872 ms 107980 KB Output is correct
162 Correct 1004 ms 108952 KB Output is correct
163 Correct 992 ms 108708 KB Output is correct
164 Correct 930 ms 108680 KB Output is correct
165 Correct 1008 ms 108416 KB Output is correct
166 Correct 1093 ms 107256 KB Output is correct
167 Incorrect 199 ms 25668 KB a[11] = 0 is not an odd integer
168 Halted 0 ms 0 KB -