oj.uz

답안 #584137

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
584137 2022-06-26T21:32:48 Z Toqa44 Ljeto (COCI21_ljeto) C++17
25 / 50
 1 ms 212 KB 
#include <bits/stdc++.h>

#define endl "\n"

typedef long long ll;

using namespace std;
ll n , t[109] , x[109] , y , sum1 , sum2 ;

int main()
{
    ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    cin >> n ;
    for(int i = 0; i < n ; i++)
    {
        cin >> t[i] >> x[i] >> y ;
        if(x[i] <= 4)
            sum1 += 100 ;
        else
            sum2 += 100 ;
    }

    for (int i = 0 ; i < n-1 ; i++)
    {
        if(x[i] <= 4)
        {
            if(t[i+1] - t[i] <= 10 && x[i+1] == x[i])
                sum1 += 50 ;
        }

        else
        {
            if(t[i+1] - t[i] <= 10 && x[i+1] == x[i])
                sum2 += 50 ;
        }
    }

    cout << sum1 << " " << sum2 << endl ;


    return 0;
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct

Subtask #3
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Incorrect 1 ms 212 KB Output isn't correct
12 Halted 0 ms 0 KB -