Submission #797666

#TimeUsernameProblemLanguageResultExecution timeMemory
797666Joshi503Thousands Islands (IOI22_islands)C++17
0 / 100
2 ms468 KiB
// Source: https://usaco.guide/general/io #include <bits/stdc++.h> using namespace std; struct datos{ bool ok; vector<int> v; }; /* 1 3 2 1 3 2 */ struct datos find_journey(int N, int M, vector<int> U, vector<int> V){ datos res; res.ok = 0; vector<int> ida, regreso; for(int i = 0; i < M; i++){ if(U[i] == 0 && V[i] == 1) ida.push_back(i); else regreso.push_back(i); } vector<int> x; if((int)ida.size() >= 2 && (int)(regreso.size())){ x = {ida[0], regreso[0], ida[1], ida[0], regreso[0], ida[1]}; res.v = x; } 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...