제출 #1047561

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1047561		vjudge1	Split the Attractions (IOI19_split)	C++17	18 / 100	57 ms	18012 KiB

split

#include "split.h"
#include <bits/stdc++.h>
using namespace std;
#define sp " "
#define endl "\n"
#define pb push_back
#define pii pair<int, int>
#define st first
#define nd second
#define fileio() freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout)
#define fastio() cin.tie(0), ios_base::sync_with_stdio(0)
#define LL node * 2
#define RR node * 2 + 1
#define ll long long
#define MAXN 200005

vector<int> adj[MAXN];
int res[MAXN], vis[MAXN];


void dfs(int node, int par, vector<pii> &v){
	//assert(!v.empty());
	res[node] = v.back().nd;
	vis[node] = 1;
	v[v.size() - 1].st--;
	if (v.back().st == 0) v.pop_back();
	for (auto i : adj[node]){
		if (i == par || vis[i]) continue;
		dfs(i, node, v);
	}
}


vector<int> find_split(int n, int a, int b, int c, vector<int> p, vector<int> q) {
	for (int i = 0; i < p.size(); i++)
		adj[p[i]].pb(q[i]), adj[q[i]].pb(p[i]);
	vector<pii> v = {{a, 1}, {b, 2}, {c, 3}};
	sort(v.rbegin(), v.rend());
	int root = 0;
	for (int i = 0; i < n; i++) if (adj[i].size() == 1) root = i;
	dfs(root, -1, v);
	vector<int> ans(n);
	for (int i = 0; i < n; i++) ans[i] = res[i];
	return ans;
}
/*
int main() {
	fileio();
	int n, m, a, b, c;
	assert(5 == scanf("%d%d%d%d%d", &n, &m, &a, &b, &c));
	vector<int> p(m), q(m);
	for (int i=0; i<m; i++)
		assert(2 == scanf("%d%d", &p[i], &q[i]));
	fclose(stdin);

	vector<int> result = find_split(n, a, b, c, p, q);

	for (int i=0; i<(int)result.size(); i++)
		printf("%s%d", ((i>0)?" ":""), result[i]);
	printf("\n");
	fclose(stdout);
	return 0;
}*/

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

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

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