oj.uz

Submission #922465

# Submission time Handle Problem Language Result Execution time Memory
922465 2024-02-05T14:24:37 Z blackavar Ljeto (COCI21_ljeto) C++14
15 / 50
 1 ms 348 KB 
#include <bits/stdc++.h>
using namespace std;

struct event{
    long long t, a, b;
};

bool cmp(event truoc, event sau)
{
    return truoc.t < sau.t;
}

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    long long n;
    cin >> n;
    event arr[n + 1];
    for (int i = 1; i <= n; i++) cin >> arr[i].t >> arr[i].a >> arr[i].b;
    sort (arr + 1, arr + 1 + n, cmp);
    long long teama = 0, teamb = 0, pre = 0, awin = 0, bwin = 0, num = 0;
    for (int i = 1; i <= n; i++)
    {
        if (arr[i].a <= 4 && arr[i].b >= 5) 
        {
            if (i > 1 && arr[i].t - pre <= 10 && awin && arr[i].a == num) teama += 50;
            teama += 100;
            awin = 1;
            bwin = 0;
        }
        if (arr[i].a >= 5 && arr[i].b <= 4)
        {
            if (i > 1 && arr[i].t - pre <= 10 && bwin && arr[i].b == num) teamb += 50;
            teamb += 100;
            bwin = 1;
            awin = 0;
        }
        pre = arr[i].t;
        num = arr[i].a;
    }
    cout << teama << " " << teamb;
    return 0;
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
15.0 / 15.0

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

Subtask #3
0 / 25.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -