제출 #671534

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
671534		coding_snorlax	장난감 기차 (IOI17_train)	C++14	0 / 100	1926 ms	1620 KiB

train

#include<bits/stdc++.h>
#include "train.h"
using namespace std;
#define pb push_back
int vis[5005]={0};
int rev_answer[5005]={0};
vector<int> answer;
vector<int> G[5005];
vector<int> rev_G[5005];
int charge[5005]={0};
int flag=-1;
void dfs(int node){
    //cout<<"dfs node: "<<node;
    vis[node]=1;
    for(int i:G[node]){
        if(!vis[i] && !charge[i]) dfs(i);
        if(vis[i]) flag=i;
    }
}
void rev_dfs(int node){
    //cout<<"rev_dfs node: "<<node;
    vis[node]=1;
    for(int i:rev_G[node]){
        if(!vis[i]){
           rev_answer[i]=1;
           rev_dfs(i);
        }
    }
}

vector<int> who_wins(vector<int> a,vector<int> r,vector<int> u,vector<int> v){
    for(int i=0;i<(int)r.size();i++){
        charge[i]=r[i];
    }
    for(int i=0;i<(int)u.size();i++){
        G[u[i]].push_back(v[i]);
        rev_G[v[i]].push_back(u[i]);
    }
    for(int i=0;i<(int)a.size();i++){
        flag=-1;
        for(int j=0;j<(int)a.size();j++){
            vis[j]=0;
        }
        if(!charge[i]) dfs(i);
        for(int j=0;j<(int)a.size();j++){
            vis[j]=0;
        }
        if(flag!=-1) rev_dfs(flag);
    }
    for(int i=0;i<(int)a.size();i++){
        if(!rev_answer[i]) answer.pb(1);
        else answer.pb(0);
    }
    return answer;

}

• Subtask 1: 0 / 5
• Subtask 2: 0 / 10
• Subtask 3: 0 / 11
• Subtask 4: 0 / 11
• Subtask 5: 0 / 12
• Subtask 6: 0 / 51