Submission #1168992

#	Time	Username	Problem	Language	Result	Execution time	Memory
1168992		user736482	Painting Squares (IOI20_squares)	C++20	100 / 100	63 ms	420 KiB

squares

#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define pb push_back
#define ff first
#define ss second
#define MOD 998244353
#define POT 4194304
#define INF 1000000019
#define INFL 1000000000000000099LL
 
//ll t,n,a,b,c,d;


//map<ll,bool>used;

vector<int> paint(int n){
    //string s="0000000000000000000000000000001111111111111111111111111111110111111111111111111111111111100111111111111111111111111111010111111111111111111111111111000111111111111111111111111110110111111111111111111111111110100111111111111111111111111110010111111111111111111111111110000111111111111111111111111101110111111111111111111111111101100111111111111111111111111101010111111111111111111111111101000111111111111111111111111100110111111111111111111111111100100111111111111111111111111100010111111111111111111111111100000111111111111111111111111011110111111111111111111111111011100111111111111111111111111011010111111111111111111111111011000111111111111111111111111010110111111111111111111111111010100111111111111111111111111010010111111111111111111111111010000111111111111111111111111001110111111111111111111111111001100111111111111111111111111001010111111111111111111111111001000111111111111111111111111000110111111111111111111111111000100111111111111111111111111000010111111111111111111111111000000111111111";
    string s="0000000000111111111101111111100111111101011111110001111110110111111010011111100101111110000111110111011111011001111101010111110100011111001101111100100111110001011111000001111011110111001111011010111101100011110101101111010100111101001011110100001111001110111100110011110010101111001000111100011011110001001111000010111100000011101110101110111000111011011011101101001110110010111011000011101011001110101010111010100011101001101110100100111010001011101000001110011100110101110011000111001011011100101001110010010111001000011100011001110001010111000100011100001101110000100111000001011100000001101101100110110101011011010001101100100110110001011011000001101011010110001101010100110101001011010100001101001100110100101011010010001101000100110100001011010000001100110010110011000011001010101100101000110010010011001000101100100000110001100010100110001001011000100001100001010110000100011000001001100000010110000000010101010100010101001001010100000101001010010000101000100010100001001010000000100100100010";
    vector<int>x;
    x.resize(n+1);
    for(ll i=0;i<n;i++){
        x[i]=s[i]-'0';
    }
    x[n]=10;
    return x;
}

int find_location(int n, vector<int>c){
    //string s="0000000000000000000000000000001111111111111111111111111111110111111111111111111111111111100111111111111111111111111111010111111111111111111111111111000111111111111111111111111110110111111111111111111111111110100111111111111111111111111110010111111111111111111111111110000111111111111111111111111101110111111111111111111111111101100111111111111111111111111101010111111111111111111111111101000111111111111111111111111100110111111111111111111111111100100111111111111111111111111100010111111111111111111111111100000111111111111111111111111011110111111111111111111111111011100111111111111111111111111011010111111111111111111111111011000111111111111111111111111010110111111111111111111111111010100111111111111111111111111010010111111111111111111111111010000111111111111111111111111001110111111111111111111111111001100111111111111111111111111001010111111111111111111111111001000111111111111111111111111000110111111111111111111111111000100111111111111111111111111000010111111111111111111111111000000111111111";
    string s="0000000000111111111101111111100111111101011111110001111110110111111010011111100101111110000111110111011111011001111101010111110100011111001101111100100111110001011111000001111011110111001111011010111101100011110101101111010100111101001011110100001111001110111100110011110010101111001000111100011011110001001111000010111100000011101110101110111000111011011011101101001110110010111011000011101011001110101010111010100011101001101110100100111010001011101000001110011100110101110011000111001011011100101001110010010111001000011100011001110001010111000100011100001101110000100111000001011100000001101101100110110101011011010001101100100110110001011011000001101011010110001101010100110101001011010100001101001100110100101011010010001101000100110100001011010000001100110010110011000011001010101100101000110010010011001000101100100000110001100010100110001001011000100001100001010110000100011000001001100000010110000000010101010100010101001001010100000101001010010000101000100010100001001010000000100100100010";
    //cout<<s.size();
    for(ll i=0;i<10;i++){
        if(c[i]==-1){
            return n-i;
        }
    }
    //for(ll i=0;i<10;i++)cout<<c[i];
    //cout<<" ";
    for(ll i=0;i<1000-9;i++){
        bool bl=1;
        for(ll j=0;j<10;j++){
            if(c[j]!=s[i+j]-'0')
                bl=0;
        }
        if(bl)return i;
    }
    return 1;
}

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