oj.uz

답안 #13480

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
13480 2015-02-21T21:06:46 Z ainta 열대 식물원 (Tropical Garden) (IOI11_garden) C++
100 / 100
 142 ms 27900 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 between signed and unsigned integer expressions [-Wsign-compare]
  for (i = 0; i < E[a].size(); i++){
              ~~^~~~~~~~~~~~~

Subtask #1
49.0 / 49.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 7476 KB Output is correct
2 Correct 9 ms 7588 KB Output is correct
3 Correct 10 ms 7580 KB Output is correct
4 Correct 8 ms 7408 KB Output is correct
5 Correct 8 ms 7404 KB Output is correct
6 Correct 9 ms 7544 KB Output is correct
7 Correct 8 ms 7416 KB Output is correct
8 Correct 9 ms 7572 KB Output is correct
9 Correct 10 ms 7580 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 7476 KB Output is correct
2 Correct 9 ms 7588 KB Output is correct
3 Correct 10 ms 7580 KB Output is correct
4 Correct 8 ms 7408 KB Output is correct
5 Correct 8 ms 7404 KB Output is correct
6 Correct 9 ms 7544 KB Output is correct
7 Correct 8 ms 7416 KB Output is correct
8 Correct 9 ms 7572 KB Output is correct
9 Correct 10 ms 7580 KB Output is correct
10 Correct 8 ms 7460 KB Output is correct
11 Correct 14 ms 9368 KB Output is correct
12 Correct 32 ms 10464 KB Output is correct
13 Correct 68 ms 21868 KB Output is correct
14 Correct 99 ms 17568 KB Output is correct
15 Correct 137 ms 18204 KB Output is correct
16 Correct 109 ms 15264 KB Output is correct
17 Correct 102 ms 14616 KB Output is correct
18 Correct 34 ms 11012 KB Output is correct
19 Correct 98 ms 18732 KB Output is correct
20 Correct 142 ms 19404 KB Output is correct
21 Correct 137 ms 16632 KB Output is correct
22 Correct 100 ms 15344 KB Output is correct
23 Correct 112 ms 19652 KB Output is correct

Subtask #3
31.0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 7476 KB Output is correct
2 Correct 9 ms 7588 KB Output is correct
3 Correct 10 ms 7580 KB Output is correct
4 Correct 8 ms 7408 KB Output is correct
5 Correct 8 ms 7404 KB Output is correct
6 Correct 9 ms 7544 KB Output is correct
7 Correct 8 ms 7416 KB Output is correct
8 Correct 9 ms 7572 KB Output is correct
9 Correct 10 ms 7580 KB Output is correct
10 Correct 8 ms 7460 KB Output is correct
11 Correct 14 ms 9368 KB Output is correct
12 Correct 32 ms 10464 KB Output is correct
13 Correct 68 ms 21868 KB Output is correct
14 Correct 99 ms 17568 KB Output is correct
15 Correct 137 ms 18204 KB Output is correct
16 Correct 109 ms 15264 KB Output is correct
17 Correct 102 ms 14616 KB Output is correct
18 Correct 34 ms 11012 KB Output is correct
19 Correct 98 ms 18732 KB Output is correct
20 Correct 142 ms 19404 KB Output is correct
21 Correct 137 ms 16632 KB Output is correct
22 Correct 100 ms 15344 KB Output is correct
23 Correct 112 ms 19652 KB Output is correct
24 Correct 9 ms 7416 KB Output is correct
25 Correct 19 ms 9592 KB Output is correct
26 Correct 34 ms 11020 KB Output is correct
27 Correct 71 ms 22880 KB Output is correct
28 Correct 100 ms 18780 KB Output is correct
29 Correct 142 ms 19492 KB Output is correct
30 Correct 116 ms 16552 KB Output is correct
31 Correct 104 ms 15496 KB Output is correct
32 Correct 33 ms 11000 KB Output is correct
33 Correct 108 ms 18876 KB Output is correct
34 Correct 134 ms 19504 KB Output is correct
35 Correct 113 ms 16192 KB Output is correct
36 Correct 112 ms 15108 KB Output is correct
37 Correct 99 ms 19404 KB Output is correct
38 Correct 110 ms 27900 KB Output is correct