oj.uz

답안 #959459

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
959459 2024-04-08T08:50:50 Z Art_ogo Ljeto (COCI21_ljeto) C++17
50 / 50
 1 ms 456 KB 
#include <bits/stdc++.h>

#define ll long long
#define fi first
#define se second
#define ve vector
#define all(x) x.begin(), x.end()
#define pb(x) push_back(x)

using namespace std;

mt19937 rnd;

typedef pair<ll, ll> pll;
typedef pair<int, int> pii;


void solve(){
    int n;
    cin >> n;
    ve<int> lst(8, -1e9);
    int ans[2] = {0, 0};
    for(int i = 0; i < n; i++){
        int t, a, b;
        cin >> t >> a >> b;
        a--; b--;
        int pr = 100;
        if(lst[a] >= t - 10)
            pr += 50;
        lst[a] = t;
        ans[a >= 4] += pr;
    }
    cout << ans[0] << " " << ans[1];
}

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

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 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

# 결과 실행 시간 메모리 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 1 ms 348 KB Output is correct

Subtask #3
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 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
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 456 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 1 ms 348 KB Output is correct