제출 #1177650

#제출 시각아이디문제언어결과실행 시간메모리
1177650madamadam3스핑크스 (IOI24_sphinx)C++20
3 / 100
1 ms412 KiB
#include "sphinx.h" #include <bits/stdc++.h> using namespace std; typedef long long ll; using vi = vector<int>; using vl = vector<ll>; using vvi = vector<vi>; using vvl = vector<vl>; int N, M; vvi adj; vi find_colours(int N, vi X, vi Y) { N = N, M = (int) X.size(); adj.assign(N, vi()); for (int i = 0; i < M; i++) { adj[X[i]].push_back(Y[i]); adj[Y[i]].push_back(X[i]); } vi G(N, 0); int CCs = perform_experiment(vi(N, -1)); if (N == 2) { if (CCs == 1) { for (int colour = 0; colour < N; colour++) { if (perform_experiment({colour, -1}) != 1) continue; G[0] = colour; G[1] = colour; } } else { for (int colour = 0; colour < N; colour++) { if (perform_experiment({colour, -1}) == 1) { G[1] = colour; } if (perform_experiment({-1, colour}) == 1) { G[0] = colour; } } } } return G; }
#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...