oj.uz

Submission #904333

# Submission time Handle Problem Language Result Execution time Memory
904333 2024-01-12T03:56:48 Z Jawad_Akbar_JJ Ljeto (COCI21_ljeto) C++17
25 / 50
 2 ms 6588 KB 
#include <iostream>
#include <map>
#include <vector>
#include <algorithm>

using namespace std;
const int N = 1e6 +10;

int a[N];
int b[N];
int d[N];
int dd[N];
int tm[N];

int main() {
	int n;
	cin>>n;

	int t[3] = {0};
	tm[0] = -1e8;
	for (int i=1;i<=n;i++){
		cin>>tm[i]>>a[i]>>b[i];

		if (a[i]<5)
			d[i] = 1;
		else
			d[i] = 2;
	}

	for (int i=1;i<=n;i++){
		t[d[i]] += 100;
		if (a[i]==a[i-1] and tm[i] - tm[i-1] <= 10)
			t[d[i]] += 50;
	}
	cout<<t[1]<<" "<<t[2]<<endl;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 6488 KB Output is correct
2 Correct 2 ms 6492 KB Output is correct

Subtask #2
15.0 / 15.0

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

Subtask #3
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 6488 KB Output is correct
2 Correct 2 ms 6492 KB Output is correct
3 Correct 2 ms 6488 KB Output is correct
4 Correct 2 ms 6492 KB Output is correct
5 Correct 2 ms 6492 KB Output is correct
6 Correct 2 ms 6492 KB Output is correct
7 Correct 2 ms 6492 KB Output is correct
8 Correct 2 ms 6492 KB Output is correct
9 Correct 1 ms 6492 KB Output is correct
10 Correct 2 ms 6588 KB Output is correct
11 Incorrect 2 ms 6492 KB Output isn't correct
12 Halted 0 ms 0 KB -