제출 #1317820

#제출 시각아이디문제언어결과실행 시간메모리
1317820spetr스핑크스 (IOI24_sphinx)C++20
0 / 100
0 ms332 KiB
#include <bits/stdc++.h>
#include "sphinx.h"
using namespace std;

#define ll long long
const ll mmod = 998244353;  
#define vl vector<long long>
#define vll vector<vector<long long>>
#define pl pair<long long, long long>
#define vb vector<bool>



std::vector<int> find_colours(int N,
    std::vector<int> X, std::vector<int> Y){

    int n = N;
    vector<vector<int>> graf(n);

    vector<int> a;
    for (int i = 0; i < n; i++){
        a.push_back(n);
    }

    for (int i = 0; i < X.size(); i++){
        graf[X[i]].push_back(Y[i]);
        graf[Y[i]].push_back(X[i]);
    }

    vector<int> colors(n);
    colors[0] = 0;
    for (ll i = 0; i < n-1; i++){
        a[i] = -1;
        a[i+1] = -1;
        int d = perform_experiment(a);
        if (d == 2){
            colors[i+1] = colors[i];
        }
        else{
            colors[i+1] = 1^colors[i];
        }
        a[i] = n;
        a[i+1] = n;
    }
    
    return colors;



}

#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...