제출 #1317806

#제출 시각아이디문제언어결과실행 시간메모리
1317806spetr스핑크스 (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,0);
    for (int i = 0; i < n; i++){
        int v = graf[i][0];
        a[i] = 0;
        a[v] = 1;
        int c = perform_experiment(a);
        int d = c;
        a[i] = -1;
        a[v] = -1;
        while (c == d){
            a[v]++;
            d = perform_experiment(a);
        }
        colors[i] = d;
        a[i] = n;
        a[v] = 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...