oj.uz

Submission #380534

# Submission time Handle Problem Language Result Execution time Memory
380534 2021-03-22T08:19:08 Z pure_mem JOIRIS (JOI16_joiris) C++14
0 / 100
 1 ms 364 KB 
#include <bits/stdc++.h>
 
#define X first
#define Y second
#define MP make_pair
#define ll long long
 
using namespace std;
 
const int N = 52;
const ll INF = 1e18;

int a[N], b[N], d[N], n, k;
vector< pair<int, int> > ans;

int main () {
	ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
	cin >> n >> k;
	for(int i = 0;i < n;i++)
		cin >> a[i], b[i % k] = (b[i % k] + a[i]) % k;
	for(int i = 0;i < n % k;i++){
		if(b[i] != b[0])
			return cout << -1, 0;	
	}
	for(int i = n % k;i < k;i++){
		if(b[i] != b[k - 1])
			return cout << -1, 0;	
	}
	for(int i = 1;i < n;i++){
		while(a[i] < a[i - 1]){
			a[i] += k;
			ans.push_back(MP(1, i));
		}
	}
	for(int i = k - 1;i + 1 < n;i++){
		for(;a[i] < a[i + 1];a[i]++){
			for(int j = i - k + 1;j >= 0;j -= k){
				ans.push_back(MP(2, j));
			}		
			d[i % k]--;
		}   
	} d[k - 1] = 0;
	for(int i = k - 2;i >= 0;i--)
		d[i] += d[i + 1];
	for(int i = 0;i < k;i++){
		while(d[i] < 0)
			d[i] += k, ans.push_back(MP(1, i));
	}
	cout << ans.size() << "\n";
	for(pair<int, int> v: ans)
		cout << v.X << " " << v.Y + 1 << "\n";
}

Subtask #1
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Incorrect 1 ms 364 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #2
0 / 15.0

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

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Incorrect 1 ms 364 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #4
0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Incorrect 1 ms 364 KB Output isn't correct
8 Halted 0 ms 0 KB -