# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
499551 | 2021-12-28T15:26:31 Z | Ibraheem | Ljeto (COCI21_ljeto) | C++14 | 1 ms | 204 KB |
#include<bits/stdc++.h> using namespace std; int a[9]; int main(){ a[1] = -1; a[2] = -1; a[3] = -1; a[4] = -1; a[5] = -1; a[6] = -1; a[7] = -1; a[8] = -1; int n, r , i , p = 0 , k , t , o = 0; cin >> n; i = n; while(n > 0){ cin >> t >> r >> k; if(i == n - a[r] > 10){ if(r <= 4){ o = o + 100; } if(r >= 5){ p = p + 100; } }else if(t - a[r] <= 10 && t >= 10 ){ if(r <= 4){ o = o + 150; }if(r >= 5){ p = p + 150; } }else{ if(r <= 4){ o = o + 100; }if(r >= 5){ p = p + 100; } } a[k] = -1; a[r] = t; n--; } cout << o << ' ' << p; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 204 KB | Output is correct |
2 | Correct | 0 ms | 204 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 204 KB | Output is correct |
2 | Correct | 0 ms | 204 KB | Output is correct |
3 | Correct | 1 ms | 204 KB | Output is correct |
4 | Correct | 0 ms | 204 KB | Output is correct |
5 | Correct | 0 ms | 204 KB | Output is correct |
6 | Correct | 0 ms | 204 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 204 KB | Output is correct |
2 | Correct | 0 ms | 204 KB | Output is correct |
3 | Correct | 0 ms | 204 KB | Output is correct |
4 | Correct | 0 ms | 204 KB | Output is correct |
5 | Correct | 1 ms | 204 KB | Output is correct |
6 | Correct | 0 ms | 204 KB | Output is correct |
7 | Correct | 0 ms | 204 KB | Output is correct |
8 | Correct | 0 ms | 204 KB | Output is correct |
9 | Correct | 0 ms | 204 KB | Output is correct |
10 | Correct | 0 ms | 204 KB | Output is correct |
11 | Incorrect | 0 ms | 204 KB | Output isn't correct |
12 | Halted | 0 ms | 0 KB | - |