제출 #1169004

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1169004		4QT0R	Painting Squares (IOI20_squares)	C++20	100 / 100	50 ms	416 KiB

squares

#include <bits/stdc++.h>
#include "squares.h"
using namespace std;

string ciag="0000000000111111111101010101011101010110110101011111010110101101111010111011101011110110101111111011011011101101111110111011111011110111111110010010011001001010100100101110010011011001001110100100111110010100101001110010101011001010110100101011110010110011001011010100101101110010111011001011110100101111110011001101001100111100110101010011010111001101101100110111010011011111001110011101011001110110100111011110011110101001111011100111110110011111101001111111000100010100010001110001001001000100101100010011010001001111000101001100010101010001010111000101100100010110110001011101000101111100011000110010100011001110001101001000110101100011011010001101111000111001100011101010001110111000111100100011110110001111101000111111000010000100011000010010100001001110000101001000010101100001011010000101111000011000100001100110000110101000011011100001110010000111011000011110100001111100000100010000010011000001010100000101110000011001000001101100000111010000011110000001001000000101100000011010000001110000000101000000011000000001000000000";

vector<int> paint(int n){
	vector<int> ans;
	for (int i = 0; i<n; i++)ans.push_back(ciag[i]-'0');
	ans.push_back(min(n,10));
	return ans;
}

int find_location(int n, vector<int> c){
	if (c.back()==-1){
		int pos=n-c.size();
		while(c.back()==-1){
			pos++;
			c.pop_back();
		}
		return pos;
	}
	for (int i = 0; i+(int)c.size()-1<(int)ciag.size(); i++){
		bool ok=true;
		for (int j = 0; j<(int)c.size(); j++){
			if ((ciag[i+j]-'0')!=c[j]){
				ok=false;
				break;
			}
		}
		if (ok)return i;
	}
	return -1;
}

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