oj.uz

답안 #42977

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
42977 2018-03-07T10:43:28 Z BThero 세 명의 친구들 (BOI14_friends) C++14
100 / 100
 96 ms 6572 KB 
#include <bits/stdc++.h>

#define pb push_back
#define mp make_pair

#define fi first
#define se second

typedef long long ll;

using namespace std;

char ans[2000005];

char t[2000005];

char s[2000005];

int n;

void solve() {
    scanf("%d", &n);
    scanf("%s", s);

    if (n % 2 == 0) {
        printf("NOT POSSIBLE\n");
        return;
    }

    int len = (n - 1) / 2;

    vector <int> vv;

    {
        int l = 0, r = len + 1;
        int ps = -1;

        for (int i = 1; i <= len; ++i) {
            while (s[l] != s[r]) {
                if (ps == -1) {
                    ps = l;
                }
                else {
                    ps = -2;
                    break;
                }

                ++l;
            }

            if (ps == -2) {
                break;
            }

            ++l, ++r;
        }

        if (ps == -1) {
            ps = len;
        }

        if (0 <= ps) {
            vv.pb(ps);
        }
    }

    {
        int l = 0, r = len;
        int ps = -1;

        for (int i = 1; i <= len; ++i) {
            while (s[l] != s[r]) {
                if (ps == -1) {
                    ps = r;
                }
                else {
                    ps = -2;
                    break;
                }

                ++r;
            }

            if (ps == -2) {
                break;
            }

            ++l, ++r;
        }

        if (ps == -1) {
            ps = n - 1;
        }

        if (0 <= ps) {
            vv.pb(ps);
        }
    }

    bool ex = 0;

    for (auto it : vv) {
        int sz = 0;

        for (int i = 0; i < n; ++i) {
            if (i != it) {
                t[sz++] = s[i];
            }
        }

        bool ok = 1;

        for (int i = 0; i < len; ++i) {
            ok &= (t[i] == t[i + len]);
        }

        if (!ok) {
            continue;
        }

        if (ex) {
            for (int i = 0; i < len; ++i) {
                if (t[i] != ans[i]) {
                    printf("NOT UNIQUE\n");
                    return;
                }
            }
        }

        ex = 1;

        for (int i = 0; i < len; ++i) {
            ans[i] = t[i];
        }
    }

    if (!ex) {
        printf("NOT POSSIBLE\n");
        return;
    }

    for (int i = 0; i < len; ++i) {
        printf("%c", ans[i]);
    }
}

int main() {
    #ifdef BThero
        freopen("input.txt", "r", stdin);
        freopen("output.txt", "w", stdout);
    #endif // BThero

    int tt = 1;

    while (tt--) {
        solve();
    }

    return 0;
}

Compilation message

friends.cpp: In function 'void solve()':
friends.cpp:22:20: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &n);
                    ^
friends.cpp:23:19: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%s", s);
                   ^

Subtask #1
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 248 KB Output is correct
2 Correct 1 ms 352 KB Output is correct
3 Correct 1 ms 424 KB Output is correct
4 Correct 1 ms 440 KB Output is correct
5 Correct 1 ms 496 KB Output is correct
6 Correct 1 ms 512 KB Output is correct
7 Correct 1 ms 640 KB Output is correct
8 Correct 1 ms 640 KB Output is correct
9 Correct 1 ms 640 KB Output is correct
10 Correct 1 ms 640 KB Output is correct
11 Correct 1 ms 640 KB Output is correct
12 Correct 1 ms 640 KB Output is correct
13 Correct 1 ms 640 KB Output is correct
14 Correct 1 ms 640 KB Output is correct
15 Correct 1 ms 640 KB Output is correct
16 Correct 1 ms 640 KB Output is correct
17 Correct 1 ms 640 KB Output is correct
18 Correct 1 ms 640 KB Output is correct
19 Correct 1 ms 640 KB Output is correct
20 Correct 1 ms 640 KB Output is correct
21 Correct 1 ms 640 KB Output is correct
22 Correct 2 ms 640 KB Output is correct
23 Correct 2 ms 640 KB Output is correct
24 Correct 2 ms 640 KB Output is correct
25 Correct 1 ms 640 KB Output is correct
26 Correct 1 ms 640 KB Output is correct
27 Correct 1 ms 640 KB Output is correct
28 Correct 1 ms 640 KB Output is correct
29 Correct 1 ms 640 KB Output is correct
30 Correct 2 ms 640 KB Output is correct
31 Correct 2 ms 640 KB Output is correct
32 Correct 1 ms 640 KB Output is correct
33 Correct 2 ms 640 KB Output is correct
34 Correct 1 ms 640 KB Output is correct
35 Correct 1 ms 640 KB Output is correct
36 Correct 1 ms 640 KB Output is correct
37 Correct 1 ms 640 KB Output is correct
38 Correct 1 ms 640 KB Output is correct
39 Correct 1 ms 640 KB Output is correct
40 Correct 1 ms 640 KB Output is correct
41 Correct 1 ms 640 KB Output is correct
42 Correct 1 ms 640 KB Output is correct
43 Correct 1 ms 640 KB Output is correct
44 Correct 1 ms 640 KB Output is correct
45 Correct 1 ms 640 KB Output is correct
46 Correct 1 ms 640 KB Output is correct
47 Correct 1 ms 640 KB Output is correct
48 Correct 1 ms 640 KB Output is correct
49 Correct 1 ms 640 KB Output is correct
50 Correct 1 ms 640 KB Output is correct
51 Correct 1 ms 640 KB Output is correct
52 Correct 1 ms 640 KB Output is correct
53 Correct 1 ms 640 KB Output is correct
54 Correct 1 ms 640 KB Output is correct

