oj.uz

답안 #974836

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
974836 2024-05-04T00:45:03 Z vjudge1 Ljeto (COCI21_ljeto) C++17
50 / 50
 1 ms 436 KB 
#include <iostream>
using namespace std;

int main() {
    int n;
    cin >> n;

    int timelasthit[9] = {-1, -1, -1, -1, -1, -1, -1, -1};
    int timelang = 0;
    int timbebek = 0;
    for (int i = 0; i < n; i++)
    {
        int t, a, b;
        cin >> t >> a >> b;

        int score = 100;
        if (timelasthit[a] != -1 && (t - timelasthit[a]) <= 10) score += 50;
        timelasthit[a] = t;

        if (a <= 4) timelang += score;
        else timbebek += score;
    }
    
    cout << timelang << ' ' << timbebek << endl;

    return 0;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
15.0 / 15.0

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

Subtask #3
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 432 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 436 KB Output is correct