# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
472854 | SaraMostafa | Hokej (COCI17_hokej) | C++14 | 639 ms | 40192 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>
#include<unordered_map>
using namespace std;
#define ll long long
#define endl "\n"
#define Sara ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
const long long mod=998244353;
const double PI=acos(-1);
struct sub
{
ll t,a,b;
sub(ll ti,ll ai,ll bi)
{
t=ti;
a=ai;
b=bi;
}
};
int main()
{
//freopen("input.in","r",stdin);
Sara
ll m,n;
cin>>m>>n;
vector<pair<ll,ll>>v(n);
map<pair<ll,ll>,ll>mp;
for(int i=0; i<n; i++)
{
cin>>v[i].first>>v[i].second;
mp[ {v[i].first,v[i].second}]=i+1;
}
sort(v.rbegin(),v.rend());
vector<sub>b;
vector<ll>f(6);
vector<pair<ll,ll>>c(6);
for(int i=0; i<6; i++)
{
f[i]=mp[{v[i].first,v[i].second}];
c[i]= {v[i].first,v[i].second};
}
ll id=6;
ll cnt=0,sum=0;
for(int i=1; i<=m; i++)
{
bool valid=1;
sum=0;
for(int j=0; j<6; j++)
{
if(c[j].second-i<0)
{
valid=0;
for(int k=id; k<n; k++)
{
b.push_back({i,mp[c[j]],mp[v[k]]});
v[k].second+=c[j].second;
c[j]=v[k];
id++;
valid=1;
break;
}
}
sum+=c[j].first;
}
if(valid){
// cout<<"sum"<<sum<<endl;
cnt+=sum;
}
else break;
}
cout<<cnt<<endl;
for(int i=0;i<6;i++) cout<<f[i]<<' ';
cout<<endl;
cout<<b.size()<<endl;
for(int i=0;i<b.size();i++){
cout<<b[i].t<<' '<<b[i].a<<' '<<b[i].b<<endl;
}
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |