Submission #657470

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
657470	2022-11-09 23:38:48	perchuts	One-Way Streets (CEOI17_oneway)	C++17	100 / 100	102 ms	21232 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 all(x) x.begin(), x.end()
#define sz(x) (int)x.size()
#define endl '\n'
#define _ ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define pb push_back
 
using namespace std;
 
using ii = pair<int,int>;
using iii = tuple<int,int,int>;
using ll = long long;
 
const int inf = 1e9+1;
const int mod = 1e9+7;
const int maxn = 2e5+100;
 
template<typename X,typename Y> bool ckmin(X& x,Y y){return (x>y?x=y,1:0);}
template<typename X,typename Y> bool ckmax(X& x,Y y){return (x<y?x=y,1:0);}
 
vector<ii>g[maxn];
 
int dp[maxn], lvl[maxn], entrada[maxn], saida[maxn], bridge[maxn], vis[maxn], t = 0;
ii ranges[maxn][2];
 
void dfs(int u,int p){
    lvl[u] = lvl[p] + 1, entrada[u] = ++t;
    for(auto [v,idx]:g[u]){
        if(!lvl[v]){
            dfs(v,u);
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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