Submission #991392

#	Time	Username	Problem	Language	Result	Execution time	Memory
991392		amine_aroua	Split the Attractions (IOI19_split)	C++17	0 / 100	46 ms	13124 KiB

split

#include <cstdio>
#include <cassert>
#include <bits/stdc++.h>
#define Int long long
#define fore(i , n) for(int i = 0 ; i<n;i++)
#define pb push_back
#define forn(i , x , y) for(int i = x ; i >= y; i--)
using namespace std;
vector<int> ans;
vector<bool> vis;
vector<vector<int>>adj;
int a , b , c;
void dfs(int x , int cnt)
{
    if(cnt <= a)
        ans[x] = 1;
    else if(cnt <= a + b)
        ans[x] = 2;
    else
        ans[x] = 3;
    vis[x] = 1;
    for(auto u : adj[x])
    {
        if(!vis[u])
            dfs(u , cnt + 1);
    }
}
vector<int> find_split(int n, int _a , int _b , int _c , vector<int> p , vector<int> q)
{
    a = _a , b=_b , c = _c;
    ans.assign(n , 0);
    vis.assign(n , 0);
    adj.assign(n , {});
    int m = (int)p.size();
    fore(i , m)
    {
        adj[p[i]].pb(q[i]);
        adj[q[i]].pb(p[i]);
    }
    fore(i , n)
    {
        if((int)adj[i].size() == 1)
        {
            dfs(i , 1);
            break;
        }
    }
    dfs(0 , 1);
    return ans;
}
//int main() {
//    int n, m, A, B, C;
//    assert(5 == scanf("%d%d%d%d%d", &n, &m, &A, &B, &C));
//    vector<int> p(m), q(m);
//    for (int i=0; i<m; i++)
//        assert(2 == scanf("%d%d", &p[i], &q[i]));
//    fclose(stdin);
//
//    vector<int> result = find_split(n, A, B, C, p, q);
//
//    for (int i=0; i<(int)result.size(); i++)
//        printf("%s%d", ((i>0)?" ":""), result[i]);
//    printf("\n");
//    fclose(stdout);
//    return 0;
//}

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