제출 #1111793

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1111793		ThegeekKnight16	세 명의 친구들 (BOI14_friends)	C++17	0 / 100	25 ms	5480 KiB

friends

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

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int tam;
    cin >> tam;
    if (tam % 2 == 0) {cout << "NOT POSSIBLE" << '\n'; return 0;}

    int N = (tam-1)/2;
    string S; cin >> S;
    int resp = -1; vector<bool> sufEqual(N+2, 1);
    for (int i = N; i >= 1; i--) sufEqual[i] = (sufEqual[i+1] && S[i] == S[N+i]);
    bool pref = 1;
    for (int i = 0; i < N; i++)
    {
        if (pref && sufEqual[i+1] && resp != -1) {cout << "NOT UNIQUE" << '\n'; return 0;}
        else if (pref && sufEqual[i+1]) resp = i;
        pref = pref && (S[i] == S[i+N+1]);
    }
    if (pref && resp != -1) {cout << "NOT UNIQUE" << '\n'; return 0;}
    if (pref) resp = N;

    pref = 1;
    for (int i = 1; i <= N; i++)
    {
        pref = (pref && (S[i-1] == S[N+i-1]));
        if (pref && sufEqual[i+1] && resp != -1) {cout << "NOT UNIQUE" << '\n'; return 0;}
        else if (pref && sufEqual[i+1]) resp = i;
    }

    if (pref == -1) {cout << "NOT POSSIBLE" << '\n'; return 0;}

    int cnt = 0;
    for (int i = 0; cnt < N; i++) if (i != resp) {cout << S[i]; cnt++;} cout << '\n';
}

컴파일 시 표준 에러 (stderr) 메시지

friends.cpp: In function 'int main()':
friends.cpp:34:14: warning: comparison of constant '-1' with boolean expression is always false [-Wbool-compare]
   34 |     if (pref == -1) {cout << "NOT POSSIBLE" << '\n'; return 0;}
      |         ~~~~~^~~~~
friends.cpp:37:5: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   37 |     for (int i = 0; cnt < N; i++) if (i != resp) {cout << S[i]; cnt++;} cout << '\n';
      |     ^~~
friends.cpp:37:73: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   37 |     for (int i = 0; cnt < N; i++) if (i != resp) {cout << S[i]; cnt++;} cout << '\n';
      |                                                                         ^~~~

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