oj.uz

답안 #633638

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
633638 2022-08-22T23:25:56 Z Pietra Ljeto (COCI21_ljeto) C++14
50 / 50
 1 ms 212 KB 
// ordena pelo tempo e bruta 
#include<bits/stdc++.h>
using namespace std ; 

const int maxn = 110 ; 
const int inf = 1e5 ; 

int n, lst[maxn], sce, scd, timer ; 
// 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 <= n ; i++) lst[i] = -inf ; 

	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" ; 

}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:15:6: warning: unused variable 'ctd' [-Wunused-variable]
   15 |  int ctd = 0, cte = 0 ;
      |      ^~~
Main.cpp:15:15: warning: unused variable 'cte' [-Wunused-variable]
   15 |  int ctd = 0, cte = 0 ;
      |               ^~~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 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 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct

Subtask #3
25.0 / 25.0

# 결과 실행 시간 메모리 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 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct