oj.uz

Submission #439890

# Submission time Handle Problem Language Result Execution time Memory
439890 2021-07-01T05:57:33 Z dutch Tropical Garden (IOI11_garden) C++17
100 / 100
 1740 ms 25544 KB 
#include <bits/stdc++.h>
using namespace std;
#include "garden.h"
#include "gardenlib.h"

const int LIM = 1.5e5, INF = 2e9;

int n, cnt[LIM], c, d[2][LIM*2], p, r[2] = {INF, INF};
vector<int> g[LIM*2];

void dfs(int u, int dist){
	if(!d[c][u]) return void(r[c] = dist);
	d[c][u] = dist;
	for(int v : g[u]) dfs(v, dist + 1);
}
 
void count_routes(int N, int M, int P, int R[][2], int Q, int G[]){
	n = N, p = P;
	for(int i=0; i<M; ++i){
		for(int j=0; j<2; ++j){
			int u = R[i][j], v = R[i][!j];
			if(cnt[u] == 0) g[v + (!cnt[v])*n].push_back(u);
			if(cnt[u] == 1) g[v + (!cnt[v])*n].push_back(u+n);
		}
		for(int j=0; j<2; ++j) ++cnt[R[i][j]];
	}
	for(int u=0; u<n; ++u) if(cnt[u] < 2){
		for(int v : g[u+n]) g[u].push_back(v);
		g[u+n].clear();
	}
	for(c=0; c<2; ++c) fill(d[c], d[c]+2*n, INF);
	for(c=0; c<2; ++c) dfs(p+c*n, 0);

	int e[2][n];
	for(int u=0; u<n; ++u)
		for(int j=0; j<2; ++j)
			e[j][u] = d[j][u] % r[j];
 
	for(int i=0; i<Q; ++i){
		int res = 0, x[2] = {G[i] % r[0], G[i] % r[1]};
		for(int u=0; u<n; ++u)
			for(int j=0; j<2; ++j)
				if(d[j][u] <= G[i] && x[j] == e[j][u]) ++res;
		answer(res);
	}
}

Subtask #1
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 7384 KB Output is correct
2 Correct 6 ms 7372 KB Output is correct
3 Correct 6 ms 7372 KB Output is correct
4 Correct 7 ms 7372 KB Output is correct
5 Correct 5 ms 7372 KB Output is correct
6 Correct 6 ms 7500 KB Output is correct
7 Correct 6 ms 7372 KB Output is correct
8 Correct 6 ms 7372 KB Output is correct
9 Correct 8 ms 7372 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 7384 KB Output is correct
2 Correct 6 ms 7372 KB Output is correct
3 Correct 6 ms 7372 KB Output is correct
4 Correct 7 ms 7372 KB Output is correct
5 Correct 5 ms 7372 KB Output is correct
6 Correct 6 ms 7500 KB Output is correct
7 Correct 6 ms 7372 KB Output is correct
8 Correct 6 ms 7372 KB Output is correct
9 Correct 8 ms 7372 KB Output is correct
10 Correct 6 ms 7372 KB Output is correct
11 Correct 14 ms 9036 KB Output is correct
12 Correct 30 ms 10180 KB Output is correct
13 Correct 48 ms 20292 KB Output is correct
14 Correct 81 ms 17484 KB Output is correct
15 Correct 115 ms 17544 KB Output is correct
16 Correct 75 ms 14404 KB Output is correct
17 Correct 91 ms 13364 KB Output is correct
18 Correct 26 ms 10208 KB Output is correct
19 Correct 79 ms 17400 KB Output is correct
20 Correct 106 ms 17724 KB Output is correct
21 Correct 80 ms 14420 KB Output is correct
22 Correct 71 ms 13400 KB Output is correct
23 Correct 81 ms 18548 KB Output is correct

Subtask #3
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 7384 KB Output is correct
2 Correct 6 ms 7372 KB Output is correct
3 Correct 6 ms 7372 KB Output is correct
4 Correct 7 ms 7372 KB Output is correct
5 Correct 5 ms 7372 KB Output is correct
6 Correct 6 ms 7500 KB Output is correct
7 Correct 6 ms 7372 KB Output is correct
8 Correct 6 ms 7372 KB Output is correct
9 Correct 8 ms 7372 KB Output is correct
10 Correct 6 ms 7372 KB Output is correct
11 Correct 14 ms 9036 KB Output is correct
12 Correct 30 ms 10180 KB Output is correct
13 Correct 48 ms 20292 KB Output is correct
14 Correct 81 ms 17484 KB Output is correct
15 Correct 115 ms 17544 KB Output is correct
16 Correct 75 ms 14404 KB Output is correct
17 Correct 91 ms 13364 KB Output is correct
18 Correct 26 ms 10208 KB Output is correct
19 Correct 79 ms 17400 KB Output is correct
20 Correct 106 ms 17724 KB Output is correct
21 Correct 80 ms 14420 KB Output is correct
22 Correct 71 ms 13400 KB Output is correct
23 Correct 81 ms 18548 KB Output is correct
24 Correct 7 ms 7372 KB Output is correct
25 Correct 103 ms 9156 KB Output is correct
26 Correct 157 ms 10224 KB Output is correct
27 Correct 290 ms 20396 KB Output is correct
28 Correct 1000 ms 17640 KB Output is correct
29 Correct 784 ms 17736 KB Output is correct
30 Correct 389 ms 14404 KB Output is correct
31 Correct 440 ms 13380 KB Output is correct
32 Correct 163 ms 10196 KB Output is correct
33 Correct 1020 ms 17504 KB Output is correct
34 Correct 729 ms 17644 KB Output is correct
35 Correct 354 ms 14512 KB Output is correct
36 Correct 1004 ms 13472 KB Output is correct
37 Correct 771 ms 18556 KB Output is correct
38 Correct 1740 ms 25544 KB Output is correct