제출 #1070469

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1070469		ortsac	세 명의 친구들 (BOI14_friends)	C++17	100 / 100	59 ms	9156 KiB

friends

#include <bits/stdc++.h>
 
using namespace std;

int32_t main() {
    int n;
    string s;
    cin >> n >> s;
    if ((n % 2) == 0) {
        cout << "NOT POSSIBLE\n";
        return 0;
    }
    int tam = (n - 1)/2;
    int pos = 0;
    // test possibility 1
    string ans1 = "";
    int curr = 0;
    int skipped = 0;
    for (int i = tam; i < n; i++) {
        if ((curr < tam) && (s[curr] == s[i])) {
            curr++;
        } else {
            skipped++;
        }
        if (skipped == 2) break;
    }
    if (skipped == 1) {
        for (int i = 0; i < tam; i++) ans1 += s[i];
        pos++;
    } 
    // test possibility 2
    string ans2 = "";
    curr = tam + 1;
    skipped = 0;
    for (int i = 0; i <= tam; i++) {
        if ((curr < n) && (s[curr] == s[i])) {
            curr++;
        } else {
            skipped++;
        }
        if (skipped == 2) break;
    }
    if (skipped == 1) {
        for (int i = tam + 1; i < n; i++) ans2 += s[i];
        pos++;
    }
    // gonow
    if (pos == 0) {
        cout << "NOT POSSIBLE\n";
    } else if ((pos == 2) && (ans1 != ans2)) {
        cout << "NOT UNIQUE\n";
    } else if (ans1.empty()) {
        cout << ans2 << "\n";
    } else {
        cout << ans1 << "\n";
    }
}

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