# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
390841 | acm | Sleepy game (innopolis2018_final_D) | C++14 | 67 ms | 19396 KiB |
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>
#define speed \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define precision \
cout.precision(30); \
cerr.precision(10);
#define ll long long
#define ld long double
#define pll pair<ll, ll>
#define pii pair<int, int>
#define forn(n) for (int i = 1; i <= n; i++)
#define forlr(l, r) for (int i = l; i != r; (l > r ? i-- : i++))
#define pb(x) push_back(x)
#define sz(x) (int)x.size()
#define mp(x, y) make_pair(x, y)
#define all(x) x.begin(), x.end()
#define pc(x) __builtin_popcount(x)
#define pcll(x) __builtin_popcountll(x)
#define F first
#define S second
using namespace std;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
void ioi(string name) {
freopen((name + ".in").c_str(), "r", stdin);
freopen((name + ".out").c_str(), "w", stdout);
}
int n, m, c, r, t[200005], w[200005][2];
vector<int> g[200005];
void dfs(int v = r, int k = 0, int p = -1) {
w[v][k] = p;
for (auto to : g[v]) {
if (!w[to][!k]) dfs(to, !k, v);
}
}
void sfd(int v = r) {
t[v] = 1;
for (auto to : g[v]) {
if (!t[to])
sfd(to);
else if (t[to] == 1)
c = 1;
}
t[v] = 2;
}
int main() {
speed;
precision;
// code
cin >> n >> m;
for (int i = 1; i <= n; i++) {
int x;
cin >> x;
while (x--) {
int v;
cin >> v;
g[i].pb(v);
}
}
cin >> r;
dfs();
for (int i = 1; i <= n; i++) {
if (!sz(g[i]) && w[i][1]) {
cout << "Win\n";
vector<int> e;
int v = i, k = 1;
e.pb(v);
while (w[v][k] > 0) {
e.pb(w[v][k]);
v = w[v][k];
k ^= 1;
}
reverse(all(e));
for (auto u : e) cout << u << " ";
return 0;
}
}
sfd();
cout << (c ? "Draw" : "Lose");
// endl
#ifndef ONLINE_JUDGE
cerr << "\nTime elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
#endif
return 0;
}
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... |