# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
633637 | 2022-08-22T23:25:05 Z | Pietra | Ljeto (COCI21_ljeto) | C++14 | 0 ms | 212 KB |
// ordena pelo tempo e bruta #include<bits/stdc++.h> using namespace std ; const int maxn = 110 ; const int inf = 1e5 ; int n, lst[10], sce, scd, timer ; int esq[8], dir[8] ; // atinge algm e ja tinha atingido outro aglm nos ultimos 10s int main(){ cin >> n ; int ctd = 0, cte = 0 ; for(int i = 1 ; i <= n ; i++) lst[i] = -inf ; for(int i = 1 ; i <= n ; i++){ int t, a, b ; cin >> t >> a >> b ; if(a <= 4){ sce += 100 ; if(t <= lst[a] + 10) sce += 50 ; } else{ scd += 100 ; if(t <= lst[a] + 10) scd += 50 ; } lst[a] = t ; } cout << sce << " " << scd << "\n" ; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 212 KB | Output is correct |
2 | Correct | 0 ms | 212 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 212 KB | Output is correct |
2 | Correct | 0 ms | 212 KB | Output is correct |
3 | Incorrect | 0 ms | 212 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | 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 | Incorrect | 0 ms | 212 KB | Output isn't correct |
6 | Halted | 0 ms | 0 KB | - |