Submission #425725

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
425725	2021-06-13T10:33:37 Z	Blistering_Barnacles	Toy Train (IOI17_train)	C++11	0 / 100	462 ms	14360 KB

train

#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 i = 0 ; i < n ; i++){
            vis[i] = 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 ;
                }
            }
        }
        if(sz(ans) == i)ans.pb(0) ;
    }
    R ans ;
}

Compilation message

train.cpp: In function 'std::vector<int> who_wins(std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>)':
train.cpp:85: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]
   85 |         if(sz(ans) == i)ans.pb(0) ;
      |                    ^

Subtask #1
0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	91 ms	13792 KB	3rd lines differ - on the 14th token, expected: '1', found: '0'
2	Halted	0 ms	0 KB	-

Subtask #2
0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	9 ms	13260 KB	3rd lines differ - on the 4th token, expected: '1', found: '0'
2	Halted	0 ms	0 KB	-

Subtask #3
0 / 11.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	31 ms	14152 KB	Output is correct
2	Correct	42 ms	14184 KB	Output is correct
3	Correct	65 ms	14056 KB	Output is correct
4	Incorrect	174 ms	14360 KB	3rd lines differ - on the 1st token, expected: '1', found: '0'
5	Halted	0 ms	0 KB	-