# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1158315 | Math4Life2020 | Thousands Islands (IOI22_islands) | C++20 | 453 ms | 32728 KiB |
#include "islands.h"
#include <bits/stdc++.h>
using namespace std;
using ll = int; using pii = pair<ll,ll>;
const ll Nm = 1e5+5;
variant<bool,vector<int>> find_journey(int N, int M, vector<int> U, vector<int> V) {
if (N==2) {
vector<ll> vf,vr;
for (ll i=0;i<M;i++) {
if (U[i]==0) {
vf.push_back(i);
} else {
vr.push_back(i);
}
}
if (vf.size()<=1 || vr.size()<=0) {
return false;
} else {
return (vector<ll>) {vf[0],vr[0],vf[1],vf[0],vr[0],vf[1]};
}
}
map<pii,ll> mcnt; //map to count
map<pii,vector<ll>> mvec;
for (ll i=0;i<M;i++) {
if (mcnt.find({U[i],V[i]})==mcnt.end()) {
mcnt[{U[i],V[i]}]=0;
}
mcnt[{U[i],V[i]}]++;
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |