oj.uz

Submission #1004777

# Submission time Handle Problem Language Result Execution time Memory
1004777 2024-06-21T14:43:44 Z 12345678 Ljeto (COCI21_ljeto) C++17
50 / 50
 0 ms 348 KB 
#include <bits/stdc++.h>

using namespace std;

int n, t, a, b, lst[12], x, y;

int main()
{
    cin.tie(NULL)->sync_with_stdio(false);
    for (int i=1; i<=8; i++) lst[i]=-100;
    cin>>n;
    for (int i=1; i<=n; i++)
    {
        cin>>t>>a>>b;
        if (a<=4)
        {
            x+=100;
            if (t-lst[a]<=10) x+=50;
            lst[a]=t;
        }
        else
        {
            y+=100;
            if (t-lst[a]<=10) y+=50;
            lst[a]=t;
        }
    }
    cout<<x<<' '<<y;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 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 0 ms 348 KB Output is correct

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 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 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct