Submission #1169100

#	Time	Username	Problem	Language	Result	Execution time	Memory
1169100		niepamietamhasla	Painting Squares (IOI20_squares)	C++20	100 / 100	91 ms	424 KiB

squares

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

string skad = "0000000001111111111011110111110111011111101101110110110111111101011011110101110111010111101101011010111110101011011010101110101010101111111100101111110011011111001110111100101011110011110111001011011100110101110011100111110110010111011001101101100111010110010101011001111001100101100110011111101001011110100110111010011101101001010110100110011010011110101001011010100110101010011100101001010011111001001011100100110110010011101001001010100100110010010011111110001011111000110111100010011110001110111000101011100011001110001111011000101101100011010110001001011000111001100010100110001100011111010001011101000110110100010011010001110101000101010100011001010001111001000101100100011010010001001001000111000100010100010001111110000101111000011011100001001110000111011000010101100001100110000100011000011110100001011010000110101000010010100001110010000101001000011000100001000011111000001011100000110110000010011000001110100000101010000011001000001000100000111100000010110000001101000000100100000011100000";

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

int find_location(int n, vector<int> c){
    for(int i = 0; i < min(n, 10); ++i){
        if(c[i] == -1){
            return n - i;
        }
    }
    string W = "";
    for(int i = 0; i < min(n, 10); ++i){
        W += (c[i] == 0 ? '0' : '1');
    }
    for(int i = 0; i + c.size() - 1 < skad.size(); ++i){
        if(W == skad.substr(i, c.size())){
            return i;
        }
    }
    return -1;
}

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