| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 929178 | Zena_Hossam | Hokej (COCI17_hokej) | C++14 | 213 ms | 12124 KiB | 
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define fi ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
//#define ll double
#define ll long long
#define F first
#define S second
#define sz size()
#define all(s) s.begin(),s.end()
#define all1(s) s.rbegin(),s.rend()
int main()
{
    // freopen("maxcross.in","r",stdin);freopen("maxcross.out","w",stdout);
    ll T=1;
    //cin>>T;ll oo=0;
    while(T--)
    {
        ll n,m;
        cin>>n>>m;
        pair<ll,pair<ll,ll>>arr[m];
        for(ll i=0; i<m; i++)
        {
            cin>>arr[i].first>>arr[i].second.first;
            arr[i].first*=min(arr[i].second.first,n);
            arr[i].second.second=i;
        }
        sort(arr,arr+m);
        reverse(arr,arr+m);
        ll c=0,s=0;
        priority_queue<pair<ll,ll>,vector<pair<ll,ll>>,greater<pair<ll,ll>>>w;vector<ll>kk;
        for(ll i=0; i<6; i++)
        {
            s+=arr[i].first/arr[i].second.first;
            w.push({arr[i].second.first,arr[i].second.second});
            kk.push_back(arr[i].second.second+1);
        }//cout<<"\n";
        sort(all(kk));
        ll X=0;
        ll u=6;vector<pair<ll,pair<ll,ll>>>ee;
        while(X<n)
        {
            while(w.top().first==X)
            {
                while(u<m&&arr[u].second.first>n-X){//cout<<n-X<<" "<<arr[u].second.first<<" "<<u<<"\n";
                    arr[u].first=arr[u].first/arr[u].second.first*(n-X);
                    arr[u].second.first=n-X;
                    sort(arr+u+1,arr+m);
                }
                s-=arr[w.top().second].first/arr[w.top().second].second.first;
                ee.push_back({X,{w.top().second,arr[u].second.second}});
                s+=arr[u].first/arr[u].second.first;
                w.pop();w.push({arr[u].second.first+X,arr[u].second.second});//cout<<u<<" "<<arr[u].second.second<<" "<<X<<"\n";
                u++;
            }
            c+=s;
            X++;
        }
        cout<<c<<"\n";
        for(ll i=0;i<kk.sz;i++)cout<<kk[i]<<" ";cout<<"\n";cout<<ee.sz<<"\n";
        for(ll i=0;i<ee.sz;i++){
            cout<<ee[i].first<<" "<<ee[i].second.first+1<<" "<<ee[i].second.second+1<<"\n";
        }
    }
}
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
