제출 #1225599

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

sphinx

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

using namespace std;

const int N = 256;
int cor[N];

std::vector<int> find_colours(int n, std::vector<int> X, std::vector<int> Y) {
    for(int i = 0;i < n;i++){
        int l = 0, r = n-1;
        vector <int> v;
        while(l < r){
            int mid = (l+r)/2;
            for(int j = 0;j < n;j++){
                v.push_back(n);
            }
            v[i] = -1;
            int cnt = l;
            int tot = 2;
            for(int j = 0;j < n;j++){
                if(j == i)
                    continue;
                v[j] = cnt;
                cnt++;
                tot++;
                if(cnt > mid)
                    break;
            }
            bool aux = true;
            for(auto x : v){
                if(x == n)
                    aux = false;
            }
            if(aux)
                tot--;
            int check = perform_experiment(v);
            /*for(auto x : v){
                cout << x << ' ';
            }
            cout << '\n';
            cout << check << '\n';*/
            v.clear();
            if(check != tot){
                r = mid;
            }
            else{
                l = mid+1;
            }
        }
        cor[i] = l;
    }
    vector <int> ans;
    for(int i = 0;i < n;i++){
        ans.push_back(cor[i]);
    }
    return ans;
}

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