제출 #1204510

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1204510		PlayVoltz	Paint By Numbers (IOI16_paint)	C++20	59 / 100	0 ms	328 KiB

paint

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

string solve_puzzle(string s, vector<int> vect){
	int n=s.size(), k=vect.size();
	string ans(n, '.');
	s = '.'+s;
	vect.insert(vect.begin(), 0);
	vector<bool> cw(n+1, 0);
	vector<int> psum(n+1, 0);
	for (int i=1; i<=n; ++i)psum[i]=psum[i-1]+(s[i]=='_');
	vector<vector<int> > dp(n+1, vector<int>(k+1, 0)), dp2(n+1, vector<int>(k+1, 0));
	for (int i=0; i<=n; ++i)if (s[i]!='X')dp[i][0]=1;
	for (int i=1; i<=n; ++i)for (int j=1; j<=k; ++j){
		if (s[i]!='X'&&dp[i-1][j])dp[i][j]|=1;
		if (j==1&&vect[j]<=i&&psum[i]==psum[i-vect[j]]&&dp[i-vect[j]][j-1])dp[i][j]|=2;
		if (j!=1&&vect[j]<i&&psum[i]==psum[i-vect[j]]&&s[i-vect[j]]!='X'&&dp[i-vect[j]-1][j-1])dp[i][j]|=2;
	}
	dp2[n][k]=1;
	int mn=INT_MAX/2;
	for (int i=n; i>=1; --i){
		for (int j=0; j<=k; ++j)if (dp2[i][j]){
			if (dp[i][j]&1)dp2[i-1][j]=1, cw[i]=1;
			if (j==1&&dp[i][j]&2)dp2[i-vect[j]][j-1]=1, mn=min(mn, i-vect[j]+1);
			if (j>1&&dp[i][j]&2)dp2[i-vect[j]-1][j-1]=1, mn=min(mn, i-vect[j]+1), cw[i-vect[j]]=1;
		}
		if (cw[i]&&mn<=i)ans[i-1]='?';
		else if (cw[i])ans[i-1]='_';
		else ans[i-1]='X';
	}
	return ans;
}

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

paint.h:1:9: warning: #pragma once in main file
    1 | #pragma once
      |         ^~~~
paint_c.h:1:9: warning: #pragma once in main file
    1 | #pragma once
      |         ^~~~

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