제출 #1242727

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1242727		rdwabdellah	Split the Attractions (IOI19_split)	C++20	0 / 100	2094 ms	328 KiB

split

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;

vector<int> find_split(int n, int a, int b, int c, vector<int> p, vector<int> q){
    vector<vector<int>> G(n);
    int m = p.size();
    vector<int> ans(n,3);
    for (int i = 0; i < m; ++i){
        G[p[i]].push_back(q[i]);
        G[q[i]].push_back(p[i]);
    }
    int start = 0;
    for (int i = 0; i < n; ++i){
        if(G[i].size()==1){
            start = i;
            break;
        }
    }
    int cur = start;
    ans[start]=1;
    int cnt = 1;
    while(cnt<a){
        for(auto &i : G[cur]){
            if(ans[i]!=1){
                ans[i]=1;
                cur = i;
                ++cnt;
                break;
            }
        }
    }
    cnt = 0;
    while(cnt<b){
        for(auto &i : G[cur]){
            if(ans[i]==3){
                ans[i]=2;
                cur = i;
                ++cnt;
            }
        }
    }
    return ans;
}

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