oj.uz

Submission #974579

# Submission time Handle Problem Language Result Execution time Memory
974579 2024-05-03T13:26:38 Z vjudge1 Ljeto (COCI21_ljeto) C++17
50 / 50
 1 ms 436 KB 
// Source: https://usaco.guide/general/io

#include <bits/stdc++.h>
using namespace std;

int main() {
	int temp[8], duck = 0, eagle = 0;
	memset(temp, 0, sizeof(temp));
	int times; cin >> times;
	int arr[times][3];

	for(int i = 0 ; i < times ; i++){
		cin >> arr[i][0] >> arr[i][1] >> arr[i][2];
		if(arr[i][0] - temp [arr[i][1] - 1] <= 10 && temp[arr[i][1] - 1] != 0){
			if(1 <= arr[i][1] && arr[i][1] <= 4){
				eagle += 150;
			}
			else{
				duck += 150;
			}
		}
		else{
			if(1 <= arr[i][1] && arr[i][1] <= 4){
				eagle += 100;
			}
			else{
				duck += 100;
			}
		}
		temp [arr[i][1] - 1] = arr[i][0];
	}

	cout << eagle << " " << duck << endl;

	return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 436 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 344 KB Output is correct

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 436 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 344 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct