Submission #7511

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
7511	2014-08-10 07:03:43	baneling100	Tropical Garden (IOI11_garden)	C++98	100 / 100	4106 ms	9772 KiB

garden

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include "garden.h"
#include "gardenlib.h"
#include <vector>
#define INF 0x7fffffff
using namespace std;
int First[150001], Second[150001], A[300001], D[300001][2], Check[300001], K, Cycle1, Cycle2;
void DFS(int Now)
{
    if(!Check[A[Now]])
    {
        Check[A[Now]]=1;
        DFS(A[Now]);
    }
    if(D[A[Now]][K]!=INF)
        D[Now][K]=D[A[Now]][K]+1;
}
void count_routes(int N, int M, int P, int R[][2], int Q, int G[])
{
    int i, j, Cnt;
    for(i=0 ; i<N ; i++)
        First[i]=Second[i]=-1;
    for(i=0 ; i<M ; i++)
    {
        if(First[R[i][0]]==-1)
            First[R[i][0]]=R[i][1];
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 49 / 49
• Subtask 2: 20 / 20
• Subtask 3: 31 / 31