oj.uz

Submission #731028

# Submission time Handle Problem Language Result Execution time Memory
731028 2023-04-26T19:50:45 Z murad_2005 Ljeto (COCI21_ljeto) C++14
50 / 50
 1 ms 324 KB 
#include<bits/stdc++.h>
#define ll long long
#define ld long double
#define pii pair<int, int>
#define piii pair<int, pii>
#define pllll pair<ll, ll>
#define plli pair<ll, int>
#define vi vector<int>
#define vvi vector<vector<int>>
#define pb push_back
#define pf push_front
#define eb emplace_back
#define all(v) v.begin(), v.end()
#define size(v) v.size()
#define INF 2e9
#define f first
#define s second
#define ln "\n"

using namespace std;

void solve(){
    int n;
    cin >> n;
    vector<pii>p;
    for(int i = 1; i <= n; ++i){
        int t, a, b;
        cin >> t >> a >> b;
        p.pb({a, t});
    }
    sort(all(p));
    int PointA = 0, PointB = 0, prev_time = p[0].s, prev_player = p[0].f;
    if(prev_player <= 4) PointA += 100;
    else PointB += 100;
    for(int i = 1; i < n; ++i){
        int player = p[i].f, time = p[i].s;
        if(player <= 4){
            PointA += 100;
            if(time - prev_time <= 10 && player == prev_player){
                PointA += 50;
            }
        }else{
            PointB += 100;
            if(time - prev_time <= 10 && player == prev_player){
                PointB += 50;
            }
        }
        prev_time = time, prev_player = player;
    }
    cout << PointA << " " << PointB << "\n";
}

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int t;
    t = 1;
    // cin >> t;
    while(t--){
        solve();
    }
    return 0;
}

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 316 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 316 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 324 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 324 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 316 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 316 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 324 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 324 KB Output is correct
9 Correct 0 ms 320 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 320 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct