oj.uz

Submission #437975

# Submission time Handle Problem Language Result Execution time Memory
437975 2021-06-27T11:20:30 Z CyanForces Fountain Parks (IOI21_parks) C++17
70 / 100
 640 ms 70340 KB 
#include "parks.h"
#include <bits/stdc++.h>
#define rep(a,b,c) for(int a=int(b); a<int(c); ++a)
using namespace std;
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;

#pragma once

bool dfs(int a, int L, vector<vi>& g, vi& btoa, vi& A, vi& B) {
	if (A[a] != L) return 0;
	A[a] = -1;
	for (int b : g[a]) if (B[b] == L + 1) {
		B[b] = 0;
		if (btoa[b] == -1 || dfs(btoa[b], L + 1, g, btoa, A, B))
			return btoa[b] = a, 1;
	}
	return 0;
}

int hopcroftKarp(vector<vi>& g, vi& btoa) {
	int res = 0;
	vi A(g.size()), B(btoa.size()), cur, next;
	for (;;) {
		fill(all(A), 0);
		fill(all(B), 0);
		/// Find the starting nodes for BFS (i.e. layer 0).
		cur.clear();
		for (int a : btoa) if(a != -1) A[a] = -1;
		rep(a,0,sz(g)) if(A[a] == 0) cur.push_back(a);
		/// Find all layers using bfs.
		for (int lay = 1;; lay++) {
			bool islast = 0;
			next.clear();
			for (int a : cur) for (int b : g[a]) {
				if (btoa[b] == -1) {
					B[b] = lay;
					islast = 1;
				}
				else if (btoa[b] != a && !B[b]) {
					B[b] = lay;
					next.push_back(btoa[b]);
				}
			}
			if (islast) break;
			if (next.empty()) return res;
			for (int a : next) A[a] = lay;
			cur.swap(next);
		}
		/// Use DFS to scan for augmenting paths.
		rep(a,0,sz(g))
			res += dfs(a, 0, g, btoa, A, B);
	}
}

vector<int> parent;
vector<int> s;

int find(int x) {
  if(x==parent[x]) return x;
  else return parent[x]=find(parent[x]);
}

void makeset(int x) {
  parent[x]=x;
}

bool sameset(int x, int y) {
  return find(x)==find(y);
}

void join(int x, int y) {
  int xroot = find(x);
  int yroot = find(y);
  if(s[xroot]>s[yroot]) {
    parent[yroot]=xroot;
    s[xroot] += s[yroot];
  } else {
    parent[xroot]=yroot;
    s[yroot] += s[xroot];
  }
}

