제출 #862263

#제출 시각아이디문제언어결과실행 시간메모리
862263AbdelmagedNourLjeto (COCI21_ljeto)C++17
50 / 50
1 ms348 KiB
#include <bits/stdc++.h> #pragma GCC optimize("Ofast") using namespace std; typedef long long ll; int last[105],s[2]; int main(){ ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n; cin>>n; memset(last,-'?',sizeof(last)); for(int i=0;i<n;i++){ int t,a,b; cin>>t>>a>>b; a--;b--; s[a>b]+=100; if(t-last[a]<=10)s[a>b]+=50; last[a]=t; } cout<<s[0]<<" "<<s[1]<<"\n"; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...