oj.uz

Submission #154757

# Submission time Handle Problem Language Result Execution time Memory
154757 2019-09-24T12:40:29 Z crisente235 올림픽 (KOI13_olympic) C++14
20 / 100
 3 ms 504 KB 
#include<iostream>

using namespace std;

#define MAX_NUM 1001

int country[MAX_NUM][4];

int main() {
	int num;
	int cn;
	cin >> num >> cn;
	int degree=1;
	for (int i = 1; i <= num; i++) {
		for (int j = 0; j < 4; j++) {
			cin>>country[i][j];
		}
	}
	for (int i = 1; i <= num; i++) {
		if (cn == country[i][0]){
			cn = i;
		}
	}
	for (int i = 1; i <= num; i++) {
		if (country[i][1] > country[cn][1]) {
			degree++;
		}
		else if (country[i][1] == country[cn][1] && country[i][2] > country[cn][2]) {
			degree++;
		}
		else if (country[i][1] == country[cn][1] && country[i][2] == country[cn][2] && country[i][3] > country[cn][3]) {
			degree++;
		}
		
	}
	cout << degree;

	return 0;
}

Subtask #1
8.0 / 8.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

Subtask #2
12.0 / 12.0

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

Subtask #3
0 / 20.0

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

Subtask #4
0 / 25.0

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

Subtask #5
0 / 35.0

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