제출 #256440

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
256440		ant101	Paint By Numbers (IOI16_paint)	C++14	100 / 100	426 ms	90036 KiB

paint

#include "paint.h"
#include <cstdlib>
#include <iostream>
#include <algorithm>
#include <cstring>
#include <iomanip>
#include <fstream>
#include <cmath>
#include <vector>
#include <set>
#include <unordered_set>
#include <unordered_map>
#include <map>
#include <stack>
#include <queue>
#include <assert.h>
#include <limits>
#include <cstdio>
#include <complex>
using namespace std;

typedef long long ll;
typedef long double ld;
typedef double db;
typedef string str;

typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;
#define mp make_pair
#define f first
#define s second

typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<ld> vd;
typedef vector<str> vs;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<pd> vpd;

#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rall(x) (x).rbegin(), (x).rend()
#define rsz resize
#define ins insert
#define ft front()
#define bk back()
#define pf push_front
#define pb push_back
#define eb emplace_back
#define lb lower_bound
#define ub upper_bound

#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define trav(a,x) for (auto& a: x)

const int MOD = 1e9+7; // 998244353; // = (119<<23)+1
const int MX = 2e5+5;
const ll INF = 1e18;
const ld PI = 4*atan((ld)1);
const int dx[4] = {0,1,0,-1}, dy[4] = {1,0,-1,0};


namespace io {
    void setIn(string s) { freopen(s.c_str(),"r",stdin); }
    void setOut(string s) { freopen(s.c_str(),"w",stdout); }
    void setIO(string s = "") {
        ios_base::sync_with_stdio(0); cin.tie(0); // fast I/O
        // cin.exceptions(cin.failbit); // ex. throws exception when you try to read letter into int
        if (sz(s)) {
            setIn(s+".in");
            setOut(s+".out");
        } // for USACO
    }
}

using namespace io;

namespace input {
    template<class T> void re(complex<T>& x);
    template<class T1, class T2> void re(pair<T1,T2>& p);
    template<class T> void re(vector<T>& a);
    template<class T, size_t SZ> void re(array<T,SZ>& a);
    
    template<class T> void re(T& x) { cin >> x; }
    void re(double& x) { string t; re(t); x = stod(t); }
    void re(ld& x) { string t; re(t); x = stold(t); }
    template<class Arg, class... Args> void re(Arg& first, Args&... rest) {
        re(first); re(rest...);
    }
    
    template<class T> void re(complex<T>& x) { T a,b; re(a,b); x = cd(a,b); }
    template<class T1, class T2> void re(pair<T1,T2>& p) { re(p.f,p.s); }
    template<class T> void re(vector<T>& a) { F0R(i,sz(a)) re(a[i]); }
    template<class T, size_t SZ> void re(array<T,SZ>& a) { F0R(i,SZ) re(a[i]); }
}

namespace output {
    template<class T1, class T2> void pr(const pair<T1,T2>& x);
    template<class T, size_t SZ> void pr(const array<T,SZ>& x);
    template<class T> void pr(const vector<T>& x);
    template<class T> void pr(const set<T>& x);
    template<class T1, class T2> void pr(const map<T1,T2>& x);
    
    template<class T> void pr(const T& x) { cout << x; }
    template<class Arg, class... Args> void pr(const Arg& first, const Args&... rest) {
        pr(first); pr(rest...);
    }
    
    template<class T1, class T2> void pr(const pair<T1,T2>& x) {
        pr("{",x.f,", ",x.s,"}");
    }
    template<class T> void prContain(const T& x) {
        pr("{");
        bool fst = 1; for (const auto& a: x) pr(!fst?", ":"",a), fst = 0; // const needed for vector<bool>
        pr("}");
    }
    template<class T, size_t SZ> void pr(const array<T,SZ>& x) { prContain(x); }
    template<class T> void pr(const vector<T>& x) { prContain(x); }
    template<class T> void pr(const set<T>& x) { prContain(x); }
    template<class T1, class T2> void pr(const map<T1,T2>& x) { prContain(x); }
    
