//Coded by Chirath Nirodha
#include<bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//using namespace __gnu_pbds;
using namespace std;
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define P push
#define I insert
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
//typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> indexed_set;
const ll mod=1e9+7;
inline void io(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
}
void solve(){
io();
int n;cin>>n;
vector<pair<int,pair<int,int> > > v;
for(int i=0;i<n;i++){
int t,a,b;cin>>t>>a>>b;a--;b--;
v.PB(MP(t,MP(a,b)));
}
sort(v.begin(),v.end());
int last[8];memset(last,-1,sizeof(last));
int sp=0,sb=0;
for(int i=0;i<n;i++){
int t=v[i].F,a=v[i].S.F,b=v[i].S.S;
if(a<=4){
if(b<=4)continue;
sp+=100;
if(t-last[a]<=10)sp+=50;
last[a]=t;
}
else{
if(b>4)continue;
sb+=100;
if(t-last[a]<=10)sb+=50;
last[a]=t;
}
}
cout<<sp<<" "<<sb<<endl;
}
int main(){
io();
solve();
//int t;cin>>t;for(int i=0;i<t;i++)solve();
return 0;
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
0 ms |
212 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
0 ms |
212 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
0 ms |
212 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
