oj.uz

답안 #607507

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
607507 2022-07-26T18:50:43 Z Arturgo 장난감 기차 (IOI17_train) C++14
38 / 100
 2000 ms 1456 KB 
#include "train.h"
#include <deque>
#include <vector>
using namespace std;

vector<int> who_wins(vector<int> estMax, vector<int> estRecharge,
 vector<int> debs, vector<int> fins) {
	int nbSommets = estMax.size();
	
	vector<int> aggregs(nbSommets, 0);
	vector<int> nbMins(nbSommets, 0);
	
	vector<int> scores(nbSommets, 0);
	vector<bool> estDans(nbSommets, true);
	
	vector<vector<int>> fils(nbSommets);
	vector<vector<int>> parents(nbSommets);
	
	for(int iArc = 0;iArc < (int)debs.size();iArc++) {
		fils[debs[iArc]].push_back(fins[iArc]);
		parents[fins[iArc]].push_back(debs[iArc]);
	}
	
	int nbRecharges = 0;
	
	deque<int> file;
	for(int iSommet = 0;iSommet < nbSommets;iSommet++) {
		file.push_back(iSommet);
		
		if(estRecharge[iSommet])
			nbRecharges += 1;
	}
	
	while(!file.empty()) {
		int sommet = file.back();
		file.pop_back();
		
		if(scores[sommet] != nbRecharges + 1)
			estDans[sommet] = false;
		
		int oldScore = scores[sommet];
		
		int score;
		if(estMax[sommet]) {
			score = 0;
			
			for(int fil : fils[sommet]) {
				score = max(score, scores[fil]);
			}
		}
		else {
			score = nbRecharges + 1;
			int nb = 0;
			
			for(int fil : fils[sommet]) {
				if(scores[fil] < score) {
					score = scores[fil];
					nb = 0;
				}
				
				if(score == scores[fil]) {
					nb++;
				}
			}
			
			nbMins[sommet] = nb;
		}
		
		aggregs[sommet] = score;
		if(estRecharge[sommet]) {
			score += 1;
		}
		score = min(score, nbRecharges + 1);
		scores[sommet] = score;
		
		if(score == oldScore) continue;
		
		for(int parent : parents[sommet]) {
			if(estDans[parent]) continue;
			
			if(estMax[parent] && score > aggregs[parent]) {
				file.push_front(parent);
				estDans[parent] = true;
			}
			
			if(!estMax[parent] && oldScore == aggregs[parent]) {
				nbMins[parent]--;
				
				if(nbMins[parent] == 0) {
					file.push_front(parent);
					estDans[parent] = true;
				}
			}
		}
	}
	
	vector<int> estGagnant;
	
	for(int iSommet = 0;iSommet < nbSommets;iSommet++) {
		estGagnant.push_back(scores[iSommet] >= nbRecharges + 1);
	}
	
	return estGagnant;
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 179 ms 1080 KB Output is correct
2 Correct 165 ms 1076 KB Output is correct
3 Correct 191 ms 1096 KB Output is correct
4 Correct 158 ms 1072 KB Output is correct
5 Correct 171 ms 1068 KB Output is correct
6 Correct 184 ms 1072 KB Output is correct
7 Correct 58 ms 1100 KB Output is correct
8 Correct 271 ms 1068 KB Output is correct
9 Correct 193 ms 1100 KB Output is correct
10 Correct 186 ms 1040 KB Output is correct
11 Correct 175 ms 1052 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 74 ms 1456 KB Output is correct
2 Correct 115 ms 1436 KB Output is correct
3 Correct 167 ms 1364 KB Output is correct
4 Correct 248 ms 1364 KB Output is correct
5 Correct 74 ms 1380 KB Output is correct
6 Correct 16 ms 1400 KB Output is correct
7 Correct 169 ms 1380 KB Output is correct
8 Correct 7 ms 1364 KB Output is correct
9 Correct 10 ms 1364 KB Output is correct
10 Correct 12 ms 1360 KB Output is correct
11 Correct 8 ms 1356 KB Output is correct
12 Correct 7 ms 1352 KB Output is correct
13 Correct 9 ms 1428 KB Output is correct
14 Correct 9 ms 1364 KB Output is correct
15 Correct 8 ms 1412 KB Output is correct
16 Correct 9 ms 1448 KB Output is correct
17 Correct 9 ms 1364 KB Output is correct
18 Correct 124 ms 1144 KB Output is correct

Subtask #4
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2072 ms 1208 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 1408 KB Output is correct
2 Correct 8 ms 1408 KB Output is correct
3 Correct 8 ms 1364 KB Output is correct
4 Correct 7 ms 1336 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 4 ms 980 KB Output is correct
7 Correct 5 ms 852 KB Output is correct
8 Correct 4 ms 852 KB Output is correct
9 Correct 5 ms 852 KB Output is correct
10 Correct 1 ms 468 KB Output is correct
11 Correct 5 ms 724 KB Output is correct

Subtask #6
0 / 51.0

# 결과 실행 시간 메모리 Grader output
1 Correct 179 ms 1080 KB Output is correct
2 Correct 165 ms 1076 KB Output is correct
3 Correct 191 ms 1096 KB Output is correct
4 Correct 158 ms 1072 KB Output is correct
5 Correct 171 ms 1068 KB Output is correct
6 Correct 184 ms 1072 KB Output is correct
7 Correct 58 ms 1100 KB Output is correct
8 Correct 271 ms 1068 KB Output is correct
9 Correct 193 ms 1100 KB Output is correct
10 Correct 186 ms 1040 KB Output is correct
11 Correct 175 ms 1052 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 0 ms 212 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 0 ms 212 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 74 ms 1456 KB Output is correct
33 Correct 115 ms 1436 KB Output is correct
34 Correct 167 ms 1364 KB Output is correct
35 Correct 248 ms 1364 KB Output is correct
36 Correct 74 ms 1380 KB Output is correct
37 Correct 16 ms 1400 KB Output is correct
38 Correct 169 ms 1380 KB Output is correct
39 Correct 7 ms 1364 KB Output is correct
40 Correct 10 ms 1364 KB Output is correct
41 Correct 12 ms 1360 KB Output is correct
42 Correct 8 ms 1356 KB Output is correct
43 Correct 7 ms 1352 KB Output is correct
44 Correct 9 ms 1428 KB Output is correct
45 Correct 9 ms 1364 KB Output is correct
46 Correct 8 ms 1412 KB Output is correct
47 Correct 9 ms 1448 KB Output is correct
48 Correct 9 ms 1364 KB Output is correct
49 Correct 124 ms 1144 KB Output is correct
50 Execution timed out 2072 ms 1208 KB Time limit exceeded
51 Halted 0 ms 0 KB -