oj.uz

Submission #155778

# Submission time Handle Problem Language Result Execution time Memory
155778 2019-09-30T13:51:55 Z stefdasca JOIRIS (JOI16_joiris) C++14
100 / 100
 5 ms 504 KB 
#include<bits/stdc++.h>
using namespace std;
int n, k, nr;
int val[52], val2[52];
pair<int, int>ans[100002];
void proc(int poz, int difference)
{
    int maxi = 0;
    for(int i = poz; i <= poz + k - 1; ++i)
        maxi = max(maxi, val[i]);
    maxi += difference;
    for(int i = 1; i <= difference; ++i)
        ans[++nr] = {2, poz};
    for(int i = 1; i < poz; ++i)
    {
        while(val[i] < maxi)
        {
            val[i] += k;
            ans[++nr] = {1, i};
        }
        val[i] -= difference;
    }
    for(int i = poz + k; i <= n; ++i)
    {
        while(val[i] < maxi)
        {
            val[i] += k;
            ans[++nr] = {1, i};
        }
        val[i] -= difference;
    }
}
void tri()
{
    for(int dstart = 0; dstart < k; ++dstart)
    {
        nr = 0;
        for(int i = 1; i <= n; ++i)
            val[i] = val2[i];
        proc(1, dstart);
        for(int i = 2; i + k - 1 <= n; ++i)
            while(val[i] % k != val[i-1] % k)
                proc(i, 1);
        for(int i = n - k + 2; i >= k + 1; --i)
            while(val[i] % k != val[i-1] % k)
                proc(i - k, 1);
        int mx = val[1];
        bool bad = 0;
        for(int i = 2; i <= n; ++i)
        {
            mx = max(mx, val[i]);
            if(val[i] % k != val[i-1] % k)
                bad = 1;
        }
        for(int i = 1; i <= n; ++i)
        {
            while(val[i] < mx)
            {
                val[i] += k;
                ans[++nr] = {1, i};
            }
        }
        if(nr > 10000)
            bad = 1;
        if(!bad)
        {
            cout << nr << '\n';
            for(int i = 1; i <= nr; ++i)
                cout << ans[i].first << " " << ans[i].second << '\n';
            exit(0);
        }
    }
}
int main()
{
    cin >> n >> k;
    for(int i = 1; i <= n; ++i)
    {
        cin >> val[i];
        val2[i] = val[i];
    }
    tri();
    cout << -1;
    return 0;
}

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 256 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 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 256 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 252 KB Output is correct
10 Correct 2 ms 292 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 256 KB Output is correct
14 Correct 2 ms 256 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 256 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 256 KB Output is correct
8 Correct 2 ms 256 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 256 KB Output is correct
11 Correct 2 ms 256 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 252 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 256 KB Output is correct
16 Correct 2 ms 256 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 256 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 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 256 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 252 KB Output is correct
10 Correct 2 ms 292 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 256 KB Output is correct
14 Correct 2 ms 256 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 256 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 3 ms 376 KB Output is correct
20 Correct 2 ms 256 KB Output is correct
21 Correct 2 ms 256 KB Output is correct
22 Correct 2 ms 252 KB Output is correct
23 Correct 2 ms 376 KB Output is correct
24 Correct 2 ms 256 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 504 KB Output is correct
28 Correct 2 ms 256 KB Output is correct
29 Correct 2 ms 376 KB Output is correct
30 Correct 2 ms 256 KB Output is correct
31 Correct 2 ms 376 KB Output is correct
32 Correct 2 ms 256 KB Output is correct
33 Correct 2 ms 256 KB Output is correct
34 Correct 2 ms 376 KB Output is correct
35 Correct 3 ms 380 KB Output is correct
36 Correct 3 ms 248 KB Output is correct
37 Correct 2 ms 376 KB Output is correct
38 Correct 2 ms 376 KB Output is correct

