Submission #667016

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

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