Submission #1202356

#TimeUsernameProblemLanguageResultExecution timeMemory
1202356PacybwoahSphinx's Riddle (IOI24_sphinx)C++20
10 / 100
8 ms1168 KiB
#include "sphinx.h"
#include<iostream>
#include<algorithm>
#include<vector>
#include<utility>
using namespace std;
typedef long long ll;
std::vector<int> find_colours(int n, std::vector<int> X, std::vector<int> Y){
    int m = (int)X.size();
    vector<vector<int>> graph(n);
    for(int i = 0; i < m; i++){
        graph[X[i]].push_back(Y[i]);
        graph[Y[i]].push_back(X[i]);
    }
    vector<int> que(n), ans(n, -1);
    if(n <= 50){
        for(int i = 0; i < n; i++){
            for(int j = 0; j < n; j++){
                for(int k = 0; k < n; k++) que[k] = j;
                que[i] = -1;
                if(perform_experiment(que) == 1){
                    ans[i] = j;
                    break;
                }
            }
        }
        return ans;
    }
}

Compilation message (stderr)

sphinx.cpp: In function 'std::vector<int> find_colours(int, std::vector<int>, std::vector<int>)':
sphinx.cpp:29:1: warning: control reaches end of non-void function [-Wreturn-type]
   29 | }
      | ^
#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...