oj.uz

답안 #981805

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
981805 2024-05-13T15:12:00 Z samek08 Ljeto (COCI21_ljeto) C++14
50 / 50
 0 ms 456 KB 
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define rep(a,b) for(int a = 0; a < (b); ++a)
#define pb push_back
#define all(t) t.begin(), t.end()

const int MAXN = 1e6+5, INF = 2e9+50;
const ull INF_L = (ull)1e19+500;

int n,t,a,b;
ll A = 0, B = 0;
int ost[10];

void solve()
{
	cin >> n;
	for(int i = 1; i <= 8; ++i) ost[i] = -5000;
	rep(i,n)
	{
		cin >> t >> a >> b;
		ll sum = 0;
		if(t-ost[a] <= 10) sum = 150;
		else sum = 100;
		ost[a] = t;
		if(a <= 4) A += sum;
		else B += sum;
	}
	cout << A << ' ' << B << '\n';
}

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0); 

    int T = 1;
   	//cin >> T;
    while(T--) solve();

    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 0 ms 456 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 448 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 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 0 ms 348 KB Output is correct
4 Correct 0 ms 456 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 448 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 456 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct