Submission #1217993

#TimeUsernameProblemLanguageResultExecution timeMemory
1217993dostsSphinx's Riddle (IOI24_sphinx)C++20
0 / 100
16 ms31720 KiB
#include "sphinx.h" #include <bits/stdc++.h> #pragma GCC optimize("O3,unroll-loops") #pragma GCC target("avx2") #define int long long #define pii pair<int,int> #define vi vector<int> #define ff first #define ss second #define sp << " " << #define all(x) x.begin(),x.end() #define big(x) ((int)(x.size())) using namespace std; const int MOD = 1e9+7, LIM = 1e6+1, inf = 2e9; vi edges[LIM]; vi vis(LIM,0); void dfs(int node,int b1,int b2) { vis[node] = 1; for (auto it : edges[node]) { if (it == b1 || it == b2) continue; if (vis[it]) continue; dfs(it,b1,b2); } } vector<signed> find_colours(signed N, vector<signed> X, vector<signed> Y) { int M = X.size(); for (int i = 0;i<M;i++) { edges[X[i]].push_back(Y[i]); edges[Y[i]].push_back(X[i]); } vector<signed> color(N); vector<signed> orig(N); color[0] = 0; for (int i=1;i<N;i++) { orig.assign(N,N); orig[i] = -1; orig[i] = -1; int extra = (i > 2)+(i<N); int y = perform_experiment(orig); if (y == 1) color[i] = color[i-1]; else color[i] = color[i-1]+1; } return color; }
#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...