제출 #1242712

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1242712		mohamedboukerche55	Split the Attractions (IOI19_split)	C++20	7 / 100	35 ms	7752 KiB

split

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


vector<int> find_split(int n, int a, int b, int c, vector<int> p, vector<int> q) {
    
    vector<vector<ll>> hello(n);

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

	vector<int> ans(n);

    int curr = 1, nd = 0, par = -1;

    for (int i = 0; i < n; i++)
    {
        if (hello[i].size() == 1)
            nd = i;
    }
        

    for (int i = 0; i < n; i++)
    {
        if (i == a || i == a + b)
        {
            curr++;
        }

        ans[nd] = curr;

        for (auto &x : hello[nd])
        {
            if (x != par)
            {
                par = nd;
                nd = x;
                break;
            }
        }
    }

	return ans;
}

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