oj.uz

Submission #494196

# Submission time Handle Problem Language Result Execution time Memory
494196 2021-12-14T18:22:54 Z AlperenT Ljeto (COCI21_ljeto) C++17
50 / 50
 1 ms 312 KB 
#include <bits/stdc++.h>

using namespace std;

const int M = 8 + 5, INF = 1e9 + 5;

int n, t, a, b, ansa, ansb, last[M];

int main(){
    ios_base::sync_with_stdio(false);cin.tie(NULL);

    fill(last, last + M, -INF);

    cin >> n;

    while(n--){
        cin >> t >> a >> b;

        if(a <= 4) ansa += 100 + (t - last[a] <= 10 ? 50 : 0);
        else ansb += 100 + (t - last[a] <= 10 ? 50 : 0);

        last[a] = t;
    }

    cout << ansa << " " << ansb;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 312 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 312 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct