oj.uz

답안 #869515

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
869515 2023-11-04T15:24:19 Z JoksimKaktus Ljeto (COCI21_ljeto) C++17
50 / 50
 1 ms 460 KB 
#include <bits/stdc++.h>

using namespace std;
using ll = long long;

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(0);
    int n;
    cin >> n;
    vector <int> v[9];
    for(int i = 0;i < n;i++){
        int t,a,b;
        cin >> t >> a >> b;
        v[a].push_back(t);
    }
    int res1 = 0;
    int res2 = 0;
    int last = -100;
    for(int i = 1;i <= 4;i++){
        for(int j : v[i]){
            if(j - 10 <= last){
                res1 += 50;
            }
            res1 += 100;
            last = j;
        }
        last = -100;
    }
    for(int i = 5;i <= 8;i++){
        for(int j : v[i]){
            if(j - 10 <= last){
                res2 += 50;
            }
            res2 += 100;
            last = j;
        }
        last = -100;
    }
    cout << res1 << " " << res2 << "\n";
    return 0;
}

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 0 ms 348 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 1 ms 348 KB Output is correct
6 Correct 0 ms 460 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 0 ms 348 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 1 ms 348 KB Output is correct
8 Correct 0 ms 460 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 460 KB Output is correct