Submission #1359428

#TimeUsernameProblemLanguageResultExecution timeMemory
1359428opeleklanosThousands Islands (IOI22_islands)C++20
3.50 / 100
15 ms3516 KiB
#include <iostream>
#include <vector>
#include <variant>
using namespace std;

variant<bool, vector<int>> find_journey(int N, int M, vector<int> U, vector<int> V){

    int a = 0; int b = 0;
    for(int i = 0; i<M; i++){
        if(U[i] == 1) b++;
        else a++;
    }

    if(a <2 || b<1) return (bool)0;

    return (bool)1;
}
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...