oj.uz

Submission #633635

# Submission time Handle Problem Language Result Execution time Memory
633635 2022-08-22T23:22:02 Z Pietra Ljeto (COCI21_ljeto) C++14
10 / 50
 0 ms 212 KB 
// ordena pelo tempo e bruta 
#include<bits/stdc++.h>
using namespace std ; 

const int maxn = 110 ; 

int n, lst[10], sce, scd, timer ; 
int esq[8], dir[8] ; 
// atinge algm e ja tinha atingido outro aglm nos ultimos 10s 

int main(){

	cin >> n ; 

	int ctd = 0, cte = 0 ; 

	for(int i = 1 ; i <= 8 ; i++) (i >= 5 ? dir[++ctd] = i : esq[++cte] = i) ; 

	for(int i = 1 ; i <= n ; i++) lst[i] = -(maxn*maxn) ; 

	for(int i = 1 ; i <= n ; i++){
		int t, a, b ; cin >> t >> a >> b ;  
		if(a <= 4){
			sce += 100 ;  
			if(t <= lst[a] + 10) sce += 50 ; 
		}
		else{
			scd += 100 ; 
			if(t <= lst[a] + 10) scd += 50 ; 
		}
		lst[a] = t ; 
	}

	cout << sce << " " << scd << "\n" ; 

}

Subtask #1
10.0 / 10.0

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

Subtask #2
0 / 15.0

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

Subtask #3
0 / 25.0

# Verdict Execution time Memory 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 Incorrect 0 ms 212 KB Output isn't correct
6 Halted 0 ms 0 KB -