QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#455937 | #8521. Pattern Search II | USP_USP_USP | WA | 0ms | 3876kb | C++20 | 2.0kb | 2024-06-27 02:32:08 | 2024-06-27 02:32:08 |
Judging History
answer
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define int long long
void dbg_out() { cerr << endl; }
template <typename H, typename... T>
void dbg_out(H h, T... t) { cerr << ' ' << h; dbg_out(t...); }
#define dbg(...) { cerr << #__VA_ARGS__ << ':'; dbg_out(__VA_ARGS__); }
using ll = long long;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
const int MAXN = 2e5 + 5;
const int MOD = 1e9+7; //998244353;
const int INF = 0x3f3f3f3f;
const ll INF64 = ll(4e18) + 5;
int dp[MAXN][2][2];
void solve(){
string s;
cin >> s;
int n = s.size();
for(int i = 1; i <= n; i++){
for(int j = 0; j < 2; j++){
for(int k = 0; k < 2; k++){
dp[i][j][k] = INF;
}
}
}
for(int i = 0; i < n; i++){
for(int j = 0; j < 2; j++){
for(int k = 0; k < 2; k++){
for(int w = 0; w < 2; w++){
if(j == k && k == w) continue;
if(k == 1 && w == 1){
continue;
}
if(j == 1 && k == 1){
continue;
}
if(i == 0 && s[0] == 'b'){
dp[1][k][w] = min(dp[1][k][w],1ll);
}
string pat;
if(w == 0){
pat = "aab";
}else{
pat = "ab";
}
int nx = i;
int sz = pat.size();
int cnt = 0;
for(auto c : pat){
cnt++;
if(nx < n && s[nx] == c){
nx++;
}
if(nx == n){
dp[nx][k][w] = min(dp[nx][k][w],dp[i][j][k]+cnt);
}
}
dp[nx][k][w] = min(dp[nx][k][w],dp[i][j][k]+sz);
}
}
}
}
int ans = INF;
for(int i = 0; i < 2; i++){
for(int j = 0; j < 2; j++){
ans = min(ans,dp[n][i][j]);
}
}
cout << ans << '\n';
}
signed main(){
ios::sync_with_stdio(false); cin.tie(NULL);
int t = 1;
//cin >> t;
while(t--){
solve();
}
return 0;
}
/*
Makefile:
CXXFLAGS=-Wall -Wextra -Wshadow -g -pedantic -fsanitize=address,undefined -D_GLIBCXX_DEBUG -D_GLIBCXX_DEBUGPEDANTIC -std=gnu++17
*/
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 3704kb
input:
aabbaab
output:
8
result:
ok 1 number(s): "8"
Test #2:
score: 0
Accepted
time: 0ms
memory: 3876kb
input:
a
output:
1
result:
ok 1 number(s): "1"
Test #3:
score: 0
Accepted
time: 0ms
memory: 3564kb
input:
b
output:
1
result:
ok 1 number(s): "1"
Test #4:
score: 0
Accepted
time: 0ms
memory: 3628kb
input:
aa
output:
2
result:
ok 1 number(s): "2"
Test #5:
score: 0
Accepted
time: 0ms
memory: 3628kb
input:
bb
output:
3
result:
ok 1 number(s): "3"
Test #6:
score: 0
Accepted
time: 0ms
memory: 3828kb
input:
ab
output:
2
result:
ok 1 number(s): "2"
Test #7:
score: 0
Accepted
time: 0ms
memory: 3688kb
input:
ba
output:
2
result:
ok 1 number(s): "2"
Test #8:
score: 0
Accepted
time: 0ms
memory: 3576kb
input:
bbba
output:
7
result:
ok 1 number(s): "7"
Test #9:
score: 0
Accepted
time: 0ms
memory: 3832kb
input:
abbbbbbbab
output:
20
result:
ok 1 number(s): "20"
Test #10:
score: -100
Wrong Answer
time: 0ms
memory: 3564kb
input:
abbbbabbbabbbabbabaabbabb
output:
42
result:
wrong answer 1st numbers differ - expected: '43', found: '42'