oj.uz

답안 #47155

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
47155 2018-04-28T07:55:04 Z Kmcode DEL13 (info1cup18_del13) C++14
15 / 100
 15 ms 1512 KB 
#include "bits/stdc++.h"
using namespace std;

#define MAX 100002

int n;

vector<int> v;
int q;

vector<pair<int, int> > vv;


bool ng;

vector<int> ope;
vector<int> v2;
void er() {
	v2.clear();
	int las = 0;
	for (int i = 0; i < vv.size(); i++) {
		int L = vv[i].first;
		int R = vv[i].second;
		int rest = R - L + 1;
		if (rest < las) {
			ng = true;
			break;
		}
		int need = las;
		if (rest > 2) {
			if (rest % 2) {
				
			}
			else {
				rest--;
				need--;
				R--;
			}
		}
		int mid = (R + L) / 2;
		int z = vv[i].second-vv[i].first+1;
		while (rest-2>=need&&rest>=3) {
			ope.push_back(mid);
			R--;
			L++;
			rest -= 2;
			z -= 2;
		}
		while (las--) {
			ope.push_back(vv[i].first - 1);
			z--;
		}
		las = z;
	}
	if (las) {
		ng = true;
	}
	vv.clear();
}

int main() {
	int t;
	cin >> t;
	while (t--) {
		ope.clear();
		ng = false;
		scanf("%d%d", &n,&q);
		v.clear();
		v.push_back(0);
		for (int i = 0; i < q; i++) {
			int a;
			scanf("%d", &a);
			v.push_back(a);
		}
		v.push_back(n+1);
		v.push_back(n + 2);
		for (int i = 1; i < v.size(); i++) {
			if (v[i] - v[i - 1] - 1 == 0) {
				er();
				continue;
			}
			vv.push_back(make_pair(v[i - 1] + 1, v[i] - 1));
		}
		if (ng) {
			puts("-1");
		}
		else {
			cout << ope.size() << endl;
			bool out = false;
			for (int el : ope) {
				if (out) {
					printf(" ");
				}
				out = true;
				printf("%d", el);
			}
			puts("");
		}
	}

	return 0;
}

Compilation message

del13.cpp: In function 'void er()':
del13.cpp:21:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < vv.size(); i++) {
                  ~~^~~~~~~~~~~
del13.cpp: In function 'int main()':
del13.cpp:77:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int i = 1; i < v.size(); i++) {
                   ~~^~~~~~~~~~
del13.cpp:67:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d", &n,&q);
   ~~~~~^~~~~~~~~~~~~~~
del13.cpp:72:9: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    scanf("%d", &a);
    ~~~~~^~~~~~~~~~

Subtask #1
0.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 248 KB Output isn't correct
2 Incorrect 2 ms 356 KB Output isn't correct

Subtask #2
0.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 248 KB Output isn't correct
2 Incorrect 2 ms 356 KB Output isn't correct
3 Incorrect 9 ms 432 KB Output isn't correct
4 Incorrect 15 ms 560 KB Output isn't correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 752 KB Output is correct
2 Correct 4 ms 908 KB Output is correct

Subtask #4
0.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 248 KB Output isn't correct
2 Incorrect 2 ms 356 KB Output isn't correct
3 Incorrect 9 ms 432 KB Output isn't correct
4 Incorrect 15 ms 560 KB Output isn't correct
5 Incorrect 3 ms 908 KB Output isn't correct
6 Incorrect 3 ms 908 KB Output isn't correct
7 Incorrect 3 ms 908 KB Output isn't correct

Subtask #5
0.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 248 KB Output isn't correct
2 Incorrect 2 ms 356 KB Output isn't correct
3 Incorrect 9 ms 432 KB Output isn't correct
4 Incorrect 15 ms 560 KB Output isn't correct
5 Incorrect 3 ms 908 KB Output isn't correct
6 Incorrect 3 ms 908 KB Output isn't correct
7 Incorrect 3 ms 908 KB Output isn't correct
8 Incorrect 9 ms 988 KB Output isn't correct
9 Incorrect 10 ms 1116 KB Output isn't correct
10 Incorrect 9 ms 1116 KB Output isn't correct
11 Incorrect 15 ms 1512 KB Output isn't correct