// Om Namah Shivaya
// GM in 93 days
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define endl '\n'
#define pb push_back
#define conts continue
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "YES" << endl
#define no cout << "NO" << endl
#define ff first
#define ss second
#define ceil2(x,y) ((x+y-1) / (y))
#define sz(a) a.size()
#define setbits(x) __builtin_popcountll(x)
#ifndef ONLINE_JUDGE
#define debug(x) cout << #x <<" = "; print(x); cout << endl
#else
#define debug(x)
#endif
#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)
bool iseven(ll n) {if ((n & 1) == 0) return true; return false;}
void print(ll t) {cout << t;}
void print(int t) {cout << t;}
void print(string t) {cout << t;}
void print(char t) {cout << t;}
void print(double t) {cout << t;}
void print(ld t) {cout << t;}
template <class T, class V> void print(pair <T, V> p);
template <class T> void print(vector <T> v);
template <class T> void print(set <T> v);
template <class T, class V> void print(map <T, V> v);
template <class T> void print(multiset <T> v);
template <class T, class V> void print(pair <T, V> p) {cout << "{"; print(p.ff); cout << ","; print(p.ss); cout << "}";}
template <class T> void print(vector <T> v) {cout << "[ "; for (T i : v) {print(i); cout << " ";} cout << "]";}
template <class T> void print(set <T> v) {cout << "[ "; for (T i : v) {print(i); cout << " ";} cout << "]";}
template <class T> void print(multiset <T> v) {cout << "[ "; for (T i : v) {print(i); cout << " ";} cout << "]";}
template <class T, class V> void print(map <T, V> v) {cout << "[ "; for (auto i : v) {print(i); cout << " ";} cout << "]";}
template<typename T> void amin(T &a, T b) { a = min(a, b); }
template<typename T> void amax(T &a, T b) { a = max(a, b); }
void usaco(string filename) {
freopen((filename + ".in").c_str(), "r", stdin);
freopen((filename + ".out").c_str(), "w", stdout);
}
const int MOD = 1e9 + 7;
const int maxn = 1e5 + 5;
const int inf1 = 1e9 + 5;
const ll inf2 = ll(1e18) + 5;
void solve(int test_case)
{
// editorial approach
ll m, n; cin >> m >> n;
vector<pll> a(n);
rep(i, n) cin >> a[i].ff >> a[i].ss;
sort(rall(a));
ll player[6][m];
ll ptr1 = 0, ptr2 = 0;
rep(i, n) {
auto [x, y] = a[i];
while (y-- and ptr1 < 6) {
player[ptr1][ptr2] = i;
ptr2++;
if (ptr2 == m) {
ptr1++;
ptr2 = 0;
}
}
}
ll sum = 0;
rep(i, 6) rep(j, m) sum += a[player[i][j]].ff;
cout << sum << endl;
rep(i, 6) cout << player[i][0] + 1 << " ";
cout << endl;
vector<array<ll, 3>> subs;
rep1(j, m - 1) {
rep(i, 6) {
if (player[i][j] != player[i][j - 1]) {
subs.pb({j, player[i][j - 1], player[i][j]});
}
}
}
cout << sz(subs) << endl;
for (auto [t, leave, enter] : subs) {
cout << t << " " << leave + 1 << " " << enter + 1 << endl;
}
}
int main()
{
chrono::steady_clock::time_point begin = chrono::steady_clock::now();
fastio;
int t = 1;
// cin >> t;
rep1(i, t) {
solve(i);
}
chrono::steady_clock::time_point end = chrono::steady_clock::now();
cerr << "[Finished in " << chrono::duration_cast<chrono::microseconds>(end - begin).count() / 1000 << "ms]" << endl;
return 0;
}
Compilation message
hokej.cpp: In function 'void usaco(std::string)':
hokej.cpp:64:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
64 | freopen((filename + ".in").c_str(), "r", stdin);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
hokej.cpp:65:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
65 | freopen((filename + ".out").c_str(), "w", stdout);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Failed |
1 ms |
212 KB |
some player fainted |
| 2 |
Failed |
2 ms |
596 KB |
some player fainted |
| 3 |
Failed |
27 ms |
24496 KB |
some player fainted |
| 4 |
Failed |
1 ms |
340 KB |
some player fainted |
| 5 |
Failed |
10 ms |
10048 KB |
some player fainted |
| 6 |
Failed |
1 ms |
396 KB |
some player fainted |
| 7 |
Incorrect |
3 ms |
544 KB |
Output isn't correct |
| 8 |
Incorrect |
28 ms |
5260 KB |
Output isn't correct |
| 9 |
Incorrect |
139 ms |
36624 KB |
Output isn't correct |
| 10 |
Incorrect |
147 ms |
36888 KB |
Output isn't correct |
