oj.uz

Submission #356148

# Submission time Handle Problem Language Result Execution time Memory
356148 2021-01-23T07:47:30 Z parsabahrami Three Friends (BOI14_friends) C++17
100 / 100
 234 ms 44488 KB 
// Call my Name and Save me from The Dark
#include <bits/stdc++.h>
 
using namespace std;

typedef long long int ll;
typedef pair<int, int> pii;
 
#define SZ(x)                       (int) x.size()
#define F                           first
#define S                           second

const int N = 2e6 + 10, MOD[] = {(int) 1e9 + 7, (int) 1e9 + 9};
int n, H[2][N], pw[2][N], base = 31; char S[N]; vector<int> R; set<pii> st;

pii get(int l, int r) {
    if (r < l) return {0, 0};
    pii h; 
    h.F = (H[0][r] - 1ll * H[0][l - 1] * pw[0][r - l + 1] % MOD[0] + MOD[0]) % MOD[0];
    h.S = (H[1][r] - 1ll * H[1][l - 1] * pw[1][r - l + 1] % MOD[1] + MOD[1]) % MOD[1];
    return h;
}

int main() {
    pw[0][0] = pw[1][0] = 1;
    for (int i = 1; i < N; i++) for (int j = 0; j < 2; j++) pw[j][i] = 1ll * base * pw[j][i - 1] % MOD[j];
    scanf("%d%s", &n, S + 1);
    //if (n % 2 == 0) return !printf("NOT POSSIBLE\n");
    for (int i = 1; i <= n; i++) {
        for (int j = 0; j < 2; j++) H[j][i] = (1ll * H[j][i - 1] * base % MOD[j] + S[i] - 'A' + 1) % MOD[j];
    }
    for (int i = 1; i <= n; i++) {
        if (i > n / 2) {
            pii h = get(1, n / 2), l = get(n / 2 + 1, i - 1), r = get(i + 1, n);
            l = {(1ll * l.F * pw[0][n - i] % MOD[0] + r.F) % MOD[0], (1ll * l.S * pw[1][n - i] % MOD[1] + r.S) % MOD[1]};
            if (h == l) R.push_back(i), st.insert(h);
        } else {
            pii h = get(n / 2 + 2, n), l = get(1, i - 1), r = get(i + 1, n / 2 + 1);
            l = {(1ll * l.F * pw[0][n / 2 - i + 1] % MOD[0] + r.F) % MOD[0], (1ll * l.S * pw[1][n / 2 - i + 1] % MOD[1] + r.S) % MOD[1]};
            if (h == l) R.push_back(i), st.insert(h);
        }
    }   
    if (!SZ(R)) printf("NOT POSSIBLE\n");
    else if (SZ(st) > 1) printf("NOT UNIQUE\n");
    else {
        int id = R[0];
        for (int i = 1, j = 0; i <= n && j < n / 2; i++) {
            if (i == id) continue;
            else {
                printf("%c", S[i]), j++;
            }
        }
    }
    return 0;
}

Compilation message

friends.cpp: In function 'int main()':
friends.cpp:27:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   27 |     scanf("%d%s", &n, S + 1);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~

Subtask #1
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 16000 KB Output is correct
2 Correct 20 ms 15980 KB Output is correct
3 Correct 20 ms 15980 KB Output is correct
4 Correct 21 ms 15980 KB Output is correct
5 Correct 21 ms 15980 KB Output is correct
6 Correct 20 ms 15980 KB Output is correct
7 Correct 21 ms 15980 KB Output is correct
8 Correct 21 ms 15980 KB Output is correct
9 Correct 21 ms 15980 KB Output is correct
10 Correct 24 ms 15980 KB Output is correct
11 Correct 23 ms 15980 KB Output is correct
12 Correct 21 ms 15980 KB Output is correct
13 Correct 21 ms 15980 KB Output is correct
14 Correct 21 ms 15980 KB Output is correct
15 Correct 21 ms 15980 KB Output is correct
16 Correct 21 ms 15980 KB Output is correct
17 Correct 21 ms 15980 KB Output is correct
18 Correct 22 ms 15980 KB Output is correct
19 Correct 21 ms 15980 KB Output is correct
20 Correct 21 ms 15980 KB Output is correct
21 Correct 21 ms 16108 KB Output is correct
22 Correct 21 ms 15980 KB Output is correct
23 Correct 21 ms 15980 KB Output is correct
24 Correct 22 ms 15980 KB Output is correct
25 Correct 21 ms 15980 KB Output is correct
26 Correct 21 ms 15980 KB Output is correct
27 Correct 21 ms 16108 KB Output is correct
28 Correct 21 ms 15980 KB Output is correct
29 Correct 21 ms 15980 KB Output is correct
30 Correct 21 ms 16000 KB Output is correct
31 Correct 21 ms 15980 KB Output is correct
32 Correct 21 ms 15980 KB Output is correct
33 Correct 20 ms 15980 KB Output is correct
34 Correct 21 ms 15980 KB Output is correct
35 Correct 21 ms 15980 KB Output is correct
36 Correct 22 ms 15980 KB Output is correct
37 Correct 21 ms 15980 KB Output is correct
38 Correct 24 ms 15980 KB Output is correct
39 Correct 23 ms 16108 KB Output is correct
40 Correct 21 ms 15980 KB Output is correct
41 Correct 20 ms 15980 KB Output is correct
42 Correct 21 ms 15980 KB Output is correct
43 Correct 21 ms 15980 KB Output is correct
44 Correct 23 ms 15980 KB Output is correct
45 Correct 21 ms 15980 KB Output is correct
46 Correct 22 ms 16108 KB Output is correct
47 Correct 21 ms 15980 KB Output is correct
48 Correct 21 ms 15980 KB Output is correct
49 Correct 21 ms 15980 KB Output is correct
50 Correct 21 ms 15980 KB Output is correct
51 Correct 21 ms 15980 KB Output is correct
52 Correct 23 ms 16000 KB Output is correct
53 Correct 22 ms 15980 KB Output is correct
54 Correct 21 ms 15980 KB Output is correct

Subtask #2
65.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 214 ms 35880 KB Output is correct
2 Correct 205 ms 35696 KB Output is correct
3 Correct 204 ms 35900 KB Output is correct
4 Correct 205 ms 35712 KB Output is correct
5 Correct 206 ms 35760 KB Output is correct
6 Correct 147 ms 35564 KB Output is correct
7 Correct 234 ms 44488 KB Output is correct
8 Correct 132 ms 33644 KB Output is correct
9 Correct 204 ms 34540 KB Output is correct
10 Correct 186 ms 34540 KB Output is correct
11 Correct 127 ms 32364 KB Output is correct
12 Correct 22 ms 15980 KB Output is correct
13 Correct 21 ms 15980 KB Output is correct
14 Correct 21 ms 15980 KB Output is correct
15 Correct 21 ms 15980 KB Output is correct
16 Correct 21 ms 16108 KB Output is correct
17 Correct 21 ms 15980 KB Output is correct
18 Correct 20 ms 15980 KB Output is correct
19 Correct 21 ms 15980 KB Output is correct
20 Correct 21 ms 15980 KB Output is correct
21 Correct 21 ms 15980 KB Output is correct
22 Correct 20 ms 15980 KB Output is correct
23 Correct 23 ms 15980 KB Output is correct
24 Correct 21 ms 15980 KB Output is correct
25 Correct 21 ms 15980 KB Output is correct
26 Correct 21 ms 16128 KB Output is correct
27 Correct 21 ms 15980 KB Output is correct
28 Correct 21 ms 16108 KB Output is correct
29 Correct 21 ms 15980 KB Output is correct
30 Correct 21 ms 15980 KB Output is correct
31 Correct 23 ms 16108 KB Output is correct
32 Correct 21 ms 16000 KB Output is correct
33 Correct 21 ms 15980 KB Output is correct
34 Correct 21 ms 15980 KB Output is correct
35 Correct 21 ms 15980 KB Output is correct
36 Correct 21 ms 15980 KB Output is correct
37 Correct 21 ms 15980 KB Output is correct
38 Correct 21 ms 15980 KB Output is correct
39 Correct 21 ms 15980 KB Output is correct
40 Correct 22 ms 15980 KB Output is correct
41 Correct 21 ms 15980 KB Output is correct
42 Correct 21 ms 15980 KB Output is correct
43 Correct 20 ms 16108 KB Output is correct
44 Correct 20 ms 15980 KB Output is correct
45 Correct 22 ms 15980 KB Output is correct
46 Correct 24 ms 15980 KB Output is correct
47 Correct 20 ms 15980 KB Output is correct
48 Correct 21 ms 15980 KB Output is correct
49 Correct 20 ms 15980 KB Output is correct
50 Correct 21 ms 15980 KB Output is correct
51 Correct 21 ms 15980 KB Output is correct
52 Correct 20 ms 15980 KB Output is correct
53 Correct 20 ms 15980 KB Output is correct
54 Correct 21 ms 15980 KB Output is correct