제출 #226153

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

paint

#include "paint.h"
#include <bits/stdc++.h>
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<db,db> pd; 

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

#define mp make_pair 
#define f first
#define s second
#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;
const int MX = 2e5+5; 
const ll INF = 1e18; 
const ld PI = acos((ld)-1);
const int xd[4] = {1,0,-1,0}, yd[4] = {0,1,0,-1}; 

template<class T> bool ckmin(T& a, const T& b) { 
	return b < a ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { 
	return a < b ? a = b, 1 : 0; } 
int pct(int x) { return __builtin_popcount(x); } 
int bit(int x) { return 31-__builtin_clz(x); } // floor(log2(x)) 
int cdiv(int a, int b) { return a/b+!(a<0||a%b == 0); } // division of a by b rounded up, assumes b > 0 

// INPUT
template<class A> void re(complex<A>& c);
template<class A, class B> void re(pair<A,B>& p);
template<class A> void re(vector<A>& v);
template<class A, size_t SZ> void re(array<A,SZ>& a);

template<class T> void re(T& x) { cin >> x; }
void re(db& d) { str t; re(t); d = stod(t); }
void re(ld& d) { str t; re(t); d = stold(t); }
template<class H, class... T> void re(H& h, T&... t) { re(h); re(t...); }

template<class A> void re(complex<A>& c) { A a,b; re(a,b); c = {a,b}; }
template<class A, class B> void re(pair<A,B>& p) { re(p.f,p.s); }
template<class A> void re(vector<A>& x) { trav(a,x) re(a); }
template<class A, size_t SZ> void re(array<A,SZ>& x) { trav(a,x) re(a); }

// TO_STRING
#define ts to_string
template<class A, class B> str ts(pair<A,B> p);
template<class A> str ts(complex<A> c) { return ts(mp(c.real(),c.imag())); }
str ts(bool b) { return b ? "true" : "false"; }
str ts(char c) { str s = ""; s += c; return s; }
str ts(str s) { return s; }
str ts(const char* s) { return (str)s; }
str ts(vector<bool> v) { 
	bool fst = 1; str res = "{";
	F0R(i,sz(v)) {
		if (!fst) res += ", ";
		fst = 0; res += ts(v[i]);
	}
	res += "}"; return res;
}
template<size_t SZ> str ts(bitset<SZ> b) {
	str res = ""; F0R(i,SZ) res += char('0'+b[i]);
	return res; }
template<class T> str ts(T v) {
	bool fst = 1; str res = "{";
	for (const auto& x: v) {
		if (!fst) res += ", ";
		fst = 0; res += ts(x);
	}
	res += "}"; return res;
}
template<class A, class B> str ts(pair<A,B> p) {
	return "("+ts(p.f)+", "+ts(p.s)+")"; }

// OUTPUT
template<class A> void pr(A x) { cout << ts(x); }
template<class H, class... T> void pr(const H& h, const T&... t) { 
	pr(h); pr(t...); }
void ps() { pr("\n"); } // print w/ spaces
template<class H, class... T> void ps(const H& h, const T&... t) { 
	pr(h); if (sizeof...(t)) pr(" "); ps(t...); }

// DEBUG
void DBG() { cerr << "]" << endl; }
template<class H, class... T> void DBG(H h, T... t) {
	cerr << to_string(h); if (sizeof...(t)) cerr << ", ";
	DBG(t...); }
#ifdef LOCAL // compile with -DLOCAL
#define dbg(...) cerr << "[" << #__VA_ARGS__ << "]: [", DBG(__VA_ARGS__)
#else
#define dbg(...) 42
#endif

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

mt19937 rng((uint32_t)chrono::steady_clock::now().time_since_epoch().count()); 

typedef array<array<bool, 105>, 200005> T;

vi C;
int wsum[200005];

int getwhites(int l, int r){
	assert(l <= r);
	assert(l >= 1);
	return wsum[r]-wsum[l-1];
}



pair<T, T> getdp(string s){

	T endat; //satisfy all information, jth interval ending at i
	T upto; //satisfy all information, jth interval ending at or before i

	//endat[0][0] = upto[0][0] = true;
	for(int i = 0; i < 200005; i++){
		for(int j = 0; j < 105; j++){
			endat[i][j] = upto[i][j] = 0;
		}
	}
	upto[0][0] = endat[0][0] = 1;
	for(int i = 1; i <= sz(s)-1; i++){
		endat[i][0] = endat[i-1][0];
		if(s[i] == 'X'){
			endat[i][0] = 0;
		}

		upto[i][0] = endat[i][0];
	}

	for(int i = 1; i <= sz(s)-1; i++){
		wsum[i] = wsum[i-1];
		if(s[i] == '_') wsum[i]++;
	}

	for(int i = 1; i <= sz(s)-1; i++){
		for(int j = 1; j <= sz(C)-1; j++){
			int len = C[j];
			//update endat

			if(len > i){ //range too big
				endat[i][j] = 0;
			}
			else if(getwhites(i-len+1, i) > 0){ //any _ in the range
				endat[i][j] = 0;
			}
			else if(s[i-len] == 'X'){ //if it must be black right before range
				endat[i][j] = 0;
			}
			else if(i == len){
				if(j == 1){
					endat[i][j] = 1;
				}
				else endat[i][j] = 0;
			}
			else{
				endat[i][j] = upto[i-len-1][j-1];
			}
			//update upto
			if(s[i] == 'X'){
				upto[i][j] = endat[i][j];
			}
			else{
				upto[i][j] = upto[i-1][j]|endat[i][j];
			}
		}
	}
	return mp(endat, upto);
}




string solve_puzzle(string s, vector<int> c) {
	

	string s1 = "!"+s; //1 index
	reverse(all(s));
	string s2 = "!"+s;
	reverse(all(s));


	C.pb(0); // 1 index
	for(auto u: c) C.pb(u);

	pair<T, T> a1 = getdp(s1);

	C = vector<int>(0);
	C.pb(0);
	reverse(all(c));
	for(auto u: c) C.pb(u);
	reverse(all(c));

	pair<T, T> a2 = getdp(s2);

	string ans = s;
	s = "!"+s;

	T atpos;
	array<array<int, 105>, 200005> cdp;
	for(int i = 0; i < 200005; i++){
		for(int j = 0; j < 105; j++){
			atpos[i][j] = cdp[i][j] = 0;
		}
	}

	for(int i = 1; i <= sz(s)-1; i++){
		for(int j = 1; j <= sz(c); j++){
			if(i == sz(s)-1){
				if(j != sz(c)) continue;
				atpos[i][j] = a1.f[i][j];
				continue;
			}
			if(s[i+1] == 'X'){
				atpos[i][j] = 0;
				continue;
			}
			if(a1.f[i][j] == 1 && a2.s[sz(s)-(i+2)][sz(c)-j] == 1){
				atpos[i][j] = 1;
			}
		}
	}

	for(int i = 1; i <= sz(s)-1; i++){
		for(int j = 1; j <= sz(c); j++){
			cdp[i][j] = cdp[i-1][j]+atpos[i][j];
		}
	}

	for(int i = 1; i <= sz(s)-1; i++){
		if(s[i] != '.') continue; //already determined
		bool canbeW = 0;
		bool canbeB = 0;

		for(int j = 0; j <= sz(c); j++){
			if(a1.s[i-1][j] == 1 && a2.s[sz(s)-(i+1)][sz(c)-j] == 1){
				canbeW = 1;
			}
		}

		for(int j = 1; j <= sz(c); j++){
			int len = c[j-1];
			int maxx = i+len-1;
			ckmin(maxx, sz(s)-1);
			int ex = cdp[maxx][j]-cdp[i-1][j];
			if(ex >= 1) canbeB = 1;
		}

		if(canbeW == 1 && canbeB == 1){
			ans[i-1] = '?';
		}
		else if(canbeW == 1 && canbeB == 0){
			ans[i-1] = '_';
		}
		else if(canbeW == 0 && canbeB == 1){
			ans[i-1] = 'X';
		}
		else{
			ans[i-1] = 'E';
			//assert(1 == 0); //impossible!
		}
	}

    return ans;
}

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

paint.cpp: In function 'std::__cxx11::string solve_puzzle(std::__cxx11::string, std::vector<int>)':
paint.cpp:243:28: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
    atpos[i][j] = cdp[i][j] = 0;
paint.cpp: In function 'void setIn(std::__cxx11::string)':
paint.cpp:124:31: 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 setOut(std::__cxx11::string)':
paint.cpp:125:32: 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