제출 #1054377

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1054377		juicy	JOIRIS (JOI16_joiris)	C++17	100 / 100	1 ms	460 KiB

joiris

#include <bits/stdc++.h>

using namespace std;

#ifdef LOCAL
#include "debug.h"
#else
#define debug(...) 42
#endif

int main() {
  ios::sync_with_stdio(false); cin.tie(nullptr);

  int n, k; cin >> n >> k;
  vector<int> a(n), b(k), cnt(k);
  for (int i = 0; i < n; ++i) {
    cin >> a[i];
    b[i % k] = (b[i % k] + a[i]) % k;
  } 
  for (int i = 1; i < n % k; ++i) {
    if (b[i] != b[i - 1]) {
      cout << -1;
      exit(0);
    }
  }
  for (int i = n % k + 1; i < k; ++i) {
    if (b[i] != b[i - 1]) {
      cout << -1;
      exit(0);
    }
  }
  vector<array<int, 2>> res;
  for (int i = 1; i < n; ++i) {
    while (a[i] < a[i - 1]) {
      a[i] += k;
      res.push_back({1, i});
    } 
  }
  for (int i = 1; i < n; ++i) {
    int dif = a[i] - a[i - 1];
    while (dif--) {
      for (int j = i - k; j >= 0; j -= k) {
        res.push_back({2, j});
      }
      for (int j = 0; j < i % k; ++j) {
        ++cnt[j];
      }
    }
  }
  for (int i = 0; i < k - 1; ++i) {
    while (cnt[i] > 0) {
      res.push_back({1, i});
      cnt[i] -= k;
    }
  }
  int rem = -cnt[0];
  while (rem--) {
    for (int j = n % k; j < n; j += k) {
      res.push_back({2, j});
    }
  }
  cout << res.size() << "\n";
  for (auto [t, x] : res) {
    cout << t << " " << x + 1 << "\n";
  }
  return 0;
}

• Subtask 1: 15 / 15
• Subtask 2: 15 / 15
• Subtask 3: 15 / 15
• Subtask 4: 55 / 55