Submission #496698

#TimeUsernameProblemLanguageResultExecution timeMemory
496698inksamuraiACM (COCI19_acm)C++17
50 / 50
9 ms500 KiB
#include <bits/stdc++.h> #define fi first #define se second #define pb push_back #define sz(a) (int)a.size() #define all(a) a.begin(),a.end() #define rep(i,n) for(int i=0;i<n;i++) #define crep(i,x,n) for(int i=x;i<n;i++) #define drep(i,n) for(int i=n-1;i>=0;i--) #define vec(...) vector<__VA_ARGS__> #define _32bB6rn ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0) using namespace std; typedef long long ll; typedef long double ld; using pii=pair<int,int>; using vi=vector<int>; int main(){ _32bB6rn; int n,m; cin>>n>>m; std::map<string,pair<ll,ll>> mp; string hm="NijeZivotJedanACM"; rep(i,n+1){ string s; cin>>s; mp[s]={0,0}; rep(i,m){ string now; cin>>now; if(now[0]=='+' or now[0]=='?'){ mp[s].fi++; now.erase(now.begin()); int x=now[0]-'0'; mp[s].se+=x*1200; now.erase(now.begin()); now.erase(now.begin()); ll y=(now[0]-'0')*10+(now[1]-'0'); mp[s].se+=y*3600; rep(_,3) now.erase(now.begin()); y=(now[0]-'0')*10+(now[1]-'0'); mp[s].se+=y*60; rep(_,3) now.erase(now.begin()); y=(now[0]-'0')*10+(now[1]-'0'); mp[s].se+=y; } } } pair<ll,ll> score=mp[hm]; int cnt=0; for(auto p : mp){ if(p.fi==hm) continue; if(p.se.fi>score.fi) cnt++; else if(p.se.fi==score.fi){ if(p.se.se<score.se) cnt++; else if(p.se.se==score.se){ if(p.fi<hm) cnt++; } } } cout<<cnt+1<<"\n"; // return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...