제출 #718144

#제출 시각아이디문제언어결과실행 시간메모리
718144mseebacherSplit the Attractions (IOI19_split)C++17
7 / 100
68 ms12820 KiB
#include "split.h" #include <bits/stdc++.h> using namespace std; #define MAX_N (int) 1e5+5 vector<int> ad[MAX_N]; vector<int> res; vector<bool> vis(MAX_N); void dfs(int x,int a,int b,int c){ if(vis[x]) return; vis[x] = 1; if(a > 0){ res[x] = 1; --a; }else if(b > 0){ res[x] = 2; --b; }else{ res[x] = 3; } for(auto s: ad[x]){ dfs(s,a,b,c); } } vector<int> find_split(int n, int a, int b, int c, vector<int> p, vector<int> q) { for(int i = 0;i<(int)p.size();i++){ ad[p[i]].push_back(q[i]); ad[q[i]].push_back(p[i]); } res.assign(n,0); if(p.size() < n-1) return res; int start = 0; for(int i = 0;i<n;i++){ if(ad[i].size() == 1){ start = i; break; } } dfs(start,a,b,c); return res; }

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

split.cpp: In function 'std::vector<int> find_split(int, int, int, int, std::vector<int>, std::vector<int>)':
split.cpp:35:14: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   35 |  if(p.size() < n-1) return res;
      |     ~~~~~~~~~^~~~~
#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...