Submission #1125211

#TimeUsernameProblemLanguageResultExecution timeMemory
1125211StefanSebezThousands Islands (IOI22_islands)C++20
6.75 / 100
29 ms6772 KiB
#include "islands.h" #include<bits/stdc++.h> #include <variant> #include <vector> using namespace std; #define fi first #define se second #define pb push_back #define ll long long #define ld long double const int N=1e5+50; vector<int>E[N]; std::variant<bool, std::vector<int>> find_journey(int n, int m, std::vector<int> U, std::vector<int> V) { int deg[n+10]={0}; vector<int>nesto[n+10]; for(int i=0;i<m;i++){ deg[U[i]]++; nesto[U[i]].pb(i); } if(deg[0]<=1||deg[1]<=0) return false; vector<int>res={nesto[0][0],nesto[1][0],nesto[0][1],nesto[0][0],nesto[1][0],nesto[0][1]}; return res; }
#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...