結果
| 問題 | No.3000 Optimal Run Length Encoding |
| ユーザー |
👑  tute7627
|
| 提出日時 | 2024-12-25 01:25:30 |
| 言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 4,732 ms / 10,000 ms |
| コード長 | 14,737 bytes |
| コンパイル時間 | 3,571 ms |
| コンパイル使用メモリ | 243,116 KB |
| 最終ジャッジ日時 | 2025-02-26 16:32:19 |
|
ジャッジサーバーID （参考情報） |
judge2 / judge2 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 1 |
| other | AC * 142 |
ソースコード
//#define _GLIBCXX_DEBUG//#pragma GCC target("avx2")//#pragma GCC optimize("O3")//#pragma GCC optimize("unroll-loops")#include<bits/stdc++.h>using namespace std;#ifdef LOCAL#include <debug_print.hpp>#define OUT(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)#else#define OUT(...) (static_cast<void>(0))#endif#define endl '\n'#define lfs cout<<fixed<<setprecision(15)#define ALL(a) (a).begin(),(a).end()#define ALLR(a) (a).rbegin(),(a).rend()#define UNIQUE(a) (a).erase(unique((a).begin(),(a).end()),(a).end())#define spa << " " <<#define fi first#define se second#define MP make_pair#define MT make_tuple#define PB push_back#define EB emplace_back#define rep(i,n,m) for(ll i = (n); i < (ll)(m); i++)#define rrep(i,n,m) for(ll i = (ll)(m) - 1; i >= (ll)(n); i--)namespace template_tute{using ll = long long;using ld = long double;const ll MOD1 = 1e9+7;const ll MOD9 = 998244353;const ll INF = 4.1e18;using P = pair<ll, ll>;template<typename T> using PQ = priority_queue<T>;template<typename T> using QP = priority_queue<T,vector<T>,greater<T>>;template<typename T1, typename T2>bool chmin(T1 &a,T2 b){if(a>b){a=b;return true;}else return false;}template<typename T1, typename T2>bool chmax(T1 &a,T2 b){if(a<b){a=b;return true;}else return false;}ll median(ll a,ll b, ll c){return a+b+c-max<ll>({a,b,c})-min<ll>({a,b,c});}void ans1(bool x){if(x) cout<<"Yes"<<endl;else cout<<"No"<<endl;}void ans2(bool x){if(x) cout<<"YES"<<endl;else cout<<"NO"<<endl;}void ans3(bool x){if(x) cout<<"Yay!"<<endl;else cout<<":("<<endl;}template<typename T1,typename T2>void ans(bool x,T1 y,T2 z){if(x)cout<<y<<endl;else cout<<z<<endl;}template<typename T1,typename T2,typename T3>void anss(T1 x,T2 y,T3 z){ans(x!=y,x,z);};template<typename T>void debug(const T &v,ll h,ll w,string sv=" "){for(ll i=0;i<h;i++){cout<<v[i][0];for(ll j=1;j<w;j++)cout<<sv<<v[i][j];cout<<endl;}};template<typename T>void debug(const T &v,ll n,string sv=" "){if(n!=0)cout<<v[0];for(ll i=1;i<n;i++)cout<<sv<<v[i];cout<<endl;};template<typename T>void debug(const vector<T>&v){debug(v,v.size());}template<typename T>void debug(const vector<vector<T>>&v){for(auto &vv:v)debug(vv,vv.size());}template<typename T>void debug(stack<T> st){while(!st.empty()){cout<<st.top()<<" ";st.pop();}cout<<endl;}template<typename T>void debug(queue<T> st){while(!st.empty()){cout<<st.front()<<" ";st.pop();}cout<<endl;}template<typename T>void debug(deque<T> st){while(!st.empty()){cout<<st.front()<<" ";st.pop_front();}cout<<endl;}template<typename T>void debug(PQ<T> st){while(!st.empty()){cout<<st.top()<<" ";st.pop();}cout<<endl;}template<typename T>void debug(QP<T> st){while(!st.empty()){cout<<st.top()<<" ";st.pop();}cout<<endl;}template<typename T>void debug(const set<T>&v){for(auto z:v)cout<<z<<" ";cout<<endl;}template<typename T>void debug(const multiset<T>&v){for(auto z:v)cout<<z<<" ";cout<<endl;}template<typename T,size_t size>void debug(const array<T, size> &a){for(auto z:a)cout<<z<<" ";cout<<endl;}template<typename T,typename V>void debug(const map<T,V>&v){for(auto z:v)cout<<"["<<z.first<<"]="<<z.second<<",";cout<<endl;}template<typename T>vector<vector<T>>vec(ll x, ll y, T w){vector<vector<T>>v(x,vector<T>(y,w));return v;}vector<ll>dx={1,-1,0,0,1,1,-1,-1};vector<ll>dy={0,0,1,-1,1,-1,1,-1};template<typename T>vector<T> make_v(size_t a,T b){return vector<T>(a,b);}template<typename... Ts>auto make_v(size_t a,Ts... ts){return vector<decltype(make_v(ts...))>(a,make_v(ts...));}template<typename T1, typename T2>ostream &operator<<(ostream &os, const pair<T1, T2>&p){return os << "(" << p.first << "," << p.second << ")";}template<typename T>ostream &operator<<(ostream &os, const vector<T> &v){os<<"[";for(auto &z:v)os << z << ",";os<<"]"; return os;}template<typename T>void rearrange(vector<int>&ord, vector<T>&v){auto tmp = v;for(int i=0;i<tmp.size();i++)v[i] = tmp[ord[i]];}template<typename Head, typename... Tail>void rearrange(vector<int>&ord,Head&& head, Tail&&... tail){rearrange(ord, head);rearrange(ord, tail...);}template<typename T> vector<int> ascend(const vector<T>&v){vector<int>ord(v.size());iota(ord.begin(),ord.end(),0);sort(ord.begin(),ord.end(),[&](int i,int j){return make_pair(v[i],i)<make_pair(v[j],j);});return ord;}template<typename T> vector<int> descend(const vector<T>&v){vector<int>ord(v.size());iota(ord.begin(),ord.end(),0);sort(ord.begin(),ord.end(),[&](int i,int j){return make_pair(v[i],-i)>make_pair(v[j],-j);});return ord;}template<typename T> vector<T> inv_perm(const vector<T>&ord){vector<T>inv(ord.size());for(int i=0;i<ord.size();i++)inv[ord[i]] = i;return inv;}ll FLOOR(ll n,ll div){assert(div>0);return n>=0?n/div:(n-div+1)/div;}ll CEIL(ll n,ll div){assert(div>0);return n>=0?(n+div-1)/div:n/div;}ll digitsum(ll n){ll ret=0;while(n){ret+=n%10;n/=10;}return ret;}ll modulo(ll n,ll d){return (n%d+d)%d;};template<typename T>T min(const vector<T>&v){return *min_element(v.begin(),v.end());}template<typename T>T max(const vector<T>&v){return *max_element(v.begin(),v.end());}template<typename T>T acc(const vector<T>&v){return accumulate(v.begin(),v.end(),T(0));};template<typename T>T reverse(const T &v){return T(v.rbegin(),v.rend());};//mt19937 mt(chrono::steady_clock::now().time_since_epoch().count());int popcount(ll x){return __builtin_popcountll(x);};int poplow(ll x){return __builtin_ctzll(x);};int pophigh(ll x){return 63 - __builtin_clzll(x);};template<typename T>T poll(queue<T> &q){auto ret=q.front();q.pop();return ret;};template<typename T>T poll(priority_queue<T> &q){auto ret=q.top();q.pop();return ret;};template<typename T>T poll(QP<T> &q){auto ret=q.top();q.pop();return ret;};template<typename T>T poll(stack<T> &s){auto ret=s.top();s.pop();return ret;};ll MULT(ll x,ll y){if(LLONG_MAX/x<=y)return LLONG_MAX;return x*y;}ll POW2(ll x, ll k){ll ret=1,mul=x;while(k){if(mul==LLONG_MAX)return LLONG_MAX;if(k&1)ret=MULT(ret,mul);mul=MULT(mul,mul);k>>=1;}return ret;}ll POW(ll x, ll k){ll ret=1;for(int i=0;i<k;i++){if(LLONG_MAX/x<=ret)return LLONG_MAX;ret*=x;}return ret;}std::ostream &operator<<(std::ostream &dest, __int128_t value) {std::ostream::sentry s(dest);if (s) {__uint128_t tmp = value < 0 ? -value : value;char buffer[128];char *d = std::end(buffer);do {--d;*d = "0123456789"[tmp % 10];tmp /= 10;} while (tmp != 0);if (value < 0) {--d;*d = '-';}int len = std::end(buffer) - d;if (dest.rdbuf()->sputn(d, len) != len) {dest.setstate(std::ios_base::badbit);}}return dest;}namespace converter{int dict[500];const string lower="abcdefghijklmnopqrstuvwxyz";const string upper="ABCDEFGHIJKLMNOPQRSTUVWXYZ";const string digit="0123456789";const string digit1="123456789";void regi_str(const string &t){for(int i=0;i<t.size();i++){dict[t[i]]=i;}}void regi_int(const string &t){for(int i=0;i<t.size();i++){dict[i]=t[i];}}vector<int>to_int(const string &s,const string &t){regi_str(t);vector<int>ret(s.size());for(int i=0;i<s.size();i++){ret[i]=dict[s[i]];}return ret;}vector<int>to_int(const string &s){auto t=s;sort(t.begin(),t.end());t.erase(unique(t.begin(),t.end()),t.end());return to_int(s,t);}vector<vector<int>>to_int(const vector<string>&s,const string &t){regi_str(t);vector<vector<int>>ret(s.size(),vector<int>(s[0].size()));for(int i=0;i<s.size();i++){for(int j=0;j<s[0].size();j++){ret[i][j]=dict[s[i][j]];}}return ret;}vector<vector<int>>to_int(const vector<string>&s){string t;for(int i=0;i<s.size();i++){t+=s[i];}sort(t.begin(),t.end());t.erase(unique(t.begin(),t.end()),t.end());return to_int(s,t);}string to_str(const vector<int>&s,const string &t){regi_int(t);string ret;for(auto z:s)ret+=dict[z];return ret;}vector<string> to_str(const vector<vector<int>>&s,const string &t){regi_int(t);vector<string>ret(s.size());for(int i=0;i<s.size();i++){for(auto z:s[i])ret[i]+=dict[z];}return ret;}}template< typename T = int >struct edge {int to;T cost;int id;edge():to(-1),id(-1){};edge(int to, T cost = 1, int id = -1):to(to), cost(cost), id(id){}operator int() const { return to; }};template<typename T>using Graph = vector<vector<edge<T>>>;template<typename T>Graph<T>revgraph(const Graph<T> &g){Graph<T>ret(g.size());for(int i=0;i<g.size();i++){for(auto e:g[i]){int to = e.to;e.to = i;ret[to].push_back(e);}}return ret;}template<typename T>Graph<T> readGraph(int n,int m,int indexed=1,bool directed=false,bool weighted=false){Graph<T> ret(n);for(int es = 0; es < m; es++){int u,v;T w=1;cin>>u>>v;u-=indexed,v-=indexed;if(weighted)cin>>w;ret[u].emplace_back(v,w,es);if(!directed)ret[v].emplace_back(u,w,es);}return ret;}template<typename T>Graph<T> readParent(int n,int indexed=1,bool directed=true){Graph<T>ret(n);for(int i=1;i<n;i++){int p;cin>>p;p-=indexed;ret[p].emplace_back(i);if(!directed)ret[i].emplace_back(p);}return ret;}}using namespace template_tute;namespace Run{template <class T> std::vector<int> z_algorithm(const std::vector<T>& s) {int n = int(s.size());if (n == 0) return {};std::vector<int> z(n);z[0] = 0;for (int i = 1, j = 0; i < n; i++) {int& k = z[i];k = (j + z[j] <= i) ? 0 : std::min(j + z[j] - i, z[i - j]);while (i + k < n && s[k] == s[i + k]) k++;if (j + z[j] < i + z[i]) j = i;}z[0] = n;return z;}std::vector<int> z_algorithm(const std::string& s) {int n = int(s.size());std::vector<int> s2(n);for (int i = 0; i < n; i++) {s2[i] = s[i];}return z_algorithm(s2);}//period, l, rtemplate<typename T>vector<tuple<int,int,int>>enumerate(const vector<T> &v){vector<tuple<int,int,int>>ret;int n = v.size();;auto dfs=[&](auto &&self,int l,int r)->void {if(r-l<=1)return;int m=(l+r)/2;self(self,l,m);self(self,m,r);vector<T>sr(v.begin()+m,v.begin()+r);sr.insert(sr.end(),v.begin()+l,v.begin()+r);vector<T>sl(v.rbegin()+n-m,v.rbegin()+n-l);sl.insert(sl.end(),v.rbegin()+n-r,v.rbegin()+n-l);auto zsr=z_algorithm(sr);auto zsl=z_algorithm(sl);for(int t=1;t<=m-l;t++){int ml=max(l,m-t-zsl[t]);int mr=min(r,m+zsr[r-l-t]);if(mr-ml>=2*t&&(ml==0||v[ml-1]!=v[ml+t-1])&&(mr==v.size()||v[mr]!=v[mr-t])){ret.emplace_back(ml,mr,t);}}for(int t=1;t<=r-m;t++){int ml=max(l,m-zsl[r-l-t]);int mr=min(r,m+t+zsr[t]);if(mr-ml>=2*t&&(ml==0||v[ml-1]!=v[ml+t-1])&&(mr==v.size()||v[mr]!=v[mr-t])){ret.emplace_back(ml,mr,t);}}};dfs(dfs,0,v.size());sort(ret.begin(),ret.end());vector<tuple<int,int,int>>nret;int pl=-1, pr=-1;for(auto [l,r,t]:ret){if(l==pl&&r==pr)continue;pl=l,pr=r;nret.emplace_back(t,l,r);}return nret;}vector<tuple<int,int,int>>enumerate(const string &s){return enumerate(vector<char>(s.begin(),s.end()));}}template<typename T>vector<ll>KMP(const T &v){vector<ll>ret(v.size()+1);ret[0]=-1;int j=-1;for(int i=0;i<v.size();i++){while(j>=0&&v[i]!=v[j])j=ret[j];j++;ret[i+1]=j;}return ret;}int solve(string s){ll n=s.size();vector<ll>dp(n+1,INF);dp[0]=0;rep(i,0,n){rep(d,1,n+1){rep(j,i,n){if(j-d>=i&&s[j]!=s[j-d])break;if((j+1-i)%d==0)chmin(dp[j+1],dp[i]+d+to_string((j+1-i)/d).size());}}}OUT(dp);return dp[n];}void solve(){ll res=0,buf=0;bool judge = true;string s;cin>>s;int n=s.size();auto run=Run::enumerate(s);vector<int>pre(n+1,-1);vector<int>p,l,r;for(auto [px,lx,rx]:run){p.PB(px);l.PB(lx);r.PB(rx);}int m=p.size();vector<vector<int>>gl(n+1);rep(i,0,m)gl[l[i]].PB(i);vector<int>runs;vector<int>ten={10,100,1000,10000,100000,1000000};vector<vector<array<pair<int,int>,6>>>dp;const int inf=1e9;// rep(i,0,m){// dp[i].assign(p[i],{});// rep(j,0,p[i]){// rep(o,0,6){// dp[i][j][o]={inf,inf};// }// }// }vector<int>mi(n+1,inf);mi[0]=0;int last=0;rep(i,0,n+1){if(i>0){if(chmin(mi[i],i-last+mi[last]+1)){pre[i]=last;}}int zi=0;for(auto z:runs){int t=i%p[z];rrep(j,0,6){if(dp[zi][t][j].fi==inf)continue;int cnt=(i+dp[zi][t][j].se)/p[z];if(cnt>=ten[j]){dp[zi][t][j].fi++;chmin(dp[zi][t][j+1],dp[zi][t][j]);dp[zi][t][j]={inf,inf};}}rep(j,0,6){if(chmin(mi[i],dp[zi][t][j].fi)){pre[i]=-dp[zi][t][j].se;}}zi++;}rrep(j,0,runs.size()){if(r[runs[j]]==i){runs.erase(runs.begin()+j);dp.erase(dp.begin()+j);}}for(auto z:gl[i]){runs.PB(z);dp.EB(p[z],array<pair<int,int>,6>());rep(j,0,p[z]){rep(o,0,6){dp[dp.size()-1][j][o]={inf,inf};}}}zi=0;for(auto z:runs){int t=i%p[z];chmin(dp[zi][t][0],pair<int,int>(mi[i]+p[z]+1,-i));zi++;}if(i-last+mi[last]>mi[i]){last=i;}//OUT(i,dp);}//cout<<mi[n]<<endl;OUT(mi);//assert(mi[n]==solve(s));int pos=n;vector<string>ret;//OUT(pre,mi);while(pos!=0){int nxt=pre[pos];string x=s.substr(nxt,pos-nxt);auto kmp=KMP(x);auto p=pos-nxt-kmp.back();if((pos-nxt)%p!=0)p=pos-nxt;ret.PB(x.substr(0,p)+to_string((pos-nxt)/p));pos=nxt;}reverse(ALL(ret));string all;for(auto z:ret)all+=z;assert(all.size()==mi[n]);cout<<all<<endl;}int main(){cin.tie(nullptr);ios_base::sync_with_stdio(false);ll res=0,buf=0;bool judge = true;int T = 1;cin>>T;while(T--){solve();}return 0;}