oj.uz

답안 #938379

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
938379 2024-03-05T05:24:25 Z Ghulam_Junaid 세 명의 친구들 (BOI14_friends) C++17
0 / 100
 90 ms 24420 KB 
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;

const ll mod = 1e9 + 7;
const ll base = 727;

int main(){
    ll n;
    string s;
    cin >> n >> s;

    if (n % 2 == 0){
        cout << "NOT POSSIBLE" << endl;
        return 0;
    }

    ll k = n / 2;
    ll hsh = 0;

    ll pw[n];
    pw[0] = 1;
    for (ll i = 1; i < n; i ++)
        pw[i] = (pw[i - 1] * base) % mod;

    ll pref = 0;
    ll suff = 0;

    ll poss = 0;

    string P, S;

    for (ll i = 0; i < k; i ++)
        pref = (pref * base + s[i]) % mod, P += s[i];
    for (ll i = k + 1; i < n; i ++)
        suff = (suff * base + s[i]) % mod, S += s[i];

    for (ll i = 1; i <= k; i ++)
        hsh = (hsh * base + s[i]) % mod;

    for (ll i = 0; i < k; i ++){
        poss += (hsh == suff);
        hsh += pw[k - i - 1] * s[i];
        hsh = ((hsh % mod) + mod) % mod;
        hsh -= pw[k - i - 1] * s[i + 1];
        hsh = ((hsh % mod) + mod) % mod;
    }

    string ans;
    if (poss)
        ans = S;

    ll nposs = 0;
    hsh = suff;
    for (ll i = k, j = k - 1; i + 1 < n; i ++, j--){
        nposs += (hsh == pref);
        hsh -= s[i + 1] * pw[j];
        hsh = ((hsh % mod) + mod) % mod;
        hsh += s[i] * pw[j];
        hsh = ((hsh % mod) + mod) % mod;
    }
    nposs += (hsh == pref);

    if (nposs)
        ans = P;

    poss += nposs;

    if (poss > 1)
        cout << "NOT UNIQUE" << endl;
    else if (poss == 0)
        cout << "NOT POSSIBLE" << endl;
    else
        cout << ans << endl;
}

Subtask #1
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 344 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 1 ms 348 KB Output is correct
38 Correct 0 ms 344 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 0 ms 348 KB Output is correct
41 Correct 0 ms 348 KB Output is correct
42 Correct 0 ms 348 KB Output is correct
43 Correct 0 ms 348 KB Output is correct
44 Correct 0 ms 348 KB Output is correct
45 Correct 0 ms 348 KB Output is correct
46 Correct 0 ms 348 KB Output is correct
47 Correct 0 ms 348 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 1 ms 348 KB Output is correct
50 Incorrect 0 ms 348 KB Output isn't correct
51 Halted 0 ms 0 KB -

Subtask #2
0 / 65.0

# 결과 실행 시간 메모리 Grader output
1 Correct 90 ms 24272 KB Output is correct
2 Correct 90 ms 24420 KB Output is correct
3 Correct 90 ms 23228 KB Output is correct
4 Correct 90 ms 23740 KB Output is correct
5 Incorrect 90 ms 23636 KB Output isn't correct
6 Halted 0 ms 0 KB -