Submission #1057969

#TimeUsernameProblemLanguageResultExecution timeMemory
1057969hirayuu_ojThousands Islands (IOI22_islands)C++17
5 / 100
24 ms4436 KiB
#include "islands.h"

#include <variant>
#include <vector>

#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define rng(i,l,r) for(int i=(l); i<(r); i++)
#define all(x) x.begin(),x.end()
using ll=long long;

std::variant<bool, std::vector<int>> find_journey(
    int N, int M, std::vector<int> U, std::vector<int> V) {
    if(N==2) {
        vector<vector<int>> cnt(2);
        rep(i,M)cnt[U[i]].emplace_back(i);
        if(cnt[0].size()>=2&&cnt[1].size()>=1) {
            return vector<int>{cnt[0][0],cnt[1][0],cnt[0][1],cnt[0][0],cnt[1][0],cnt[0][1]};
        }
        else {
            return false;
        }
    }
    return false;
}
#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...