This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
// ordena pelo tempo e bruta
#include<bits/stdc++.h>
using namespace std ;
const int maxn = 110 ;
const int inf = 1e5 ;
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] = -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" ;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |