Submission #1047306

#	Time	Username	Problem	Language	Result	Execution time	Memory
1047306		vjudge1	Split the Attractions (IOI19_split)	C++17	7 / 100	36 ms	20132 KiB

split

#include "split.h"
#include<bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back
const int N = 5e5;

vector<int> g[N];
vector<int> find_split(int n, int a, int b, int c, vector<int> Y, vector<int> X) {
	vector<int> res(n, 0);
	for(int i = 0; i < Y.size(); ++i){
		g[Y[i]].pb(X[i]);
		g[X[i]].pb(Y[i]);
	}

	queue<int> q;
	q.push(0);
	vector<bool> vis(n);
	vis[0] = 1;
	while(!q.empty()){
		int v = q.front();
		q.pop();
		if(a > 0){
			res[v] = 1;
			--a;
		}else if(b > 0){
			res[v] = 2;
			--b;
		}
		for(int u: g[v]){
			if(!vis[u]){
				vis[u] = 1;
				q.push(u);
			}
		}
	}

	for(int &c: res) if(c == 0) c = 3;

	return res;
}

Compilation message (stderr)

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

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