oj.uz

Submission #335634

# Submission time Handle Problem Language Result Execution time Memory
335634 2020-12-13T12:10:23 Z Bill_00 JOIRIS (JOI16_joiris) C++14
100 / 100
 66 ms 492 KB 
#include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define pp push 
#define mp make_pair
#define MOD 1000000007
#define INF 1000000000
typedef long long ll; 
using namespace std;
int a[51];
vector<int>s[51];
int c[51];
int main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	int n,k;
	cin >> n >> k;
	for(int i=1;i<=n;i++){
		cin >> a[i];
	}
	for(int i=1;i<=n-k+1;i++){
		for(int j=i;j<=i+k-1;j++){
			s[j].pb(i);
		}
	}
	for(int i=0;i<k;i++){
		c[1]=i;
		int height=(i+a[1])%k;
		for(int j=2;j<=n-k+1;j++){
			int sum=0;
			for(int p=0;p<(s[j].size()-1);p++){
				sum+=c[s[j][p]];
			}
			c[j]=((height-a[j]-sum)%k+k)%k;
		}
		int flag=0;
		for(int j=n-k+2;j<=n;j++){
			int sum=0;
			for(int p=0;p<s[j].size();p++){
				sum+=c[s[j][p]];
			}
			if(height!=((sum+a[j])%k)){
				flag++;
				break;
			}
		}
		if(!flag){
			// for(int j=1;j<=n-k+1;j++) cout << c[j] << ' ';
			vector<pair<int,int> >ans;
			for(int j=1;j<=n-k+1;j++){
				for(int p=1;p<=c[j];p++){
					int mx=0;
					for(int u=j;u<=j+k-1;u++){
						mx=max(a[u],mx);
					}
					ans.pb(mp(2,j));
					for(int u=1;u<=n;u++){
						if(u>=j && u<=j+k-1) continue;
						if(a[u]<=mx){
							// cout << mx << "KKk";
							while(a[u]<=mx){
								a[u]+=(k);
								ans.pb(mp(1,u));	
							}	
						} 
						a[u]--;
					}
				}
			}
			int mx=0;
			for(int j=1;j<=n;j++){
				mx=max(mx,a[j]);
			}
			for(int j=1;j<=n;j++){
				for(int p=1;p<=(mx-a[j])/k;p++){
					ans.pb(mp(1,j));
				}
			}
			cout << ans.size() << '\n';
			for(int i=0;i<ans.size();i++){
				cout << ans[i].ff << ' ' << ans[i].ss << '\n';
			}
			return 0;
		}
	}
	cout << -1;
}

Compilation message

