| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1317794 | spetr | 스핑크스 (IOI24_sphinx) | C++20 | 0 ms | 0 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){
ll n = N;
vll graf(n);
vl array {n, n};
for (ll i = 0; i < n; i++){
graf[X[i]].push_back(Y[i]);
graf[Y[i]].push_back(X[i]);
}
vl colors (n);
for (ll i = 0; i < n; i++){
ll v = graf[i][0];
array[i] = 0;
array[v] = 1;
ll c = perform_experiment(array);
ll d = c;
array[i] = -1;
array[v] = -1;
while (c == d){
array[v]++;
d = perform_experiment(array);
}
colors[i] = d;
array[i] = n;
array[v] = n;
}
return colors;
}