제출 #520995

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
520995		zsombor	Split the Attractions (IOI19_split)	C++17	0 / 100	2 ms	2636 KiB

split

#include "split.h"
#include <bits/stdc++.h>

using namespace std;

int bcount;
vector <vector <int>> g(1e5);
vector <bool> bo(1e5,true);
vector<int> res;

void dfs(int x){
    if (bcount==-1 || !bo[x]) return;
    if (bcount==0){
        res[x]=1;
        return;
    }
    res[x]=2;
    bcount--;
    bo[x]=false;
    for (int i : g[x]) dfs(i);
}


vector<int> find_split(int n, int a, int b, int c, vector<int> p, vector<int> q) {
	res.resize(n,0);
	int cur=0;
	if (a == 1) {
        fill(res.begin(),res.end(),3);
		bcount=b;
		dfs(0);
	} else {
		for (int i=0;i<p.size();i++){
            g[p[i]].push_back(q[i]);
            g[q[i]].push_back(p[i]);
		}
        for (int i=0;i<n;i++) if (g[i].size()==1) cur = i;
        for (int i = 0;i<a;i++){
            res[cur]=1;
            bo[cur]=false;
            if (bo[g[i][0]]){
                cur=g[i][0];
            }else{
                cur=g[i][1];
            }
        }
        for (int i = 0;i<b;i++){
            res[cur]=2;
            bo[cur]=false;
            if (bo[g[i][0]]){
                cur=g[i][0];
            }else{
                cur=g[i][1];
            }
        }
        for (int i = 0;i<c;i++){
            res[cur]=3;
            bo[cur]=false;
            if (bo[g[i][0]]){
                cur=g[i][0];
            }else{
                cur=g[i][1];
            }
        }
	}
	return res;
}

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

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

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