Submission #1204373

#	Time	Username	Problem	Language	Result	Execution time	Memory
1204373		perekopskad	Sphinx's Riddle (IOI24_sphinx)	C++20	28.50 / 100	111 ms	1472 KiB

sphinx

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

using namespace std;

typedef long long ll;

#define fr(i, l, r) for(ll (i) = l; (i) <= r; (i)++)
#define frb(i, r, l) for(ll (i) = r; (i) >= l; (i)--)
#define pb push_back
#define el '\n'

ll const N = 500 + 10;

ll n;
vector <ll> g[N];
bool used[N];
ll col[N];

void dfs(ll v) {
    used[v] = 1;
    for(ll u : g[v]) 
        if(!used[u] && col[v] == col[u])
            dfs(u);
}

ll count_comp() {
    fill(used, used + N, 0);

    ll res = 0;
    fr(i, 0, n - 1) {
        if(used[i])
            continue;
        dfs(i);
        res++;
    }
    return res;
}

std::vector<int> find_colours(int N, std::vector<int> X, std::vector<int> Y) {
    n = N;
    fr(i, 0, X.size() - 1) {
        ll u = X[i], v = Y[i];
        g[u].pb(v);
        g[v].pb(u);
    }

    vector <int> ans(N);

    vector <vector <int>> vec;
    vec.pb({0});

    fr(i, 1, N - 1)
        col[i] = N;

    fr(i, 1, N - 1) {
        vector <int> c(N, N);
        fill(col, col + N, N);

        for(int j = 0; j < vec.size(); j++) {
            for(ll x : vec[j]) {
                c[x] = -1;
                col[x] = j;
            }
        }
        
        c[i] = -1;
        col[i] = N + 1;

        ll cnt = count_comp();
        ll res = perform_experiment(c);

        if(res == cnt) {
            vec.pb({int(i)});
            col[i] = vec.size() - 1;
            continue;
        }

        ll l = 0, r = vec.size() - 1;
        while(l < r) {
            ll mid = (l + r) / 2;
            // check [l; mid]
            c.assign(N, N);
            fill(col, col + N, N);

            fr(j, l, mid) {
                for(ll x : vec[j]) {
                    c[x] = -1;
                    col[x] = j;
                }
            }

            c[i] = -1;

            col[i] = N + 1;
            ll cnt = count_comp();
            ll res = perform_experiment(c);

            if(cnt != res) r = mid;
            else l = mid + 1;
        }
        vec[l].pb(i);
        col[i] = l;
    }

    fr(i, 0, vec.size() - 1)
        for(ll x : vec[i])
            ans[x] = i;
    
    return ans;
}

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