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 <map>
#include <vector>
#include <algorithm>
using namespace std;
const int N = 1e6 +10;
int a[N];
int b[N];
int d[N];
int dd[N];
int tm[N];
int main() {
int n;
cin>>n;
int t[3] = {0};
tm[0] = -1e8;
for (int i=1;i<=n;i++){
cin>>tm[i]>>a[i]>>b[i];
if (a[i]<5)
d[i] = 1;
else
d[i] = 2;
}
for (int i=1;i<=n;i++){
t[d[i]] += 100;
if (a[i]==a[i-1] and tm[i] - tm[i-1] <= 10)
t[d[i]] += 50;
}
cout<<t[1]<<" "<<t[2]<<endl;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |