제출 #381064

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
381064		BlancaHM	Painting Squares (IOI20_squares)	C++14	0 / 100	2121 ms	808 KiB

squares

#include <iostream>
#include <vector>
#include <map>
using namespace std;

vector<int> paint(int n) {
	vector<int> squares = vector<int>(n+1);
	map<string, int> used;
	squares[n] = 10;
	string window = "1111111111";
	used.clear();
	for (int i = 0; i < 10; i++) {
		if (i == n)
			break;
		squares[i] = 1;
	}
	used[window] = 0;
	for (int i = 10; i < n; i++) {
		window.erase(0, 1);
		window.push_back('0');
		if (used.find(window) == used.end())
			squares[i] = 0;
		else {
			squares[i] = 1;
			window[9] = '1';
		}
		used[window] = i - 9;
	}
	return squares;
}

int find_location(int n, vector<int> c) {
	for (int i = 0; i < (int) c.size(); i++) {
		if (c[i] == -1)
			return n - i;
	}
	vector<int> squares = vector<int>(n+1);
	map<string, int> used;
	squares[n] = 10;
	string window = "1111111111";
	string s = "";
	for (int i = 0; i < (int) c.size(); i++)
		s.push_back('0' + c[i]);
	for (int i = 0; i < 10; i++)
		squares[i] = 1;
	used[window] = 0;
	for (int i = 10; i < n; i++) {
		window.erase(0, 1);
		window.push_back('0');
		if (used.find(window) == used.end())
			squares[i] = 0;
		else {
			squares[i] = 1;
			window[9] = '1';
		}
		used[window] = i - 9;
	}
	return used[s];
}

• Subtask 1: 0 / 10
• Subtask 2: 0 / 15
• Subtask 3: 0 / 20
• Subtask 4: 0 / 55