oj.uz

Submission #509646

# Submission time Handle Problem Language Result Execution time Memory
509646 2022-01-14T07:48:37 Z Blistering_Barnacles One-Way Streets (CEOI17_oneway) C++17
0 / 100
 22 ms 13388 KB 
//apig's property
//Happiness can be found, even in the darkest of times, if one only remembers to turn on the light
//El Pueblo Unido Jamas Sera Vencido
//Do or do not... there is no try
//Billions of bilious blue blistering barnacles in a thundering typhoon!
#include<bits/stdc++.h>
#define fast ios_base::sync_with_stdio(0) , cin.tie(0) , cout.tie(0)
#define F first
#define S second
#define pb push_back
#define vll vector< ll >
#define vi vector< int >
#define pll pair< ll , ll >
#define pi pair< int , int >
#define all(s) s.begin() , s.end()
#define sz(s) s.size()
#define str string
#define md ((s + e) / 2)
#define mid ((l + r) / 2)
#define msdp(dp) memset(dp , -1 , sizeof dp)
#define mscl(dp) memset(dp , 0 , sizeof dp)
#define C continue
#define R return
#define B break
#define lx node * 2
#define rx node * 2 + 1
#define br(o) o ; break
#define co(o) o ; continue
using namespace std;
typedef long long ll;
ll q, vis[100005], a[555555] , b[555555], k, l, m, n, o, p;
map < ll , ll > mp;
vll adj[555555];
const ll mod = 1e9 + 7 ;
pll edj[555555] , have[555555] ;
ll pp ;
void dfs(ll v , pll ed){
    if(v == ed.S){
        pp = 1 ;
        R ;
    }
    vis[v] = 1 ;
    for(auto u : adj[v]){
        if(vis[u] || pll{v , u} == ed)C ;
        dfs(u , ed) ;
    }
}
void solve(){
    cin >> n >> m ;
    for(ll i = 1 ; i <= m ; i++){
        cin >> o >> p ;
        adj[o].pb(p) ;
        adj[p].pb(o) ;
        edj[i] = {o , p} ;
    }
    cin >> l ;
    for(ll i = 1 ; i <= l ; i++){
        cin >> o >> p ;
        have[i] = {o , p} ;
    }
    for(ll i = 1 ; i <= m ; i++){
        pp = 0 ;
        for(ll i = 1 ; i <= n ; i++){
            vis[i] = 0 ;
        }
        o = edj[i].F , p = edj[i].S ;
        dfs(o , edj[i]) ;
        if(pp){
            cout << "B" ;
            C ;
        }
        ll tol = 1 , tor = 1 ;
        for(ll i = 1 ; i <= l ; i++){
            if(vis[have[i].F] && !vis[have[i].S])tol = 0 ;
            if(!vis[have[i].F] && vis[have[i].S])tor = 0 ;
        }
        cout << (tol && tor ? "B" : (tol ? "L" : "R")) ;
    }
    cout << endl ;
}
int main(){
    fast ;
    q = 1 ;
    //cin >> q ;
    while(q--){
        solve() ;
    }
}

Subtask #1
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 13260 KB Output is correct
2 Correct 7 ms 13388 KB Output is correct
3 Correct 22 ms 13380 KB Output is correct
4 Correct 13 ms 13388 KB Output is correct
5 Correct 14 ms 13388 KB Output is correct
6 Correct 12 ms 13376 KB Output is correct
7 Correct 15 ms 13368 KB Output is correct
8 Correct 14 ms 13388 KB Output is correct
9 Incorrect 16 ms 13388 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #2
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 13260 KB Output is correct
2 Correct 7 ms 13388 KB Output is correct
3 Correct 22 ms 13380 KB Output is correct
4 Correct 13 ms 13388 KB Output is correct
5 Correct 14 ms 13388 KB Output is correct
6 Correct 12 ms 13376 KB Output is correct
7 Correct 15 ms 13368 KB Output is correct
8 Correct 14 ms 13388 KB Output is correct
9 Incorrect 16 ms 13388 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #3
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 13260 KB Output is correct
2 Correct 7 ms 13388 KB Output is correct
3 Correct 22 ms 13380 KB Output is correct
4 Correct 13 ms 13388 KB Output is correct
5 Correct 14 ms 13388 KB Output is correct
6 Correct 12 ms 13376 KB Output is correct
7 Correct 15 ms 13368 KB Output is correct
8 Correct 14 ms 13388 KB Output is correct
9 Incorrect 16 ms 13388 KB Output isn't correct
10 Halted 0 ms 0 KB -