oj.uz

답안 #516358

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
516358 2022-01-21T08:08:56 Z amunduzbaev JOIRIS (JOI16_joiris) C++14
30 / 100
 1 ms 336 KB 
#include "bits/stdc++.h"
using namespace std;

#define ar array

const int mod = 2020;

signed main(){
	ios::sync_with_stdio(0); cin.tie(0);
	
	int n, k; cin>>n>>k;
	vector<int> a(n);
	for(int i=0;i<n;i++) cin>>a[i];
	vector<int> b(k);
	for(int i=0;i<n;i++){
		b[i%k] = (b[i%k] + a[i]) % k;
	}
	
	for(int i=1;i<n%k;i++){
		if(b[i] != b[i-1]) {
			cout<<-1<<"\n";
			return 0;
		}
	}
	
	for(int i=n%k+1;i<k;i++){
		if(b[i] != b[i-1]){
			cout<<-1<<"\n";
			return 0;
		}
	}
	vector<ar<int, 2>> res;
	for(int i=1;i<n;i++){
		while(a[i] < a[i-1]){
			res.push_back({i, 0});
			a[i] += k;
		}
	}
	int tmp = (a[n-1] + k - 1) / k * k;
	vector<int> cnt(tmp + 1, n);
	for(int r=1;r<=tmp;r++){
		for(int i=n-1;~i;i--){
			if(a[i] >= r) cnt[r]--; 
			else if(i >= k - 1){
				i = i-k+1;
				res.push_back({i, 1});
				cnt[r]-=k;
			}
		}
	}
	
	for(int i=0;i<k-1;i++){
		int tot = 0;
		for(int j=k;j<=tmp;j+=k){
			res.push_back({i, 0});
			for(int r=j-k+1;r<=j;r++){
				if(!cnt[r]) continue;
				if(cnt[r] == 1) tot++;
				cnt[r]--;
			}
		}
		
		a[i] = tmp - tot;
		while(a[i] < tmp) res.push_back({i, 0}), a[i] += k;
	}
	
	for(int i=n-1;i>=k-1;i--){
		for(int l=0;l<tmp/k;l++){
			res.push_back({i, 0});
		}
	}
	
	if(n%k){
		a[0] -= tmp;
		for(int r=0;r<a[0];r++){
			for(int i=n%k;i<n;i+=k){
				res.push_back({i, 1});
			}
		}
	}
	
	cout<<(int)res.size()<<"\n";
	for(auto x : res){
		cout<<x[1] + 1<<" "<<x[0] + 1<<"\n";
	}
}

Subtask #1
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 208 KB Output is correct
2 Correct 0 ms 296 KB Output is correct
3 Correct 0 ms 208 KB Output is correct
4 Correct 0 ms 312 KB Output is correct
5 Correct 0 ms 208 KB Output is correct
6 Correct 1 ms 208 KB Output is correct
7 Correct 1 ms 336 KB Output is correct
8 Correct 1 ms 336 KB Output is correct
9 Correct 0 ms 208 KB Output is correct
10 Correct 1 ms 208 KB Output is correct
11 Correct 1 ms 320 KB Output is correct
12 Correct 0 ms 208 KB Output is correct
13 Correct 1 ms 208 KB Output is correct
14 Correct 0 ms 208 KB Output is correct
15 Correct 0 ms 208 KB Output is correct
16 Correct 1 ms 316 KB Output is correct

Subtask #2
15.0 / 15.0

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

Subtask #3
0 / 15.0

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

Subtask #4
0 / 55.0

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