int construct_roads(vector<int> x, vector<int> y) {
    if (x.size() == 1) {
	build({}, {}, {}, {});
        return 1;
    }
    int n = x.size();
    int M = 2*1e5+1;
    vector<vector<pair<int,int>>> x_fountains(M);
    vector<vector<pair<int,int>>> y_fountains(M);
    // first is the coordinate
    // second is the index.
    rep(i,0,n) {
      x_fountains[x[i]].emplace_back(y[i],i);
      y_fountains[y[i]].emplace_back(x[i],i);
    }
    rep(i,0,M) {
      sort(x_fountains[i].begin(), x_fountains[i].end());
      sort(y_fountains[i].begin(), y_fountains[i].end());
    }

    vector<int> u, v, a, b;

    parent.clear();
    parent.resize(n);
    s.resize(n);
    rep(i,0,n) makeset(i);
    rep(i,0,M) {
      rep(j,1,x_fountains[i].size()) {
        int ind1 = x_fountains[i][j-1].second;
        int y1 = x_fountains[i][j-1].first;
        int ind2 = x_fountains[i][j].second;
        int y2 = x_fountains[i][j].first;
        if(y2-y1!=2) continue;
        if(sameset(ind1,ind2)) continue;
        join(ind1,ind2);
        u.push_back(ind1);
        v.push_back(ind2);
      }
    }
    rep(i,0,M) {
      rep(j,1,y_fountains[i].size()) {
        int ind1 = y_fountains[i][j-1].second;
        int x1 = y_fountains[i][j-1].first;
        int ind2 = y_fountains[i][j].second;
        int x2 = y_fountains[i][j].first;
        if(x2-x1!=2) continue;
        if(sameset(ind1,ind2)) continue;
        join(ind1,ind2);
        u.push_back(ind1);
        v.push_back(ind2);
      }
    }
    int num_roads = u.size();
    if(num_roads!=n-1) return 0;
    map<pair<int,int>, int> potential_benches;
    vector<pair<int,int>> potential_benches2;
    vector<vector<int>> graph(num_roads);
    rep(i,0,num_roads) {
      int f1 = u[i];
      int f2 = v[i];
      vector<pair<int,int>> temp;
      if(x[f1]==x[f2]) {
        int mid = (y[f1]+y[f2])/2;
        temp.emplace_back(x[f1]-1, mid);
        temp.emplace_back(x[f1]+1, mid);
      } else {
        assert(y[f1]==y[f2]);
          int mid = (x[f1]+x[f2])/2;
          temp.emplace_back(mid, y[f1]-1);
          temp.emplace_back(mid, y[f1]+1);
      }
      rep(j,0,temp.size()) {
        if (!potential_benches.count(temp[j])) {
          potential_benches[temp[j]]=potential_benches.size();
          potential_benches2.emplace_back(temp[j]);
        }
        graph[i].push_back(potential_benches[temp[j]]);
      }
    }
    vector<int> btoa(potential_benches.size(),-1);
    hopcroftKarp(graph, btoa);
    a.resize(num_roads);
    b.resize(num_roads);
    rep(i,0,potential_benches2.size()) {
      if(btoa[i] != -1) {
        a[btoa[i]] = potential_benches2[i].first;
        b[btoa[i]] = potential_benches2[i].second;
      }
    }
    build(u, v, a, b);
    return 1;
}

Compilation message

parks.cpp:11:9: warning: #pragma once in main file
   11 | #pragma once
      |         ^~~~

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 9 ms 9676 KB Output is correct
3 Correct 9 ms 9584 KB Output is correct
4 Correct 9 ms 9676 KB Output is correct
5 Correct 10 ms 9676 KB Output is correct
6 Correct 10 ms 9760 KB Output is correct
7 Correct 10 ms 9680 KB Output is correct
8 Correct 9 ms 9692 KB Output is correct
9 Correct 280 ms 41232 KB Output is correct
10 Correct 27 ms 12744 KB Output is correct
11 Correct 127 ms 26604 KB Output is correct
12 Correct 38 ms 14336 KB Output is correct
13 Correct 25 ms 13116 KB Output is correct
14 Correct 10 ms 9676 KB Output is correct
15 Correct 9 ms 9780 KB Output is correct
16 Correct 281 ms 41220 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 9 ms 9676 KB Output is correct
3 Correct 9 ms 9584 KB Output is correct
4 Correct 9 ms 9676 KB Output is correct
5 Correct 10 ms 9676 KB Output is correct
6 Correct 10 ms 9760 KB Output is correct
7 Correct 10 ms 9680 KB Output is correct
8 Correct 9 ms 9692 KB Output is correct
9 Correct 280 ms 41232 KB Output is correct
10 Correct 27 ms 12744 KB Output is correct
11 Correct 127 ms 26604 KB Output is correct
12 Correct 38 ms 14336 KB Output is correct
13 Correct 25 ms 13116 KB Output is correct
14 Correct 10 ms 9676 KB Output is correct
15 Correct 9 ms 9780 KB Output is correct
16 Correct 281 ms 41220 KB Output is correct
17 Correct 9 ms 9688 KB Output is correct
18 Correct 10 ms 9804 KB Output is correct
19 Correct 9 ms 9676 KB Output is correct
20 Correct 8 ms 9676 KB Output is correct
21 Correct 10 ms 9676 KB Output is correct
22 Correct 8 ms 9592 KB Output is correct
23 Correct 514 ms 62796 KB Output is correct
24 Correct 10 ms 9676 KB Output is correct
25 Correct 11 ms 9932 KB Output is correct
26 Correct 11 ms 9804 KB Output is correct
27 Correct 11 ms 9932 KB Output is correct
28 Correct 180 ms 31052 KB Output is correct
29 Correct 284 ms 41540 KB Output is correct
30 Correct 400 ms 52176 KB Output is correct
31 Correct 513 ms 62772 KB Output is correct
32 Correct 9 ms 9676 KB Output is correct
33 Correct 8 ms 9676 KB Output is correct
34 Correct 10 ms 9696 KB Output is correct
35 Correct 9 ms 9676 KB Output is correct
36 Correct 9 ms 9676 KB Output is correct
37 Correct 9 ms 9692 KB Output is correct
38 Correct 10 ms 9676 KB Output is correct
39 Correct 9 ms 9676 KB Output is correct
40 Correct 10 ms 9676 KB Output is correct
41 Correct 10 ms 9676 KB Output is correct
42 Correct 10 ms 9676 KB Output is correct
43 Correct 11 ms 9820 KB Output is correct
44 Correct 10 ms 9844 KB Output is correct
45 Correct 239 ms 35444 KB Output is correct
46 Correct 344 ms 47000 KB Output is correct
47 Correct 342 ms 46924 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 9 ms 9676 KB Output is correct
3 Correct 9 ms 9584 KB Output is correct
4 Correct 9 ms 9676 KB Output is correct
5 Correct 10 ms 9676 KB Output is correct
6 Correct 10 ms 9760 KB Output is correct
7 Correct 10 ms 9680 KB Output is correct
8 Correct 9 ms 9692 KB Output is correct
9 Correct 280 ms 41232 KB Output is correct
10 Correct 27 ms 12744 KB Output is correct
11 Correct 127 ms 26604 KB Output is correct
12 Correct 38 ms 14336 KB Output is correct
13 Correct 25 ms 13116 KB Output is correct
14 Correct 10 ms 9676 KB Output is correct
15 Correct 9 ms 9780 KB Output is correct
16 Correct 281 ms 41220 KB Output is correct
17 Correct 9 ms 9688 KB Output is correct
18 Correct 10 ms 9804 KB Output is correct
19 Correct 9 ms 9676 KB Output is correct
20 Correct 8 ms 9676 KB Output is correct
21 Correct 10 ms 9676 KB Output is correct
22 Correct 8 ms 9592 KB Output is correct
23 Correct 514 ms 62796 KB Output is correct
24 Correct 10 ms 9676 KB Output is correct
25 Correct 11 ms 9932 KB Output is correct
26 Correct 11 ms 9804 KB Output is correct
27 Correct 11 ms 9932 KB Output is correct
28 Correct 180 ms 31052 KB Output is correct
29 Correct 284 ms 41540 KB Output is correct
30 Correct 400 ms 52176 KB Output is correct
31 Correct 513 ms 62772 KB Output is correct
32 Correct 9 ms 9676 KB Output is correct
33 Correct 8 ms 9676 KB Output is correct
34 Correct 10 ms 9696 KB Output is correct
35 Correct 9 ms 9676 KB Output is correct
36 Correct 9 ms 9676 KB Output is correct
37 Correct 9 ms 9692 KB Output is correct
38 Correct 10 ms 9676 KB Output is correct
39 Correct 9 ms 9676 KB Output is correct
40 Correct 10 ms 9676 KB Output is correct
41 Correct 10 ms 9676 KB Output is correct
42 Correct 10 ms 9676 KB Output is correct
43 Correct 11 ms 9820 KB Output is correct
44 Correct 10 ms 9844 KB Output is correct
45 Correct 239 ms 35444 KB Output is correct
46 Correct 344 ms 47000 KB Output is correct
47 Correct 342 ms 46924 KB Output is correct
48 Correct 10 ms 9624 KB Output is correct
49 Correct 10 ms 9676 KB Output is correct
50 Correct 10 ms 9624 KB Output is correct
51 Correct 9 ms 9640 KB Output is correct
52 Correct 9 ms 9676 KB Output is correct
53 Correct 8 ms 9676 KB Output is correct
54 Correct 9 ms 9676 KB Output is correct
55 Correct 485 ms 60480 KB Output is correct
56 Correct 8 ms 9676 KB Output is correct
57 Correct 14 ms 10060 KB Output is correct
58 Correct 19 ms 11168 KB Output is correct
59 Correct 13 ms 10316 KB Output is correct
60 Correct 230 ms 35204 KB Output is correct
61 Correct 335 ms 43976 KB Output is correct
62 Correct 374 ms 51484 KB Output is correct
63 Correct 472 ms 60472 KB Output is correct
64 Correct 10 ms 9676 KB Output is correct
65 Correct 10 ms 9676 KB Output is correct
66 Correct 8 ms 9652 KB Output is correct
67 Correct 548 ms 69224 KB Output is correct
68 Correct 559 ms 70172 KB Output is correct
69 Correct 559 ms 69452 KB Output is correct
70 Correct 11 ms 10060 KB Output is correct
71 Correct 11 ms 10188 KB Output is correct
72 Correct 240 ms 34916 KB Output is correct
73 Correct 385 ms 47208 KB Output is correct
74 Correct 524 ms 59716 KB Output is correct
75 Correct 546 ms 64508 KB Output is correct
76 Correct 640 ms 70160 KB Output is correct
77 Correct 13 ms 9932 KB Output is correct
78 Correct 16 ms 10228 KB Output is correct
79 Correct 270 ms 35484 KB Output is correct
80 Correct 380 ms 48336 KB Output is correct
81 Correct 542 ms 61156 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 9 ms 9676 KB Output is correct
3 Correct 9 ms 9584 KB Output is correct
4 Correct 9 ms 9676 KB Output is correct
5 Correct 10 ms 9676 KB Output is correct
6 Correct 10 ms 9760 KB Output is correct
7 Correct 10 ms 9680 KB Output is correct
8 Correct 9 ms 9692 KB Output is correct
9 Correct 280 ms 41232 KB Output is correct
10 Correct 27 ms 12744 KB Output is correct
11 Correct 127 ms 26604 KB Output is correct
12 Correct 38 ms 14336 KB Output is correct
13 Correct 25 ms 13116 KB Output is correct
14 Correct 10 ms 9676 KB Output is correct
15 Correct 9 ms 9780 KB Output is correct
16 Correct 281 ms 41220 KB Output is correct
17 Correct 10 ms 9676 KB Output is correct
18 Correct 10 ms 9640 KB Output is correct
19 Correct 10 ms 9676 KB Output is correct
20 Correct 612 ms 55868 KB Output is correct
21 Correct 517 ms 54676 KB Output is correct
22 Correct 503 ms 54712 KB Output is correct
23 Correct 409 ms 61232 KB Output is correct
24 Correct 80 ms 18372 KB Output is correct
25 Correct 88 ms 20160 KB Output is correct
26 Correct 91 ms 19984 KB Output is correct
27 Correct 414 ms 68032 KB Output is correct
28 Correct 443 ms 68040 KB Output is correct
29 Correct 488 ms 68020 KB Output is correct
30 Correct 469 ms 68208 KB Output is correct
31 Correct 9 ms 9636 KB Output is correct
32 Correct 40 ms 13072 KB Output is correct
33 Correct 109 ms 18224 KB Output is correct
34 Correct 585 ms 55872 KB Output is correct
35 Correct 13 ms 10316 KB Output is correct
36 Correct 33 ms 12836 KB Output is correct
37 Correct 56 ms 15728 KB Output is correct
38 Correct 194 ms 28332 KB Output is correct
39 Correct 290 ms 35800 KB Output is correct
40 Correct 379 ms 43024 KB Output is correct
41 Correct 446 ms 50216 KB Output is correct
42 Correct 540 ms 57028 KB Output is correct
43 Correct 8 ms 9676 KB Output is correct
44 Correct 8 ms 9676 KB Output is correct
45 Correct 9 ms 9620 KB Output is correct
46 Correct 11 ms 9676 KB Output is correct
47 Correct 9 ms 9676 KB Output is correct
48 Correct 9 ms 9692 KB Output is correct
49 Correct 9 ms 9676 KB Output is correct
50 Correct 9 ms 9676 KB Output is correct
51 Correct 10 ms 9676 KB Output is correct
52 Correct 9 ms 9676 KB Output is correct
53 Correct 8 ms 9676 KB Output is correct
54 Correct 9 ms 9804 KB Output is correct
55 Correct 10 ms 9804 KB Output is correct
56 Correct 258 ms 35468 KB Output is correct
57 Correct 349 ms 46948 KB Output is correct
58 Correct 359 ms 46936 KB Output is correct
59 Correct 9 ms 9676 KB Output is correct
60 Correct 9 ms 9676 KB Output is correct
61 Correct 8 ms 9676 KB Output is correct
62 Correct 543 ms 69140 KB Output is correct
63 Correct 537 ms 70340 KB Output is correct
64 Correct 556 ms 69540 KB Output is correct
65 Correct 10 ms 9932 KB Output is correct
66 Correct 12 ms 10188 KB Output is correct
67 Correct 248 ms 34792 KB Output is correct
68 Correct 377 ms 47184 KB Output is correct
69 Correct 531 ms 59796 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 9 ms 9676 KB Output is correct
3 Correct 9 ms 9584 KB Output is correct
4 Correct 9 ms 9676 KB Output is correct
5 Correct 10 ms 9676 KB Output is correct
6 Correct 10 ms 9760 KB Output is correct
7 Correct 10 ms 9680 KB Output is correct
8 Correct 9 ms 9692 KB Output is correct
9 Correct 280 ms 41232 KB Output is correct
10 Correct 27 ms 12744 KB Output is correct
11 Correct 127 ms 26604 KB Output is correct
12 Correct 38 ms 14336 KB Output is correct
13 Correct 25 ms 13116 KB Output is correct
14 Correct 10 ms 9676 KB Output is correct
15 Correct 9 ms 9780 KB Output is correct
16 Correct 281 ms 41220 KB Output is correct
17 Correct 517 ms 69772 KB Output is correct
18 Correct 518 ms 69824 KB Output is correct
19 Correct 483 ms 59292 KB Output is correct
20 Correct 407 ms 56792 KB Output is correct
21 Correct 393 ms 59352 KB Output is correct
22 Correct 11 ms 9676 KB Output is correct
23 Correct 71 ms 17300 KB Output is correct
24 Correct 17 ms 10940 KB Output is correct
25 Correct 43 ms 14148 KB Output is correct
26 Correct 65 ms 16744 KB Output is correct
27 Correct 249 ms 34364 KB Output is correct
28 Correct 322 ms 40552 KB Output is correct
29 Correct 379 ms 46432 KB Output is correct
30 Correct 434 ms 52348 KB Output is correct
31 Correct 509 ms 58228 KB Output is correct
32 Correct 510 ms 64716 KB Output is correct
33 Correct 546 ms 70280 KB Output is correct
34 Correct 11 ms 9932 KB Output is correct
35 Correct 13 ms 10340 KB Output is correct
36 Correct 227 ms 35484 KB Output is correct
37 Correct 354 ms 48344 KB Output is correct
38 Correct 497 ms 61124 KB Output is correct

