이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define f first
#define s second
map <int,int> mp;
int a[10000],b[10000],t[10000];
int sum2,n,sum1;
int main(){
ios::sync_with_stdio(false);
cin.tie(NULL);
cin>>n;
for(int i=0;i<n;i++){
cin>>t[i]>>a[i]>>b[i];
if((t[i]-mp[a[i]])<=10 and mp[a[i]]!=0){
if(a[i]>=5){
sum2+=150;
}else{
sum1+=150;
}
mp[a[i]]=t[i];
}else{
if(a[i]>=5){
sum2+=100;
}else{
sum1+=100;
}
mp[a[i]]=t[i];
}
}
cout<<sum1<<" "<<sum2;
}
/*
aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa
annnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnna
an%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%na
an %na
an %na
an %na
an %na
an %na
an %na
an %na
annnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnnna
aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa
*/
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |