제출 #857245

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
857245		onepunchac168	Paint By Numbers (IOI16_paint)	C++14	90 / 100	205 ms	399336 KiB

paint

//------------------------------------\\
//   ------------------------------   \\
//  |  created by Dinh Manh Hung   |  \\
//  |      tht.onepunchac168       |  \\
//  |     THPT CHUYEN HA TINH      |  \\
//  |      HA TINH, VIET NAM       |  \\
//  |           Siuuu              |  \\
//   ------------------------------   \\
//------------------------------------\\

#include "paint.h"
#include <bits/stdc++.h>
using namespace std;

#define            task     ""
#define       file(name)    if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
#define             ldb     long double
#define              pb     push_back
#define              eb     emplace_back
#define              fi     first
#define              se     second
#define           all(x)    begin(x),end(x)
#define       uniquev(v)    v.resize(unique(all(v))-v.begin())
#define       rep(i,a,b)    for (int i=a;i<=b;i++)
#define        cntbit(v)    __builtin_popcountll(v)
#define         gcd(a,b)    __gcd(a,b)
#define         lcm(a,b)    ((1LL*a*b)/__gcd(a,b))
#define          mask(x)    (1LL<<(x))
#define     readbit(x,i)    ((x>>i)&1)
#define             Yes     cout << "Yes"
#define             YES     cout << "YES"
#define              No     cout << "No"
#define              NO     cout << "NO"

typedef long long ll;
typedef pair <ll,ll> ii;
typedef pair <ll,ii> iii;
typedef pair <ii,ii> iiii;

ll dx[]= {1,-1,0,0,1,-1,1,-1};
ll dy[]= {0,0,-1,1,1,-1,-1,1};

const ldb PI = acos (-1);
//const ll mod=978846151;
//const ll base=29;
const ll mod=1e9+7;
const char nl = '\n';

inline int ReadInt()
{
    char co;
    for (co = getchar(); co < '0' || co > '9'; co = getchar());
    int xo = co - '0';
    for (co = getchar(); co >= '0' && co <= '9'; co = getchar())
        xo = (xo<<1) + (xo<<3) + co - '0';
    return xo;
}

void WriteInt(int xo)
{
    if (xo > 9)
        WriteInt(xo / 10);
    putchar(xo % 10 + '0');
}

// DEBUG
/*
void __print(int x) {cerr << x;}
void __print(long x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(unsigned x) {cerr << x;}
void __print(unsigned long x) {cerr << x;}
void __print(unsigned long long x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}

template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}


#ifndef ONLINE_JUDGE
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#define debug(x...)
#endif
*/

/* END OF TEMPLATE*/

// ================= Solution =================//

/*
void onepunchac168();

signed main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    file(task);
    int tests;
    tests=1;
    //cin>>tests;
    while (tests--)
    {
        onepunchac168();
    }
}

const int N=2e5+5;

void onepunchac168()
{

}
// goodbye see ya
*/
const int N=2e5+10;
const int M=1010;
bool dp[2][N][M];
int n;
char a[N];
int cp[N];
int sum[N];
int gg[N];
int k;
std::string solve_puzzle(std::string s, std::vector<int> c) {
    n=s.size();
    for (int i=0;i<s.size();i++)
    {
        a[i+1]=s[i];
    }
    sum[0]=0;
    for (int i=1;i<=n;i++)
    {
        sum[i]=sum[i-1];
        if (a[i]=='_')
        {
            sum[i]++;
        }
    }
    k=c.size();
    for (int i=1;i<=k;i++)
    {
        cp[i]=c[i-1];
    }
    dp[0][0][0]=1;
    for (int i=1;i<=n;i++)
    {
        if (a[i]!='X')
        {
            for (int j=0;j<=k;j++)
            {
                dp[0][i][j]=dp[0][i-1][j];
            }
        }
        for (int j=1;j<=k;j++)
        {
            if (cp[j]>i)
            {
                continue;
            }
            if (sum[i]-sum[i-cp[j]]==0)
            {
                if ((i-cp[j]+1==1&&j==1)||(a[i-cp[j]]!='X'&&dp[0][i-cp[j]-1][j-1]==1))
                {
                    dp[0][i][j]=1;
                }
            }
        }
    }
    dp[1][n+1][k+1]=1;
    string ans;
    for (int i=n;i>=1;i--)
    {
        if (a[i]!='X')
        {
            for (int j=1;j<=k+1;j++)
            {
                dp[1][i][j]=dp[1][i+1][j];
            }
        }
        for (int j=1;j<=k;j++)
        {
            if (cp[j]>n-i+1)
            {
                continue;
            }
            if (sum[i+cp[j]-1]-sum[i-1]==0)
            {
                if ((i+cp[j]-1==n&&j==k)||(a[i+cp[j]]!='X'&&dp[1][i+cp[j]+1][j+1]==1))
                {
                    if (i==1)
                    {
                        if (j==1)
                        {
                            gg[i]++;
                            gg[i+cp[j]]--;

                        }
                    }
                    else if (a[i-1]!='X'&&dp[0][i-2][j-1]==1)
                    {
                        gg[i]++;
                        gg[i+cp[j]]--;
                    }
                    dp[1][i][j]=1;
                }
            }
        }
    }
    for (int i=1;i<=n;i++)
    {
        gg[i]+=gg[i-1];
        if (a[i]!='.')
        {
            ans.pb(a[i]);
            continue;
        }
        bool checka=false;
        for (int j=0;j<=k;j++)
        {
            if (dp[0][i-1][j]==1&&dp[1][i+1][j+1]==1)
            {
                checka=true;
                break;
            }

        }
        if (checka==true&&gg[i]>=1)
        {
            ans.pb('?');
        }
        else if (checka==true)
        {
            ans.pb('_');
        }
        else ans.pb('X');
    }
    return ans;
}

컴파일 시 표준 에러 (stderr) 메시지

paint.cpp:1:1: warning: multi-line comment [-Wcomment]
    1 | //------------------------------------\\
      | ^
paint.cpp: In function 'std::string solve_puzzle(std::string, std::vector<int>)':
paint.cpp:138:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  138 |     for (int i=0;i<s.size();i++)
      |                  ~^~~~~~~~~

• Subtask 1: 7 / 7
• Subtask 2: 3 / 3
• Subtask 3: 22 / 22
• Subtask 4: 27 / 27
• Subtask 5: 21 / 21
• Subtask 6: 10 / 10
• Subtask 7: 0 / 10