oj.uz

Submission #173876

# Submission time Handle Problem Language Result Execution time Memory
173876 2020-01-05T16:41:44 Z VEGAnn Gift (IZhO18_nicegift) C++14
49 / 100
 2000 ms 330280 KB 
#include <bits/stdc++.h>
#define sz(x) ((int)x.size())
#define pii pair<int, int>
#define ft first
#define sd second
#define MP make_pair
#define PB push_back
using namespace std;
typedef long long ll;
const int oo = 2e9;
const ll OO = 1e18;
const int N = 1000100;
set<pii, greater<pii> > st;
vector<vector<int> > ans;
vector<int> vc;
int n, k, sm;
ll a[N];

void BAD(){
    cout << -1;
    exit(0);
}

int main(){
    ios_base::sync_with_stdio(0); cin.tie(0);

    cin >> n >> k;
    bool ok = 1;
    for (int i = 0; i < n; i++){
        cin >> a[i];
        if (i > 0)
            ok &= bool(a[i] == a[i - 1]);
    }

    if (ok){
        int kl = k / __gcd(n, k);
        if (a[0] % kl == 0){
            int bd = kl * n;
            for (int it = 0; it < bd; it += k){
                vc.clear();
                for (int lit = 0; lit < k; lit++){
                    int ps = (it + lit) % n;
                    vc.PB(ps);
                }
                ans.PB(vc);
            }

            cout << sz(ans) << '\n';
            for (int it = 0; it < sz(ans); it++){
                cout << a[0] / kl;
                for (int x : ans[it])
                    cout << " " << x + 1;
                cout << '\n';
            }
        } else {
            cout << -1;
        }

        return 0;
    }

    for (int i = 0; i < n; i++){
        sm += a[i];
        st.insert(MP(a[i], i));
    }

    while (sm > 0){
        vc.clear();
        for (int it = 0; it < k; it++){
            pii cr = (*st.begin());
            st.erase(st.begin());
            if (cr.ft == 0)
                BAD();
            a[cr.sd]--;
            sm--;
            vc.PB(cr.sd);
        }

        ans.PB(vc);

        for (int x : vc)
            st.insert(MP(a[x], x));

    }

    cout << sz(ans) << '\n';
    for (int it = 0; it < sz(ans); it++){
        cout << "1";
        for (int x : ans[it])
            cout << " " << x + 1;
        cout << '\n';
    }

    return 0;
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 380 KB n=4
2 Correct 2 ms 376 KB n=3
3 Correct 2 ms 376 KB n=3
4 Correct 2 ms 376 KB n=4
5 Correct 2 ms 376 KB n=4
6 Correct 2 ms 376 KB n=2

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 380 KB n=4
2 Correct 2 ms 376 KB n=3
3 Correct 2 ms 376 KB n=3
4 Correct 2 ms 376 KB n=4
5 Correct 2 ms 376 KB n=4
6 Correct 2 ms 376 KB n=2
7 Correct 2 ms 376 KB n=5
8 Correct 4 ms 1016 KB n=8
9 Correct 9 ms 1204 KB n=14
10 Correct 6 ms 1016 KB n=11
11 Correct 55 ms 6696 KB n=50000
12 Correct 57 ms 6568 KB n=50000
13 Correct 25 ms 3472 KB n=10
14 Correct 27 ms 3112 KB n=685
15 Correct 29 ms 3372 KB n=623
16 Correct 17 ms 2096 KB n=973

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 380 KB n=4
2 Correct 2 ms 376 KB n=3
3 Correct 2 ms 376 KB n=3
4 Correct 2 ms 376 KB n=4
5 Correct 2 ms 376 KB n=4
6 Correct 2 ms 376 KB n=2
7 Correct 2 ms 376 KB n=5
8 Correct 4 ms 1016 KB n=8
9 Correct 9 ms 1204 KB n=14
10 Correct 6 ms 1016 KB n=11
11 Correct 55 ms 6696 KB n=50000
12 Correct 57 ms 6568 KB n=50000
13 Correct 25 ms 3472 KB n=10
14 Correct 27 ms 3112 KB n=685
15 Correct 29 ms 3372 KB n=623
16 Correct 17 ms 2096 KB n=973
17 Correct 28 ms 2624 KB n=989
18 Correct 14 ms 1144 KB n=563
19 Correct 22 ms 1400 KB n=592
20 Correct 22 ms 1400 KB n=938
21 Correct 17 ms 1196 KB n=747
22 Correct 20 ms 1400 KB n=991

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 410 ms 49596 KB n=1000000
2 Correct 251 ms 34588 KB n=666666
3 Correct 138 ms 17184 KB n=400000
4 Correct 313 ms 43764 KB n=285714
5 Correct 8 ms 1016 KB n=20000
6 Correct 268 ms 35148 KB n=181818
7 Correct 5 ms 760 KB n=10000
8 Correct 32 ms 3464 KB n=6666
9 Correct 3 ms 504 KB n=4000
10 Correct 172 ms 17696 KB n=2857
11 Correct 3 ms 376 KB n=2000

Subtask #5
0 / 51.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 380 KB n=4
2 Correct 2 ms 376 KB n=3
3 Correct 2 ms 376 KB n=3
4 Correct 2 ms 376 KB n=4
5 Correct 2 ms 376 KB n=4
6 Correct 2 ms 376 KB n=2
7 Correct 2 ms 376 KB n=5
8 Correct 4 ms 1016 KB n=8
9 Correct 9 ms 1204 KB n=14
10 Correct 6 ms 1016 KB n=11
11 Correct 55 ms 6696 KB n=50000
12 Correct 57 ms 6568 KB n=50000
13 Correct 25 ms 3472 KB n=10
14 Correct 27 ms 3112 KB n=685
15 Correct 29 ms 3372 KB n=623
16 Correct 17 ms 2096 KB n=973
17 Correct 28 ms 2624 KB n=989
18 Correct 14 ms 1144 KB n=563
19 Correct 22 ms 1400 KB n=592
20 Correct 22 ms 1400 KB n=938
21 Correct 17 ms 1196 KB n=747
22 Correct 20 ms 1400 KB n=991
23 Correct 410 ms 49596 KB n=1000000
24 Correct 251 ms 34588 KB n=666666
25 Correct 138 ms 17184 KB n=400000
26 Correct 313 ms 43764 KB n=285714
27 Correct 8 ms 1016 KB n=20000
28 Correct 268 ms 35148 KB n=181818
29 Correct 5 ms 760 KB n=10000
30 Correct 32 ms 3464 KB n=6666
31 Correct 3 ms 504 KB n=4000
32 Correct 172 ms 17696 KB n=2857
33 Correct 3 ms 376 KB n=2000
34 Execution timed out 2075 ms 330280 KB Time limit exceeded
35 Halted 0 ms 0 KB -