제출 #232719

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
232719		UserIsUndefined	Split the Attractions (IOI19_split)	C++14	0 / 100	8 ms	5120 KiB

split

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

using namespace std;


vector<int> adj[100005];
vector<int> adj2[100005];

map<int,int> visited;
int children[100005];
vector<pair<int,int>> childidx;
int ans[100005];
int now, sz;


void counter(int s){
    visited[s] = true;

    for (int i : adj[s]){
        if (visited[i] == false){
            counter(i);
            children[s]+= children[i];
            adj2[s].push_back(i);
        }
    }

    children[s]++;

}





void dfs(int v){
    visited[v] = true;
    ans[v] = now;

    for (int i : adj2[v]){
        if ((visited[i] == false)&&(sz)){
            sz--;
            dfs(i);
        }
    }

}




vector<int> find_split(int n, int a, int b, int c, vector<int> p, vector<int> q) {
	vector<int> res(n, 0);
    vector<pair<int,int>> abc;

    abc.push_back({a, 1});
    abc.push_back({b, 2});
    abc.push_back({c, 3});

    sort(abc.begin() , abc.end());


    for (int i = 0 ; i < p.size() ; i++){
        int x = p[i];
        int y = q[i];
        adj[x].push_back(y);
        adj[y].push_back(x);
    }

    counter(0);


    for (int i = 0 ; i < n ; i++){
        childidx.push_back({children[i], i});
    }

    sort(childidx.begin(), childidx.end());


    visited.clear();

    int past = 0;

    for (int i = 0 ; i < 2 ; i++){
        now = abc[i].second;
        sz = abc[i].first;
        sz--;

        for (int j = past ; j < n ; j++){
            if (childidx[j].first >= sz){
                dfs(childidx[j].second);
                past = j + 1;
                break;
            }
        }

    }

    for (int i = 0 ; i < n ; i++){
        res[i] = (ans[i] == 0 ? abc[2].second : ans[i]);
    }

    return res;


}

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

split.cpp: In function 'std::vector<int> find_split(int, int, int, int, std::vector<int>, std::vector<int>)':
split.cpp:63:24: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     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