Submission #766705

#	Time	Username	Problem	Language	Result	Execution time	Memory
766705		t6twotwo	Split the Attractions (IOI19_split)	C++17	11 / 100	59 ms	12364 KiB

split

#include "split.h"
#include <bits/stdc++.h>
using namespace std;
vector<int> find_split(int n, int a, int b, int c, vector<int> p, vector<int> q) {
    int m = p.size();
    vector<vector<int>> adj(n);
    for (int i = 0; i < m; i++) {
        adj[p[i]].push_back(q[i]);
        adj[q[i]].push_back(p[i]);
    }
    if (a == 1) {
        vector<int> ans(n, 3);
        queue<int> q;
        q.push(0);
        ans[0] = 2;
        int cnt = 1;
        while (!q.empty()) {
            int x = q.front();
            q.pop();
            for (int y : adj[x]) {
                if (ans[y] == 3 && cnt < b) {
                    cnt++;
                    ans[y] = 2;
                    q.push(y);
                }
            }
        }
        for (int i = 0; i < n; i++) {
            if (ans[i] == 3) {
                ans[i] = 1;
                break;
            }
        }
        return ans;
    }
}

Compilation message (stderr)

split.cpp: In function 'std::vector<int> find_split(int, int, int, int, std::vector<int>, std::vector<int>)':
split.cpp:6:30: warning: control reaches end of non-void function [-Wreturn-type]
    6 |     vector<vector<int>> adj(n);
      |                              ^

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