oj.uz

Submission #155694

# Submission time Handle Problem Language Result Execution time Memory
155694 2019-09-29T23:36:32 Z nvmdava JOIRIS (JOI16_joiris) C++17
0 / 100
 2 ms 380 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ff first
#define ss second
 
#define N 150000
#define MOD 1000000007
#define INF 0x3f3f3f3f
 
int a[55];
int n, k;
 
vector<pair<int, int> > ans;
 
int now[55];
int md[55];
 
void reset(){
	bool ok = 0;
	for(int i = 1; i <= n; i++){
		if(now[i] >= k) ok = 1;
	}
	if(ok == 0) return;
	
	int mn = 0x3f3f3f3f;
 
	for(int i = 1; i <= n; i++){
		if(now[i] < k){
			ans.push_back({1, i});
			now[i] += k;
		}
		mn = min(mn, now[i]);
	}
	for(int i = 1; i <= n; i++)
		now[i] -= mn;
	reset();
}
 
void check(int c){
	for(int i = 1; i <= n; i++){
		now[i] = a[i];
		md[i] = now[i] % k;
	}
 
	ans.clear();
 
	reset();
	int cnt = c, mx = 0;
	for(int i = n - k + 1; i <= n; i++)
		mx = max(mx, now[i]);

	for(int i = 1; i <= n - k; i++){
		while(now[i] < mx + cnt){
			now[i] += k;
			ans.push_back({1, i});
		}
		now[i] -= cnt;
	}
	while(c--){
		md[n]++;
		md[n] %= k;
		ans.push_back({2, n - k + 1});
	}
	reset();
 
	for(int i = 1; i <= n; i++){
		md[i] = now[i];
	}
	for(int i = n - k; i > 0; i--){
		cnt = mx = 0;
		while(md[i + k - 1] != md[n]){
			cnt++;
			ans.push_back({2, i});
			for(int j = 0; j < k; j++){
				++md[i + j];
				md[i + j] %= k;
			}
		}
		for(int j = 0; j < k; j++){
			mx = max(mx, now[i]);
		}
		for(int j = 1; j < i; j++){
			while(now[j] < mx + cnt){
				now[j] += k;
				ans.push_back({1, j});
			}
			now[j] -= cnt;
		}
		for(int j = i + k; j <= n; j++){
			while(now[j] < mx + cnt){
				now[j] += k;
				ans.push_back({1, j});
			}
			now[j] -= cnt;
		}
		reset();
	}
	for(int i = 1; i <= n; i++)
		if(md[i] != md[n]) return;
 
	cout<<ans.size()<<'\n';
	
	for(auto& x: ans){
		cout<<x.ff<<' '<<x.ss<<'\n';
	}
	exit(0);
}
 
int main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
 
	mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
	
	cin>>n>>k;
	int s = 0;
	for(int i = 1; i <= n; i++){
		cin>>a[i];
		s += a[i];
	}
	for(int i = 0; i < k; i++){
		check(i);
	}
 
	cout<<-1;
}

Subtask #1
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 380 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 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 Incorrect 2 ms 376 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #2
0 / 15.0

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

Subtask #3
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 380 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 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 Incorrect 2 ms 376 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #4
0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 380 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 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 Incorrect 2 ms 376 KB Output isn't correct
12 Halted 0 ms 0 KB -