# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
499402 | 2021-12-28T11:09:04 Z | Alisaf9 | Ljeto (COCI21_ljeto) | C++14 | 1 ms | 204 KB |
#include <bits/stdc++.h> using namespace std; int main() { int n,q,f=0,s=0,w,e; cin>>n; int a[100000]; pair<int,int>pp[1009]; for(int i=0;i<n;i++) { cin>>pp[i].second>>pp[i].first>>q; } for(int i=0;i<n;i++) { if(pp[i].first<5) f+=100; else s+=100; if(pp[i].first==pp[i-1].first) { if(pp[i].second-pp[i-1].second<=10) { if(pp[i].first<5) f+=50; } else s+=50; } } cout<<f<<" "<<s; return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 204 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 204 KB | Output is correct |
2 | Correct | 0 ms | 204 KB | Output is correct |
3 | Incorrect | 0 ms | 204 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 204 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |