Submission #1240855

#TimeUsernameProblemLanguageResultExecution timeMemory
1240855nikulidThousands Islands (IOI22_islands)C++20
6.75 / 100
19 ms4456 KiB
#include "islands.h" #include <variant> #include <vector> using namespace std; #define pb push_back variant<bool, vector<int>> find_journey(int N, int M, vector<int> U, vector<int> V) { if(N==2){ // subtask 1 vector<int> A, B; for(int i=0; i<M; i++){ if(U[i]==0 && V[i]==1){ A.pb(i); } else{ B.pb(i); } } if(A.size()>1 && B.size()>0){ vector<int> answer = {A[0], B[0], A[1], A[0], B[0], A[1]}; return answer; } else{ return false; } } else{ // subtask 2 (5 marks) // N>3 guaranteed, so it's definitely possible return true; } return true; }
#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...