oj.uz

Submission #651966

# Submission time Handle Problem Language Result Execution time Memory
651966 2022-10-20T20:01:28 Z pamaj Ljeto (COCI21_ljeto) C++14
50 / 50
 1 ms 340 KB 
#include <bits/stdc++.h>
using namespace std;

int team[] = {0, 1, 1, 1, 1, 2, 2, 2, 2};
int n;
int t[9], s[3];

int main() {

    cin >> n;

    for(int i = 0; i < n; i++) {
        int a, b, c;
        cin >> a >> b >> c;

        if(team[b] == team[c]) continue;

        s[team[b]] += 100;
        if(t[b] && a - t[b] <= 10) s[team[b]] += 50;
        t[b] = a;
    }

    cout << s[1] << " " << s[2] << "\n";

}

Subtask #1
10.0 / 10.0

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

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 300 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct

Subtask #3
25.0 / 25.0

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