Submission #1242740

#	Time	Username	Problem	Language	Result	Execution time	Memory
1242740		rdwabdellah	Split the Attractions (IOI19_split)	C++20	0 / 100	40 ms	8772 KiB

split

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int cnt = 1;
void DFS(vector<vector<int>> &G, int node, vector<int> &ans, int b){
    if(cnt>=b) return;
    for(auto &i : G[node]){
        if(ans[i]==2) continue;
        ans[i]=2;       
        ++cnt;
        if(cnt==b) return;
        DFS(G,i,ans,b);
    }
}

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]);
    }
    ans[0]=2;
    DFS(G,0,ans,b);
    for (int i = 0; i < n; ++i){
        if(ans[i]==3){
            ans[i]=1;
            break;
        }
    }
    return ans;
}

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