제출 #369833

#제출 시각아이디문제언어결과실행 시간메모리
369833MilosMilutinovicSplit the Attractions (IOI19_split)C++14
0 / 100
784 ms1048580 KiB
#include "split.h"
#include <bits/stdc++.h>
using namespace std;

#define pb push_back

const int mxN=1e5;
vector<int> g[mxN], euler;

void dfs(int u, int p = -1) {
	euler.pb(u);
	for(int i:g[u])
		if(i!=p)
			dfs(i, u);
}

vector<int> find_split(int n, int a, int b, int c, vector<int> u, vector<int> v) {
	int m=(int)u.size();
	for(int i=0; i<m; ++i)
		g[u[i]].pb(v[i]), g[v[i]].pb(u[i]);
	int root;
	for(int i=0; i<n; ++i)
		if((int)g[i].size()==1)
			root=i;
	dfs(root);
	vector<int> ans(n);
	for(int i:euler) {
		if(a>0)
			ans[i]=1, --a;
		else
			if(b>0)
				ans[i]=2, --b;
			else
				ans[i]=3;
	}
	return ans;
}

/*int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);

	return 0;
}*/

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

split.cpp: In function 'std::vector<int> find_split(int, int, int, int, std::vector<int>, std::vector<int>)':
split.cpp:25:5: warning: 'root' may be used uninitialized in this function [-Wmaybe-uninitialized]
   25 |  dfs(root);
      |  ~~~^~~~~~
#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...