oj.uz

답안 #185485

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
185485 2020-01-11T21:59:22 Z qkxwsm JOIRIS (JOI16_joiris) C++14
30 / 100
 3 ms 504 KB 
#include <bits/stdc++.h>

using namespace std;

template<class T, class U>
void ckmin(T &a, U b)
{
    if (a > b) a = b;
}

template<class T, class U>
void ckmax(T &a, U b)
{
    if (a < b) a = b;
}

#define MP make_pair
#define PB push_back
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
#define SZ(x) ((int) (x).size())
#define ALL(x) (x).begin(), (x).end()
#define FOR(i, a, b) for (auto i = (a); i < (b); i++)
#define FORD(i, a, b) for (auto i = (a) - 1; i >= (b); i--)
#define MAXN 51

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<pii> vpi;
typedef vector<pll> vpl;

int N, K;
int arr[MAXN];
int sum[MAXN];
vpi ans;

void solve()
{
    FOR(i, 1, N)
    {
        //make it > a[i - 1].
        while(arr[i] < arr[i - 1])
        {
            ans.PB({0, i});
            arr[i] += K;
        }
    }
    FORD(i, N, 0)
    {
        arr[i] -= arr[0];
    }
    // cerr << "PART 1\n";
    // FOR(i, 0, N)
    // {
    //     cerr << arr[i] << ' ';
    // }
    // cerr << endl;
    FOR(i, 1, N)
    {
        FOR(j, 0, arr[i] - arr[i - 1])
        {
            int it = i - K;
            while(it >= 0)
            {
                ans.PB({1, it});
                it -= K;
            }
        }
    }
    FORD(i, SZ(ans), 0)
    {
        if (ans[i].fi == 0) break;
        int idx = ans[i].se;
        FOR(j, idx, idx + K)
        {
            arr[j]++;
        }
    }
    //cerr << "PART 2\n";
    FOR(i, 0, N)
    {
        //cerr << arr[i] << ' ';
    }
    //cerr << endl;
    int d = arr[N - 1] / K + 1;
    FOR(j, 0, d)
    {
        FOR(i, 0, K - 1)
        {
            ans.PB({0, i});
            arr[i] += K;
        }
    }
    FOR(i, 0, N)
    {
        arr[i] -= arr[N - 1];
    }
    // cerr << "PART 3\n";
    // FOR(i, 0, N)
    // {
    //     cerr << arr[i] << ' ';
    // }
    // cerr << endl;
    // //cerr << "LOL\n";
    // FOR(i, 0, N)
    // {
    //     //cerr << arr[i] << ' ';
    // }
    // //cerr << endl;
    if (N % K)
    {
        d = 0;
        FOR(i, N % K, K) ckmax(d, arr[i]);
        d = d / K + 1;
        FOR(j, 0, d)
        {
            FOR(i, 0, N % K)
            {
                ans.PB({0, i});
                arr[i] += K;
            }
        }
        //cerr << "PART 4\n";
        FOR(i, 0, N)
        {
            //cerr << arr[i] << ' ';
        }
        //cerr << endl;
        int d = (arr[0] - arr[K - 1]) % K; if (d < 0) d += K;
        FOR(i, 0, d)
        {
            for (int j = N % K; j < N; j += K)
            {
                ans.PB({1, j});
                FOR(k, j, j + K) arr[k]++;
                // //cerr << "PB " << 1 << ',' << j << endl;
            }
        }
        //cerr << "PART 5\n";
        FOR(i, 0, N)
        {
            //cerr << arr[i] << ' ';
        }
        //cerr << endl;
        FOR(i, 0, N)
        {
            arr[i] -= arr[N - 1];
        }
        //cerr << "PART 6\n";
        FOR(i, 0, N)
        {
            //cerr << arr[i] << ' ';
        }
        //cerr << endl;
    }
    d = 0;
    FOR(i, 0, K) ckmax(d, arr[i]);
    FOR(i, 0, K)
    {
        while(arr[i] < d)
        {
            ans.PB({0, i});
            arr[i] += K;
        }
    }
    // cerr << "PART 7\n";
    // FOR(i, 0, N)
    // {
    //     cerr << arr[i] << ' ';
    // }
    // cerr << endl;
    d = arr[0];
    while(d % K)
    {
        ans.PB({1, 0});
        FOR(j, 0, K) arr[j]++;
        d++;
    }
    // cerr << "PART 8\n";
    // FOR(i, 0, N)
    // {
    //     cerr << arr[i] << ' ';
    // }
    // cerr << endl;
    FOR(i, K, N)
    {
        FOR(j, 0, d / K)
        {
            ans.PB({0, i});
            arr[j] += K;
        }
    }
    return;
}

int32_t main()
{
    cout << fixed << setprecision(12);
    //cerr << fixed << setprecision(4);
    ios_base::sync_with_stdio(false); cin.tie(0);
    cin >> N >> K;
    FOR(i, 0, N)
    {
        cin >> arr[i];
        sum[i % K] += arr[i];
    }
    if (K == 1)
    {
        FOR(i, 0, N)
        {
            FOR(j, 0, 50 - arr[i])
            {
                cout << 1 << ' ' << i + 1 << '\n';
            }
        }
        return 0;
    }
    FOR(i, 0, N % K)
    {
        if ((sum[i] - sum[0]) % K)
        {
            cout << "-1\n";
            return 0;
        }
    }
    FOR(i, N % K, K)
    {
        if ((sum[i] - sum[K - 1]) % K)
        {
            cout << "-1\n";
            return 0;
        }
    }
    //it's possible
    solve();
    assert(SZ(ans) <= 10000);
    cout << SZ(ans) << '\n';
    for (pii p : ans)
    {
        cout << p.fi + 1 << ' ' << p.se + 1 << '\n';
    }
    return 0;
}

Subtask #1
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 416 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 380 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 380 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 3 ms 380 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 504 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 296 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 380 KB Output is correct
16 Correct 2 ms 376 KB Output is correct

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 416 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 380 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 380 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 3 ms 380 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Incorrect 2 ms 376 KB Output isn't correct
20 Halted 0 ms 0 KB -

Subtask #4
0 / 55.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 416 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 380 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 380 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 3 ms 380 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 2 ms 504 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 2 ms 376 KB Output is correct
23 Correct 2 ms 376 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
25 Correct 2 ms 376 KB Output is correct
26 Correct 2 ms 376 KB Output is correct
27 Correct 2 ms 376 KB Output is correct
28 Correct 2 ms 376 KB Output is correct
29 Correct 2 ms 296 KB Output is correct
30 Correct 2 ms 376 KB Output is correct
31 Correct 2 ms 380 KB Output is correct
32 Correct 2 ms 376 KB Output is correct
33 Correct 2 ms 376 KB Output is correct
34 Correct 2 ms 376 KB Output is correct
35 Incorrect 2 ms 376 KB Output isn't correct
36 Halted 0 ms 0 KB -