Subtask #4
55.0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 256 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 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 256 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 252 KB Output is correct
10 Correct 2 ms 292 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 256 KB Output is correct
14 Correct 2 ms 256 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 256 KB Output is correct
18 Correct 2 ms 256 KB Output is correct
19 Correct 2 ms 256 KB Output is correct
20 Correct 2 ms 256 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 256 KB Output is correct
24 Correct 2 ms 256 KB Output is correct
25 Correct 2 ms 376 KB Output is correct
26 Correct 2 ms 256 KB Output is correct
27 Correct 2 ms 256 KB Output is correct
28 Correct 2 ms 376 KB Output is correct
29 Correct 2 ms 252 KB Output is correct
30 Correct 2 ms 376 KB Output is correct
31 Correct 2 ms 256 KB Output is correct
32 Correct 2 ms 256 KB Output is correct
33 Correct 2 ms 256 KB Output is correct
34 Correct 2 ms 376 KB Output is correct
35 Correct 3 ms 376 KB Output is correct
36 Correct 2 ms 256 KB Output is correct
37 Correct 2 ms 256 KB Output is correct
38 Correct 2 ms 252 KB Output is correct
39 Correct 2 ms 376 KB Output is correct
40 Correct 2 ms 256 KB Output is correct
41 Correct 2 ms 376 KB Output is correct
42 Correct 2 ms 376 KB Output is correct
43 Correct 2 ms 504 KB Output is correct
44 Correct 2 ms 256 KB Output is correct
45 Correct 2 ms 376 KB Output is correct
46 Correct 2 ms 256 KB Output is correct
47 Correct 2 ms 376 KB Output is correct
48 Correct 2 ms 256 KB Output is correct
49 Correct 2 ms 256 KB Output is correct
50 Correct 2 ms 376 KB Output is correct
51 Correct 3 ms 380 KB Output is correct
52 Correct 3 ms 248 KB Output is correct
53 Correct 2 ms 376 KB Output is correct
54 Correct 2 ms 376 KB Output is correct
55 Correct 2 ms 424 KB Output is correct
56 Correct 2 ms 376 KB Output is correct
57 Correct 2 ms 256 KB Output is correct
58 Correct 2 ms 376 KB Output is correct
59 Correct 2 ms 376 KB Output is correct
60 Correct 2 ms 376 KB Output is correct
61 Correct 3 ms 380 KB Output is correct
62 Correct 2 ms 376 KB Output is correct
63 Correct 3 ms 376 KB Output is correct
64 Correct 3 ms 376 KB Output is correct
65 Correct 3 ms 376 KB Output is correct
66 Correct 1 ms 380 KB Output is correct
67 Correct 2 ms 256 KB Output is correct
68 Correct 5 ms 376 KB Output is correct
69 Correct 3 ms 376 KB Output is correct
70 Correct 2 ms 248 KB Output is correct
71 Correct 3 ms 376 KB Output is correct
72 Correct 3 ms 376 KB Output is correct
73 Correct 2 ms 376 KB Output is correct
74 Correct 3 ms 376 KB Output is correct
75 Correct 2 ms 400 KB Output is correct
76 Correct 2 ms 376 KB Output is correct
77 Correct 2 ms 376 KB Output is correct
78 Correct 2 ms 376 KB Output is correct
79 Correct 2 ms 376 KB Output is correct
80 Correct 3 ms 376 KB Output is correct
81 Correct 3 ms 376 KB Output is correct
82 Correct 2 ms 256 KB Output is correct
83 Correct 2 ms 256 KB Output is correct
84 Correct 3 ms 380 KB Output is correct
85 Correct 2 ms 376 KB Output is correct
86 Correct 2 ms 256 KB Output is correct
87 Correct 2 ms 376 KB Output is correct
88 Correct 2 ms 376 KB Output is correct
89 Correct 2 ms 376 KB Output is correct
90 Correct 2 ms 376 KB Output is correct
91 Correct 3 ms 376 KB Output is correct
92 Correct 2 ms 376 KB Output is correct