oj.uz

Submission #711818

# Submission time Handle Problem Language Result Execution time Memory
711818 2023-03-17T14:33:45 Z Karpin Three Friends (BOI14_friends) C++14
100 / 100
 28 ms 7412 KB 
#include <bits/stdc++.h>

using namespace std;


#define ll long long
#define vt vector
#define ar array


void solve(){

    int n;

    cin >> n;

    string u;
    cin >> u;

    int numOfEachChar[30];

    for (int i = 0; i < 30; i++){
        numOfEachChar[i] = 0;
    }

    for (int i = 0; i < n; i++){
        numOfEachChar[u[i] - 'A']++;
    }

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

    bool torf = false;

    int neededChar = -1;

    for (int i = 0; i < 26; i++){
        if (numOfEachChar[i] % 2 == 1){
            if (torf){
                cout << "NOT POSSIBLE" << endl;
                return;
            }
            torf = true;
            neededChar = i;
        }
    }

    if (!torf){
        cout << "NOT POSSIBLE" << endl;
        return;
    }

    // vt<int> poses;

    // for (int i = 0; i < n; i++){
    //     if (u[i] - 'A' == neededChar) poses.push_back(i);
    // }

    string res = "";
    int plusOne = 0;

    for (int i = 0; i <= n / 2; i++){
        if (i == n / 2 && plusOne == 0) break;
        if (u[i] != u[i + n / 2 + 1 - plusOne]) {
            if (plusOne) {
                res = "";
                break;
            }
            plusOne++;
        }else{
            res += u[i];
        }
    }

    plusOne = 0;
    string res2 = "";

    for (int i = 0; i <= n / 2; i++){
        if (i == n / 2 && plusOne == 0) break;
        if (u[i - plusOne] != u[i + n / 2]){
            if (plusOne){
                res2 = "";
                break;
            }
            plusOne++;
        }else{
            res2 += u[i + n / 2];
        }
    }


    if (res == "" && res2 == "") cout << "NOT POSSIBLE" << endl;
    else if (res != "" && res2 == "") cout << res << endl;
    else if (res == "" && res2 != "") cout << res2 << endl;
    else if (res == res2) cout << res << endl;
    else cout << "NOT UNIQUE" << endl;




    
		

}

int main(){

	ios::sync_with_stdio(0);
	cin.tie(0);
	
	int testcases = 1;

	// cin >> testcases;

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

	return 0;

}

Compilation message

friends.cpp: In function 'void solve()':
friends.cpp:37:9: warning: variable 'neededChar' set but not used [-Wunused-but-set-variable]
   37 |     int neededChar = -1;
      |         ^~~~~~~~~~

Subtask #1
35.0 / 35.0

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

Subtask #2
65.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 5884 KB Output is correct
2 Correct 17 ms 5104 KB Output is correct
3 Correct 18 ms 5076 KB Output is correct
4 Correct 20 ms 5096 KB Output is correct
5 Correct 21 ms 5124 KB Output is correct
6 Correct 12 ms 2416 KB Output is correct
7 Correct 28 ms 6168 KB Output is correct
8 Correct 28 ms 6488 KB Output is correct
9 Correct 27 ms 7412 KB Output is correct
10 Correct 21 ms 6488 KB Output is correct
11 Correct 13 ms 3704 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 320 KB Output is correct
14 Correct 1 ms 316 KB Output is correct
15 Correct 1 ms 320 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 316 KB Output is correct
22 Correct 1 ms 320 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 324 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 1 ms 316 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 1 ms 320 KB Output is correct
33 Correct 1 ms 212 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 1 ms 212 KB Output is correct
37 Correct 1 ms 212 KB Output is correct
38 Correct 1 ms 212 KB Output is correct
39 Correct 1 ms 212 KB Output is correct
40 Correct 1 ms 212 KB Output is correct
41 Correct 1 ms 212 KB Output is correct
42 Correct 1 ms 212 KB Output is correct
43 Correct 1 ms 212 KB Output is correct
44 Correct 1 ms 212 KB Output is correct
45 Correct 1 ms 212 KB Output is correct
46 Correct 1 ms 212 KB Output is correct
47 Correct 1 ms 212 KB Output is correct
48 Correct 0 ms 212 KB Output is correct
49 Correct 0 ms 212 KB Output is correct
50 Correct 1 ms 212 KB Output is correct
51 Correct 1 ms 320 KB Output is correct
52 Correct 1 ms 212 KB Output is correct
53 Correct 1 ms 212 KB Output is correct
54 Correct 1 ms 320 KB Output is correct