QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#632465#9454. String of CCPCucup-team1134#AC ✓61ms4044kbC++232.1kb2024-10-12 13:26:202024-10-12 13:26:25

Judging History

你现在查看的是最新测评结果

  • [2024-10-12 13:26:25]
  • 评测
  • 测评结果:AC
  • 用时:61ms
  • 内存:4044kb
  • [2024-10-12 13:26:20]
  • 提交

answer

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return true; } return false; }
#define vi vector<int>
#define vl vector<ll>
#define vii vector<pair<int,int>>
#define vll vector<pair<ll,ll>>
#define vvi vector<vector<int>>
#define vvl vector<vector<ll>>
#define vvii vector<vector<pair<int,int>>>
#define vvll vector<vector<pair<ll,ll>>>
#define vst vector<string>
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define mkunique(x) sort(all(x));(x).erase(unique(all(x)),(x).end())
#define fi first
#define se second
#define mp make_pair
#define si(x) int(x.size())
const int mod=998244353,MAX=300005,INF=15<<26;

int main(){
    
    std::ifstream in("text.txt");
    std::cin.rdbuf(in.rdbuf());
    cin.tie(0);
    ios::sync_with_stdio(false);
    
    int Q;cin>>Q;
    while(Q--){
        int N;cin>>N;
        string S;cin>>S;
        int cn=0;
        for(int i=0;i+3<N;i++){
            if(S.substr(i,4)=="CCPC") cn++;
        }
        int ma=0;
        
        for(int p=0;p<=N;p++){
            int sa=0;
            for(int l=p-3;l<=p-1;l++){
                if(l>=0&&l+3<N&&S.substr(l,4)=="CCPC") sa--;
            }
            {
                if(p-3>=0&&S.substr(p-3,3)=="CCP") sa++;
            }
            {
                if(p-1>=0&&S.substr(p-1,1)=="C"&&p+1<N&&S.substr(p,2)=="PC") sa++;
            }
            {
                if(p+2<N&&S.substr(p,3)=="CPC") sa++;
            }
            chmax(ma,sa);
        }
        
        for(int p=0;p<=N;p++){
            int sa=0;
            for(int l=p-3;l<=p-1;l++){
                if(l>=0&&l+3<N&&S.substr(l,4)=="CCPC") sa--;
            }
            {
                if(p-2>=0&&S.substr(p-2,2)=="CC"&&p<N&&S.substr(p,1)=="C") sa++;
            }
            chmax(ma,sa);
        }
        
        cout<<cn+ma<<"\n";
    }
}



这程序好像有点Bug,我给组数据试试?

详细

Test #1:

score: 100
Accepted
time: 0ms
memory: 3616kb

input:

3
3
CCC
5
CCCCP
4
CPCP

output:

1
1
1

result:

ok 3 lines

Test #2:

score: 0
Accepted
time: 61ms
memory: 4044kb

input:

20003
5
PCCPC
10
CPPPPCPCPC
4
CPPC
11
CCPPCPPPCCP
17
PPPPCPCCCCCPCCCCC
10
PPCCPCPPCP
9
CPCCCCPPC
11
PCPPPPCCPPP
15
CPCPPPPCCPCPCCC
11
PCCPPCCPCPP
9
PCPCCPPCP
10
CCPCPPPCPP
14
CCCCPPPCPCPCPP
2
CC
12
CCPCPPPPPCPP
6
CPPPPP
12
PCCPCCCCCPCC
16
CPCCPCCPPCCCCPPC
7
CPPPCPC
16
PPPPPCCPCPCPCPPC
13
PPPCPCCCCPP...

output:

1
1
0
1
2
1
1
1
2
2
1
1
1
0
1
0
3
2
1
2
1
2
2
0
1
2
3
1
1
3
1
2
2
1
0
0
0
3
1
0
0
1
1
2
0
1
1
0
1
2
0
1
0
1
0
3
1
1
0
2
1
3
2
2
0
2
2
0
0
2
1
1
3
3
1
3
1
2
0
1
1
0
1
2
2
1
1
2
1
3
1
1
3
1
2
2
0
1
0
3
0
1
1
2
2
0
2
1
1
2
2
0
3
1
1
1
1
2
1
2
0
1
1
0
3
0
3
1
1
0
0
1
0
3
0
1
1
1
1
2
2
1
1
0
0
1
2
0
1
2
...

result:

ok 20003 lines

Extra Test:

score: 0
Extra Test Passed