Submission #617891

#	Time	Username	Problem	Language	Result	Execution time	Memory
617891		chirathnirodha	Toy Train (IOI17_train)	C++17	5 / 100	14 ms	1236 KiB

train

#include "train.h"
#include<bits/stdc++.h>
using namespace std;
#define PB push_back
#define MP make_pair
#define F first
#define S second

int n,m;
vector<int> ed[5000];
bool own[5000];
bool charge[5000];
bool self[5000];
vector<int> SUB_1() {
	vector<int> ans(n);
	for(int i=0;i<n;i++){
		for(int j=i;j<n;j++){
			if(self[j]==true && ed[j].size()==1){
				if(charge[j]==true)ans[i]=1;
				else ans[i]=0;
				break;
			}
			if(own[j]==true && charge[j]==true && self[j]==true){ans[i]=1;break;}
			if(own[j]==false && charge[j]==false && self[j]==true){ans[i]=0;break;}
		}
	}
	return ans;
}
vector<int> who_wins(vector<int> a, vector<int> r, vector<int> u, vector<int> v) {
	n=a.size();m=u.size();
	memset(self,false,sizeof(self));
	for(int i=0;i<m;i++){
		ed[u[i]].PB(v[i]);
		if(u[i]==v[i])self[u[i]]=true;
	}
	for(int i=0;i<n;i++){own[i]=a[i];charge[i]=r[i];}
	return SUB_1();
}

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