제출 #169932

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
169932		socho	Split the Attractions (IOI19_split)	C++14	7 / 100	120 ms	12608 KiB

split

#include "bits/stdc++.h"
#include "split.h"
using namespace std;

int A, B, C, N;
const int MXN = 100005;
vector<int> adj[MXN];
int res[MXN];
vector<int> order;

void dfsord(int node, int last) {
	order.push_back(node);
	for (int i=0; i<adj[node].size(); i++) {
		int ot = adj[node][i];
		if (ot == last) continue;
		dfsord(ot, node);
		return;
	}
}

void line(int end) {
	dfsord(end, -1);
}

vector<int> find_split(int n, int a, int b, int c, vector<int> p, vector<int> q) {
	A = a;
	B = b;
	C = c;
	N = n;
	for (int i=0; i<n-1; i++) {
		adj[p[i]].push_back(q[i]);
		adj[q[i]].push_back(p[i]);
	}
	int mn = 0;
	for (int i=0; i<n; i++) {
		if (adj[i].size() < adj[mn].size()) {
			mn = i;
		}
	}
	line(mn);
	vector<int> re(n);
	for (int i=0; i<n; i++) {
		if (i < a) re[order[i]] = 1;
		else if (i - a < b) re[order[i]] = 2;
		else re[order[i]] = 3;
	}
	return re;
}

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

split.cpp: In function 'void dfsord(int, int)':
split.cpp:13:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i=0; i<adj[node].size(); i++) {
                ~^~~~~~~~~~~~~~~~~

• Subtask 1: 7 / 7
• Subtask 2: 0 / 11
• Subtask 3: 0 / 22
• Subtask 4: 0 / 24
• Subtask 5: 0 / 36