結果

問題 No.2361 Many String Compare Queries
ユーザー woodywoodywoodywoody
提出日時 2023-06-23 23:50:39
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 1,252 ms / 2,500 ms
コード長 5,672 bytes
コンパイル時間 4,335 ms
コンパイル使用メモリ 240,216 KB
実行使用メモリ 66,776 KB
最終ジャッジ日時 2024-07-01 03:38:55
合計ジャッジ時間 13,989 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,816 KB
testcase_01 AC 2 ms
6,940 KB
testcase_02 AC 2 ms
6,940 KB
testcase_03 AC 2 ms
6,940 KB
testcase_04 AC 2 ms
6,940 KB
testcase_05 AC 2 ms
6,944 KB
testcase_06 AC 2 ms
6,940 KB
testcase_07 AC 2 ms
6,944 KB
testcase_08 AC 1,252 ms
66,640 KB
testcase_09 AC 1,164 ms
66,528 KB
testcase_10 AC 1,206 ms
66,476 KB
testcase_11 AC 985 ms
66,776 KB
testcase_12 AC 1,077 ms
66,708 KB
testcase_13 AC 1,017 ms
65,940 KB
testcase_14 AC 887 ms
65,280 KB
testcase_15 AC 982 ms
64,940 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include<bits/stdc++.h>
#include<atcoder/all>
#define rep(i,b) for(int i=0;i<b;i++)
#define rrep(i,b) for(int i=b-1;i>=0;i--)
#define rep1(i,b) for(int i=1;i<b;i++)
#define repx(i,x,b) for(int i=x;i<b;i++)
#define rrepx(i,x,b) for(int i=b-1;i>=x;i--)
#define fore(i,a) for(auto& i:a)
#define rng(x) (x).begin(), (x).end()
#define rrng(x) (x).rbegin(), (x).rend()
#define sz(x) ((int)(x).size())
#define pb push_back
#define fi first
#define se second
#define pcnt __builtin_popcountll

using namespace std;
using namespace atcoder;

using ll = long long;
using ld = long double;
template<typename T> using mpq = priority_queue<T, vector<T>, greater<T>>;
template<typename T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<typename T> bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
template<typename T> ll sumv(const vector<T>&a){ll res(0);for(auto&&x:a)res+=x;return res;}
bool yn(bool a) { if(a) {cout << "Yes" << endl; return true;} else {cout << "No" << endl; return false;}}
#define dame { cout << "No" << endl; return;}
#define dame1 { cout << -1 << endl; return;}
#define cout2(x,y) cout << x << " " << y << endl;
#define coutp(p) cout << p.fi << " " << p.se << endl;
#define out cout << ans << endl;
#define outd cout << fixed << setprecision(20) << ans << endl;
#define outm cout << ans.val() << endl;
#define outv fore(yans , ans) cout << yans << "\n";
#define outdv fore(yans , ans) cout << yans.val() << "\n";
#define coutv(v) {fore(vy , v) {cout << vy << " ";} cout << endl;}
#define coutv2(v) fore(vy , v) cout << vy << "\n";
#define coutvm(v) {fore(vy , v) {cout << vy.val() << " ";} cout << endl;}
#define coutvm2(v) fore(vy , v) cout << vy.val() << "\n";
using pll = pair<ll,ll>;using pil = pair<int,ll>;using pli = pair<ll,int>;using pii = pair<int,int>;using pdd = pair<ld,ld>;
using vi = vector<int>;using vd = vector<ld>;using vl = vector<ll>;using vs = vector<string>;using vb = vector<bool>;
using vpii = vector<pii>;using vpli = vector<pli>;using vpll = vector<pll>;using vpil = vector<pil>;
using vvi = vector<vector<int>>;using vvl = vector<vector<ll>>;using vvs = vector<vector<string>>;using vvb = vector<vector<bool>>;
using vvpii = vector<vector<pii>>;using vvpli = vector<vector<pli>>;using vvpll = vector<vpll>;using vvpil = vector<vpil>;
using mint = modint998244353;
//using mint = modint1000000007;
//using mint = dynamic_modint<0>;
using vm = vector<mint>;
using vvm = vector<vector<mint>>;
vector<int> dx={1,0,-1,0,1,1,-1,-1},dy={0,1,0,-1,1,-1,1,-1};
ll gcd(ll a, ll b) { return a?gcd(b%a,a):b;}
ll lcm(ll a, ll b) { return a/gcd(a,b)*b;}
#define yes {cout <<"Yes"<<endl;}
#define yesr { cout <<"Yes"<<endl; return;}
#define no {cout <<"No"<<endl;}
#define nor { cout <<"No"<<endl; return;}
const double eps = 1e-10;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
#ifdef MY_LOCAL_DEBUG
#define show(x) cerr<<#x<<" = "<<x<<endl
#define showp(p) cerr<<#p<<" = "<<p.fi<<" : "<<p.se<<endl
#define show2(x,y) cerr<<#x<<" = "<<x<<" : "<<#y<<" = "<<y<<endl
#define show3(x,y,z) cerr<<#x<<" = "<<x<<" : "<<#y<<" = "<<y<<" : "<<#z<<" = "<<z<<endl
#define show4(x,y,z,x2) cerr<<#x<<" = "<<x<<" : "<<#y<<" = "<<y<<" : "<<#z<<" = "<<z<<" : "<<#x2<<" = "<<x2<<endl
#define test(x) cout << "test" << x << endl
#define showv(v) {fore(vy , v) {cout << vy << " ";} cout << endl;}
#define showv2(v) fore(vy , v) cout << vy << "\n";
#define showvm(v) {fore(vy , v) {cout << vy.val() << " ";} cout << endl;}
#define showvm2(v) fore(vy , v) cout << vy.val() << "\n";
#else
#define show(x)
#define showp(p)
#define show2(x,y)
#define show3(x,y,z)
#define show4(x,y,z,x2)
#define test(x)
#define showv(v)
#define showv2(v)
#define showvm(v)
#define showvm2(v)
#endif

