Submission #991490

#	Time	Username	Problem	Language	Result	Execution time	Memory
991490		MarwenElarbi	Split the Attractions (IOI19_split)	C++17	11 / 100	48 ms	14428 KiB

split

#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define ll long long
#define pb push_back
const int nax=200005;
vector<int> adj[nax];
int aa;
vector<int> res;
vector<int> vis(nax);
int cur;
void dfs(int x){
    if(cur>=aa) return;
    vis[x]=true;
    res[x]=2;
    for(auto u:adj[x]){
        if(vis[u]) continue;
        cur++;
        dfs(u);
    }
}
vector<int> find_split(int n, int a, int b, int c, vector<int> p, vector<int> q){
    bool test=false;
    if(b>c){
        aa=b;
    }else{
        aa=c;
        test=true;
    }
    res.resize(n,0);
    for (int i = 0; i < (int)p.size(); ++i)
    {
        adj[p[i]].pb(q[i]);
        adj[q[i]].pb(p[i]);
    }
    dfs(0);
    bool nabba=false;
    for (int i = 0; i < n; ++i)
    {
        if(res[i]==0&&!nabba){
            res[i]=1;
            nabba=true;
        }else if(res[i]==0) res[i]=3;
        if(test&&res[i]==2) res[i]=3;
        else if(test&&res[i]==3) res[i]=2;
        //cout <<res[i]<<" ";
    }//cout <<endl;
    return res;
}

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