# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
442699 | BeanZ | One-Way Streets (CEOI17_oneway) | C++14 | 516 ms | 83436 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.
// I_Love_LPL 11m
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl '\n'
const int N = 3e5 + 5;
long long mod = 1000007;
const int lim = 4e5 + 5;
const int lg = 20;
const int base = 311;
const long double eps = 1e-6;
ll ans = 0, timer = 0, cnt = 0;
vector<pair<ll, ll>> node[N];
vector<ll> adj[N];
ll ids[N], low[N], in[N], vis[N], s[N], e[N], sz[N], dep[N], dp[N][lg + 1], grp[N];
char res[N];
ll root;
vector<ll> st;
map<pair<ll, ll>, ll> dir, mem;
void dfs3(ll u, ll p){
vis[u] = 1;
for (auto j : adj[u]){
if (j == p) continue;
dfs3(j, u);
sz[u] += sz[j];
}
if (sz[u] < 0){
if (dir[{p, u}]) res[mem[{p, u}]] = 'R';
else res[mem[{p, u}]] = 'L';
} else if (sz[u] > 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... |