Submission #1242955

#	Time	Username	Problem	Language	Result	Execution time	Memory
1242955		ericl23302	Sphinx's Riddle (IOI24_sphinx)	C++20	0 / 100	0 ms	412 KiB

sphinx

#include "sphinx.h"
#include <bits/stdc++.h> 

using namespace std;

void dfs(int cur, vector<bool> &visited, vector<vector<int>> &adjacency, int erased) {
    visited[cur] = true;
    for (auto &i : adjacency[cur]) {
        if (visited[i] || i == erased) continue;
        dfs(i, visited, adjacency, erased);
    }
}

int countComponents(int erased, int N, vector<vector<int>> &adjacency) {
    vector<bool> visited(N, false);
    int cnt = 1;
    for (int i = 0; i < N; ++i) {
        if (visited[i] || i == erased) continue;
        dfs(i, visited, adjacency, erased);
        ++cnt;
    }
    return cnt;
}

std::vector<int> find_colours(int N, std::vector<int> X, std::vector<int> Y) {
    vector<int> G(N, -1);
    // vector<vector<int>> adjacency(N);
    // for (int i = 0; i < X.size(); ++i) {
    //     adjacency[X[i]].push_back(Y[i]);
    //     adjacency[Y[i]].push_back(X[i]);
    // }
    for (int i = 0; i < N; ++i) {
        int left = 0, right = N; 
        while (left < right - 1) {
            int mid = (left + right) / 2;
            vector<int> E(N, N);
            E[i] = -1;
            int cur = left;
            for (int j = 0; j < N; ++j) {
                if (i == j) continue;
                if (cur >= mid) break;
                E[j] = cur++;
            }
            int expected = mid - left + 3;
            int nCnt = 0;
            for (int i : E) {
                if (i == N) ++nCnt;
            }
            if (nCnt == 0) --expected;

            if (perform_experiment(E) < expected) right = mid;
            else left = mid;
        }
        G[i] = left;
    }

    return G;
}

• Subtask 0: 0 / 0
• Subtask 1: 0 / 3
• Subtask 2: 0 / 7
• Subtask 3: 0 / 33
• Subtask 4: 0 / 21
• Subtask 5: 0 / 36