Submission #379803

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
379803	2021-03-19 10:45:31	MladenP	One-Way Streets (CEOI17_oneway)	C++17	100 / 100	90 ms	14188 KiB

oneway

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <bits/stdc++.h>
#define pii pair<int, int>
#define fi first
#define se second
#define pb push_back
#define PRINT(x) cerr<<#x<<'='<<x<<endl;
#define MAXN 100010
using namespace std;
int N, M, P, w[MAXN], fup[MAXN], dub[MAXN];
vector<pii> adj[MAXN];
pii edge[MAXN];
string s = "#";
void dfs(int node, int e) {
    dub[node] = dub[node^edge[e].fi^edge[e].se]+1;
    fup[node] = dub[node];
    for(auto x : adj[node]) {
        if(x.se == e) continue;
        if(dub[x.fi]) {
            fup[node] = min(fup[node], dub[x.fi]);
        } else {
            dfs(x.fi, x.se);
            w[node] += w[x.fi];
            fup[node] = min(fup[node], fup[x.fi]);
        }
    }
    if(fup[node] != dub[node]) return;
    if(w[node] > 0) {
        int node1 = node^edge[e].fi^edge[e].se;
        if(make_pair(node1, node) == edge[e]) s[e] = 'L';
        else s[e] = 'R';
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 30 / 30
• Subtask 2: 30 / 30
• Subtask 3: 40 / 40