# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
165818 | Segtree | Paint By Numbers (IOI16_paint) | C++14 | 11 ms | 504 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"paint.h"
#include<iostream>
#include<vector>
using namespace std;
typedef long long ll;
string solve_puzzle(string s,vector<int> c){
int n=s.size();
vector<bool> t;
for(int i=0;i<c.size();i++){
if(i)t.push_back(0);
for(int j=0;j<c[i];j++){
t.push_back(1);
}
}
bool b[110],w[110];
for(int i=0;i<n;i++)b[i]=w[i]=0;
for(int i=0;i<n-t.size();i++){
w[i]=1;
w[n-1-i]=1;
}
for(int i=0;i<t.size();i++){
for(int j=0;j<=n-t.size();j++){
if(t[i]==0)w[i+j]=1;
if(t[i]==1)b[i+j]=1;
}
}
string ans;
for(int i=0;i<n;i++){
if(b[i]==0&&w[i]==0)cout<<1/0<<endl;
if(b[i]==0&&w[i]==1)ans+="_";
if(b[i]==1&&w[i]==0)ans+="X";
if(b[i]==1&&w[i]==1)ans+="?";
}
return ans;
}
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |