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<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
#define rep(a,b) for(int a = 0; a < (b); ++a)
#define pb push_back
#define all(t) t.begin(), t.end()
const int MAXN = 1e6+5, INF = 2e9+50;
const ull INF_L = (ull)1e19+500;
int n,t,a,b;
ll A = 0, B = 0;
int ost[10];
void solve()
{
cin >> n;
for(int i = 1; i <= 8; ++i) ost[i] = -5000;
rep(i,n)
{
cin >> t >> a >> b;
ll sum = 0;
if(t-ost[a] <= 10) sum = 150;
else sum = 100;
ost[a] = t;
if(a <= 4) A += sum;
else B += sum;
}
cout << A << ' ' << B << '\n';
}
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
int T = 1;
//cin >> T;
while(T--) solve();
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |