oj.uz

답안 #116579

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
116579 2019-06-13T02:18:47 Z dragonslayerit 열대 식물원 (Tropical Garden) (IOI11_garden) C++14
100 / 100
 254 ms 48504 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);
  }
}

Subtask #1
49.0 / 49.0

# 결과 실행 시간 메모리 Grader output
1 Correct 31 ms 25080 KB Output is correct
2 Correct 26 ms 25144 KB Output is correct
3 Correct 26 ms 25080 KB Output is correct
4 Correct 25 ms 24952 KB Output is correct
5 Correct 25 ms 24952 KB Output is correct
6 Correct 28 ms 25080 KB Output is correct
7 Correct 20 ms 25052 KB Output is correct
8 Correct 25 ms 25052 KB Output is correct
9 Correct 26 ms 25252 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 31 ms 25080 KB Output is correct
2 Correct 26 ms 25144 KB Output is correct
3 Correct 26 ms 25080 KB Output is correct
4 Correct 25 ms 24952 KB Output is correct
5 Correct 25 ms 24952 KB Output is correct
6 Correct 28 ms 25080 KB Output is correct
7 Correct 20 ms 25052 KB Output is correct
8 Correct 25 ms 25052 KB Output is correct
9 Correct 26 ms 25252 KB Output is correct
10 Correct 25 ms 25052 KB Output is correct
11 Correct 39 ms 27092 KB Output is correct
12 Correct 58 ms 28596 KB Output is correct
13 Correct 89 ms 40928 KB Output is correct
14 Correct 156 ms 37576 KB Output is correct
15 Correct 186 ms 39244 KB Output is correct
16 Correct 140 ms 34632 KB Output is correct
17 Correct 142 ms 34004 KB Output is correct
18 Correct 77 ms 28820 KB Output is correct
19 Correct 170 ms 38240 KB Output is correct
20 Correct 200 ms 39104 KB Output is correct
21 Correct 167 ms 34668 KB Output is correct
22 Correct 139 ms 33996 KB Output is correct
23 Correct 158 ms 38408 KB Output is correct

Subtask #3
31.0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 31 ms 25080 KB Output is correct
2 Correct 26 ms 25144 KB Output is correct
3 Correct 26 ms 25080 KB Output is correct
4 Correct 25 ms 24952 KB Output is correct
5 Correct 25 ms 24952 KB Output is correct
6 Correct 28 ms 25080 KB Output is correct
7 Correct 20 ms 25052 KB Output is correct
8 Correct 25 ms 25052 KB Output is correct
9 Correct 26 ms 25252 KB Output is correct
10 Correct 25 ms 25052 KB Output is correct
11 Correct 39 ms 27092 KB Output is correct
12 Correct 58 ms 28596 KB Output is correct
13 Correct 89 ms 40928 KB Output is correct
14 Correct 156 ms 37576 KB Output is correct
15 Correct 186 ms 39244 KB Output is correct
16 Correct 140 ms 34632 KB Output is correct
17 Correct 142 ms 34004 KB Output is correct
18 Correct 77 ms 28820 KB Output is correct
19 Correct 170 ms 38240 KB Output is correct
20 Correct 200 ms 39104 KB Output is correct
21 Correct 167 ms 34668 KB Output is correct
22 Correct 139 ms 33996 KB Output is correct
23 Correct 158 ms 38408 KB Output is correct
24 Correct 25 ms 24952 KB Output is correct
25 Correct 39 ms 27128 KB Output is correct
26 Correct 60 ms 28660 KB Output is correct
27 Correct 91 ms 41048 KB Output is correct
28 Correct 154 ms 38404 KB Output is correct
29 Correct 254 ms 39184 KB Output is correct
30 Correct 151 ms 34768 KB Output is correct
31 Correct 142 ms 33948 KB Output is correct
32 Correct 60 ms 28692 KB Output is correct
33 Correct 150 ms 37908 KB Output is correct
34 Correct 184 ms 39148 KB Output is correct
35 Correct 145 ms 34816 KB Output is correct
36 Correct 149 ms 34068 KB Output is correct
37 Correct 154 ms 38420 KB Output is correct
38 Correct 165 ms 48504 KB Output is correct