제출 #11160

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
11160		gs14004	세 명의 친구들 (BOI14_friends)	C++98	100 / 100	40 ms	18664 KiB

friends

#include <cstdio>
#include <cstdlib>
 
int n;
char str[2000005];
 
long long pow[2000005], l_hash, r_hash, c_hash;
int result = -1;
 
void input(){
    scanf("%d %s",&n,str);
    if(!(n&1)){
        puts("NOT POSSIBLE");
        exit(0);
    }
    pow[0] = 1;
    for (int i=1; i<n; i++) {
        pow[i] = pow[i-1] * 31;
    }
}
 
void output(){
    if(result == -1) puts("NOT POSSIBLE");
    else{
        int p = 0;
        for (int i=0; i<n/2+p; i++) {
            if(i == result){
                p++;
                continue;
            }
            putchar(str[i]);
        }
    }
}
 
void calc_left(long long l_hash, long long r_hash){
    int piv = 0;
    for (int i=n/2-1; i>=0; i--) {
        l_hash -= pow[piv] *(str[i] - str[i+1]);
        if(l_hash == r_hash && l_hash != c_hash){
            if(~result){
                puts("NOT UNIQUE");
                exit(0);
            }
            else result = i, c_hash = l_hash;
        }
        piv++;
    }
}
 
void calc_right(long long l_hash, long long r_hash){
    int piv = n/2-1;
    for (int i=n/2+1; i<n; i++) {
        r_hash += (str[i-1] -str[i]) * pow[piv];
        if(l_hash == r_hash && l_hash != c_hash){
            if(~result){
                puts("NOT UNIQUE");
                exit(0);
            }
            else result = i, c_hash = l_hash;
        }
        piv--;
    }
}
 
int main(){
    input();
    for (int i=0; i<n/2; i++) {
        l_hash *= 31;
        r_hash *= 31;
        l_hash += str[i] - 'A';
        r_hash += str[n/2 + 1 + i] - 'A';
    }
    if(l_hash == r_hash) result = n/2, c_hash = l_hash;
    calc_left(l_hash,r_hash);
    calc_right(l_hash,r_hash);
    output();
}

• Subtask 1: 35 / 35
• Subtask 2: 65 / 65