oj.uz

Submission #234594

# Submission time Handle Problem Language Result Execution time Memory
234594 2020-05-24T17:50:32 Z Vimmer Hokej (COCI17_hokej) C++14
120 / 120
 995 ms 18424 KB 
#include <bits/stdc++.h>

#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-O3")
#pragma GCC optimize("Ofast")

#define F first
#define S second
#define sz(x) int(x.size())
#define pb push_back
#define N 500005
#define M ll(1e9 + 7)
#define inf 1e9 + 1e9

using namespace std;

typedef long double ld;
typedef long long ll;

typedef short int si;

int main()
{
    //freopen("input.txt", "r", stdin);// freopen("output.txt", "w", stdout);

    ios_base::sync_with_stdio(0); istream::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int m, n;

    cin >> m >> n;

    int a[m][6];

    vector <pair <pair <int, int>, int> > g(n);

    for (int i = 0; i < n; i++)
    {
        g[i].S = i;

        cin >> g[i].F.F >> g[i].F.S;
    }

    sort(g.begin(), g.end());

    reverse(g.begin(), g.end());

    int j = 0, kol = 0;

    ll ans = 0;

    for (int u = 0; u < 6; u++)
        for (int i = 0; i < m; i++)
        {
            if (kol == m) {j++; i--; kol = 0; continue;}

            kol++;

            a[i][u] = g[j].S;

            ans += g[j].F.F;

            g[j].F.S--;

            if (g[j].F.S == 0) {kol = 0; j++;}
        }

    cout << ans << endl;

    for (int i = 0; i < 6; i++) cout << a[0][i] + 1 << " "; cout << endl;

    set <int> pr; pr.clear();

    for (int i = 0; i < 6; i++) pr.insert(a[0][i]);

    kol = 0;

    for (int i = 1; i < m; i++)
    {
        set <int> gr; gr.clear();

        for (int j = 0; j < 6; j++) gr.insert(a[i][j]);

        while (sz(pr) > 0)
        {
            if (gr.find(*pr.begin()) == gr.end()) kol++;

            gr.erase(*pr.begin());

            pr.erase(pr.begin());
        }

        for (int j = 0; j < 6; j++) pr.insert(a[i][j]);
    }

    cout << kol << endl;

    pr.clear();

    for (int i = 0; i < 6; i++) pr.insert(a[0][i]);

    for (int i = 1; i < m; i++)
    {
        set <int> gr; gr.clear();

        for (int j = 0; j < 6; j++) gr.insert(a[i][j]);

        vector <int> swp; swp.clear();

        while (sz(pr) > 0)
        {
            if (gr.find(*pr.begin()) == gr.end()) swp.pb(*pr.begin());

            gr.erase(*pr.begin());

            pr.erase(pr.begin());
        }

        for (auto it : swp)
        {
            cout << i << " " << it + 1 << " " << *gr.begin() + 1 << endl;

            gr.erase(gr.begin());
        }

        for (int j = 0; j < 6; j++) pr.insert(a[i][j]);
    }
}

Compilation message

hokej.cpp: In function 'int main()':
hokej.cpp:69:5: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
     for (int i = 0; i < 6; i++) cout << a[0][i] + 1 << " "; cout << endl;
     ^~~
hokej.cpp:69:61: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
     for (int i = 0; i < 6; i++) cout << a[0][i] + 1 << " "; cout << endl;
                                                             ^~~~

Subtask #1
120.0 / 120.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 11 ms 512 KB Output is correct
3 Correct 842 ms 12416 KB Output is correct
4 Correct 8 ms 384 KB Output is correct
5 Correct 348 ms 5240 KB Output is correct
6 Correct 9 ms 384 KB Output is correct
7 Correct 10 ms 512 KB Output is correct
8 Correct 133 ms 2808 KB Output is correct
9 Correct 980 ms 18424 KB Output is correct
10 Correct 995 ms 18168 KB Output is correct