# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
151616 | OptxPrime | Hokej (COCI17_hokej) | C++11 | 217 ms | 23168 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.
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define ll long long
/// 9 12
struct player{
int k,e,id;
player(){}
player( int k, int e,int id ):k(k),e(e),id(id){}
} p[500010];
vector<pair<int,int>> event[500010];
bool cmp( player a, player b )
{
if( a.k != b.k ) return a.k>b.k;
return a.e<b.e;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n,m;
cin>>m>>n;
for(int i=0;i<n;i++){
cin>>p[i].k >> p[i].e;
p[i].id=i+1;
}
sort( p,p+n,cmp );
vector<int>citav;
int prev=-1,time=0,tot=0,timetotal=0,sz=0;
for( int i=0;i<n;i++ ){
/// cout << i << " " << time << " " << prev << " " << timetotal << " kontas " <<endl;
if( p[i].e==m ){
citav.pb( p[i].id );
tot+=p[i].k*m;
timetotal+=m;
}
else{
event[time].pb( mp( prev, p[i].id ) );
if(time!=0)sz++;
if( timetotal + p[i].e >= 6*m ){
tot+=p[i].k*( 6*m - timetotal );
break;
}
if( time + p[i].e > m ){
event[0].pb( mp( -1, p[i].id ) );
}
time+=p[i].e;
tot+=p[i].k*p[i].e;
timetotal+=p[i].e;
if( time>=m ) time-=m;
prev=p[i].id;
}
}
cout <<tot<<endl;
for( int i=0;i<citav.size();i++ ) {
cout << citav[i] << " ";
}
// cout << " ";
for( int i=0;i<event[0].size();i++ ) cout << event[0][i].second << " ";
cout << endl;
cout<<sz<<endl;
for( int i=1;i<=m;i++ ){
for( int j=0;j<event[i].size();j++ ){
cout << i << " " << event[i][j].first << " " << event[i][j].second <<endl;
}
}
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |