oj.uz

답안 #425742

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
425742 2021-06-13T10:49:33 Z Blistering_Barnacles 장난감 기차 (IOI17_train) C++11
11 / 100
 1235 ms 14532 KB 
#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 notincharge[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(charge[cur])C ;
            if(!vis[cur]){
                vis[cur]++ ;
                for(auto v : adj[cur])q.push(v) ;
            }
            else if(cur == u){
                notincharge[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(notincharge[cur]){
                    ans.pb(0) ;
                    B ;
                }
                for(auto u : adj[cur])q.push(u) ;
            }
        }
        if(sz(ans) == i)ans.pb(1) ;
    }
    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:87: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]
   87 |         if(sz(ans) == i)ans.pb(1) ;
      |                    ^

Subtask #1
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 28 ms 13828 KB 3rd lines differ - on the 14th token, expected: '1', found: '0'
2 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 11 ms 13260 KB 3rd lines differ - on the 2nd token, expected: '1', found: '0'
2 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 211 ms 14236 KB Output is correct
2 Correct 97 ms 14284 KB Output is correct
3 Correct 42 ms 14212 KB Output is correct
4 Incorrect 381 ms 14176 KB 3rd lines differ - on the 1st token, expected: '1', found: '0'
5 Halted 0 ms 0 KB -

Subtask #4
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 928 ms 14108 KB Output is correct
2 Correct 232 ms 14420 KB Output is correct
3 Correct 255 ms 14404 KB Output is correct
4 Correct 50 ms 14344 KB Output is correct
5 Correct 624 ms 14508 KB Output is correct
6 Correct 617 ms 14480 KB Output is correct
7 Correct 599 ms 14404 KB Output is correct
8 Correct 187 ms 14532 KB Output is correct
9 Correct 35 ms 14296 KB Output is correct
10 Correct 1235 ms 14392 KB Output is correct
11 Correct 1225 ms 14408 KB Output is correct
12 Correct 1207 ms 14416 KB Output is correct
13 Correct 374 ms 14404 KB Output is correct
14 Correct 290 ms 14332 KB Output is correct

Subtask #5
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 579 ms 14216 KB 3rd lines differ - on the 1st token, expected: '1', found: '0'
2 Halted 0 ms 0 KB -

Subtask #6
0 / 51.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 28 ms 13828 KB 3rd lines differ - on the 14th token, expected: '1', found: '0'
2 Halted 0 ms 0 KB -