oj.uz

Submission #154759

# Submission time Handle Problem Language Result Execution time Memory
154759 2019-09-24T14:07:19 Z crisente235 올림픽 (KOI13_olympic) C++14
0 / 100
 3 ms 376 KB 
#include<iostream>

using namespace std;

#define MAX_NUM 1001

int medal[MAX_NUM][4];

int main() {

	int num;
	int cu;

	cin >> num >> cu;
	for (int i = 1; i <= num; i++) {
		for (int j = 1; j < 4; j++) {
			cin >> medal[i][j];
		}
		if (medal[i][0] == cu) {
			cu = i;
		}
	}
	int cnt = 1;
	for (int i = 1; i <= num; i++) {
		if (medal[i][1] > medal[cu][1]) {
			cnt++;
		}
		else if (medal[i][1] == medal[cu][1] && medal[i][1] > medal[cu][1]) {
			cnt++;
		}
		else if (medal[i][1] == medal[cu][1] && medal[i][1] == medal[cu][1] && medal[i][1] > medal[cu][1]) {
			cnt++;
		}
	}

	cout << cnt;


	return 0;
}

Subtask #1
0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 256 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 252 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Incorrect 2 ms 256 KB Output isn't correct

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 256 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 25.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 376 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 35.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 376 KB Output isn't correct
2 Halted 0 ms 0 KB -