#include "squares.h"
#include <vector>
#include<bits/stdc++.h>
using namespace std;
std::vector<int> paint(int n) {
std::vector<int> labels(n + 1, 1);
int k=70;
//cout<<labels<<'\n';
for(int i=0;i<2*(n/k+1);i++)
{
for(int j=0;j<k-i-1;j++)
{
if(i*k+j>n) break;
if(j<i) labels[i*k+j]=1;
else labels[i*k+j]=0;
}
}
/*for(int i=0;i<10;i++) cout<<i<<' ';
*/
labels[n]=k;
return labels;
}
int find_location(int n, std::vector<int> c) {
//cout<<"Y";
std::vector<int> labels(n +80, -1);
int k=70;
//cout<<labels<<'\n';
for(int i=0;i<2*(n/k+1);i++)
{
for(int j=0;j<k-i-1;j++)
{
if(i*k+j>n) continue;
if(j<i) labels[i*k+j]=1;
else labels[i*k+j]=0;
}
}
for(int i=0;i<=71;i++)
labels.push_back(-1);
/*for(int i=0;i<n+70;i++) cout<<labels[i]<<' ';
for(int i=0;i<c.size();i++) cout<<c[i];
cout<<'\n';*/
for(int i=0;i<n;i++)
{
int ch=1;
for(int j=0;j<c.size();j++)
{
//if(i+j>labels.size()) break;
if(labels[i+j]!=c[j]) {
ch=0;
break;
}
}
if(ch) return i-1;
}
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |