#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <string>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
typedef long double ld;
#define REP(i,a,b) for(ll i=a; i<b; i++)
#define pb push_back
#define mp make_pair
#define pl pair<ll,ll>
#define ff first
#define ss second
#define INF ((ll) pow(2,63) -1)
ll insig;
#define In(vecBRO, LENBRO) REP(IBRO,0,LENBRO) {cin>>insig; vecBRO.pb(insig);}
void Out(vector<ll> x) {REP(i,0,x.size()) {cout<<x[i]<<" ";} cout<<endl;}
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
ll M,N; cin>>M>>N; vector<pl> p; vector<pair<pl,ll> > pc; ll cur1,cur2;
REP(i,0,N) {cin>>cur1>>cur2; p.pb(mp(cur1,cur2)); pc.pb(mp(mp(cur1,cur2),i));}
sort(p.begin(),p.end()); sort(pc.begin(),pc.end());
reverse(p.begin(),p.end()); reverse(pc.begin(),pc.end());
vector<ll> per; REP(i,0,N) {per.pb(0);}
REP(i,0,N) {per[i]=pc[i].ss;}
ll ans=0; ll mi=0;
REP(i,0,N)
{
mi+=p[i].ss; ans+=p[i].ff*p[i].ss;
if(mi>6*M)
{
ll miss=mi-6*M; ans-=p[i].ff*miss;
}
}
cout<<ans<<endl;
vector<pl> team;
REP(i,0,6) {cout<<per[i]+1<<" "; team.pb(mp(i,p[i].ss));}
cout<<endl; vector<vector<ll> > sub; ll nex=6; vector<ll> tr; tr.pb(0); tr.pb(0); tr.pb(0);
REP(i,0,M-1)
{
REP(j,0,6)
{
team[j].ss--;
}
REP(j,0,6)
{
if(team[j].ss==0)
{
tr[0]=i+1;
tr[1]=team[j].ff;
tr[2]=nex;
team[j]=mp(nex,p[nex].ss);
nex++;
sub.pb(tr);
}
}
}
cout<<sub.size()<<endl;
REP(i,0,sub.size())
{
cout<<sub[i][0]<<" "<<per[sub[i][1]]+1<<" "<<per[sub[i][2]]+1<<endl;
}
return 0;
}
Compilation message
hokej.cpp: In function 'void Out(std::vector<long long int>)':
hokej.cpp:10:33: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
#define REP(i,a,b) for(ll i=a; i<b; i++)
hokej.cpp:19:29:
void Out(vector<ll> x) {REP(i,0,x.size()) {cout<<x[i]<<" ";} cout<<endl;}
~~~~~~~~~~~~
hokej.cpp:19:25: note: in expansion of macro 'REP'
void Out(vector<ll> x) {REP(i,0,x.size()) {cout<<x[i]<<" ";} cout<<endl;}
^~~
hokej.cpp: In function 'int main()':
hokej.cpp:10:33: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
#define REP(i,a,b) for(ll i=a; i<b; i++)
hokej.cpp:64:9:
REP(i,0,sub.size())
~~~~~~~~~~~~~~
hokej.cpp:64:5: note: in expansion of macro 'REP'
REP(i,0,sub.size())
^~~
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Failed |
2 ms |
376 KB |
the answer doesn't match with the value Z |
| 2 |
Failed |
5 ms |
888 KB |
the answer doesn't match with the value Z |
| 3 |
Failed |
21 ms |
1816 KB |
the answer doesn't match with the value Z |
| 4 |
Failed |
3 ms |
376 KB |
the answer doesn't match with the value Z |
| 5 |
Failed |
13 ms |
1116 KB |
the answer doesn't match with the value Z |
| 6 |
Failed |
6 ms |
632 KB |
the answer doesn't match with the value Z |
| 7 |
Failed |
7 ms |
1116 KB |
the answer doesn't match with the value Z |
| 8 |
Failed |
75 ms |
6264 KB |
the answer doesn't match with the value Z |
| 9 |
Failed |
293 ms |
28084 KB |
the answer doesn't match with the value Z |
| 10 |
Failed |
314 ms |
28208 KB |
the answer doesn't match with the value Z |
