oj.uz

Submission #500269

# Submission time Handle Problem Language Result Execution time Memory
500269 2021-12-30T14:51:19 Z 600Mihnea JOIRIS (JOI16_joiris) C++17
30 / 100
 2 ms 332 KB 
#include <bits/stdc++.h>

using namespace std;

const int N = 57;
int n;
int k;
int a[N];
vector<pair<int, int>> sol;

void clr() {
  int mn = a[0];
  for (int i = 1; i < n; i++) {
    mn = min(mn, a[i]);
  }
  for (int i = 0; i < n; i++) {
    a[i] -= mn;
  }
}

void op1(int x) {
  a[x] += k;
  clr();
  sol.push_back({1, x});
}

void op2(int x, int y) {
  assert(y == x + k - 1);
  for (int i = x; i <= y; i++) {
    a[i]++;
  }
  sol.push_back({2, x});
}

bool isok() {
  vector<int> s(k, 0);
  for (int i = 0; i < n; i++) {
    s[i % k] += a[i];
  }
  for (int i = 0; i <= n % k - 1; i++) {
    if (s[i] % k != s[0] % k) {
      return 0;
    }
  }
  for (int i = n % k; i < k; i++) {
    if (s[i] % k != s[k - 1] % k) {
      return 0;
    }
  }
  return 1;
}

int main() {
  //freopen ("input", "r", stdin);
  //freopen ("output", "w", stdout);
  cin >> n >> k;
  for (int i = 0; i < n; i++) {
    cin >> a[i];
  }
  clr();
  if (!isok()) {
    cout << "-1\n";
    exit(0);
  }
  for (int i = k - 1; i + 1 < n; i++) {
    for (int j = 1; j < n; j++) {
      while (a[j - 1] > a[j]) {
        op1(j);
      }
    }
    /// want to make a[i] == a[i + 1]
    /// a[1] <= ... <= a[n]
    vector<int> guys;
    set<int> inGuys;
    if (i % k != k - 1) {
      for (int j = 0; j <= i % k; j++) {
        guys.push_back(j);
        inGuys.insert(j);
      }
    }
    for (auto &j : guys) {
      while (a[j] < a[i + 1]) {
        op1(j);
      }
    }
    int dif = a[i + 1] - a[i];
    for (int step = 1; step <= dif; step++) {
      int last;
      for (int j = i; j - k + 1 >= 0; j -= k) {
        sol.push_back({2, j - k + 1});
        last = j - k + 1;
      }
    }
    for (int j = i + 1; j < n; j++) {
      a[j] -= dif;
    }
    for (auto &j : guys) {
      a[j] -= dif;
    }
    assert(a[i] == a[i + 1]);
  }

  while (a[k - 1] > 0) {
    for (int i = 0; i <= k - 2; i++) {
      op1(i);
    }
  }

  for (int i = n % k; i < k; i++) {
    while (a[i] > 0) {
      for (int j = 0; j < n; j++) {
        while (a[j] < a[i]) {
          op1(j);
        }
      }
    }
  }
  cout << (int) sol.size() << "\n";
  for (auto &it : sol) {
    cout << it.first << " " << it.second + 1 << "\n";
  }
  return 0;
}

Compilation message

joiris.cpp: In function 'int main()':
joiris.cpp:88:11: warning: variable 'last' set but not used [-Wunused-but-set-variable]
   88 |       int last;
      |           ^~~~

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 0 ms 204 KB Output is correct
21 Correct 0 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 2 ms 332 KB Output is correct
26 Correct 0 ms 204 KB Output is correct
27 Correct 2 ms 332 KB Output is correct
28 Correct 0 ms 204 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 0 ms 204 KB Output is correct
31 Correct 0 ms 204 KB Output is correct
32 Correct 0 ms 204 KB Output is correct
33 Correct 0 ms 204 KB Output is correct
34 Correct 0 ms 204 KB Output is correct
35 Correct 1 ms 204 KB Output is correct
36 Correct 0 ms 204 KB Output is correct
37 Correct 0 ms 204 KB Output is correct
38 Correct 0 ms 204 KB Output is correct

Subtask #4
0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 0 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 0 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Incorrect 0 ms 204 KB Output isn't correct
18 Halted 0 ms 0 KB -