Submission #728561

#TimeUsernameProblemLanguageResultExecution timeMemory
728561groguThousands Islands (IOI22_islands)C++17
0 / 100
2 ms468 KiB
#include "islands.h" #define dbg(x) cerr<<#x<<": "<<x<<endl #define ll int #define pll pair<ll,ll> #include <iostream> #include <vector> #include <variant> #define pb push_back using namespace std; #define maxn 405 ll n,m; vector<ll> g[maxn]; ll id[maxn][maxn]; variant<bool, vector<int>> find_journey(int N, int M, vector<int> U, vector<int> V) { n = N; m = M; variant<bool,vector<int>> ans((bool)(n&1)); return ans; for(ll i = 0;i<m;i++){ ll x = U[i],y = V[i]; x++; y++; g[x].pb(y); g[y].pb(x); id[x][y] = i; } }
#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...