    void ps() { pr("\n"); }
    template<class Arg> void ps(const Arg& first) {
        pr(first); ps(); // no space at end of line
    }
    template<class Arg, class... Args> void ps(const Arg& first, const Args&... rest) {
        pr(first," "); ps(rest...); // print w/ spaces
    }
}

using namespace output;

using namespace input;

ll add(ll a, ll b) {
    a += b;
    if(a >= MOD) {
        a -= MOD;
    }
    return a;
}
ll sub(ll a, ll b) {
    a -= b;
    if(a < 0) {
        a += MOD;
    }
    return a;
}

ll mul(ll a, ll b) {
    return (a * b)%MOD;
}

void add_self(ll& a, ll b) {
    a = add(a, b);
}
void sub_self(ll& a, ll b) {
    a = sub(a, b);
}
void mul_self(ll& a, ll b) {
    a = mul(a, b);
}


ll N, K;
bool dp[MX][210];
bool dp2[MX][210];
pl pref[MX];
pl lazy[MX];
ll qpref[MX];


std::string solve_puzzle(std::string s, std::vector<int> c) {
    N = s.length();
    K = c.size();
    N++;
    s+="_";
    string res = "";
    ll cs1 = 0, cs2 = 0;
    F0R (i, K) {
        cs1+=c[i];
        qpref[i+1] = cs1;
    }
    cs1 = 0;
    F0R (i, N) {
        if (s[i] == 'X') {
            cs1++;
        } else if (s[i] == '_') {
            cs2++;
        }
        pref[i+1].f = cs1;
        pref[i+1].s = cs2;
    }
    dp[0][0] = s[0] != 'X';
    FOR (i, 1, N) {
        F0R (j, K+1) {
            if (s[i] != 'X' && dp[i-1][j]) {
                dp[i][j] = true;
            }
//            if (j == 1 && i-c[j-1]-1 == -1 && pref[i].s == 0) {
//                dp[i][j] = true;
//            }
            if (i-c[j-1] < 0) {
                continue;
            }
            if (j != 0 && s[i] != 'X' && pref[i].s-pref[i-c[j-1]].s == 0 && ((j == 1 && i-c[j-1]-1 == -1) || dp[i-c[j-1]-1][j-1])) {
                dp[i][j] = true;
            }
        }
    }
    dp2[N][K] = 1;
    dp2[N-1][K] = 1;
    R0F (i, N-1) {
        F0R (j, K+1) {
            if (s[i] != 'X' && dp2[i+1][j]) {
                dp2[i][j] = true;
                if ((i == 0 && j == 0) || (i >= 1 && dp[i-1][j])) {
                    lazy[i].s++;
                    lazy[i+1].s--;
                }
            }
            if (i+c[j] >= N) {
                continue;
            }
            if (j != K && pref[i+c[j]].s-pref[i].s == 0 && s[i+c[j]] != 'X' && s[i] != '_' && dp2[i+c[j]+1][j+1]) {
                dp2[i][j] = true;
                if ((i == 0 && j == 0) || (i >= 1 && dp[i-1][j])) {
                    lazy[i].f++;
                    lazy[i+c[j]].f--;
                    lazy[i+c[j]].s++;
                    lazy[i+c[j]+1].s--;
                }
            }
        }
    }
    ll p1 = 0, p2 = 0;
    F0R (i, N-1) {
        p1+=lazy[i].f;
        p2+=lazy[i].s;
        if (p1 && p2) {
            res+=('?');
        } else {
            res+=(p1 ? 'X' : '_');
        }
    }
    return res;
}

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

paint.cpp: In function 'void io::setIn(std::__cxx11::string)':
paint.cpp:69:35: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
     void setIn(string s) { freopen(s.c_str(),"r",stdin); }
                            ~~~~~~~^~~~~~~~~~~~~~~~~~~~~
paint.cpp: In function 'void io::setOut(std::__cxx11::string)':
paint.cpp:70:36: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
     void setOut(string s) { freopen(s.c_str(),"w",stdout); }
                             ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~

• 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: 10 / 10