제출 #165160

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
165160		Segtree	Toy Train (IOI17_train)	C++14	5 / 100	18 ms	1064 KiB

train

#include<iostream>
#include<algorithm>
#include<vector>
#include<queue>
#include<set>
#include<unordered_map>
#include"train.h"
using namespace std;
typedef long long ll;
#define chmax(a,b) a=max(a,b)
#define chmin(a,b) a=min(a,b)
#define mod 1000000007
#define mad(a,b) a=(a+b)%mod
#define N 5010
vector<int> g[N];
vector<int> who_wins(vector<int> a,vector<int> r,vector<int> u,vector<int> v){
    ll n=a.size(),m=u.size();
    bool th[N];
    for(int i=0;i<n;i++)th[i]=0;
    for(int i=0;i<m;i++){
	if(u[i]==v[i])th[u[i]]=1;
	else g[u[i]].push_back(v[i]);
    }
    vector<int> ans(n);
    for(int i=0;i<n;i++){
	int ok=-1;
	for(int j=i;j<n;j++){
	    if(th[j]==1&&a[j]==1&&r[j]==1){ok=1; break;}
	    if(th[j]==1&&a[j]==0&&r[j]==0){ok=0; break;}
	    if(g[j].size()==0){
		ok=r[j];
		break;
	    }
	}
	ans[i]=ok;
    }
    return ans;
}
/*
int main(){
    cin.tie(0);
    ios::sync_with_stdio(0);
    
}*/

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