oj.uz

Submission #351838

# Submission time Handle Problem Language Result Execution time Memory
351838 2021-01-20T08:39:36 Z juggernaut Tropical Garden (IOI11_garden) C++14
100 / 100
 134 ms 32236 KB 
#include "garden.h"
#include "gardenlib.h"
#include<stdio.h>
#include<algorithm>
#include<vector>
using namespace std;
 
int deg[150010], Mn[150010], F[300010], D[300010], n, Res[2010];
bool v[300010];
vector<int>E[300010];
 
void DFS(int a, int d){
	int i;
	D[a] = d;
	for (i = 0; i < E[a].size(); i++){
		if (D[E[a][i]] == -1)DFS(E[a][i], d + 1);
	}
}
 
int QQ, DD[300010];
struct Query{
	int a, num;
	bool operator<(const Query &p)const{
		return a < p.a;
	}
}w[2010];
 
int S[300010];
 
void Do(int a){
	int i, x, c = 0, cnt = 0, pv;
	for (i = 0; i < 2 * n; i++){
		D[i] = -1;
		v[i] = false;
		S[i] = 0;
	}
	DFS(a, 0);
	for (i = 0; i < n; i++){
		if (D[i] != -1){
			DD[cnt++] = D[i];
		}
	}
	sort(DD, DD + cnt);
	x = a;
	while (!v[x]){
		c++;
		v[x] = true;
		x = F[x];
	}
	if (x != a){
		c = 1000000009;
	}
	pv = 0;
	for (i = 0; i < QQ; i++){
		while (pv < cnt && DD[pv] <= w[i].a){
			S[DD[pv] % c]++;
			pv++;
		}
		if (w[i].a%c > 2 * n)continue;
		Res[w[i].num] += S[w[i].a%c];
	}
}
 
void Add(int a, int b, int i){
	if (Mn[a] == i){
		if (Mn[b] != i || deg[b] == 1)F[a] = b;
		else F[a] = b + n;
	}
	else if (F[a + n] == -1){
		if (Mn[b] != i || deg[b] == 1)F[a + n] = b;
		else F[a + n] = b + n;
	}
}
 
void count_routes(int N, int M, int P, int R[][2], int Q, int G[])
{
	int i, a, b;
	n = N;
	QQ = Q;
	for (i = 0; i < Q; i++){
		w[i].a = G[i];
		w[i].num = i;
	}
	sort(w, w + Q);
	for (i = 0; i < 2 * N; i++)F[i] = -1;
	for (i = 0; i < M; i++){
		a = R[i][0], b = R[i][1];
		deg[a]++, deg[b]++;
		if (!Mn[a])Mn[a] = i + 1;
		if (!Mn[b])Mn[b] = i + 1;
	}
	for (i = 0; i < M; i++){
		a = R[i][0], b = R[i][1];
		Add(a, b, i+1);
		Add(b, a, i+1);
	}
	for (i = 0; i < N; i++){
		E[F[i]].push_back(i);
		if (deg[i]>1)E[F[i + N]].push_back(i + N);
	}
	Do(P);
	if (deg[P] != 1)Do(P + N);
	for (i = 0; i < Q; i++)answer(Res[i]);
}

Compilation message

garden.cpp: In function 'void DFS(int, int)':
garden.cpp:15:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   15 |  for (i = 0; i < E[a].size(); i++){
      |              ~~^~~~~~~~~~~~~

Subtask #1
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 7532 KB Output is correct
2 Correct 6 ms 7532 KB Output is correct
3 Correct 6 ms 7532 KB Output is correct
4 Correct 7 ms 7404 KB Output is correct
5 Correct 5 ms 7404 KB Output is correct
6 Correct 6 ms 7660 KB Output is correct
7 Correct 5 ms 7404 KB Output is correct
8 Correct 7 ms 7532 KB Output is correct
9 Correct 7 ms 7532 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 7532 KB Output is correct
2 Correct 6 ms 7532 KB Output is correct
3 Correct 6 ms 7532 KB Output is correct
4 Correct 7 ms 7404 KB Output is correct
5 Correct 5 ms 7404 KB Output is correct
6 Correct 6 ms 7660 KB Output is correct
7 Correct 5 ms 7404 KB Output is correct
8 Correct 7 ms 7532 KB Output is correct
9 Correct 7 ms 7532 KB Output is correct
10 Correct 5 ms 7404 KB Output is correct
11 Correct 14 ms 9324 KB Output is correct
12 Correct 26 ms 10476 KB Output is correct
13 Correct 73 ms 24556 KB Output is correct
14 Correct 81 ms 17516 KB Output is correct
15 Correct 128 ms 18284 KB Output is correct
16 Correct 97 ms 15340 KB Output is correct
17 Correct 82 ms 14316 KB Output is correct
18 Correct 26 ms 10476 KB Output is correct
19 Correct 85 ms 17516 KB Output is correct
20 Correct 134 ms 18052 KB Output is correct
21 Correct 101 ms 15468 KB Output is correct
22 Correct 82 ms 14060 KB Output is correct
23 Correct 89 ms 18412 KB Output is correct

Subtask #3
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 7532 KB Output is correct
2 Correct 6 ms 7532 KB Output is correct
3 Correct 6 ms 7532 KB Output is correct
4 Correct 7 ms 7404 KB Output is correct
5 Correct 5 ms 7404 KB Output is correct
6 Correct 6 ms 7660 KB Output is correct
7 Correct 5 ms 7404 KB Output is correct
8 Correct 7 ms 7532 KB Output is correct
9 Correct 7 ms 7532 KB Output is correct
10 Correct 5 ms 7404 KB Output is correct
11 Correct 14 ms 9324 KB Output is correct
12 Correct 26 ms 10476 KB Output is correct
13 Correct 73 ms 24556 KB Output is correct
14 Correct 81 ms 17516 KB Output is correct
15 Correct 128 ms 18284 KB Output is correct
16 Correct 97 ms 15340 KB Output is correct
17 Correct 82 ms 14316 KB Output is correct
18 Correct 26 ms 10476 KB Output is correct
19 Correct 85 ms 17516 KB Output is correct
20 Correct 134 ms 18052 KB Output is correct
21 Correct 101 ms 15468 KB Output is correct
22 Correct 82 ms 14060 KB Output is correct
23 Correct 89 ms 18412 KB Output is correct
24 Correct 6 ms 7404 KB Output is correct
25 Correct 15 ms 9324 KB Output is correct
26 Correct 30 ms 10476 KB Output is correct
27 Correct 61 ms 24556 KB Output is correct
28 Correct 84 ms 17516 KB Output is correct
29 Correct 123 ms 18156 KB Output is correct
30 Correct 119 ms 15340 KB Output is correct
31 Correct 85 ms 14316 KB Output is correct
32 Correct 26 ms 10476 KB Output is correct
33 Correct 82 ms 17516 KB Output is correct
34 Correct 122 ms 18156 KB Output is correct
35 Correct 92 ms 15212 KB Output is correct
36 Correct 94 ms 14188 KB Output is correct
37 Correct 87 ms 18540 KB Output is correct
38 Correct 93 ms 32236 KB Output is correct