# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
429815 | tinjyu | Painting Squares (IOI20_squares) | C++14 | 30 ms | 768 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "squares.h"
#include <vector>
#include <iostream>
using namespace std;
long long int tag[10005],now[100005];
int check(int s)
{
for(int i=0;i<=s-10;i++)
{
long long int c=0,p=s;
for(int j=i;j<i+10;j++)
{
if(now[j]!=now[p])c=1;
p++;
}
if(c==0)return 1;
}
return 0;
}
std::vector<int> paint(int n) {
std::vector<int> labels(n + 1);
labels[n]=10;
if(n<10)
{
labels[n]=n;
return labels;
}
for(int i=0;i<min(10,n);i++)
{
labels[i]=0;
now[i]=0;
}
tag[0]=1;
for(int i=10;i<n;i++)
{
labels[i]=0;
now[i]=0;
if(check(i-10+1)==1)
{
labels[i]=1;
now[i]=1;
}
//cout<<now[i];
}
return labels;
}
int find_location(int n, std::vector<int> c) {
for(int i=0;i<c.size();i++)cout<<c[i]<<" ";
cout<<endl;
if(c[c.size()-1]==-1)
{
long long int ans=n;
for(int i=0;;i++)
{
if(c[i]==-1)break;
ans--;
}
return ans-1;
}
for(int i=0;i<10;i++)
{
now[i]=0;
}
for(int i=10;i<n;i++)
{
now[i]=0;
if(check(i-9)==1)
{
now[i]=1;
}
}
for(int i=0;i<n;i++)
{
long long int p=0,can=0;
for(int j=i;j<i+10;j++)
{
if(now[j]!=c[p])can=1;
p++;
}
if(can==0)return i;
}
}
Compilation message (stderr)
# | 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... |