제출 #1211198

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1211198		Aviansh	스핑크스 (IOI24_sphinx)	C++20	18 / 100	20 ms	412 KiB

sphinx

#include "sphinx.h"

#include <bits/stdc++.h>

using namespace std;

vector<int> find_colours(int n, vector<int> x, vector<int> y) {
    vector<int>e(n,n);
    vector<int>ans(n,-1);
    int m = x.size();
    //line case
    int curr = 0;
    for(int i = 0;i<n;i++){
        int lo = i;
        int hi = n-1;
        while(lo<hi){
            fill(e.begin(),e.end(),n);
            int mid = (lo+hi+1)/2;
            fill(e.begin()+i,e.begin()+mid+1,-1);
            int a = perform_experiment(e);
            if(i==0&&mid==n-1){
                if(a==1){
                    lo=mid;
                }
                else{
                    hi=mid-1;
                }
            }
            else if(i==0||mid==n-1){
                if(a==2){
                    lo=mid;
                }
                else{
                    hi=mid-1;
                }
            }
            else{
                if(a==3){
                    lo=mid;
                }
                else{
                    hi=mid-1;
                }
            }
        }
        fill(ans.begin()+i,ans.begin()+lo+1,curr);
        curr++;
        i=lo;
    }
    return ans;
}

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