Submission #116579

# Submission time Handle Problem Language Result Execution time Memory
116579 2019-06-13T02:18:47 Z dragonslayerit Tropical Garden (IOI11_garden) C++14
100 / 100
193 ms 41976 KB
#include "garden.h"
#include "gardenlib.h"
#include <vector>
#include <queue>
#include <cstdio>
#include <algorithm>

const int INF=1e9+7;

static std::vector<int> adj[150005];
static int to[300005];
static std::vector<int> from[300005];

static int dist[2][300005];

static std::vector<int> at[2][300005];

static void bfs(int start,int* dist){
  std::queue<int> q;
  q.push(start);
  while(!q.empty()){
    int node=q.front();
    q.pop();
    for(int child:from[node]){
      if(!dist[child]){
	dist[child]=dist[node]+1;
	q.push(child);
      }
    }
  }
}

void count_routes(int N, int M, int P, int R[][2], int Q, int G[])
{
  for(int i=0;i<M;i++){
    adj[R[i][0]].push_back(R[i][1]);
    adj[R[i][1]].push_back(R[i][0]);
  }
  for(int i=0;i<N;i++){
    to[i<<1]=(adj[i][0]<<1)|(i==adj[adj[i][0]][0]);
    if(adj[i].size()>1){
      to[i<<1|1]=(adj[i][1]<<1)|(i==adj[adj[i][1]][0]);
    }else{
      to[i<<1|1]=to[i<<1];
    }
  }
  for(int i=0;i<N*2;i++){
    from[to[i]].push_back(i);
  }
  bfs(P<<1,dist[0]);
  bfs(P<<1|1,dist[1]);
  int cycle[2];
  cycle[0]=dist[0][P<<1]?dist[0][P<<1]:INF;
  cycle[1]=dist[1][P<<1|1]?dist[1][P<<1|1]:INF;
  for(int d=0;d<2;d++){
    for(int i=0;i<N*2;i+=2){
      if(dist[d][i]){
	at[d][dist[d][i]%cycle[d]].push_back(dist[d][i]);
      }
    }
  }
  for(int d=0;d<2;d++){
    for(int i=0;i<N*2;i++){
      std::sort(at[d][i].begin(),at[d][i].end());
    }
  }
  for(int q=0; q<Q; q++){
    int K=G[q];
    int ans=0;
    /*
    for(int i=0;i<N*2;i+=2){
      if(dist[0][i]) ans+=(K>=dist[0][i]&&(K-dist[0][i])%cycle[0]==0);
      if(dist[1][i]) ans+=(K>=dist[1][i]&&(K-dist[1][i])%cycle[1]==0);
    }
    */
    for(int d=0;d<2;d++){
      int rem=K%cycle[d];
      if(rem<N*2){
	ans+=std::upper_bound(at[d][rem].begin(),at[d][rem].end(),K)-at[d][rem].begin();
      }
    }
    answer(ans);
  }
}


# Verdict Execution time Memory Grader output
1 Correct 25 ms 25088 KB Output is correct
2 Correct 25 ms 25088 KB Output is correct
3 Correct 27 ms 25068 KB Output is correct
4 Correct 24 ms 25088 KB Output is correct
5 Correct 23 ms 24960 KB Output is correct
6 Correct 25 ms 25088 KB Output is correct
7 Correct 24 ms 24960 KB Output is correct
8 Correct 25 ms 25060 KB Output is correct
9 Correct 26 ms 25336 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 25 ms 25088 KB Output is correct
2 Correct 25 ms 25088 KB Output is correct
3 Correct 27 ms 25068 KB Output is correct
4 Correct 24 ms 25088 KB Output is correct
5 Correct 23 ms 24960 KB Output is correct
6 Correct 25 ms 25088 KB Output is correct
7 Correct 24 ms 24960 KB Output is correct
8 Correct 25 ms 25060 KB Output is correct
9 Correct 26 ms 25336 KB Output is correct
10 Correct 24 ms 25088 KB Output is correct
11 Correct 84 ms 27380 KB Output is correct
12 Correct 55 ms 29192 KB Output is correct
13 Correct 81 ms 41976 KB Output is correct
14 Correct 137 ms 38736 KB Output is correct
15 Correct 192 ms 40408 KB Output is correct
16 Correct 145 ms 35960 KB Output is correct
17 Correct 125 ms 35264 KB Output is correct
18 Correct 53 ms 29176 KB Output is correct
19 Correct 121 ms 39544 KB Output is correct
20 Correct 158 ms 40412 KB Output is correct
21 Correct 116 ms 35832 KB Output is correct
22 Correct 127 ms 35320 KB Output is correct
23 Correct 135 ms 39768 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 25 ms 25088 KB Output is correct
2 Correct 25 ms 25088 KB Output is correct
3 Correct 27 ms 25068 KB Output is correct
4 Correct 24 ms 25088 KB Output is correct
5 Correct 23 ms 24960 KB Output is correct
6 Correct 25 ms 25088 KB Output is correct
7 Correct 24 ms 24960 KB Output is correct
8 Correct 25 ms 25060 KB Output is correct
9 Correct 26 ms 25336 KB Output is correct
10 Correct 24 ms 25088 KB Output is correct
11 Correct 84 ms 27380 KB Output is correct
12 Correct 55 ms 29192 KB Output is correct
13 Correct 81 ms 41976 KB Output is correct
14 Correct 137 ms 38736 KB Output is correct
15 Correct 192 ms 40408 KB Output is correct
16 Correct 145 ms 35960 KB Output is correct
17 Correct 125 ms 35264 KB Output is correct
18 Correct 53 ms 29176 KB Output is correct
19 Correct 121 ms 39544 KB Output is correct
20 Correct 158 ms 40412 KB Output is correct
21 Correct 116 ms 35832 KB Output is correct
22 Correct 127 ms 35320 KB Output is correct
23 Correct 135 ms 39768 KB Output is correct
24 Correct 24 ms 25060 KB Output is correct
25 Correct 35 ms 27392 KB Output is correct
26 Correct 52 ms 29176 KB Output is correct
27 Correct 77 ms 41964 KB Output is correct
28 Correct 133 ms 39672 KB Output is correct
29 Correct 169 ms 40580 KB Output is correct
30 Correct 126 ms 36080 KB Output is correct
31 Correct 108 ms 35320 KB Output is correct
32 Correct 55 ms 29300 KB Output is correct
33 Correct 158 ms 39272 KB Output is correct
34 Correct 193 ms 40492 KB Output is correct
35 Correct 144 ms 36092 KB Output is correct
36 Correct 121 ms 35468 KB Output is correct
37 Correct 146 ms 39908 KB Output is correct