oj.uz

답안 #584129

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
584129 2022-06-26T21:08:34 Z Maha Ljeto (COCI21_ljeto) C++14
0 / 50
 1 ms 324 KB 
#include <bits/stdc++.h>

#define endl "\n"

typedef long long ll;

using namespace std;
ll n;
ll a[109];
ll b[109];
ll t[109];
map<char,ll>mp;
ll ananas = 0;
ll enab = 0;
int main()
{
ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
cin >> n;
for (int i = 0 ; i < n ; i++)
 {
cin >> t[i] >> a[i] >> b[i];
 }
 for (int i = 0 ; i < n ; i++)
 {
if ( a[i] <= 4 && b[i] > 4 ){
ananas += 100;
 }
if ( a[i] <= 4 && b[i] > 4 && a[i+1] <= 4 && b[i] > 4 ){
if ( abs ( t[i] - t[i+1] <= 10 && a[i] == a[i+1])){
ananas += 50;
 }
}
if ( a[i] > 4 && b[i] <= 4){
enab += 100;
 }
if ( a[i] > 4 && b[i] <= 4 && a[i+1] > 4 && b[i] <= 4){
if ( abs(t[i] - t[i+1] <= 10 && a[i] == a[i+1])){
enab+=50;
 }
}
 }

cout << ananas << " " << enab << endl;
return 0;
}

Subtask #1
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Incorrect 1 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 324 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Incorrect 1 ms 212 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Incorrect 1 ms 212 KB Output isn't correct
3 Halted 0 ms 0 KB -