oj.uz

답안 #938418

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

typedef long long ll;

ll k;
bool check(string s, string t){
    int j = 0;
    int i = 0;
    int ind = t.size() - 1;
    for (; i < s.size() and j < t.size();){
        if (s[i] == t[j]){
            i++;
            j++;
        }
        else{
            ind = j;
            j++;
        }
    }

    if (i == s.size())
        return 1;

    j = t.size() - 1;
    i = s.size() - 1;
    ind = 0;
    for (; i >= 0 and j >= 0;){
        if (s[i] == t[j]){
            i--;
            j--;
        }
        else{
            ind = j;
            j--;
        }
    }

    if (i == -1)
        return 1;
    return 0;
}

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

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

    k = n / 2;
    string P, S;
    for (ll i = 0; i < k; i ++)
        P += s[i];
    for (ll i = k + 1; i < n; i ++)
        S += s[i];

    if (P == S){
        cout << P << endl;
        return 0;
    }

    string ans;

    string Q = s[k] + S;
    int poss = check(P, Q);
    if (poss)
        ans = P;

    int prev = poss;

    Q = P + s[k];
    poss += check(S, Q);
    if (poss - prev)
        ans = S;

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

Compilation message

friends.cpp: In function 'bool check(std::string, std::string)':
friends.cpp:11:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   11 |     for (; i < s.size() and j < t.size();){
      |            ~~^~~~~~~~~~
friends.cpp:11:31: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   11 |     for (; i < s.size() and j < t.size();){
      |                             ~~^~~~~~~~~~
friends.cpp:22:11: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   22 |     if (i == s.size())
      |         ~~^~~~~~~~~~~
friends.cpp:10:9: warning: variable 'ind' set but not used [-Wunused-but-set-variable]
   10 |     int ind = t.size() - 1;
      |         ^~~

Subtask #1
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 344 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 1 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 1 ms 348 KB Output is correct
14 Correct 0 ms 348 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 1 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 344 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 348 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 1 ms 348 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 0 ms 600 KB Output is correct
39 Correct 0 ms 360 KB Output is correct
40 Correct 0 ms 344 KB Output is correct
41 Correct 1 ms 344 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 344 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 1 ms 344 KB Output is correct
49 Correct 0 ms 348 KB Output is correct
50 Correct 0 ms 348 KB Output is correct
51 Correct 0 ms 348 KB Output is correct
52 Correct 0 ms 440 KB Output is correct
53 Correct 0 ms 348 KB Output is correct
54 Correct 0 ms 348 KB Output is correct

Subtask #2
65.0 / 65.0

# 결과 실행 시간 메모리 Grader output
1 Correct 43 ms 11804 KB Output is correct
2 Correct 42 ms 11456 KB Output is correct
3 Correct 42 ms 10684 KB Output is correct
4 Correct 41 ms 10436 KB Output is correct
5 Correct 41 ms 10444 KB Output is correct
6 Correct 27 ms 4944 KB Output is correct
7 Correct 32 ms 7616 KB Output is correct
8 Correct 34 ms 9284 KB Output is correct
9 Correct 38 ms 10048 KB Output is correct
10 Correct 38 ms 10044 KB Output is correct
11 Correct 40 ms 8520 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 436 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 1 ms 600 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 436 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 436 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 436 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 1 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 348 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 1 ms 432 KB Output is correct
36 Correct 0 ms 344 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 1 ms 348 KB Output is correct
39 Correct 0 ms 344 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 344 KB Output is correct
44 Correct 0 ms 348 KB Output is correct
45 Correct 0 ms 348 KB Output is correct
46 Correct 1 ms 348 KB Output is correct
47 Correct 1 ms 348 KB Output is correct
48 Correct 0 ms 348 KB Output is correct
49 Correct 0 ms 348 KB Output is correct
50 Correct 0 ms 344 KB Output is correct
51 Correct 0 ms 348 KB Output is correct
52 Correct 0 ms 348 KB Output is correct
53 Correct 0 ms 348 KB Output is correct
54 Correct 0 ms 348 KB Output is correct