oj.uz

답안 #426875

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
426875 2021-06-14T10:37:54 Z oscar1f 장난감 기차 (IOI17_train) C++17
0 / 100
 1217 ms 1232 KB 
#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];
int dv[MAX_GARE];
int charge[MAX_GARE];
vector<int> rep;

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

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(0);
		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

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

Subtask #1
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 226 ms 968 KB 3rd lines differ - on the 1st token, expected: '0', found: '1'
2 Halted 0 ms 0 KB -

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1 ms 332 KB 3rd lines differ - on the 1st token, expected: '0', found: '1'
2 Halted 0 ms 0 KB -

Subtask #3
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 172 ms 1232 KB 3rd lines differ - on the 1st token, expected: '0', found: '1'
2 Halted 0 ms 0 KB -

Subtask #4
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 933 ms 1024 KB 3rd lines differ - on the 696th token, expected: '0', found: '1'
2 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 1217 ms 1136 KB 3rd lines differ - on the 2nd token, expected: '0', found: '1'
2 Halted 0 ms 0 KB -

Subtask #6
0 / 51.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 226 ms 968 KB 3rd lines differ - on the 1st token, expected: '0', found: '1'
2 Halted 0 ms 0 KB -