제출 #268046

#제출 시각아이디문제언어결과실행 시간메모리
268046MarcoMeijerPalindromic Partitions (CEOI17_palindromic)C++14
100 / 100
746 ms97336 KiB
#include <bits/stdc++.h> using namespace std; // macros typedef long long ll; typedef unsigned long long ull; typedef long double ld; typedef pair<int, int> ii; typedef pair<ll, ll> lll; typedef tuple<int, int, int> iii; typedef vector<int> vi; typedef vector<ii> vii; typedef vector<iii> viii; typedef vector<ll> vll; typedef vector<lll> vlll; #define REP(a,b,c) for(int a=int(b); a<int(c); a++) #define RE(a,c) REP(a,0,c) #define RE1(a,c) REP(a,1,c+1) #define REI(a,b,c) REP(a,b,c+1) #define REV(a,b,c) for(int a=int(c-1); a>=int(b); a--) #define FOR(a,b) for(auto& a : b) #define all(a) a.begin(), a.end() #define INF 1e9 #define EPS 1e-9 #define pb push_back #define popb pop_back #define fi first #define se second #define sz size() mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count()); // input template<class T> void IN(T& x) {cin >> x;} template<class H, class... T> void IN(H& h, T&... t) {IN(h); IN(t...); } // output template<class T1, class T2> void OUT(const pair<T1,T2>& x); template<class T> void OUT(const T& x) {cout << x;} template<class H, class... T> void OUT(const H& h, const T&... t) {OUT(h); OUT(t...); } template<class T1, class T2> void OUT(const pair<T1,T2>& x) {OUT(x.fi,' ',x.se);} template<class... T> void OUTL(const T&... t) {OUT(t..., "\n"); } template<class H> void OUTLS(const H& h) {OUTL(h); } template<class H, class... T> void OUTLS(const H& h, const T&... t) {OUT(h,' '); OUTLS(t...); } //===================// // Added libraries // //===================// // mod library ll MOD=1e9+7; inline ll mod(ll x_) { return (x_)%MOD; } ll modpow(ll x_, ll N_) { if(N_ == 0) return 1; ll a = modpow(x_,N_/2); a = (a*a)%MOD; if(N_%2) a = (a*x_)%MOD; return a; } ll inv(ll x_) { return modpow(x_, MOD-2); } class mi { public: mi(ll v=0) {value = v;} mi operator+ (ll rs) {return mod(value+rs);} mi operator- (ll rs) {return mod(value-rs+MOD);} mi operator* (ll rs) {return mod(value*rs);} mi operator/ (ll rs) {return mod(value*inv(rs));} mi& operator+=(ll rs) {*this = (*this)+rs; return *this;} mi& operator-=(ll rs) {*this = (*this)-rs; return *this;} mi& operator*=(ll rs) {*this = (*this)*rs; return *this;} mi& operator/=(ll rs) {*this = (*this)/rs; return *this;} operator ll&() {return value;} ll value; }; typedef vector<mi> vmi; //===================// //end added libraries// //===================// void program(); int main() { ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); program(); } //===================// // begin program // //===================// const int MX = 1e6+2; int t, n; string s; mi h[256]; int getAns(int bg=0, int ed=n-1) { mi hl=0, hr=0; int l=bg, r=ed; if(r < l) return 0; if(l == r) return 1; RE(len,MX) { if(r < l) return 1; hl += h[s[l]]*modpow(2, len); hr = hr*2ll + h[s[r]]; if(hl == hr && string(s.begin()+bg,s.begin()+l+1) == string(s.begin()+r, s.begin()+ed+1)) { return 2 + getAns(l+1, r-1); } l++; r--; } return 0; } void program() { IN(t); RE(i,256) h[i] = rng()%MOD; while(t--) { IN(s); n=s.sz; OUTL(getAns()); } }

컴파일 시 표준 에러 (stderr) 메시지

palindromic.cpp: In function 'int getAns(int, int)':
palindromic.cpp:113:21: warning: array subscript has type 'char' [-Wchar-subscripts]
  113 |         hl += h[s[l]]*modpow(2, len);
      |                     ^
palindromic.cpp:114:29: warning: array subscript has type 'char' [-Wchar-subscripts]
  114 |         hr = hr*2ll + h[s[r]];
      |                             ^
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...