oj.uz

답안 #920409

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
920409 2024-02-02T14:16:58 Z SuPythony Ljeto (COCI21_ljeto) C++17
25 / 50
 1 ms 548 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

int main() {
    int n; cin>>n;
    ll prev=-1;
    ll prev_p=0;
    ll pi=0;
    ll bl=0;
    while (n--) {
        ll t; int a,b;
        cin>>t>>a>>b;
        if (prev==-1) {
            prev=t;
            prev_p=a;
            if (a<=4) pi+=100;
            else bl+=100;
        } else {
            if (prev+10>=t&&a==prev_p) {
                prev=t;
                if (a<=4) pi+=150;
                else bl+=150;
            } else {
                prev=t;
                prev_p=a;
                if (a<=4) pi+=100;
                else bl+=100;
            }
        }
    }
    cout<<pi<<" "<<bl;
    return 0;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 548 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 344 KB Output is correct

Subtask #3
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 548 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Incorrect 0 ms 348 KB Output isn't correct
12 Halted 0 ms 0 KB -