제출 #419055

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
419055		EncryptingWolf	Split the Attractions (IOI19_split)	C++14	11 / 100	97 ms	10940 KiB

split

#include <vector>
#include <iostream>
#include <set>
#include <map>
using namespace std;
typedef long long ll;
#define FOR(i,x,y) for (ll i = x; i <y; i++)

vector<vector<int>> adj;

vector<int> ret;
int counts = 0;
int B;
void dfs(int x)
{
	if (counts >= B)
		return;
	if (ret[x] == 2)
		return;
	ret[x] = 2;
	counts++;

	for (auto i : adj[x])
		dfs(i);
}

vector<int> find_split(int n, int a, int b, int c, vector<int> p, vector<int> q)
{
	B = b;
	adj.resize(n);
	ret.resize(n, 3);
	FOR(i, 0, p.size())
	{
		adj[p[i]].push_back(q[i]);
		adj[q[i]].push_back(p[i]);
	}
	dfs(0);
	FOR(i, 0, n)
	{
		if (ret[i] != 2)
		{
			ret[i] = 1;
			return ret;
		}
	}

	return ret;
}

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

split.cpp: In function 'std::vector<int> find_split(int, int, int, int, std::vector<int>, std::vector<int>)':
split.cpp:7:37: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    7 | #define FOR(i,x,y) for (ll i = x; i <y; i++)
......
   32 |  FOR(i, 0, p.size())
      |      ~~~~~~~~~~~~~~                  
split.cpp:32:2: note: in expansion of macro 'FOR'
   32 |  FOR(i, 0, p.size())
      |  ^~~

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