oj.uz

Submission #439893

# Submission time Handle Problem Language Result Execution time Memory
439893 2021-07-01T06:17:53 Z dutch Tropical Garden (IOI11_garden) C++17
100 / 100
 210 ms 27916 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], e[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 last[2][n+n];
	for(int j=0; j<2; ++j){
		for(int i=0; i<n; ++i){
			if(d[j][i] < INF) ++e[j][d[j][i]];
		}
		for(int i=r[j]; i<n+n; ++i){
			e[j][i] += e[j][i-r[j]];
		}
		for(int i=0; i<n+n; ++i) last[j][i % r[j]] = i;
	}
 
	for(int i=0; i<Q; ++i){
		int res = 0;
		for(int j=0; j<2; ++j){
			if(G[i] >= n+n && r[j] < 2*n){
				res += e[j][last[j][G[i] % r[j]]];
			}
			if(G[i] < n+n){
				res += e[j][G[i]];
			}
		}
		answer(res);
	}
}

Subtask #1
49.0 / 49.0

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

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 7372 KB Output is correct
2 Correct 6 ms 7372 KB Output is correct
3 Correct 5 ms 7500 KB Output is correct
4 Correct 5 ms 7372 KB Output is correct
5 Correct 5 ms 7372 KB Output is correct
6 Correct 6 ms 7480 KB Output is correct
7 Correct 6 ms 7320 KB Output is correct
8 Correct 6 ms 7372 KB Output is correct
9 Correct 9 ms 7500 KB Output is correct
10 Correct 6 ms 7372 KB Output is correct
11 Correct 16 ms 9644 KB Output is correct
12 Correct 29 ms 11128 KB Output is correct
13 Correct 57 ms 20948 KB Output is correct
14 Correct 109 ms 20676 KB Output is correct
15 Correct 136 ms 20824 KB Output is correct
16 Correct 94 ms 16632 KB Output is correct
17 Correct 73 ms 14808 KB Output is correct
18 Correct 26 ms 10552 KB Output is correct
19 Correct 88 ms 20596 KB Output is correct
20 Correct 135 ms 20736 KB Output is correct
21 Correct 98 ms 15860 KB Output is correct
22 Correct 78 ms 15300 KB Output is correct
23 Correct 91 ms 22004 KB Output is correct

Subtask #3
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 7372 KB Output is correct
2 Correct 6 ms 7372 KB Output is correct
3 Correct 5 ms 7500 KB Output is correct
4 Correct 5 ms 7372 KB Output is correct
5 Correct 5 ms 7372 KB Output is correct
6 Correct 6 ms 7480 KB Output is correct
7 Correct 6 ms 7320 KB Output is correct
8 Correct 6 ms 7372 KB Output is correct
9 Correct 9 ms 7500 KB Output is correct
10 Correct 6 ms 7372 KB Output is correct
11 Correct 16 ms 9644 KB Output is correct
12 Correct 29 ms 11128 KB Output is correct
13 Correct 57 ms 20948 KB Output is correct
14 Correct 109 ms 20676 KB Output is correct
15 Correct 136 ms 20824 KB Output is correct
16 Correct 94 ms 16632 KB Output is correct
17 Correct 73 ms 14808 KB Output is correct
18 Correct 26 ms 10552 KB Output is correct
19 Correct 88 ms 20596 KB Output is correct
20 Correct 135 ms 20736 KB Output is correct
21 Correct 98 ms 15860 KB Output is correct
22 Correct 78 ms 15300 KB Output is correct
23 Correct 91 ms 22004 KB Output is correct
24 Correct 6 ms 7344 KB Output is correct
25 Correct 15 ms 9688 KB Output is correct
26 Correct 27 ms 11084 KB Output is correct
27 Correct 47 ms 20948 KB Output is correct
28 Correct 113 ms 20664 KB Output is correct
29 Correct 124 ms 20844 KB Output is correct
30 Correct 84 ms 16616 KB Output is correct
31 Correct 78 ms 14688 KB Output is correct
32 Correct 28 ms 10436 KB Output is correct
33 Correct 92 ms 20616 KB Output is correct
34 Correct 145 ms 20828 KB Output is correct
35 Correct 92 ms 15812 KB Output is correct
36 Correct 83 ms 14700 KB Output is correct
37 Correct 89 ms 22032 KB Output is correct
38 Correct 210 ms 27916 KB Output is correct