Submission #1174075

#	Time	Username	Problem	Language	Result	Execution time	Memory
1174075		hewfhlwejfl	ACM (COCI19_acm)	C++20	20 / 50	16 ms	19016 KiB

acm

#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define pll pair<long long, long long>
#define ppl pair<pll, long long>
#define ll long long
#define se second
#define fi first
#define pb push_back
ll T,n,nq,a[1001009],m,cmp,ind,k,b[1001009],bn,r,res,y,vis1[4000009],vis[4000009],x,ma[400009],l;
string s[10009][59],t;
struct st
{
    ll sc,h,m,s,ind;
};
st pen[1000009];
bool prime(ll num)
{
    if(num<=1)return 1;
    for(ll i=2;i*i<=num;i++)
        if(num%i==0)return 0;
    return 1;
}
ll f(string s1)
{
    ll ret=0;
    l=1;
    while(s1[l]!='/')
    {
        ret+=s1[l]-'0';
        ret*=10;
        l++;
    }
    return ret/10;
}

int main()
{
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    ll fl=0;
	cin>>n>>m;
	for(int i=1;i<=n;i++)
    {
        cin>>s[i][0];
        t=s[i][0];
        if(t=="NijeZivotJedanACM")ind=i;
        pen[i].ind=i;
        for(int j=1;j<=m;j++)
        {
            cin>>s[i][j];
            if(s[i][j]=="-" || t=="NijeZivotJedanACM")continue;
            else
            {
                pen[i].sc++;
                pen[i].m+=f(s[i][j])*20;l++;
                pen[i].h+=(s[i][j][l]-'0')*10+s[i][j][l+1]-'0';
                pen[i].m+=(s[i][j][l+3]-'0')*10+s[i][j][l+4]-'0';
                pen[i].s+=(s[i][j][l+6]-'0')*10+s[i][j][l+7]-'0';
                if(pen[i].s>=60)pen[i].m+=pen[i].s/60,pen[i].s%=60;
                if(pen[i].m>=60)pen[i].h+=pen[i].m/60,pen[i].m%=60;
            }
        }
    }
    cin>>t;
    for(int j=1;j<=m;j++)
    {
        cin>>s[ind][j];
        ll i=ind;
        if(s[i][j]=="-")continue;
        else
        {
            pen[i].sc++;
            pen[i].m+=f(s[i][j])*20;l++;
            pen[i].h+=(s[i][j][l]-'0')*10+s[i][j][l+1]-'0';
            pen[i].m+=(s[i][j][l+3]-'0')*10+s[i][j][l+4]-'0';
            pen[i].s+=(s[i][j][l+6]-'0')*10+s[i][j][l+7]-'0';
            if(pen[i].s>=60)pen[i].m+=pen[i].s/60,pen[i].s%=60;
            if(pen[i].m>=60)pen[i].h+=pen[i].m/60,pen[i].m%=60;
        }
    }
    sort(pen+1,pen+1+n,[](st x,st y){
         if(x.sc!=y.sc)return x.sc>y.sc;
         else if(x.h!=y.h)return x.h<y.h;
         else if(x.m!=y.m)return x.m<y.m;
         else if(x.s!=y.s)return x.s<y.s;
         else return s[x.ind][0]<s[y.ind][0];
            });
    for(int i=1;i<=n;i++)
        if(pen[i].ind==ind)
        {
            cout<<i;
            break;
        }
    //for(int i=1;i<=n;i++)cout<<a[i]<<endl;
    return 0;
}

• Subtask 1: 20 / 50