oj.uz

답안 #20987

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
20987 2017-03-27T08:12:33 Z model_code JOIRIS (JOI16_joiris) C++11
0 / 100
 0 ms 1172 KB 
#include<stdio.h>
#include<vector>
#include<algorithm>
using namespace std;
typedef pair<int, int>pii;
int dat[100];
int r[100];
int main()
{
	int num, len;
	scanf("%d%d", &num, &len);
	vector<int>vec;
	for (int i = 0; i < num; i++)
	{
		int z;
		scanf("%d", &z);
		vec.push_back(z);
		dat[i%len] += z;
	}
	for (int i = 0; i < num%len; i++)
	{
		if (dat[i] % len != dat[0] % len)
		{
			printf("-1\n");
			return 0;
		}
	}
	for (int i = num%len; i < len; i++)
	{
		if (dat[i] % len != dat[len - 1] % len)
		{
			printf("-1\n");
			return 0;
		}
	}
	vector<pii>ans;
	for (int i = 1; i < num; i++)
	{
		for (;;)
		{
			if (vec[i - 1] > vec[i])
			{
				ans.push_back(make_pair(1, i));
				vec[i] += len;
			}
			else break;
		}
	}
	for (int i = 0; i < num - 1; i++)
	{
		for (int j = vec[i]; j < vec[i + 1]; j++)
		{
			for (int k = i - len + 1; k >= 0; k -= len)
			{
				ans.push_back(make_pair(2, k));
			}
			if(i%len!=len-1)r[i % len]--;
		}
	}
	for(int i=len-3;i>=0;i--)r[i]+=r[i+1];
	int maxi = 0;
	for (int i = 0; i < num; i++)
	{
		for (;;)
		{
			if(r[i]>=0)break;
			ans.push_back(make_pair(1, i));
			r[i] += len;
		}
	}
	if(num%len>=1&&r[0]<r[len-1])
	{
		for (int i = 0; i < num%len; i++)ans.push_back(make_pair(1,i)),r[i]+=len;
	}
	if(num%len>=1)
	{
		for (int i = num - len; i >= 0; i -= len)
		{
			for (int j = 0; j < r[0]-r[len-1]; j++)ans.push_back(make_pair(2, i));
		}
	}
	printf("%d\n", ans.size()+1);
	for (int i = 0; i < ans.size(); i++)printf("%d %d\n", ans[i].first, ans[i].second + 1);
}

Compilation message

joiris.cpp: In function 'int main()':
joiris.cpp:82:29: warning: format '%d' expects argument of type 'int', but argument 2 has type 'std::vector<std::pair<int, int> >::size_type {aka long unsigned int}' [-Wformat=]
  printf("%d\n", ans.size()+1);
                             ^
joiris.cpp:83:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < ans.size(); i++)printf("%d %d\n", ans[i].first, ans[i].second + 1);
                    ^
joiris.cpp:61:6: warning: unused variable 'maxi' [-Wunused-variable]
  int maxi = 0;
      ^
joiris.cpp:11:27: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d", &num, &len);
                           ^
joiris.cpp:16:18: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", &z);
                  ^

Subtask #1
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 1172 KB Output is correct
2 Correct 0 ms 1172 KB Output is correct
3 Correct 0 ms 1172 KB Output is correct
4 Incorrect 0 ms 1172 KB Unexpected end of file - int32 expected
5 Halted 0 ms 0 KB -

Subtask #2
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 0 ms 1172 KB Unexpected end of file - int32 expected
2 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 1172 KB Output is correct
2 Correct 0 ms 1172 KB Output is correct
3 Correct 0 ms 1172 KB Output is correct
4 Incorrect 0 ms 1172 KB Unexpected end of file - int32 expected
5 Halted 0 ms 0 KB -

Subtask #4
0 / 55.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 1172 KB Output is correct
2 Correct 0 ms 1172 KB Output is correct
3 Correct 0 ms 1172 KB Output is correct
4 Incorrect 0 ms 1172 KB Unexpected end of file - int32 expected
5 Halted 0 ms 0 KB -