Subtask #6
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 9 ms 9676 KB Output is correct
3 Correct 9 ms 9584 KB Output is correct
4 Correct 9 ms 9676 KB Output is correct
5 Correct 10 ms 9676 KB Output is correct
6 Correct 10 ms 9760 KB Output is correct
7 Correct 10 ms 9680 KB Output is correct
8 Correct 9 ms 9692 KB Output is correct
9 Correct 280 ms 41232 KB Output is correct
10 Correct 27 ms 12744 KB Output is correct
11 Correct 127 ms 26604 KB Output is correct
12 Correct 38 ms 14336 KB Output is correct
13 Correct 25 ms 13116 KB Output is correct
14 Correct 10 ms 9676 KB Output is correct
15 Correct 9 ms 9780 KB Output is correct
16 Correct 281 ms 41220 KB Output is correct
17 Correct 9 ms 9688 KB Output is correct
18 Correct 10 ms 9804 KB Output is correct
19 Correct 9 ms 9676 KB Output is correct
20 Correct 8 ms 9676 KB Output is correct
21 Correct 10 ms 9676 KB Output is correct
22 Correct 8 ms 9592 KB Output is correct
23 Correct 514 ms 62796 KB Output is correct
24 Correct 10 ms 9676 KB Output is correct
25 Correct 11 ms 9932 KB Output is correct
26 Correct 11 ms 9804 KB Output is correct
27 Correct 11 ms 9932 KB Output is correct
28 Correct 180 ms 31052 KB Output is correct
29 Correct 284 ms 41540 KB Output is correct
30 Correct 400 ms 52176 KB Output is correct
31 Correct 513 ms 62772 KB Output is correct
32 Correct 9 ms 9676 KB Output is correct
33 Correct 8 ms 9676 KB Output is correct
34 Correct 10 ms 9696 KB Output is correct
35 Correct 9 ms 9676 KB Output is correct
36 Correct 9 ms 9676 KB Output is correct
37 Correct 9 ms 9692 KB Output is correct
38 Correct 10 ms 9676 KB Output is correct
39 Correct 9 ms 9676 KB Output is correct
40 Correct 10 ms 9676 KB Output is correct
41 Correct 10 ms 9676 KB Output is correct
42 Correct 10 ms 9676 KB Output is correct
43 Correct 11 ms 9820 KB Output is correct
44 Correct 10 ms 9844 KB Output is correct
45 Correct 239 ms 35444 KB Output is correct
46 Correct 344 ms 47000 KB Output is correct
47 Correct 342 ms 46924 KB Output is correct
48 Correct 10 ms 9624 KB Output is correct
49 Correct 10 ms 9676 KB Output is correct
50 Correct 10 ms 9624 KB Output is correct
51 Correct 9 ms 9640 KB Output is correct
52 Correct 9 ms 9676 KB Output is correct
53 Correct 8 ms 9676 KB Output is correct
54 Correct 9 ms 9676 KB Output is correct
55 Correct 485 ms 60480 KB Output is correct
56 Correct 8 ms 9676 KB Output is correct
57 Correct 14 ms 10060 KB Output is correct
58 Correct 19 ms 11168 KB Output is correct
59 Correct 13 ms 10316 KB Output is correct
60 Correct 230 ms 35204 KB Output is correct
61 Correct 335 ms 43976 KB Output is correct
62 Correct 374 ms 51484 KB Output is correct
63 Correct 472 ms 60472 KB Output is correct
64 Correct 10 ms 9676 KB Output is correct
65 Correct 10 ms 9676 KB Output is correct
66 Correct 8 ms 9652 KB Output is correct
67 Correct 548 ms 69224 KB Output is correct
68 Correct 559 ms 70172 KB Output is correct
69 Correct 559 ms 69452 KB Output is correct
70 Correct 11 ms 10060 KB Output is correct
71 Correct 11 ms 10188 KB Output is correct
72 Correct 240 ms 34916 KB Output is correct
73 Correct 385 ms 47208 KB Output is correct
74 Correct 524 ms 59716 KB Output is correct
75 Correct 546 ms 64508 KB Output is correct
76 Correct 640 ms 70160 KB Output is correct
77 Correct 13 ms 9932 KB Output is correct
78 Correct 16 ms 10228 KB Output is correct
79 Correct 270 ms 35484 KB Output is correct
80 Correct 380 ms 48336 KB Output is correct
81 Correct 542 ms 61156 KB Output is correct
82 Correct 10 ms 9676 KB Output is correct
83 Correct 10 ms 9640 KB Output is correct
84 Correct 10 ms 9676 KB Output is correct
85 Correct 612 ms 55868 KB Output is correct
86 Correct 517 ms 54676 KB Output is correct
87 Correct 503 ms 54712 KB Output is correct
88 Correct 409 ms 61232 KB Output is correct
89 Correct 80 ms 18372 KB Output is correct
90 Correct 88 ms 20160 KB Output is correct
91 Correct 91 ms 19984 KB Output is correct
92 Correct 414 ms 68032 KB Output is correct
93 Correct 443 ms 68040 KB Output is correct
94 Correct 488 ms 68020 KB Output is correct
95 Correct 469 ms 68208 KB Output is correct
96 Correct 9 ms 9636 KB Output is correct
97 Correct 40 ms 13072 KB Output is correct
98 Correct 109 ms 18224 KB Output is correct
99 Correct 585 ms 55872 KB Output is correct
100 Correct 13 ms 10316 KB Output is correct
101 Correct 33 ms 12836 KB Output is correct
102 Correct 56 ms 15728 KB Output is correct
103 Correct 194 ms 28332 KB Output is correct
104 Correct 290 ms 35800 KB Output is correct
105 Correct 379 ms 43024 KB Output is correct
106 Correct 446 ms 50216 KB Output is correct
107 Correct 540 ms 57028 KB Output is correct
108 Correct 8 ms 9676 KB Output is correct
109 Correct 8 ms 9676 KB Output is correct
110 Correct 9 ms 9620 KB Output is correct
111 Correct 11 ms 9676 KB Output is correct
112 Correct 9 ms 9676 KB Output is correct
113 Correct 9 ms 9692 KB Output is correct
114 Correct 9 ms 9676 KB Output is correct
115 Correct 9 ms 9676 KB Output is correct
116 Correct 10 ms 9676 KB Output is correct
117 Correct 9 ms 9676 KB Output is correct
118 Correct 8 ms 9676 KB Output is correct
119 Correct 9 ms 9804 KB Output is correct
120 Correct 10 ms 9804 KB Output is correct
121 Correct 258 ms 35468 KB Output is correct
122 Correct 349 ms 46948 KB Output is correct
123 Correct 359 ms 46936 KB Output is correct
124 Correct 9 ms 9676 KB Output is correct
125 Correct 9 ms 9676 KB Output is correct
126 Correct 8 ms 9676 KB Output is correct
127 Correct 543 ms 69140 KB Output is correct
128 Correct 537 ms 70340 KB Output is correct
129 Correct 556 ms 69540 KB Output is correct
130 Correct 10 ms 9932 KB Output is correct
131 Correct 12 ms 10188 KB Output is correct
132 Correct 248 ms 34792 KB Output is correct
133 Correct 377 ms 47184 KB Output is correct
134 Correct 531 ms 59796 KB Output is correct
135 Correct 517 ms 69772 KB Output is correct
136 Correct 518 ms 69824 KB Output is correct
137 Correct 483 ms 59292 KB Output is correct
138 Correct 407 ms 56792 KB Output is correct
139 Correct 393 ms 59352 KB Output is correct
140 Correct 11 ms 9676 KB Output is correct
141 Correct 71 ms 17300 KB Output is correct
142 Correct 17 ms 10940 KB Output is correct
143 Correct 43 ms 14148 KB Output is correct
144 Correct 65 ms 16744 KB Output is correct
145 Correct 249 ms 34364 KB Output is correct
146 Correct 322 ms 40552 KB Output is correct
147 Correct 379 ms 46432 KB Output is correct
148 Correct 434 ms 52348 KB Output is correct
149 Correct 509 ms 58228 KB Output is correct
150 Correct 510 ms 64716 KB Output is correct
151 Correct 546 ms 70280 KB Output is correct
152 Correct 11 ms 9932 KB Output is correct
153 Correct 13 ms 10340 KB Output is correct
154 Correct 227 ms 35484 KB Output is correct
155 Correct 354 ms 48344 KB Output is correct
156 Correct 497 ms 61124 KB Output is correct
157 Correct 9 ms 9600 KB Output is correct
158 Correct 9 ms 9688 KB Output is correct
159 Correct 10 ms 9692 KB Output is correct
160 Correct 9 ms 9676 KB Output is correct
161 Correct 406 ms 53244 KB Output is correct
162 Correct 503 ms 55784 KB Output is correct
163 Correct 503 ms 56520 KB Output is correct
164 Correct 547 ms 56364 KB Output is correct
165 Correct 424 ms 56092 KB Output is correct
166 Correct 373 ms 55884 KB Output is correct
167 Incorrect 133 ms 20252 KB a[40465] = 0 is not an odd integer
168 Halted 0 ms 0 KB -