oj.uz

Submission #553331

# Submission time Handle Problem Language Result Execution time Memory
553331 2022-04-25T13:16:28 Z RaresFelix JOIRIS (JOI16_joiris) C++17
15 / 100
 1000 ms 596 KB 
#include <bits/stdc++.h>

using namespace std;
int n, k;
int main() {
    cin.tie(0);
    cin >> n >> k;
    vector<int> V(n + 1), R(k);
    for(int i = 1; i <= n; ++i) cin >> V[i];
    for(int i = 1; i <= n; ++i) R[(i - 1) % k] = (R[(i - 1) % k] + V[i]) % k;
    int ok = 1;
    for(int i = 0; i < n % k - 1; ++i)
        ok &= R[i] == R[i + 1];
    for(int i = n % k; i < k - 1; ++i)
        ok &= R[i] == R[i + 1];
    if(!ok) {
        cout << "-1\n";
        return 0;
    }
    vector<pair<int, int> > Sol;
    function<void(bool)> level = [&](auto flag) {
        int mi, ma;
        if(flag) {
            for(int i = 1; i <= n; ++i)
                V[i] -= V[n];
            for(int i = 1; i <= n; ++i)
                if(V[i] < 0) Sol.push_back({1, i}), V[i] += k;
        }
        ma = 0;
        for(int i = 1; i <= n; ++i)
            ma = max(ma, V[i]);
        for(int i = 1; i <= n; ++i)
            while(V[i] + k <= ma) Sol.push_back({1, i}), V[i] += k;
        mi = ma;
        for(int i = 1; i <= n; ++i)
            mi = min(mi, V[i]);
        for(int i = 1; i <= n; ++i) V[i] -= mi;
    };
    auto add_one = [&](auto poz) {
        Sol.push_back({2, poz - k + 1});
        for(int i = 1; i <= n; ++i)
            if(i < poz - k + 1 || i > poz) Sol.push_back({1, i}), V[i] += k - 1;
        level(1);
    };
    level(0);
    auto swap_one = [&]() {
        for(int i = n; i >= k; i -= k) add_one(i);
    };
    auto solved = [&]() {
        for(int i = 1; i <= n; ++i) if(V[i]) return false;
        return true;
    };
    auto clean = [&]() {
        for(int i = n; i >= k; --i) {
            int d = V[i];
            for(int j = 1; j <= (k - d) % k; ++j)
                add_one(i);
        }
    };
    for(int i = 1; i <= n; ++i) R[(i - 1) % k] = (R[(i - 1) % k] + V[i]) % k;
    if(n % k) {
        int delta = R[0] - R[k - 1];
        delta = (delta % k + k) % k;
        for(int i = 1; i <= delta; ++i) swap_one();
    }
    int nr = 0;
    while(!solved()) {
        clean();
        ++nr;
    }
    cout << Sol.size() << "\n";
    for(auto [a, b] : Sol) cout << a << " " << b << "\n";
    return 0;
}

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 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 212 KB Output is correct
6 Correct 0 ms 212 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 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 212 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 1 ms 212 KB Output is correct

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Execution timed out 1086 ms 212 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 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 212 KB Output is correct
6 Correct 0 ms 212 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 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 212 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 1 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 2 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Incorrect 3 ms 596 KB Integer 13919 violates the range [-1, 10000]
26 Halted 0 ms 0 KB -

Subtask #4
0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 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 212 KB Output is correct
6 Correct 0 ms 212 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 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 212 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 1 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Execution timed out 1086 ms 212 KB Time limit exceeded
19 Halted 0 ms 0 KB -