oj.uz

Submission #292304

# Submission time Handle Problem Language Result Execution time Memory
292304 2020-09-06T19:23:04 Z TadijaSebez JOIRIS (JOI16_joiris) C++11
30 / 100
 1 ms 384 KB 
#include <bits/stdc++.h>
using namespace std;
#define pii pair<int,int>
#define pb push_back
vector<pii> ans;
const int N=50;
int need[N],n,k,a[N],rem[N];
int main(){
	scanf("%i %i",&n,&k);
	for(int i=0;i<n;i++)scanf("%i",&a[i]),rem[i%k]=(rem[i%k]+a[i])%k;
	for(int i=0;i<n%k;i++)if(rem[i]!=rem[0])return 0*printf("-1\n");
	for(int i=n%k;i<k;i++)if(rem[i]!=rem[k-1])return 0*printf("-1\n");
	for(int i=1;i<n;i++)while(a[i]<a[i-1])a[i]+=k,ans.pb({1,i});
	for(int i=1;i<n;i++){
		for(int j=a[i-1]+1;j<=a[i];j++){
			for(int z=i-k;z>=0;z-=k)ans.pb({2,z});
			if((i-1)%k!=k-1)for(int z=0;z<=(i-1)%k;z++)need[z]++;
		}
	}
	for(int i=0;i<k-1;i++)while(need[i]>0)need[i]-=k,ans.pb({1,i});
	if(need[0]>need[k-1])for(int i=0;i<n%k;i++)ans.pb({1,i}),need[i]-=k;
	for(int j=0;j>need[0]-need[k-1];j--)for(int i=n-1;i>=0;i-=k)ans.pb({2,i});
	printf("%i\n",ans.size());
	for(pii p:ans)printf("%i %i\n",p.first,p.second+1);
	return 0;
}

Compilation message

joiris.cpp: In function 'int main()':
joiris.cpp:23:11: warning: format '%i' expects argument of type 'int', but argument 2 has type 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wformat=]
   23 |  printf("%i\n",ans.size());
      |          ~^    ~~~~~~~~~~
      |           |            |
      |           int          std::vector<std::pair<int, int> >::size_type {aka long unsigned int}
      |          %li
joiris.cpp:9:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    9 |  scanf("%i %i",&n,&k);
      |  ~~~~~^~~~~~~~~~~~~~~
joiris.cpp:10:27: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   10 |  for(int i=0;i<n;i++)scanf("%i",&a[i]),rem[i%k]=(rem[i%k]+a[i])%k;
      |                      ~~~~~^~~~~~~~~~~~

Subtask #1
15.0 / 15.0

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

Subtask #2
0 / 15.0

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

Subtask #3
15.0 / 15.0

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

Subtask #4
0 / 55.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 0 ms 256 KB Output is correct
6 Correct 0 ms 256 KB Output is correct
7 Correct 0 ms 256 KB Output is correct
8 Correct 0 ms 256 KB Output is correct
9 Correct 0 ms 256 KB Output is correct
10 Correct 0 ms 256 KB Output is correct
11 Correct 0 ms 256 KB Output is correct
12 Correct 0 ms 256 KB Output is correct
13 Correct 0 ms 256 KB Output is correct
14 Correct 0 ms 256 KB Output is correct
15 Correct 0 ms 256 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Incorrect 0 ms 256 KB Output isn't correct
18 Halted 0 ms 0 KB -