oj.uz

답안 #537315

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
537315 2022-03-15T00:55:56 Z cig32 Gift (IZhO18_nicegift) C++17
7 / 100
 186 ms 26256 KB 
#include "bits/stdc++.h"
using namespace std;
const int MAXN = 2e5 + 10;
const int MOD = 1e9 + 7;
#define int long long
#define ll __int128
mt19937_64 rng((int)std::chrono::steady_clock::now().time_since_epoch().count());
int rnd(int x, int y) {
  int u = uniform_int_distribution<int>(x, y)(rng); return u;
}
ll read() { // read int128
  int x; cin >> x; return (ll)x;
}
long long bm(long long b, long long p) {
  if(p==0) return 1 % MOD;
  long long r = bm(b, p >> 1);
  if(p&1) return (((r*r) % MOD) * b) % MOD;
  return (r*r) % MOD;
}
long long inv(long long b) { 
  return bm(b, MOD-2);
}
long long f[MAXN];
long long nCr(int n, int r) { 
  long long ans = f[n]; ans *= inv(f[r]); ans %= MOD;
  ans *= inv(f[n-r]); ans %= MOD; return ans;
}
void precomp() { 
  for(int i=0; i<MAXN; i++) f[i] = (i == 0 ? 1 % MOD : (f[i-1] * i) % MOD);
}
void solve(int tc) {
  int n, k;
  cin >> n >> k;
  priority_queue<pair<int, int> > pq;
  int a[n+1];
  for(int i=1; i<=n; i++) {
    cin >> a[i];
    pq.push({a[i], i});
  }
  if(k == n) {
    for(int i=1; i<n; i++) {
      if(a[i] != a[i+1]) {
        cout << "-1\n"; return;
      }
    }
    cout << "1\n";
    cout << a[1];
    for(int i=1; i<=n; i++) cout << " " << i;
    cout << "\n";
    return;
  }
  int lim = 300 / k;
  vector<int> op(k + 1); // op[0]: value, op[1] to op[k]: indices
  vector<vector<int> > all;
  for(int i=1; i<=lim; i++) {
    if(pq.top().first == 0) break;
    vector<pair<int, int> > v;
    for(int j=0; j<k; j++) {
      v.push_back(pq.top());
      pq.pop();
    }
    int weight = v[k-1].first - pq.top().first / 2;
    for(int j=0; j<k; j++) {
      pq.push({v[j].first - weight, v[j].second});
    }
    op[0] = weight;
    for(int j=1; j<=k; j++) op[j] = v[j-1].second;
    all.push_back(op);
    /*
    cout << "After op " << i << ": ";
    stack<pair<int, int> > st;
    while(pq.size()) {
      cout << pq.top().first << " ";
      st.push(pq.top()); pq.pop();
    }
    cout << "\n";
    while(st.size()) {
      pq.push(st.top()); st.pop();
    }
    */
  }
  if(pq.top().first > 0) {
    cout << "-1\n"; return;
  }
  cout << all.size() << "\n";
  for(vector<int>x: all) {
    for(int vw: x) cout << vw << " ";
    cout << "\n";
  }
  /*
  cout << "!!! ";
  while(pq.size()) {
    cout << pq.top().first << " ";
    pq.pop();
  }
  cout << "\n";
  */
}
int32_t main(){
  precomp();
  ios::sync_with_stdio(0); cin.tie(0);
  int t = 1; //cin >> t;
  for(int i=1; i<=t; i++) solve(i);
} //63245986 102334155

/*
4 2
102334155 102334155 63245986 63245986
*/

Subtask #1
7.0 / 7.0

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

Subtask #2
0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 1876 KB n=4
2 Correct 3 ms 1876 KB n=3
3 Correct 3 ms 1876 KB n=3
4 Correct 2 ms 1876 KB n=4
5 Correct 3 ms 1876 KB n=4
6 Correct 4 ms 1876 KB n=2
7 Correct 3 ms 1876 KB n=5
8 Correct 3 ms 1876 KB n=8
9 Correct 2 ms 1876 KB n=14
10 Correct 3 ms 1876 KB n=11
11 Incorrect 8 ms 3412 KB Jury has the answer but participant has not
12 Halted 0 ms 0 KB -

Subtask #3
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 1876 KB n=4
2 Correct 3 ms 1876 KB n=3
3 Correct 3 ms 1876 KB n=3
4 Correct 2 ms 1876 KB n=4
5 Correct 3 ms 1876 KB n=4
6 Correct 4 ms 1876 KB n=2
7 Correct 3 ms 1876 KB n=5
8 Correct 3 ms 1876 KB n=8
9 Correct 2 ms 1876 KB n=14
10 Correct 3 ms 1876 KB n=11
11 Incorrect 8 ms 3412 KB Jury has the answer but participant has not
12 Halted 0 ms 0 KB -

Subtask #4
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 186 ms 26256 KB Jury has the answer but participant has not
2 Halted 0 ms 0 KB -

Subtask #5
0 / 51.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 1876 KB n=4
2 Correct 3 ms 1876 KB n=3
3 Correct 3 ms 1876 KB n=3
4 Correct 2 ms 1876 KB n=4
5 Correct 3 ms 1876 KB n=4
6 Correct 4 ms 1876 KB n=2
7 Correct 3 ms 1876 KB n=5
8 Correct 3 ms 1876 KB n=8
9 Correct 2 ms 1876 KB n=14
10 Correct 3 ms 1876 KB n=11
11 Incorrect 8 ms 3412 KB Jury has the answer but participant has not
12 Halted 0 ms 0 KB -