oj.uz

답안 #173870

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
173870 2020-01-05T16:16:22 Z VEGAnn Gift (IZhO18_nicegift) C++14
30 / 100
 58 ms 10420 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 = 100100;
set<pii, greater<pii> > st;
vector<vector<int> > ans;
vector<int> vc;
int n, k, a[N], sm;

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

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

    cin >> n >> k;
    for (int i = 0; i < n; i++){
        cin >> a[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

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 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

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 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 3 ms 376 KB n=5
8 Correct 4 ms 1016 KB n=8
9 Correct 9 ms 1208 KB n=14
10 Correct 6 ms 1016 KB n=11
11 Correct 56 ms 6568 KB n=50000
12 Correct 58 ms 6656 KB n=50000
13 Correct 26 ms 3600 KB n=10
14 Correct 28 ms 3240 KB n=685
15 Correct 30 ms 3496 KB n=623
16 Correct 18 ms 2096 KB n=973

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 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 3 ms 376 KB n=5
8 Correct 4 ms 1016 KB n=8
9 Correct 9 ms 1208 KB n=14
10 Correct 6 ms 1016 KB n=11
11 Correct 56 ms 6568 KB n=50000
12 Correct 58 ms 6656 KB n=50000
13 Correct 26 ms 3600 KB n=10
14 Correct 28 ms 3240 KB n=685
15 Correct 30 ms 3496 KB n=623
16 Correct 18 ms 2096 KB n=973
17 Correct 29 ms 2732 KB n=989
18 Correct 14 ms 1144 KB n=563
19 Correct 23 ms 1556 KB n=592
20 Correct 22 ms 1528 KB n=938
21 Correct 18 ms 1244 KB n=747
22 Correct 20 ms 1400 KB n=991

Subtask #4
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 40 ms 10420 KB Execution killed with signal 11 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #5
0 / 51.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 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 3 ms 376 KB n=5
8 Correct 4 ms 1016 KB n=8
9 Correct 9 ms 1208 KB n=14
10 Correct 6 ms 1016 KB n=11
11 Correct 56 ms 6568 KB n=50000
12 Correct 58 ms 6656 KB n=50000
13 Correct 26 ms 3600 KB n=10
14 Correct 28 ms 3240 KB n=685
15 Correct 30 ms 3496 KB n=623
16 Correct 18 ms 2096 KB n=973
17 Correct 29 ms 2732 KB n=989
18 Correct 14 ms 1144 KB n=563
19 Correct 23 ms 1556 KB n=592
20 Correct 22 ms 1528 KB n=938
21 Correct 18 ms 1244 KB n=747
22 Correct 20 ms 1400 KB n=991
23 Runtime error 40 ms 10420 KB Execution killed with signal 11 (could be triggered by violating memory limits)
24 Halted 0 ms 0 KB -