oj.uz

답안 #994382

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
994382 2024-06-07T14:15:47 Z tch1cherin Gift (IZhO18_nicegift) C++17
30 / 100
 2000 ms 468728 KB 
#include <bits/stdc++.h>
using namespace std;

int main() {
  cin.tie(nullptr)->sync_with_stdio(false);
  int N, K;
  cin >> N >> K;
  vector<long long> A(N);
  priority_queue<pair<long long, int>> Q;
  long long sum = 0;
  for (int i = 0; i < N; i++) {
    cin >> A[i];
    Q.push({A[i], i});
    sum += A[i];
  }
  if (sum % K) {
    cout << "-1\n";
    exit(0);
  }
  vector<vector<long long>> answer;
  while ((int)Q.size() >= K) {
    vector<int> pos;
    long long val = numeric_limits<int>::max();
    for (int i = 0; i < K; i++) {
      val = min(val, Q.top().first);
      pos.push_back(Q.top().second);
      Q.pop();
    }
    if (!Q.empty()) {
      val = min(val, sum / K - Q.top().first);
    }
    answer.push_back({val});
    for (int i : pos) {
      answer.back().push_back(1 + i);
      if ((A[i] -= val) > 0) {
        Q.push({A[i], i});
      }
      sum -= val;
    }
  }
  if (Q.empty()) {
    cout << answer.size() << "\n";
    for (auto &op : answer) {
      for (int i = 0; i <= K; i++) {
        cout << op[i] << " \n"[i == K];
      }
    }
  } else {
    cout << "-1\n";
  }
}

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB n=4
2 Correct 0 ms 348 KB n=3
3 Correct 0 ms 348 KB n=3
4 Correct 0 ms 348 KB n=4
5 Correct 0 ms 348 KB n=4
6 Correct 0 ms 348 KB n=2

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB n=4
2 Correct 0 ms 348 KB n=3
3 Correct 0 ms 348 KB n=3
4 Correct 0 ms 348 KB n=4
5 Correct 0 ms 348 KB n=4
6 Correct 0 ms 348 KB n=2
7 Correct 0 ms 348 KB n=5
8 Correct 0 ms 348 KB n=8
9 Correct 0 ms 344 KB n=14
10 Correct 0 ms 348 KB n=11
11 Correct 17 ms 4056 KB n=50000
12 Correct 13 ms 3540 KB n=50000
13 Correct 0 ms 348 KB n=10
14 Correct 0 ms 348 KB n=685
15 Correct 1 ms 348 KB n=623
16 Correct 1 ms 348 KB n=973

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB n=4
2 Correct 0 ms 348 KB n=3
3 Correct 0 ms 348 KB n=3
4 Correct 0 ms 348 KB n=4
5 Correct 0 ms 348 KB n=4
6 Correct 0 ms 348 KB n=2
7 Correct 0 ms 348 KB n=5
8 Correct 0 ms 348 KB n=8
9 Correct 0 ms 344 KB n=14
10 Correct 0 ms 348 KB n=11
11 Correct 17 ms 4056 KB n=50000
12 Correct 13 ms 3540 KB n=50000
13 Correct 0 ms 348 KB n=10
14 Correct 0 ms 348 KB n=685
15 Correct 1 ms 348 KB n=623
16 Correct 1 ms 348 KB n=973
17 Correct 1 ms 348 KB n=989
18 Correct 1 ms 348 KB n=563
19 Correct 1 ms 344 KB n=592
20 Correct 1 ms 348 KB n=938
21 Correct 0 ms 348 KB n=747
22 Correct 0 ms 348 KB n=991

Subtask #4
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 2087 ms 468728 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 51.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB n=4
2 Correct 0 ms 348 KB n=3
3 Correct 0 ms 348 KB n=3
4 Correct 0 ms 348 KB n=4
5 Correct 0 ms 348 KB n=4
6 Correct 0 ms 348 KB n=2
7 Correct 0 ms 348 KB n=5
8 Correct 0 ms 348 KB n=8
9 Correct 0 ms 344 KB n=14
10 Correct 0 ms 348 KB n=11
11 Correct 17 ms 4056 KB n=50000
12 Correct 13 ms 3540 KB n=50000
13 Correct 0 ms 348 KB n=10
14 Correct 0 ms 348 KB n=685
15 Correct 1 ms 348 KB n=623
16 Correct 1 ms 348 KB n=973
17 Correct 1 ms 348 KB n=989
18 Correct 1 ms 348 KB n=563
19 Correct 1 ms 344 KB n=592
20 Correct 1 ms 348 KB n=938
21 Correct 0 ms 348 KB n=747
22 Correct 0 ms 348 KB n=991
23 Execution timed out 2087 ms 468728 KB Time limit exceeded
24 Halted 0 ms 0 KB -