Submission #165146

#	Time	Username	Problem	Language	Result	Execution time	Memory
165146		Segtree	Toy Train (IOI17_train)	C++14	0 / 100	9 ms	1052 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();
    for(int i=0;i<m;i++){
	g[u[i]].push_back(v[i]);
    }
    vector<int> ans(n);
    for(int i=1;i<=n;i++){
	bool ok=0;
	for(int j=i;j<=n;j++){
	    if(a[j]==1&&r[j]==1){ok=1; break;}
	    if(a[j]==0&&r[j]==0){ok=0; break;}
	}
	ans[i-1]=ok;
    }
    return ans;
}
/*
int main(){
    cin.tie(0);
    ios::sync_with_stdio(0);
    
}*/

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