This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
//struct Edge {int u, v, weight;bool operator<(Edge const& other) {return weight < other.weight;}};
#include <bits/stdc++.h>
#define endl "\n"
#define ll long long
#define sp ' '
#define pb push_back
#define ar for(int i=1;i<=n;i++)
using namespace std;
ll t=1;
const ll N=3e5+100;
ll n,m,q,k;
ll a[N],b[N],c[N];
void solve()
{
map<int,int>mp;
for(int i=1;i<=8;i++){mp[i]=-100;}
cin>>n;
ll ans1=0,ans2=0;
for(int i=1;i<=n;i++)
{
ll x,y,z;
cin>>x>>y>>z;
if(x-mp[y]>10&&y<=4){ans1+=100;mp[y]=x;}
else if(x-mp[y]<=10&&y<=4){ans1+=150;mp[y]=x;}
if(x-mp[y]>10&&y>4){ans2+=100;mp[y]=x;}
else if(x-mp[y]<=10&&y>4){ans2+=150;mp[y]=x;}
}
cout<<ans1<<" "<<ans2<<endl;return;
}
int main()
{
//freopen("shell.in", "r", stdin);
// freopen("shell.out", "w", stdout);
ios::sync_with_stdio(NULL);
cin.tie(NULL);cout.tie(NULL);
// 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... |