Submission #555495

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
555495	2022-05-01T05:49:49 Z	SmolBrain	Hokej (COCI17_hokej)	C++17	120 / 120	232 ms	47748 KB

hokej

// 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<array<ll, 3>> a(n);
    rep(i, n) {
        ll x, y; cin >> x >> y;
        a[i] = {x, y, i};
    }

    sort(rall(a));

    vector<array<ll, 3>> b;
    ll tot = 0;

    rep(i, n) {
        auto [x, y, id] = a[i];
        ll cnt = 0;

        while (cnt < y and tot < m * 6) {
            cnt++;
            tot++;
        }

        b.pb({cnt, x, id});
    }

    sort(rall(b));

    ll player[6][m];

    ll ptr1 = 0, ptr2 = 0;
    ll sum = 0;

    for (auto [cnt, x, id] : b) {
        while (cnt--) {
            player[ptr1][ptr2] = id;
            sum += x;
            ptr2++;

            if (ptr2 == m) {
                ptr1++;
                ptr2 = 0;
            }
        }
    }

    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);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1

120.0 / 120.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	2 ms	788 KB	Output is correct
3	Correct	31 ms	25028 KB	Output is correct
4	Correct	1 ms	340 KB	Output is correct
5	Correct	10 ms	10300 KB	Output is correct
6	Correct	1 ms	468 KB	Output is correct
7	Correct	3 ms	1044 KB	Output is correct
8	Correct	38 ms	7780 KB	Output is correct
9	Correct	232 ms	47748 KB	Output is correct
10	Correct	207 ms	47740 KB	Output is correct