Submission #554510

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
554510	2022-04-28T14:54:03 Z	ollel	Three Friends (BOI14_friends)	C++14	100 / 100	106 ms	8196 KB

friends

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

#define rep(i,a,b) for(int i = a; i < b; i++)
#define pb push_back

typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<bool> vb;
typedef long long ll;

int n,m;
string u;

int main() {
  cin >> n;
  cin >> u;
  n = u.size();
  if (n % 2 == 0) {
    cout << "NOT POSSIBLE\n";
    exit(0);
  }
  m = (n - 1) / 2;

  bool first = true, second = true;
  int i = 0, j = m;

  while (i < m) {
    if (u[i] != u[j]) break;
    i++; j++;
  }
  j++;
  while (i < m) {
    if (u[i] != u[j]) break;
    i++; j++;
  }
  first = (i == m);

  i = 0; j = m + 1;
  while (j < n) {
    if (u[i] != u[j]) break;
    i++; j++;
  }
  i++;
  while (j < n) {
    if (u[i] != u[j]) break;
    i++; j++;
  }
  second = (j == n);

  vector<char> s, f;
  rep(i,0,m) f.pb(u[i]);
  rep(i,m+1,n) s.pb(u[i]);
  bool eq = true;
  rep(i,0,m) if (f[i] != s[i]) eq = false;
  if ((!eq) && first && second) {
    cout << "NOT UNIQUE\n";
  } else if (first) {
    rep(i,0,m) cout << f[i];
    cout << endl;
  } else if (second) {
    rep(i,0,m) cout << s[i];
    cout << endl;
  } else {
    cout << "NOT POSSIBLE\n";
  }
}

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	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	1 ms	296 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	212 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	1 ms	296 KB	Output is correct
17	Correct	1 ms	300 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	212 KB	Output is correct
22	Correct	1 ms	212 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	304 KB	Output is correct
29	Correct	1 ms	304 KB	Output is correct
30	Correct	1 ms	300 KB	Output is correct
31	Correct	1 ms	212 KB	Output is correct
32	Correct	0 ms	212 KB	Output is correct
33	Correct	1 ms	212 KB	Output is correct
34	Correct	1 ms	300 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	300 KB	Output is correct
41	Correct	1 ms	304 KB	Output is correct
42	Correct	1 ms	296 KB	Output is correct
43	Correct	0 ms	212 KB	Output is correct
44	Correct	1 ms	300 KB	Output is correct
45	Correct	1 ms	212 KB	Output is correct
46	Correct	1 ms	300 KB	Output is correct
47	Correct	1 ms	212 KB	Output is correct
48	Correct	1 ms	300 KB	Output is correct
49	Correct	1 ms	212 KB	Output is correct
50	Correct	1 ms	212 KB	Output is correct
51	Correct	1 ms	212 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	256 KB	Output is correct

Subtask #2

65.0 / 65.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	94 ms	6628 KB	Output is correct
2	Correct	106 ms	6508 KB	Output is correct
3	Correct	92 ms	6432 KB	Output is correct
4	Correct	100 ms	6400 KB	Output is correct
5	Correct	104 ms	6428 KB	Output is correct
6	Correct	47 ms	4328 KB	Output is correct
7	Correct	97 ms	8196 KB	Output is correct
8	Correct	66 ms	6588 KB	Output is correct
9	Correct	93 ms	7484 KB	Output is correct
10	Correct	80 ms	7452 KB	Output is correct
11	Correct	48 ms	6208 KB	Output is correct
12	Correct	1 ms	212 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	1 ms	296 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	304 KB	Output is correct
22	Correct	1 ms	212 KB	Output is correct
23	Correct	1 ms	212 KB	Output is correct
24	Correct	1 ms	236 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	300 KB	Output is correct
28	Correct	1 ms	212 KB	Output is correct
29	Correct	0 ms	304 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	300 KB	Output is correct
33	Correct	1 ms	296 KB	Output is correct
34	Correct	1 ms	300 KB	Output is correct
35	Correct	1 ms	296 KB	Output is correct
36	Correct	1 ms	304 KB	Output is correct
37	Correct	1 ms	300 KB	Output is correct
38	Correct	1 ms	296 KB	Output is correct
39	Correct	1 ms	296 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	300 KB	Output is correct
47	Correct	1 ms	212 KB	Output is correct
48	Correct	1 ms	212 KB	Output is correct
49	Correct	1 ms	300 KB	Output is correct
50	Correct	1 ms	212 KB	Output is correct
51	Correct	1 ms	288 KB	Output is correct
52	Correct	1 ms	212 KB	Output is correct
53	Correct	1 ms	256 KB	Output is correct
54	Correct	1 ms	212 KB	Output is correct