This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
using namespace std;
#define inf 0x3f3f3f3f
#define sz(x) int((x).size())
#define fi first
#define se second
typedef long long ll;
typedef pair<int, int> ii;
template<class X, class Y>
inline bool maximize(X &x, const Y &y) {return (x < y ? x = y, 1 : 0);}
template<class X, class Y>
inline bool minimize(X &x, const Y &y) {return (x > y ? x = y, 1 : 0);}
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int Random(int l, int r) {
return uniform_int_distribution<int>(l, r)(rng);
}
const int MAXN = 100005;
vector<ii> adj[MAXN];
ii edge[2 * MAXN];
int numNode, numEdge;
#ifdef Nhoksocqt1
vector<int>
#else
variant<bool, vector<int>>
#endif // Nhoksocqt1
find_journey(int _N, int _M, vector<int> _U, vector<int> _V) {
numNode = _N, numEdge = _M;
for (int i = 0; i < numEdge; ++i) {
int u(_U[i]), v(_V[i]);
edge[i] = {u, v};
adj[u].push_back(ii(v, i));
adj[v].push_back(ii(u, i));
}
if(numNode == 2) {
int cnt0(0), cnt1(0);
for (int i = 0; i < numEdge; ++i) {
cnt0 += (edge[i].fi == 0);
cnt1 += (edge[i].fi == 1);
}
if(cnt0 < 2 || cnt1 < 1) {
#ifdef Nhoksocqt1
return {-1};
#else
return false;
#endif // Nhoksocqt1
}
int id0_1(-1), id0_2(-1), id1(-1);
for (int i = 0; i < numEdge; ++i) {
if(edge[i].fi == 0) {
if(id0_1 < 0) {
id0_1 = i;
} else {
id0_2 = i;
}
} else {
id1 = i;
}
}
vector<int> ans;
ans.push_back(id0_1);
ans.push_back(id1);
ans.push_back(id0_2);
ans.push_back(id0_1);
ans.push_back(id1);
ans.push_back(id0_2);
return ans;
}
}
#ifdef Nhoksocqt1
int main(void) {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#define TASK "islands"
if(fopen(TASK".inp", "r")) {
freopen(TASK".inp", "r", stdin);
freopen(TASK".out", "w", stdout);
}
vector<int> _U, _V;
int _N, _M;
cin >> _N >> _M;
_U.resize(_M), _V.resize(_M);
for (int i = 0; i < _M; ++i)
cin >> _U[i] >> _V[i];
vector<int> p = find_journey(_N, _M, _U, _V);
cout << "ANSWER: ";
if(sz(p) == 1 && p[0] == -1) {
cout << "NO\n";
} else {
for (int it = 0; it < sz(p); ++it)
cout << p[it] << ' ';
cout << '\n';
}
return 0;
}
#endif // Nhoksocqt1
Compilation message (stderr)
islands.cpp: In function 'std::variant<bool, std::vector<int, std::allocator<int> > > find_journey(int, int, std::vector<int>, std::vector<int>)':
islands.cpp:78:1: warning: control reaches end of non-void function [-Wreturn-type]
78 | }
| ^
# | 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... |