Submission #68207

#	Time	Username	Problem	Language	Result	Execution time	Memory
68207		KLPP	장난감 기차 (IOI17_train)	C++14	0 / 100	44 ms	1488 KiB

train

#include "train.h"
#include<vector>
#include<iostream>
#include<queue>
using namespace std;
vector<int>nei[5000];
vector<int>inverse[5000];
int owner[5000];
int n,m;

std::vector<int> who_wins(std::vector<int> a, std::vector<int> r, std::vector<int> u, std::vector<int> v) {
	n=a.size();m=u.size();
	for(int i=0;i<n;i++){
		nei[u[i]].push_back(v[i]);
		inverse[v[i]].push_back(u[i]);
	}
	queue<int> marcados;
	bool b[n];
	for(int i=0;i<n;i++)b[i]=false;
	for(int start=0;start<n;start++){
		if(r[start]>0){
			queue<int> Q;
			Q.push(start);
			bool visited[n];
			for(int i=0;i<n;i++)visited[i]=false;
			while(!Q.empty()){
				int u=Q.front();Q.pop();
				for(int i=0;i<nei[u].size();i++){
					int v=nei[u][i];
					if(!visited[v]){
						visited[v]=true;
						Q.push(v);
					}
				}
			}
			b[start]=false;
			if(visited[start]){
				marcados.push(start);
			}
		}
	}
	while(!marcados.empty()){
		int u=marcados.front();marcados.pop();
		for(int i=0;i<inverse[u].size();i++){
			int v=inverse[u][i];
			if(!b[v]){
				b[v]=true;
				marcados.push(v);
			}
		}	
	}
	vector<int> ans;
	for(int i=0;i<n;i++){
		ans.push_back(b[i]);
		//cout<<b[i]<<endl;
	}
	return ans;
}

Compilation message (stderr)

train.cpp: In function 'std::vector<int> who_wins(std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>)':
train.cpp:28:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=0;i<nei[u].size();i++){
                 ~^~~~~~~~~~~~~~
train.cpp:44:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int i=0;i<inverse[u].size();i++){
               ~^~~~~~~~~~~~~~~~~~

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