Submission #1317796

#TimeUsernameProblemLanguageResultExecution timeMemory
1317796spetrSphinx's Riddle (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> array {n, n}; for (ll i = 0; i < n; i++){ graf[X[i]].push_back(Y[i]); graf[Y[i]].push_back(X[i]); } vector<int> colors (n); for (ll i = 0; i < n; i++){ int v = graf[i][0]; array[i] = 0; array[v] = 1; int c = perform_experiment(array); int 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; }
#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...