Submission #589439

#	Time	Username	Problem	Language	Result	Execution time	Memory
589439		Soumya1	Split the Attractions (IOI19_split)	C++17	7 / 100	87 ms	10984 KiB

split

#include "split.h"
#include <bits/stdc++.h>
using namespace std;
const int mxN = 1e5 + 5;
vector<int> ad[mxN];
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++) {
		ad[p[i]].push_back(q[i]);
		ad[q[i]].push_back(p[i]);
	}
	int start = 0;
	vector<int> deg(n);
	for (int i : p) deg[i]++;
	for (int i : q) deg[i]++;
	for (int i = 0; i < n; i++) {
		if (deg[i] == 1) start = i;
	}
	vector<int> ans(n);
	int cur = 0;
	while (!ans[start]) {
		cur++;
		if (cur <= a) ans[start] = 1;
		else if (cur <= a + b) ans[start] = 2;
		else ans[start] = 3;
		for (int to : ad[start]) {
			if (!ans[to]) start = to;
		}
	}
	return ans;
}

Compilation message (stderr)

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

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