joiris.cpp: In function 'int main()':
joiris.cpp:33:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   33 |    for(int p=0;p<(s[j].size()-1);p++){
      |                ~^~~~~~~~~~~~~~~~
joiris.cpp:41:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   41 |    for(int p=0;p<s[j].size();p++){
      |                ~^~~~~~~~~~~~
joiris.cpp:82:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   82 |    for(int i=0;i<ans.size();i++){
      |                ~^~~~~~~~~~~

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 0 ms 364 KB Output is correct
6 Correct 0 ms 364 KB Output is correct
7 Correct 0 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 0 ms 364 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct

Subtask #2
15.0 / 15.0

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

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 0 ms 364 KB Output is correct
6 Correct 0 ms 364 KB Output is correct
7 Correct 0 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 0 ms 364 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 384 KB Output is correct
20 Correct 34 ms 368 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 384 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 1 ms 364 KB Output is correct
26 Correct 1 ms 364 KB Output is correct
27 Correct 1 ms 364 KB Output is correct
28 Correct 1 ms 364 KB Output is correct
29 Correct 1 ms 364 KB Output is correct
30 Correct 1 ms 384 KB Output is correct
31 Correct 35 ms 364 KB Output is correct
32 Correct 33 ms 364 KB Output is correct
33 Correct 33 ms 364 KB Output is correct
34 Correct 1 ms 384 KB Output is correct
35 Correct 33 ms 364 KB Output is correct
36 Correct 1 ms 364 KB Output is correct
37 Correct 33 ms 364 KB Output is correct
38 Correct 33 ms 364 KB Output is correct

Subtask #4
55.0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 0 ms 364 KB Output is correct
6 Correct 0 ms 364 KB Output is correct
7 Correct 0 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 0 ms 364 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 256 KB Output is correct
18 Correct 1 ms 384 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 384 KB Output is correct
22 Correct 1 ms 376 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 1 ms 364 KB Output is correct
26 Correct 1 ms 364 KB Output is correct
27 Correct 1 ms 364 KB Output is correct
28 Correct 1 ms 364 KB Output is correct
29 Correct 1 ms 364 KB Output is correct
30 Correct 1 ms 364 KB Output is correct
31 Correct 1 ms 364 KB Output is correct
32 Correct 1 ms 364 KB Output is correct
33 Correct 1 ms 364 KB Output is correct
34 Correct 1 ms 364 KB Output is correct
35 Correct 1 ms 384 KB Output is correct
36 Correct 34 ms 368 KB Output is correct
37 Correct 1 ms 364 KB Output is correct
38 Correct 1 ms 364 KB Output is correct
39 Correct 1 ms 384 KB Output is correct
40 Correct 1 ms 364 KB Output is correct
41 Correct 1 ms 364 KB Output is correct
42 Correct 1 ms 364 KB Output is correct
43 Correct 1 ms 364 KB Output is correct
44 Correct 1 ms 364 KB Output is correct
45 Correct 1 ms 364 KB Output is correct
46 Correct 1 ms 384 KB Output is correct
47 Correct 35 ms 364 KB Output is correct
48 Correct 33 ms 364 KB Output is correct
49 Correct 33 ms 364 KB Output is correct
50 Correct 1 ms 384 KB Output is correct
51 Correct 33 ms 364 KB Output is correct
52 Correct 1 ms 364 KB Output is correct
53 Correct 33 ms 364 KB Output is correct
54 Correct 33 ms 364 KB Output is correct
55 Correct 1 ms 364 KB Output is correct
56 Correct 1 ms 492 KB Output is correct
57 Correct 1 ms 364 KB Output is correct
58 Correct 1 ms 364 KB Output is correct
59 Correct 1 ms 364 KB Output is correct
60 Correct 1 ms 364 KB Output is correct
61 Correct 1 ms 364 KB Output is correct
62 Correct 1 ms 364 KB Output is correct
63 Correct 1 ms 364 KB Output is correct
64 Correct 1 ms 364 KB Output is correct
65 Correct 1 ms 364 KB Output is correct
66 Correct 1 ms 364 KB Output is correct
67 Correct 1 ms 364 KB Output is correct
68 Correct 1 ms 364 KB Output is correct
69 Correct 1 ms 384 KB Output is correct
70 Correct 1 ms 364 KB Output is correct
71 Correct 1 ms 364 KB Output is correct
72 Correct 1 ms 364 KB Output is correct
73 Correct 1 ms 364 KB Output is correct
74 Correct 1 ms 364 KB Output is correct
75 Correct 1 ms 364 KB Output is correct
76 Correct 1 ms 364 KB Output is correct
77 Correct 1 ms 364 KB Output is correct
78 Correct 1 ms 364 KB Output is correct
79 Correct 66 ms 364 KB Output is correct
80 Correct 1 ms 364 KB Output is correct
81 Correct 1 ms 364 KB Output is correct
82 Correct 34 ms 364 KB Output is correct
83 Correct 33 ms 364 KB Output is correct
84 Correct 31 ms 364 KB Output is correct
85 Correct 1 ms 364 KB Output is correct
86 Correct 34 ms 384 KB Output is correct
87 Correct 1 ms 364 KB Output is correct
88 Correct 1 ms 364 KB Output is correct
89 Correct 1 ms 364 KB Output is correct
90 Correct 1 ms 364 KB Output is correct
91 Correct 1 ms 364 KB Output is correct
92 Correct 1 ms 364 KB Output is correct