제출 #91177

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

garden

#include "garden.h"
#include "gardenlib.h"

# include <bits/stdc++.h>

using namespace std;

const int MN = 1e5 + 2;

int vr, k, pt[MN];
bool fl;
vector <int> g[MN];

void dfs(int v, int d){
      if(fl)
            return ;
      if(d == k){
            vr = v;
            fl = 1;
            return ;
      }
      for(; pt[v] < (int)g[v].size();){
            int to = g[v][pt[v] ++];
            dfs(to, d + 1);
      }
}

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];
           g[u].push_back(v);
           g[v].push_back(u);
      }

      for(int i = 0; i < q; i ++){
            k = G[i];
            int ret = 0;
            for(int j = 0; j < n; j ++){
                  fl = 0;
                  vr = -1;
                  memset(pt, 0, sizeof(pt));
                  dfs(j, 0);
                  if(vr == p){
                        ret ++;
                  }
            }
            answer(ret);
      }
}

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