oj.uz

답안 #23147

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
23147 2017-05-03T15:04:23 Z ainta New Ocurrences (KRIII5_NO) C++14
7 / 7
 436 ms 8024 KB 
#include<cstdio>
#include<algorithm>
#include<vector>
using namespace std;
char p[101000];
int n, C[101000], ord1[101000], ord2[101000], SA[101000], LCP[101000], Rank[101000];
struct AA{
    int a, b;
}w[101000];
void Make_SA(){
    int i, M = max(200,n), L = 1;
    for(i=0;i<n;i++)w[i].a = p[i], w[i].b = p[i+1];
    while(1){
        for(i=0;i<=M;i++)C[i]=0;
        for(i=0;i<n;i++)C[w[i].b]++;
        for(i=1;i<=M;i++)C[i]+=C[i-1];
        for(i=0;i<n;i++)ord1[--C[w[i].b]] = i;
        for(i=0;i<=M;i++)C[i]=0;
        for(i=0;i<n;i++)C[w[i].a]++;
        for(i=1;i<=M;i++)C[i]+=C[i-1];
        for(i=n-1;i>=0;i--)ord2[--C[w[ord1[i]].a]] = ord1[i];
        int cnt = 0;
        for(i=0;i<n;i++){
            if(i==0||w[ord2[i]].a!=w[ord2[i-1]].a||w[ord2[i]].b!=w[ord2[i-1]].b)cnt++;
            Rank[ord2[i]] = cnt;
        }
        if(cnt == n)break;
        L<<=1;
        for(i=0;i<n;i++){
            w[i].a=Rank[i];
            if(i+L>=n)w[i].b=0;
            else w[i].b=Rank[i+L];
        }
    }
    for(i=0;i<n;i++)SA[Rank[i]] = i;
    int t = 0, x, y;
    for(i=0;i<n;i++){
        if(t)t--;
        x = Rank[i];
        if(x==n)continue;
        y = SA[x+1];
        while(p[i+t]==p[y+t])t++;
        LCP[x] = t;
    }
}
int P[101000];
struct point{
    int x, num;
    bool operator<(const point &p)const{
        return x<p.x;
    }
};
long long BIT[101000], Res[101000];
void Add(int a, int b){
    a++;
    while(a<=n){
        BIT[a] += b;
        a+=(a&-a);
    }
}
long long Sum(int a){
    a++;
    long long r = 0;
    while(a){
        r+=BIT[a];
        a-=(a&-a);
    }
    return r;
}
void Pro(vector<point> &A, vector<point>&B){
    int i, pv = 0, sz = B.size(), c = 0;
    long long s = 0;
    for(i=0;i<A.size();i++){
        while(pv != sz && B[pv].x <= A[i].x){
            Add(B[pv].num, B[pv].x);
            s += B[pv].x;
            pv++;
        }
        Res[A[i].num] += s - Sum(A[i].num);
    }
    for(i=0;i<pv;i++)Add(B[i].num,-B[i].x);
    pv = sz-1;
    for(i=A.size()-1;i>=0;i--){
        while(pv >= 0 && B[pv].x > A[i].x){
            Add(B[pv].num, 1);
            c++;
            pv--;
        }
        Res[A[i].num] += (c - Sum(A[i].num))*A[i].x;
    }
    for(i=pv+1;i<sz;i++)Add(B[i].num,-1);
}
void Do(int b, int e){
    if(b==e)return;
    int i;
    int m = (b+e)>>1;
    Do(b,m);
    Do(m+1,e);
    int t = n;
    for(i=m+1;i<=e;i++){
        t = min(t, LCP[i-1]);
        P[i] = t;
    }
    t = n;
    for(i=m;i>=b;i--){
        t = min(t, LCP[i]);
        P[i] = t;
    }
    vector<point>A, B;
    for(i=b;i<=m;i++)A.push_back({P[i],SA[i]});
    for(i=m+1;i<=e;i++)B.push_back({P[i],SA[i]});
    sort(A.begin(), A.end());
    sort(B.begin(), B.end());
    Pro(A,B);
    Pro(B,A);
}
int main(){
    int i;
    scanf("%s",p);
    for(i=0;p[i];i++);
    n = i;
    for(i=0;i<n/2;i++)swap(p[i],p[n-i-1]);
    Make_SA();
    Do(1,n);
    long long s = 0;
    for(i=1;i<=n;i++){
        s += Res[n-i]*2+i;
        printf("%lld\n",s);
    }
}

Compilation message

NO.cpp: In function 'void Pro(std::vector<point>&, std::vector<point>&)':
NO.cpp:73:14: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(i=0;i<A.size();i++){
              ^
NO.cpp: In function 'int main()':
NO.cpp:119:18: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%s",p);
                  ^

Subtask #1
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 6404 KB Output is correct
2 Correct 0 ms 6404 KB Output is correct
3 Correct 0 ms 6404 KB Output is correct
4 Correct 6 ms 6544 KB Output is correct
5 Correct 9 ms 6544 KB Output is correct
6 Correct 9 ms 6544 KB Output is correct
7 Correct 9 ms 6544 KB Output is correct
8 Correct 0 ms 6404 KB Output is correct
9 Correct 0 ms 6404 KB Output is correct
10 Correct 9 ms 6544 KB Output is correct
11 Correct 6 ms 6544 KB Output is correct
12 Correct 6 ms 6544 KB Output is correct
13 Correct 9 ms 6544 KB Output is correct
14 Correct 9 ms 6544 KB Output is correct
15 Correct 9 ms 6544 KB Output is correct
16 Correct 9 ms 6544 KB Output is correct
17 Correct 9 ms 6544 KB Output is correct
18 Correct 9 ms 6544 KB Output is correct
19 Correct 9 ms 6544 KB Output is correct
20 Correct 9 ms 6544 KB Output is correct
21 Correct 9 ms 6544 KB Output is correct
22 Correct 9 ms 6544 KB Output is correct
23 Correct 6 ms 6544 KB Output is correct
24 Correct 9 ms 6544 KB Output is correct
25 Correct 9 ms 6544 KB Output is correct
26 Correct 9 ms 6544 KB Output is correct
27 Correct 9 ms 6544 KB Output is correct
28 Correct 9 ms 6544 KB Output is correct
29 Correct 6 ms 6544 KB Output is correct
30 Correct 9 ms 6544 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 19 ms 6672 KB Output is correct
2 Correct 313 ms 8024 KB Output is correct
3 Correct 139 ms 7256 KB Output is correct
4 Correct 339 ms 8024 KB Output is correct
5 Correct 329 ms 8024 KB Output is correct
6 Correct 436 ms 8024 KB Output is correct
7 Correct 406 ms 8024 KB Output is correct
8 Correct 273 ms 8024 KB Output is correct
9 Correct 256 ms 8024 KB Output is correct
10 Correct 266 ms 8024 KB Output is correct
11 Correct 306 ms 8024 KB Output is correct
12 Correct 306 ms 8024 KB Output is correct
13 Correct 359 ms 8024 KB Output is correct
14 Correct 343 ms 8024 KB Output is correct
15 Correct 339 ms 8024 KB Output is correct
16 Correct 346 ms 8024 KB Output is correct
17 Correct 329 ms 8024 KB Output is correct
18 Correct 333 ms 8024 KB Output is correct
19 Correct 303 ms 8024 KB Output is correct
20 Correct 309 ms 8024 KB Output is correct
21 Correct 339 ms 8024 KB Output is correct
22 Correct 369 ms 8024 KB Output is correct
23 Correct 389 ms 8024 KB Output is correct
24 Correct 403 ms 8024 KB Output is correct
25 Correct 406 ms 8024 KB Output is correct
26 Correct 396 ms 8024 KB Output is correct
27 Correct 393 ms 8024 KB Output is correct
28 Correct 399 ms 8024 KB Output is correct
29 Correct 399 ms 8024 KB Output is correct
30 Correct 403 ms 8024 KB Output is correct
31 Correct 403 ms 8024 KB Output is correct
32 Correct 416 ms 8024 KB Output is correct
33 Correct 419 ms 8024 KB Output is correct
34 Correct 386 ms 8024 KB Output is correct
35 Correct 389 ms 8024 KB Output is correct
36 Correct 403 ms 8024 KB Output is correct
37 Correct 413 ms 8024 KB Output is correct
38 Correct 383 ms 8024 KB Output is correct
39 Correct 406 ms 8024 KB Output is correct
40 Correct 409 ms 8024 KB Output is correct
41 Correct 0 ms 6404 KB Output is correct
42 Correct 0 ms 6404 KB Output is correct
43 Correct 0 ms 6404 KB Output is correct
44 Correct 6 ms 6544 KB Output is correct
45 Correct 9 ms 6544 KB Output is correct
46 Correct 9 ms 6544 KB Output is correct
47 Correct 9 ms 6544 KB Output is correct
48 Correct 0 ms 6404 KB Output is correct
49 Correct 0 ms 6404 KB Output is correct
50 Correct 9 ms 6544 KB Output is correct
51 Correct 6 ms 6544 KB Output is correct
52 Correct 6 ms 6544 KB Output is correct
53 Correct 9 ms 6544 KB Output is correct
54 Correct 9 ms 6544 KB Output is correct
55 Correct 9 ms 6544 KB Output is correct
56 Correct 9 ms 6544 KB Output is correct
57 Correct 9 ms 6544 KB Output is correct
58 Correct 9 ms 6544 KB Output is correct
59 Correct 9 ms 6544 KB Output is correct
60 Correct 9 ms 6544 KB Output is correct
61 Correct 9 ms 6544 KB Output is correct
62 Correct 9 ms 6544 KB Output is correct
63 Correct 6 ms 6544 KB Output is correct
64 Correct 9 ms 6544 KB Output is correct
65 Correct 9 ms 6544 KB Output is correct
66 Correct 9 ms 6544 KB Output is correct
67 Correct 9 ms 6544 KB Output is correct
68 Correct 9 ms 6544 KB Output is correct
69 Correct 6 ms 6544 KB Output is correct
70 Correct 9 ms 6544 KB Output is correct