This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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 |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |