답안 #974717

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
974717 2024-05-03T16:58:58 Z vjudge1 Ljeto (COCI21_ljeto) C++17
50 / 50
1 ms 456 KB
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
typedef long long ll;
const ll INF = 1e9;
const ll MOD = 1e9 + 7;
const ll MAXN = 1e6 + 5;
const ll LOG = 61;
#define vll vector <ll>
#define pll pair <ll, ll>
#define fi first
#define se second
#define endl '\n'

ll n, m;
ll a [20];
ll ans [5];

void solve(){
    cin >> n;
    for(ll i = 1; i <= n; i++){
        ll b, x, y; cin >> b >> x >> y;
        bool ya = 0;
        if(x >= 5) ya = 1;
        ans[ya] += 100;
        if(a[x] && b-a[x] <= 10) ans[ya] += 50;
        a[x] = b;
    }
    cout << ans[0] << " " << ans[1] << endl;
}

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

// 3
// 10 1 6
// 20 1 7
// 21 8 1

// 3
// 10 2 5
// 15 2 6
// 25 2 5

// 2
// 10 5 2
// 11 6 3
// 3 3 5
// 7 6 2
// 15 1 8
// 16 5 4
// 18 2 7
// 23 4 6
// 26 8 3
// 30 7 1
// 34 1 5
// 36 3 6
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 448 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 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
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 448 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 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 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 456 KB Output is correct