oj.uz

Submission #777869

# Submission time Handle Problem Language Result Execution time Memory
777869 2023-07-09T19:46:32 Z TeaTime JOIRIS (JOI16_joiris) C++17
30 / 100
 1 ms 340 KB 
#include <iostream>
#include <vector>
#include <cmath>
#include <algorithm>
#include <cassert>

using namespace std;

#define fastInp cin.tie(0); cout.tie(0); ios_base::sync_with_stdio(0);

typedef long long ll;
typedef long double ld;

const ll INF = 1'000'000'000, MX = 10'000;

ll n, k;

vector<ll> vec;
vector<pair<ll, ll>> ans;

void delmin() {
    ll mn = vec[0];

    for (auto c : vec) mn = min(mn, c);

    for (auto &c : vec) c -= mn;
}

void norm() {
    delmin();

    bool f = 0;
    ll todel = 0;
    for (auto c : vec) {
        if (c >= k) {
            f = 1;
        }
    }

    if (!f) return;

    for (int i = 0; i < vec.size(); i++) {
        if (vec[i] == 0) {
            vec[i] += k;
            ans.push_back({1, i + 1});
        }
    }

    delmin();
    norm();
}

int main() {
    fastInp;

    cin >> n >> k;
    vec.resize(n);
    for (int i = 0; i < n; i++) cin >> vec[i];

    norm();

    for (int i = 1; i < n; i++) {
        if (vec[i - 1] == vec[i]) continue;

        if (i % k == 0) {
            norm();
            while (vec[i - 1] % k != vec[i] % k) {
                ll i2 = i - k;
                while (i2 >= 0) {
                    ans.push_back({2, i2 + 1});
                    for (int j = i2; j < i2 + k; j++) vec[j]++;
                    i2 -= k;
                }

                delmin();
            }
            continue;
        }

        if (i + k - 1 >= n) {
            cout << "-1\n";
            return 0;
        }

        while (vec[i - 1] % k != vec[i] % k) {
            ans.push_back({2, i + 1});
            ll mx = 0;
            for (int j = i; j < i + k; j++) mx = max(mx, vec[j]);

            for (int j = 0; j < n; j++) {
                if (!(i <= j && j <= i + k - 1)) {
                    if (vec[j] < mx + 1) {
                        vec[j] += k;
                        ans.push_back({1, j + 1});
                    }
                    vec[j]--;
                }
            }

            delmin();
        }
    }

    norm();
    assert(ans.size() <= MX);
    cout << ans.size() << "\n";

    for (auto c : ans) cout << c.first << " " << c.second << "\n";

    return 0;
}

Compilation message

joiris.cpp: In function 'void norm()':
joiris.cpp:42:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   42 |     for (int i = 0; i < vec.size(); i++) {
      |                     ~~^~~~~~~~~~~~
joiris.cpp:33:8: warning: unused variable 'todel' [-Wunused-variable]
   33 |     ll todel = 0;
      |        ^~~~~

Subtask #1
15.0 / 15.0

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

Subtask #2
15.0 / 15.0

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

Subtask #3
0 / 15.0

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

Subtask #4
0 / 55.0

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