제출 #1243312

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1243312		SpyrosAliv	Sphinx's Riddle (IOI24_sphinx)	C++20	10 / 100	17 ms	1168 KiB

sphinx

#include "sphinx.h"
#include <bits/stdc++.h>
using namespace std;

int n, m;
vector<vector<int>> g;
const int MN = 51;
int par[MN], sz[MN];

int find(int u) {
    if (par[u] == u) return u;
    return par[u] = find(par[u]);
}

bool merge(int u, int v) {
    u = find(u);
    v = find(v);
    if ( u== v) return false;
    if (sz[u] > sz[v]) swap(u, v);
    par[u] = v;
    sz[v] += sz[u];
    return true;
}

int get_comps(vector<int> cols) {
    for (int i = 0; i < n; i++) {
        par[i] = i;
        sz[i] = 1;
    }
    int tot = n;
    for (int i = 0; i < n; i++) {
        for (auto nxt: g[i]) {
            if (cols[i] == cols[nxt]) {
                
                tot -= merge(i, nxt);;
            }
        }
    }
    return tot;
}

vector<int> find_colours(int N, vector<int> X, vector<int> Y) {
    n = N;
    m = Y.size();
    g.resize(n);
    for (int i = 0; i < m; i++) {
        g[X[i]].push_back(Y[i]);
        g[Y[i]].push_back(X[i]);
    }
    vector<int> ans(n, -1);
    for (int i = 0; i < n; i++) {
        int nxt = g[i][0];
        vector<int> willAsk(n, n);
        willAsk[i] = -1;
        for (int j = 0; j < n; j++) {
            willAsk[nxt] = j;
            int tot = perform_experiment(willAsk);
            if (tot != get_comps(willAsk)) {
                ans[i] = j;
                break;
            }
        }
    }
    return ans;
}

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