QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #602083 | #8776. Not Another Constructive! | ucup-team3691 | Compile Error | / | / | C++20 | 2.6kb | 2024-09-30 19:06:26 | 2024-09-30 19:06:27 |
Judging History
answer
#include <iostream>
#include <queue>
#include <stack>
#include <vector>
#include <deque>
#include <set>
#include <map>
#include <unordered_map>
#include <cassert>
#include <algorithm>
#include <cmath>
#include <random>
#include <ctime>
#include <cstdlib>
#include <chrono>
using namespace std;
void solve() {
int n, k;
cin >> n >> k;
string s;
cin >> s;
vector<vector<vector<bitset<2500>>>> dp(n + 1, (vector<vector<bitset<2500>>> (n + 1, vector<bitset<2500>>(n + 1))));
int tc = count(s.begin(), s.end(), 'C');
int tf = count(s.begin(), s.end(), '?');
for (int i = tc; i <= tc + tf; ++i) {
dp[0][0][i] = 1;
}
s = " " + s;
for (int i = 1; i <= n; ++i) {
bool nac = false;
if (s[i] == 'C' || s[i] == '?') {
nac = true;
for (int nn = 0; nn <= i; ++nn) {
for (int nc = 0; nc <= n - i; ++nc) {
dp[i][nn][nc] |= dp[i - 1][nn][nc + 1];
}
}
}
if (s[i] == 'N' || s[i] == '?') {
nac = true;
for (int nn = 0; nn < i; ++nn) {
for (int nc = 0; nc <= n - i; ++nc) {
dp[i][nn + 1][nc] |= dp[i - 1][nn][nc];
}
}
}
if (s[i] == 'A' || s[i] == '?') {
for (int nn = 0; nn <= i; ++nn) {
for (int nc = 0; nc <= n - i; ++nc) {
dp[i][nn][nc] |= dp[i - 1][nn][nc] << (nn * nc);
}
}
}
if (!nac || s[i] == '?') {
for (int nn = 0; nn <= i; ++nn) {
for (int nc = 0; nc <= n - i; ++nc) {
dp[i][nn][nc] |= dp[i - 1][nn][nc];
}
}
}
}
string ans;
for (int nn = 0; nn <= n; ++nn) {
if (dp[n][nn][0].test(k)) {
int i = n;
int nc = 0;
while (i > 0) {
char ch;
if (s[i] == 'N' || (s[i] == '?' && nn > 0 && dp[i - 1][nn - 1][nc].test(k))) {
ch = 'N';
nn -= 1;
} else if (s[i] == 'C' || (s[i] == '?' && nc + 1 <= n && dp[i - 1][nn][nc + 1].test(k))) {
ch = 'C';
nc += 1;
} else if (s[i] == 'A' || (s[i] == '?' && nn * nc <= k && dp[i - 1][nn][nc].test(k - nn * nc))) {
ch = 'A';
k -= nn * nc;
} else {
ch = s[i];
if (s[i] == '?')
s[i] = 'X';
}
ans.push_back(ch);
--i;
}
reverse(ans.begin(), ans.end());
cout << ans << "\n";
return;
}
}
cout << "-1\n";
}
int main() {
ios::sync_with_stdio(false);
cin.tie(NULL);
int t = 1;
while (t--)
solve();
return 0;
}
详细
answer.code: In function ‘void solve()’:
answer.code:26:24: error: ‘bitset’ was not declared in this scope
26 | vector<vector<vector<bitset<2500>>>> dp(n + 1, (vector<vector<bitset<2500>>> (n + 1, vector<bitset<2500>>(n + 1))));
| ^~~~~~
answer.code:16:1: note: ‘std::bitset’ is defined in header ‘<bitset>’; did you forget to ‘#include <bitset>’?
15 | #include <chrono>
+++ |+#include <bitset>
16 |
answer.code:26:35: error: template argument 1 is invalid
26 | vector<vector<vector<bitset<2500>>>> dp(n + 1, (vector<vector<bitset<2500>>> (n + 1, vector<bitset<2500>>(n + 1))));
| ^~
answer.code:26:35: error: template argument 2 is invalid
answer.code:26:17: error: template argument 1 is invalid
26 | vector<vector<vector<bitset<2500>>>> dp(n + 1, (vector<vector<bitset<2500>>> (n + 1, vector<bitset<2500>>(n + 1))));
| ^~~~~~~~~~~~~~~~~~~~
answer.code:26:17: error: template argument 2 is invalid
answer.code:26:37: error: template argument 1 is invalid
26 | vector<vector<vector<bitset<2500>>>> dp(n + 1, (vector<vector<bitset<2500>>> (n + 1, vector<bitset<2500>>(n + 1))));
| ^~
answer.code:26:37: error: template argument 2 is invalid
answer.code:26:72: error: template argument 1 is invalid
26 | vector<vector<vector<bitset<2500>>>> dp(n + 1, (vector<vector<bitset<2500>>> (n + 1, vector<bitset<2500>>(n + 1))));
| ^~~~
answer.code:26:72: error: template argument 2 is invalid
answer.code:26:76: error: template argument 1 is invalid
26 | vector<vector<vector<bitset<2500>>>> dp(n + 1, (vector<vector<bitset<2500>>> (n + 1, vector<bitset<2500>>(n + 1))));
| ^~
answer.code:26:76: error: template argument 2 is invalid
answer.code:26:102: error: template argument 1 is invalid
26 | vector<vector<vector<bitset<2500>>>> dp(n + 1, (vector<vector<bitset<2500>>> (n + 1, vector<bitset<2500>>(n + 1))));
| ^~~~
answer.code:26:102: error: template argument 2 is invalid
answer.code:26:117: error: expression list treated as compound expression in initializer [-fpermissive]
26 | vector<vector<vector<bitset<2500>>>> dp(n + 1, (vector<vector<bitset<2500>>> (n + 1, vector<bitset<2500>>(n + 1))));
| ^
answer.code:32:7: error: invalid types ‘int[int]’ for array subscript
32 | dp[0][0][i] = 1;
| ^
answer.code:42:13: error: invalid types ‘int[int]’ for array subscript
42 | dp[i][nn][nc] |= dp[i - 1][nn][nc + 1];
| ^
answer.code:42:30: error: invalid types ‘int[int]’ for array subscript
42 | dp[i][nn][nc] |= dp[i - 1][nn][nc + 1];
| ^
answer.code:51:13: error: invalid types ‘int[int]’ for array subscript
51 | dp[i][nn + 1][nc] |= dp[i - 1][nn][nc];
| ^
answer.code:51:34: error: invalid types ‘int[int]’ for array subscript
51 | dp[i][nn + 1][nc] |= dp[i - 1][nn][nc];
| ^
answer.code:59:13: error: invalid types ‘int[int]’ for array subscript
59 | dp[i][nn][nc] |= dp[i - 1][nn][nc] << (nn * nc);
| ^
answer.code:59:30: error: invalid types ‘int[int]’ for array subscript
59 | dp[i][nn][nc] |= dp[i - 1][nn][nc] << (nn * nc);
| ^
answer.code:67:13: error: invalid types ‘int[int]’ for array subscript
67 | dp[i][nn][nc] |= dp[i - 1][nn][nc];
| ^
answer.code:67:30: error: invalid types ‘int[int]’ for array subscript
67 | dp[i][nn][nc] |= dp[i - 1][nn][nc];
| ^
answer.code:75:11: error: invalid types ‘int[int]’ for array subscript
75 | if (dp[n][nn][0].test(k)) {
| ^
answer.code:81:56: error: invalid types ‘int[int]’ for array subscript
81 | if (s[i] == 'N' || (s[i] == '?' && nn > 0 && dp[i - 1][nn - 1][nc].test(k))) {
| ^
answer.code:84:68: error: invalid types ‘int[int]’ for array subscript
84 | } else if (s[i] == 'C' || (s[i] == '?' && nc + 1 <= n && dp[i - 1][nn][nc + 1].test(k))) {
| ^
answer.code:87:69: error: invalid types ‘int[int]’ for array subscript
87 | } else if (s[i] == 'A' || (s[i] == '?' && nn * nc <= k && dp[i - 1][nn][nc].test(k - nn * nc))) {
| ^