제출 #85650

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
85650		mirbek01	Tropical Garden (IOI11_garden)	C++17	0 / 100	36 ms	3508 KiB

garden

#include "garden.h"
#include "gardenlib.h"
#include <bits/stdc++.h>

using namespace std;

const int MAXN = 1e5 + 2;

int k, ans, p, cnt[MAXN], used[MAXN];
vector <int> g[MAXN];

bool dfs(int v){
      int c = k;
      int pr = v;
      while(c --){
            if(g[v][0] == pr && g[v].size() > 1){
                  pr = v;
                  v = g[v][1];
            } else {
                  pr = v;
                  v = g[v][0];
            }
      }
      return v == p;
}

void count_routes(int N, int M, int P, int R[][2], int Q, int G[]){
      for(int i = 0; i < M; i ++){
            int u = R[i][0], v = R[i][1];
            if(g[u].size() < 2)
            g[u].push_back(v);
            if(g[v].size() < 2)
            g[v].push_back(u);
      }
      p = P;
      for(int i = 0; i < Q; i ++){
            k = G[i];
            ans = 0;
            for(int i = 1; i < N; i ++){
                  memset(cnt, 0, sizeof(cnt));
                  memset(used, 0, sizeof(used));
                  ans += dfs(i);
            }
            answer(ans);
      }
}

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