Submission #1359441

#TimeUsernameProblemLanguageResultExecution timeMemory
1359441opeleklanosThousands Islands (IOI22_islands)C++20
0 / 100
1095 ms4124 KiB
#include <iostream>
#include <vector>
#include <variant>
using namespace std;

vector<vector<int>> adj;

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

    adj.assign(N, {});
    for(int i = 0; i<M; i++){
        adj[U[i]].push_back(V[i]);
    }


    int curr = 0;
    while(adj[curr].size() == 1) curr = adj[curr][0];

    if(adj[curr].size() > 1) return (bool)1;
    else return (bool)0;
}
#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...