Submission #1211191

#TimeUsernameProblemLanguageResultExecution timeMemory
1211191AvianshSphinx's Riddle (IOI24_sphinx)C++20
10 / 100
40 ms908 KiB
#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);
    vector<int>ans(n,-1);
    int m = x.size();
    for(int i = 0;i<m;i++){
        if(ans[x[i]]==-1){
            //find for x[i] using y[i]
            fill(e.begin(),e.end(),n);
            e[x[i]]=-1;
            int mnval = 1e9;
            int minimaj = -1;
            for(int j =0;j<n;j++){
                e[y[i]]=j;
                int a = perform_experiment(e);
                if(a<mnval){
                    mnval=a;
                    minimaj=j;
                }
            }
            ans[x[i]]=minimaj;
        }
        if(ans[y[i]]==-1){
            fill(e.begin(),e.end(),n);
            e[y[i]]=-1;
            int mnval = 1e9;
            int minimaj = -1;
            for(int j = 0;j<n;j++){
                e[x[i]]=j;
                int a = perform_experiment(e);
                if(a<mnval){
                    mnval=a;
                    minimaj=j;
                }
            }
            ans[y[i]]=minimaj;
        }
    }
    return ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...