| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 617759 | A_D | Unscrambling a Messy Bug (IOI16_messy) | C++14 | 0 ms | 0 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 <bits/stdc++.h>
using namespace std;
const int N=2e5+100;
int n,k;
string ss;
vector<int> cc;
int ok_(int u)
{
int lst=0,sum=0;
for(int i=0;i<n;i++){
int cnt=0;
for(int j=i;j<n;j++){
if(ss[j]=='.'||j==u){
cnt++;
}
else{
break;
}
}
if(sum+cnt<=cc[lst]){
sum++;
if(sum==cc[lst]){
lst++;
if(lst==k)return 1;
i++;
sum=0;
}
}
}
return 0;
}
int okx(int u)
{
int sum=0,lst=0;
for(int h=0;h<n;h++){
for(int i=0;i<n;i++){
int cnt=0;
for(int j=i;j<n;j++){
if(ss[j]=='.'||j==u){
cnt++;
}
else{
break;
}
}
if(sum==cc[lst]){
sum=0;
lst++;
if(lst==k)return 1;
}
if(lst==h){
if(i+min(cnt-1,cc[lst]-1)>=u){
sum++;
}
if(i==u&&sum+cnt-1<cc[lst])goto d;
}
else{
if(i==u)goto d;
if(cnt+sum>=cc[lst]){
sum++;
if(sum==cc[lst]){
sum=0;
lst++;
i++;
if(lst==k)return 1;
}
}
}
}
d:
;
}
}
string solve_puzzle(string s,vector<int> c){
string ans=s;
ss=s;
n=s.size();
k=c.size();
for(int i=0;i<s.size();i++){
if(s[i]!='.')continue;
int ok=okx(i);
ok+=2*ok_(i);
if(ok==1)ans[i]='X';
if(ok==2)ans[i]='_';
if(ok==3)ans[i]='?';
}
return ans;
}