제출 #1304164

#제출 시각아이디문제언어결과실행 시간메모리
1304164yus1f_mLjeto (COCI21_ljeto)C++20
50 / 50
1 ms580 KiB
#pragma GCC optimize("O3") #include <bits/stdc++.h> #define ll long long #define str string #define pb push_back #define pf push_front #define in insert #define all(v) v.begin(),v.end() const int sz=1000000,INF=1000000000; using namespace std; void solve() { ll n,num1,num2,num3,ans1=0,ans2=0; cin>>n; map<ll,ll>nums; for(int i=0;i<n;i++) { cin>>num1>>num2>>num3; if(num2<5) { if(nums[num2]!=0 && num1-nums[num2]<=10) { ans1+=150; } else { ans1+=100; } } else { if(nums[num2]!=0 && num1-nums[num2]<=10) { ans2+=150; } else { ans2+=100; } } nums[num2]=num1; } cout<<ans1<<" "<<ans2; } int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr),cout.tie(nullptr); ll t=1; //cin>>t; while(t--) { solve(); } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...