제출 #1130025

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1130025		math_rabbit_1028	스핑크스 (IOI24_sphinx)	C++20	24 / 100	46 ms	1156 KiB

sphinx

#include "sphinx.h"
using namespace std;

vector<int> adj[303];
vector<int> ch;
void dfs(int v) {
    ch[v] = 1;
    for (int u : adj[v]) {
        if (ch[u]) continue;
        dfs(u);
    }
}
int other(int N, int v, int u) {
    int ret = 0;
    ch = vector<int>(N, 0);
    ch[v] = ch[u] = 1;
    for (int i = 0; i < N; i++) {
        if (ch[i]) continue;
        dfs(i);
        ret++;
    }
    return ret;
}

vector<int> find_colours(int N, vector<int> X, vector<int> Y) {
    for (int i = 0; i < X.size(); i++) {
        adj[X[i]].push_back(Y[i]);
        adj[Y[i]].push_back(X[i]);
    }

    vector<int> C(N, 0);

    for (int i = 0; i < N; i++) {
        vector<int> E(N, N);
        E[i] = -1;
        int s = 0, e = N-1;
        while (s < e) {
            int m = (s+e)/2;
            int p = s;
            for (int j = 0; j < N; j++) {
                if (i == j) continue;
                E[j] = p;
                if (p < m) p++;
            }
            int x = perform_experiment(E);
            if (x == m-s+1) e = m;
            else s = m+1;
        }
        C[i] = s;
    }
    
    return C;
}

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