#include <bits/stdc++.h>
#define int long long
using namespace std;
vector<pair<pair<int,int>,int>> subs;
vector<pair<pair<int,int>,int>> players;
int game[7][500005];
int ind[500005], sum;
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
int n,m; cin>>m>>n;
for(int i=0; i<n; i++) {
int x,y; cin>>x>>y;
players.push_back({{x,y},i});
}
sort(players.begin(),players.end());
int now = n-1;
for(int i=0; i<6; i++) {
for(int min = 0; min<m; min++ ) {
if(players[now].first.second==0) now--;
game[i][min] = players[now].second;
sum += players[now].first.first;
players[now].first.second--;
}
}
cout<<sum<<'\n';
for(int i=0; i<6; i++) {
for(int min=1; min<m; min++) {
if(game[i][min]!=game[i][min-1]) subs.push_back({{min, game[i][min-1]+1}, game[i][min]+1});
}
}
for(int i=0; i<6; i++) cout<<game[i][0]+1<<' ';
cout<<'\n';
cout<<subs.size()<<'\n';
sort(subs.begin(),subs.end());
for(auto it:subs) cout<<it.first.first<<' '<<it.first.second<<' '<<it.second<<'\n';
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
12632 KB |
Output is correct |
2 |
Correct |
3 ms |
12824 KB |
Output is correct |
3 |
Correct |
22 ms |
27844 KB |
Output is correct |
4 |
Correct |
2 ms |
12636 KB |
Output is correct |
5 |
Correct |
9 ms |
25432 KB |
Output is correct |
6 |
Correct |
3 ms |
12892 KB |
Output is correct |
7 |
Incorrect |
4 ms |
12888 KB |
Output isn't correct |
8 |
Incorrect |
25 ms |
17604 KB |
Output isn't correct |
9 |
Incorrect |
119 ms |
39208 KB |
Output isn't correct |
10 |
Incorrect |
121 ms |
39592 KB |
Output isn't correct |