結果
問題 | No.2076 Concon Substrings (ConVersion) |
ユーザー | t9unkubj |
提出日時 | 2024-10-01 04:55:00 |
言語 | C++23 (gcc 12.3.0 + boost 1.83.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 5,181 bytes |
コンパイル時間 | 4,014 ms |
コンパイル使用メモリ | 266,788 KB |
実行使用メモリ | 6,824 KB |
最終ジャッジ日時 | 2024-10-01 04:55:16 |
合計ジャッジ時間 | 15,433 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
6,816 KB |
testcase_01 | AC | 2 ms
6,820 KB |
testcase_02 | AC | 2 ms
6,820 KB |
testcase_03 | AC | 2 ms
6,816 KB |
testcase_04 | AC | 2 ms
6,820 KB |
testcase_05 | AC | 2 ms
6,820 KB |
testcase_06 | AC | 2 ms
6,816 KB |
testcase_07 | AC | 2,025 ms
6,816 KB |
testcase_08 | AC | 1,291 ms
6,820 KB |
testcase_09 | AC | 2,007 ms
6,820 KB |
testcase_10 | AC | 2 ms
6,816 KB |
testcase_11 | AC | 2 ms
6,816 KB |
testcase_12 | AC | 2 ms
6,816 KB |
testcase_13 | AC | 2 ms
6,816 KB |
testcase_14 | AC | 2 ms
6,820 KB |
testcase_15 | AC | 1,507 ms
6,820 KB |
testcase_16 | AC | 375 ms
6,820 KB |
testcase_17 | AC | 210 ms
6,816 KB |
testcase_18 | AC | 1,518 ms
6,816 KB |
testcase_19 | WA | - |
testcase_20 | WA | - |
testcase_21 | AC | 2 ms
6,820 KB |
testcase_22 | WA | - |
testcase_23 | WA | - |
testcase_24 | WA | - |
testcase_25 | WA | - |
testcase_26 | WA | - |
testcase_27 | WA | - |
testcase_28 | WA | - |
testcase_29 | WA | - |
testcase_30 | WA | - |
testcase_31 | AC | 2 ms
6,816 KB |
ソースコード
#ifdef t9unkubj #include"template.h" //#include"template_no_debug.h" #else #undef _GLIBCXX_DEBUG #pragma GCC optimize("O3") #define dbg(...) 199958 using namespace std; #include<bits/stdc++.h> using uint=unsigned; using ll=long long; using ull=unsigned long long; using ld=long double; using pii=pair<int,int>; using pll=pair<ll,ll>; template<class T>using vc=vector<T>; template<class T>using vvc=vc<vc<T>>; template<class T>using vvvc=vvc<vc<T>>; using vi=vc<int>; using vvi=vc<vi>; using vvvi=vc<vvi>; using vl=vc<ll>; using vvl=vc<vl>; using vvvl=vc<vvl>; template<class T>using smpq=priority_queue<T,vector<T>,greater<T>>; template<class T>using bipq=priority_queue<T>; #define rep(i,n) for(ll i=0;i<(ll)(n);i++) #define REP(i,j,n) for(ll i=(j);i<(ll)(n);i++) #define DREP(i,n,m) for(ll i=(n);i>=(m);i--) #define drep(i,n) for(ll i=((n)-1);i>=0;i--) #define all(x) x.begin(),x.end() #define rall(x) x.rbegin(),x.rend() #define mp make_pair #define pb push_back #define eb emplace_back #define fi first #define se second #define is insert #define bg begin() #define ed end() void scan(int&a) { cin >> a; } void scan(ll&a) { cin >> a; } void scan(string&a) { cin >> a; } void scan(char&a) { cin >> a; } void scan(uint&a) { cin >> a; } void scan(ull&a) { cin >> a; } void scan(bool&a) { cin >> a; } void scan(ld&a){ cin>> a;} template<class T> void scan(vector<T>&a) { for(auto&x:a) scan(x); } void read() {} template<class Head, class... Tail> void read(Head&head, Tail&... tail) { scan(head); read(tail...); } #define INT(...) int __VA_ARGS__; read(__VA_ARGS__); #define LL(...) ll __VA_ARGS__; read(__VA_ARGS__); #define ULL(...) ull __VA_ARGS__; read(__VA_ARGS__); #define STR(...) string __VA_ARGS__; read(__VA_ARGS__); #define CHR(...) char __VA_ARGS__; read(__VA_ARGS__); #define DBL(...) double __VA_ARGS__; read(__VA_ARGS__); #define LD(...) ld __VA_ARGS__; read(__VA_ARGS__); #define VC(type, name, ...) vector<type> name(__VA_ARGS__); read(name); #define VVC(type, name, size, ...) vector<vector<type>> name(size, vector<type>(__VA_ARGS__)); read(name); void print(int a) { cout << a; } void print(ll a) { cout << a; } void print(string a) { cout << a; } void print(char a) { cout << a; } void print(uint a) { cout << a; } void print(bool a) { cout << a; } void print(ull a) { cout << a; } void print(double a) { cout << a; } void print(ld a){ cout<< a; } template<class T> void print(vector<T>a) { for(int i=0;i<(int)a.size();i++){if(i)cout<<" ";print(a[i]);}cout<<endl;} void PRT() { cout <<endl; return ; } template<class T> void PRT(T a) { print(a); cout <<endl; return; } template<class Head, class... Tail> void PRT(Head head, Tail ... tail) { print(head); cout << " "; PRT(tail...); return; } template<class T,class F> bool chmin(T &x, F y){ if(x>y){ x=y; return true; } return false; } template<class T, class F> bool chmax(T &x, F y){ if(x<y){ x=y; return true; } return false; } void YesNo(bool b){ cout<<(b?"Yes":"No")<<endl; } void Yes(){ cout<<"Yes"<<endl; } void No(){ cout<<"No"<<endl; } template<class T> int popcount(T n){ return __builtin_popcountll(n); } template<class T> T sum(vc<T>&a){ return accumulate(all(a),T(0)); } template<class T> T max(vc<T>&a){ return *max_element(all(a)); } template<class T> T min(vc<T>&a){ return *min_element(all(a)); } template<class T> void unique(vc<T>&a){ a.erase(unique(all(a)),a.end()); } vvi readgraph(int n,int m,int off = -1){ vvi g(n); rep(i, m){ int u,v; cin>>u>>v; u+=off,v+=off; g[u].push_back(v); g[v].push_back(u); } return g; } vvi readtree(int n,int off=-1){ return readgraph(n,n-1,off); } template<class T> vc<T> presum(vc<T> &a){ vc<T> ret(a.size()+1); rep(i,a.size())ret[i+1]=ret[i]+a[i]; return ret; } template<class T, class F> vc<T> &operator+=(vc<T> &a,F b){ for (auto&v:a)v += b; return a; } template<class T, class F> vc<T> &operator-=(vc<T>&a,F b){ for (auto&v:a)v-=b; return a; } template<class T, class F> vc<T> &operator*=(vc<T>&a,F b){ for (auto&v:a)v*=b; return a; } #endif double pass_time=0; void solve(){ INT(n,a,b); STR(s); string tar="con"; int idx=0; int now=0; vi ts; for(auto x:s){ if(x==tar[idx]){ idx++; if(idx==3)now++,idx=0; }else{ if(now){ ts.pb(now); } now=0; idx=0; } } if(now)ts.pb(now); int kk=sum(ts); int M=kk/a+3; vi dp(M,-1e9); dp[0]=0; for(auto&x:ts){ vi ndp=dp; rep(j,M){ if(dp[j]<0)continue; rep(k,x/a+1){ if(j+k<M)chmax(ndp[j+k],dp[j]+(x-a*k)/b); else break; } } dp=move(ndp); } dbg(dp); int ans=0; rep(i,M){ ll tt=min<ll>(i,dp[i])*2+(i>dp[i]); chmax(ans,tt); } PRT(ans); } signed main(){ cin.tie(0)->sync_with_stdio(0); pass_time=clock(); int t=1; //cin>>t; while(t--)solve(); pass_time=clock()-pass_time; dbg(pass_time/CLOCKS_PER_SEC); }