Submission #667020

#TimeUsernameProblemLanguageResultExecution timeMemory
667020mychecksedadThousands Islands (IOI22_islands)C++17
0 / 100
3 ms596 KiB
#include <bits/stdc++.h>
#include <utility>
using namespace std;
#define pb push_back

pair<bool, vector<int>> find_journey(int N, int M, vector<int> U, vector<int> V){
    vector<int> a, b;
    for(int i = 0; i < M; ++i) if(U[i] == 0) a.pb(i); 
    for(int i = 0; i < M; ++i) if(U[i] == 1) b.pb(i);
    if(a.size() >= 2 && b.size() >= 1){
        return {1, {a[0], b[0], a[1], a[0], b[0], a[1]}};
    }   
    return {0, {}}; 
}
#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...