제출 #433526

#제출 시각아이디문제언어결과실행 시간메모리
433526JUANDI321Split the Attractions (IOI19_split)C++17
0 / 100
1 ms332 KiB
#include "split.h" #include <vector> using namespace std; vector<vector<int>> g; vector<int> res; int aa, bb, cc; void dfs(int node, int ant) { if(aa>0) { res[node]=1; aa--; } else if(bb>0) { res[node]=2; bb--; } else { res[node]=3; cc--; } for(int y : g[node]) { if(y!=ant) { dfs(y, node); } } } vector<int> find_split(int n, int a, int b, int c, vector<int> p, vector<int> q) { aa = a; bb = b; cc = c; //vector<int> res; for(int i = 0; i<p.size(); i++) { g[p[i]].push_back(q[i]); g[q[i]].push_back(p[i]); } int node =0; for(int i = 0; i<n; i++) { if(g[i].size()==1) { node = i; break; } } dfs(node, -1); return res; }

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

split.cpp: In function 'std::vector<int> find_split(int, int, int, int, std::vector<int>, std::vector<int>)':
split.cpp:40:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   40 |  for(int i = 0; i<p.size(); i++)
      |                 ~^~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...