Submission #426928

#	Time	Username	Problem	Language	Result	Execution time	Memory
426928		oscar1f	Toy Train (IOI17_train)	C++17	0 / 100	1390 ms	1184 KiB

train

#include<bits/stdc++.h>
/*#include <cstdio>
#include <vector>
#include <cassert>*/
#include "train.h"
using namespace std;

const int MAX_GARE=5000;
int nbGare,nbChemin,deb;
vector<int> adja[MAX_GARE];
deque<int> aTraiter;
int dv[MAX_GARE];
int charge[MAX_GARE];
vector<int> rep;

void DFS(int pos) {
	if (charge[pos]==0) {
		if (dv[pos]!=deb+1) {
			dv[pos]=deb+1;
			for (int ivois=0;ivois<adja[pos].size();ivois++) {
				DFS(adja[pos][ivois]);
			}
		}
		else {
			rep[deb]=0;
		}
	}
}

vector<int> who_wins(vector<int> posses, vector<int> recharge, vector<int> dep, vector<int> arriv) {
	nbGare=posses.size();
	for (int i=0;i<nbGare;i++) {
		rep.push_back(1);
		charge[i]=recharge[i];
	}
	nbChemin=dep.size();
	for (int i=0;i<nbChemin;i++) {
		adja[dep[i]].push_back(arriv[i]);
	}
	for (int i=0;i<nbGare;i++) {
		deb=i;
		DFS(deb);
	}
	return rep;
}
/*
int main() {
	int n, m;
	assert(2 == scanf("%d %d", &n, &m));

	vector<int> a(n), r(n), u(m), v(m);

	for(int i = 0; i < n; i++)
		assert(1 == scanf("%d", &a[i]));

	for(int i = 0; i < n; i++)
		assert(1 == scanf("%d", &r[i]));

	for(int i = 0; i < m; i++)
		assert(2 == scanf("%d %d", &u[i], &v[i]));

	vector<int> res = who_wins(a, r, u, v);

	for(int i = 0; i < (int)res.size(); i++)
		printf(i ? " %d" : "%d", res[i]);
	printf("\n");

	return 0;
}*/

Compilation message (stderr)

train.cpp: In function 'void DFS(int)':
train.cpp:20:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   20 |    for (int ivois=0;ivois<adja[pos].size();ivois++) {
      |                     ~~~~~^~~~~~~~~~~~~~~~~

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