Submission #425726

#TimeUsernameProblemLanguageResultExecution timeMemory
425726Blistering_BarnaclesToy Train (IOI17_train)C++11
11 / 100
971 ms14644 KiB
#include "train.h" //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 //The saddest thing about betrayal? is that it never comes from your enemies //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, dp[100005], a[555555] , b[555555], k, l, m, n, o, p; map < ll , ll > mp; vll adj[555555]; const ll mod = 1e9+7; str s; vi o1 , o2 ; vll cur ; ll incharge[555555] , vis[555555]; vector<int> who_wins(std::vector<int> who, std::vector<int> charge, std::vector<int> u, std::vector<int> v) { n = sz(who) , m = sz(u) ; vll op ; for(ll i = 0 ; i < m ; i++){ adj[u[i]].pb(v[i]) ; } for(ll i = 0 ; i < n ; i++){ if(charge[i])op.pb(i) ; } for(auto u : op){ for(ll i = 0 ; i < n ; i++)vis[i] = 0 ; queue < ll > q ; q.push(u) ; while(!q.empty()){ ll cur = q.front() ; q.pop() ; if(!vis[cur]){ vis[cur]++ ; for(auto v : adj[cur])q.push(v) ; } else if(cur == u){ incharge[u]++ ; B ; } } } vi ans = {} ; for(ll i = 0 ; i < n ; i++){ for(ll j = 0 ; j < n ; j++){ vis[j] = 0 ; } queue < ll > q ; q.push(i) ; while(!q.empty()){ ll cur = q.front() ; q.pop() ; if(!vis[cur]){ vis[cur]++ ; if(incharge[cur]){ ans.pb(1) ; B ; } for(auto u : adj[cur])q.push(u) ; } } if(sz(ans) == i)ans.pb(0) ; } R ans ; }

Compilation message (stderr)

train.cpp: In function 'std::vector<int> who_wins(std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>)':
train.cpp:86:20: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'll' {aka 'long long int'} [-Wsign-compare]
   86 |         if(sz(ans) == i)ans.pb(0) ;
      |                    ^
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...