oj.uz

답안 #108729

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
108729 2019-05-01T07:52:04 Z tjd229 1-Color Coloring (FXCUP2_coloring) C++14
0 / 1
 3 ms 384 KB 
#include "coloring.h"
#include <vector>
using namespace std;
bool in[101];
vector<int> v1, v2;
int paint = 0;
int find(int back, int &coin) {
	if (v1.size() == 1 && v2.empty()) return v1[0];
	else if (v2.size() == 1 && v1.empty()) return v2[0];
	if (!coin) return -1;
	for (auto x : v1) Color(x), ++paint;
	int c = GetColor(back); --coin;
	vector<int> *live = &v1, *erase = &v2;
	if (c) live = &v2, erase = &v1;

	erase->clear();
	while (live->size() > erase->size()) {
		erase->push_back(live->back());
		live->pop_back();
	}
	return find(back, coin);
}
void ColoringSame(int N) {
	int i;
	int coin = 200;
	vector<int> stk, v;
	stk.push_back(1);
	while (coin>6 && stk.size()!=N) { // N cond
		int t = 1;
		v1.clear(); v2.clear();
		for (i = 2; i <= N; ++i) {
			if (in[i]) continue;
			if (t) v1.push_back(i);
			else v2.push_back(i);
			t = 1 - t;
		}
		int back = find(stk.back(), coin);
		if (back > 0) {
			in[back] = 1;
			stk.push_back(back);
		}
		else break;

	}
	for (Color(1), i = 2; i <= N; ++i) { if (!in[i]) v.push_back(i); }
	int pad = 0;
	for (i = 0; i < v.size(); ++i) {
		if (i == 1) pad += 1;
		if (i == 35) pad += 1;
		for (int j = 0; j < v.size()-pad; ++j) 
			Color(v[j]),++paint;
	}
	for (; stk.size() > 1; stk.pop_back()) Color(stk.back());
}

Compilation message

coloring.cpp: In function 'void ColoringSame(int)':
coloring.cpp:28:29: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  while (coin>6 && stk.size()!=N) { // N cond
                   ~~~~~~~~~~^~~
coloring.cpp:47:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (i = 0; i < v.size(); ++i) {
              ~~^~~~~~~~~~
coloring.cpp:50:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int j = 0; j < v.size()-pad; ++j) 
                   ~~^~~~~~~~~~~~~~

Subtask #1
0 / 1.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 3 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 256 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Runtime error 2 ms 256 KB Execution failed because the return code was nonzero
10 Halted 0 ms 0 KB -