Subtask #2
65.0 / 65.0

# 결과 실행 시간 메모리 Grader output
1 Correct 63 ms 6508 KB Output is correct
2 Correct 96 ms 6508 KB Output is correct
3 Correct 64 ms 6508 KB Output is correct
4 Correct 61 ms 6508 KB Output is correct
5 Correct 60 ms 6508 KB Output is correct
6 Correct 9 ms 6508 KB Output is correct
7 Correct 83 ms 6572 KB Output is correct
8 Correct 17 ms 6572 KB Output is correct
9 Correct 55 ms 6572 KB Output is correct
10 Correct 60 ms 6572 KB Output is correct
11 Correct 8 ms 6572 KB Output is correct
12 Correct 1 ms 6572 KB Output is correct
13 Correct 1 ms 6572 KB Output is correct
14 Correct 1 ms 6572 KB Output is correct
15 Correct 2 ms 6572 KB Output is correct
16 Correct 2 ms 6572 KB Output is correct
17 Correct 1 ms 6572 KB Output is correct
18 Correct 1 ms 6572 KB Output is correct
19 Correct 1 ms 6572 KB Output is correct
20 Correct 1 ms 6572 KB Output is correct
21 Correct 2 ms 6572 KB Output is correct
22 Correct 2 ms 6572 KB Output is correct
23 Correct 2 ms 6572 KB Output is correct
24 Correct 1 ms 6572 KB Output is correct
25 Correct 1 ms 6572 KB Output is correct
26 Correct 1 ms 6572 KB Output is correct
27 Correct 2 ms 6572 KB Output is correct
28 Correct 2 ms 6572 KB Output is correct
29 Correct 2 ms 6572 KB Output is correct
30 Correct 1 ms 6572 KB Output is correct
31 Correct 1 ms 6572 KB Output is correct
32 Correct 2 ms 6572 KB Output is correct
33 Correct 1 ms 6572 KB Output is correct
34 Correct 2 ms 6572 KB Output is correct
35 Correct 2 ms 6572 KB Output is correct
36 Correct 1 ms 6572 KB Output is correct
37 Correct 1 ms 6572 KB Output is correct
38 Correct 1 ms 6572 KB Output is correct
39 Correct 1 ms 6572 KB Output is correct
40 Correct 1 ms 6572 KB Output is correct
41 Correct 2 ms 6572 KB Output is correct
42 Correct 1 ms 6572 KB Output is correct
43 Correct 2 ms 6572 KB Output is correct
44 Correct 2 ms 6572 KB Output is correct
45 Correct 2 ms 6572 KB Output is correct
46 Correct 2 ms 6572 KB Output is correct
47 Correct 1 ms 6572 KB Output is correct
48 Correct 2 ms 6572 KB Output is correct
49 Correct 2 ms 6572 KB Output is correct
50 Correct 1 ms 6572 KB Output is correct
51 Correct 1 ms 6572 KB Output is correct
52 Correct 1 ms 6572 KB Output is correct
53 Correct 1 ms 6572 KB Output is correct
54 Correct 1 ms 6572 KB Output is correct