제출 #347500

#제출 시각아이디문제언어결과실행 시간메모리
347500tengiz05Tropical Garden (IOI11_garden)C++17
0 / 100
5052 ms3820 KiB
#include "garden.h" #include "gardenlib.h" //~ #include "grader.cpp" #include <bits/stdc++.h> using namespace std; #define pb push_back const int N_ = 150005; int ans, n, m, target; vector<int> edges[N_]; vector<bool> used; int d; void dfs(int u){ if(d < 0)return; used[u] = true; if(d == 0){ if(u == target){ ans++; }d--; return; }d--; int last = -1; for(int i=0;i<edges[u].size();i++, i%=2){ int v = edges[u][i]; if(last == v)break; if(d < 0)return; if(used[v])continue; dfs(v); if(d == 0 && u == target){ ans++;d--;return; }last = v; }d--; } void count_routes(int N, int M, int P, int R[][2], int Q, int G[]){ target = P; n = N, m = M; for(int i=0;i<m;i++){ edges[R[i][0]].pb(R[i][1]); edges[R[i][1]].pb(R[i][0]); } for(int i=0;i<Q;i++){ ans=0; for(int j=0;j<n;j++){ used.assign(n,0); d = G[i]; dfs(j); }answer(ans); }return; }

컴파일 시 표준 에러 (stderr) 메시지

garden.cpp: In function 'void dfs(int)':
garden.cpp:22:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   22 |  for(int i=0;i<edges[u].size();i++, i%=2){
      |              ~^~~~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...