pli op(pli a,pli b){
    return {a.fi+b.fi, a.se+b.se};
}
 
pli e(){
    return {0,0};
}
 
pli mapping(pll p,pli a){
    return {a.fi*p.fi + a.se*p.se, a.se};
}
 
pll composition(pll p,pll q){
    return {p.fi*q.fi , p.fi*q.se + p.se};
}
 
pll id(){
    return {1 , 0};
}


void solve(){
    int n,q; cin>>n>>q;
    string s; cin>>s;
    vi sa = suffix_array(s);
    vi lc = lcp_array(s,sa);
   
    vl ans(q);
    vvi qv(n);
    vi a(q),b(q);

    vi rr(n);
    rep(i,n) rr[sa[i]] = i;

    rep(i,q){
        cin>>a[i]>>b[i];
        a[i]--;
        b[i]--;
        qv[rr[a[i]]].pb(i);
        ans[i] += b[i]-a[i];
    }

    lazy_segtree<pli , op , e , pll , mapping , composition , id> ls(n),rs(n);
    lazy_segtree<pli , op , e , pll , mapping , composition , id> ls2(n),rs2(n);
    rep(i,n) ls.set(i,{0,1});
    rep(i,n) ls2.set(i,{0,1});
    rep(i,n) rs.set(i,{0,1});
    rep(i,n) rs2.set(i,{0,1});
    rep1(i,n){
        int k = lc[i-1];
        ll sum1 = ls.prod(k,n).fi;
        ll sumV = ls2.prod(k,n).fi;
        ls.apply(k,n,{0,0});
        ls2.apply(k,n,{0,0});
        sum1++;
        sumV+=(n-sa[i-1]);
        ls.set(k,{sum1,1});
        ls2.set(k,{sumV,1});
        fore(y , qv[i]){
            int l = b[y]-a[y]+1;
            ans[y] += ls2.prod(0,l).fi;
            ans[y] += ls.prod(l,n).fi*(l-1);
        }
    }
    rrep(i,n-1){
        int k = lc[i];
        ll sum1 = rs.prod(k,n).fi;
        ll sumV = sum1*k;
        rs.apply(k,n,{0,0});
        rs2.apply(k,n,{0,0});
        sum1++;
        sumV+=k;
        rs.set(k,{sum1,1});
        rs2.set(k,{sumV,1});
        fore(y , qv[i]){
            int l = b[y]-a[y]+1;
            ans[y] += rs2.prod(0,l).fi;
            ans[y] += rs.prod(l,n).fi*(l-1);
        }
    }
    outv;

    return;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);

    int t = 1;
    //cin>>t;

    rep(i,t){
        solve();
    }

    return 0;
}
0