답안 #585331

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
585331 2022-06-28T16:43:15 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 ; i++)
    {
        for(int j = i + 1 ; j < n ; j++)
        {
            if(t[j] - t[i] <= 10 && x[i] == x[j] && x[i] <= 4)
                sum1 += 50 ;
            else if(t[j] - t[i] <= 10 && x[i] == x[j] && x[i] <= 8 && x[i] >=5)
                sum2 += 50 ;
        }
    }

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


    return 0;
}







# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 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
# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 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 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Incorrect 0 ms 212 KB Output isn't correct
12 Halted 0 ms 0 KB -