# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
752299 |
2023-06-02T17:00:56 Z |
Augustyn |
Ljeto (COCI21_ljeto) |
C++17 |
|
1 ms |
212 KB |
#include<iostream>
#include<vector>
using namespace std;
int main()
{
int n,odp[2];
odp[0]=odp[1]=0;
cin>>n;
vector<int>timeost(9,-1000000);
for(int i=0;i<n;++i)
{
int t,a,b;
cin>>t>>a>>b;
odp[a/5]+=100;
if(t-timeost[a]<=10)
odp[a/5]+=50;
timeost[a]=t;
}
cout<<odp[0]<<" "<<odp[1];
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
212 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
212 KB |
Output is correct |
3 |
Correct |
1 ms |
212 KB |
Output is correct |
4 |
Correct |
1 ms |
212 KB |
Output is correct |
5 |
Correct |
1 ms |
212 KB |
Output is correct |
6 |
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 |
1 ms |
212 KB |
Output is correct |
3 |
Correct |
1 ms |
212 KB |
Output is correct |
4 |
Correct |
1 ms |
212 KB |
Output is correct |
5 |
Correct |
1 ms |
212 KB |
Output is correct |
6 |
Correct |
1 ms |
212 KB |
Output is correct |
7 |
Correct |
1 ms |
212 KB |
Output is correct |
8 |
Correct |
0 ms |
212 KB |
Output is correct |
9 |
Correct |
1 ms |
212 KB |
Output is correct |
10 |
Correct |
1 ms |
212 KB |
Output is correct |
11 |
Correct |
1 ms |
212 KB |
Output is correct |
12 |
Correct |
1 ms |
212 KB |
Output is correct |
13 |
Correct |
1 ms |
212 KB |
Output is correct |