답안 #41349

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
41349 2018-02-16T17:53:59 Z gabrielsimoes 세 명의 친구들 (BOI14_friends) C++14
100 / 100
85 ms 5804 KB
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
const string not_possible = "NOT POSSIBLE";
const string not_unique = "NOT UNIQUE";

const ll MOD = 1645333507;
const ll BASE = 137;

ll buildHash(int i, int len, string s) {
  ll result = 0;
  while (len--) result = (result * BASE + ll(s[i] - 'A')) % MOD;
  return result;
}

bool test(string a, string b) {
  vector<bool> pref(b.size(), false), suf(b.size(), false);

  for (int i = 0; i < a.size(); i++) {
    if (a[i] == b[i])
      pref[i] = true;
    else
      break;
  }

  for (int i = a.size() - 1; i >= 0; i--) {
    if (a[i] == b[i + 1])
      suf[i + 1] = true;
    else
      break;
  }

  for (int i = 0; i < b.size(); i++)
    if ((i == 0 || pref[i - 1]) && (i == (b.size() - 1) || suf[i + 1]))
      return true;

  return false;
}

int main() {
  int n, m;
  string s;

  cin >> n >> s;
  m = n / 2;

  if (n < 3 || n != m * 2 + 1) {
    cout << not_possible << endl;
    return 0;
  }

  bool equalParts = 1;
  for (int i = 0; i < m; i++)
    if (s[i] != s[m + 1 + i]) equalParts = false;

  if (equalParts) {
    cout << s.substr(0, m) << endl;
    return 0;
  }

  bool ansl = test(s.substr(0, m), s.substr(m, m + 1));
  bool ansr = test(s.substr(m + 1, m), s.substr(0, m + 1));

  if (ansl && ansr)
    cout << not_unique << endl;
  else if (ansl)
    cout << s.substr(0, m) << endl;
  else if (ansr)
    cout << s.substr(m + 1, m) << endl;
  else
    cout << not_possible << endl;
}

Compilation message

friends.cpp: In function 'bool test(std::__cxx11::string, std::__cxx11::string)':
friends.cpp:20:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int i = 0; i < a.size(); i++) {
                     ^
friends.cpp:34:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for (int i = 0; i < b.size(); i++)
                     ^
friends.cpp:35:39: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     if ((i == 0 || pref[i - 1]) && (i == (b.size() - 1) || suf[i + 1]))
                                       ^
# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 2 ms 352 KB Output is correct
3 Correct 2 ms 352 KB Output is correct
4 Correct 2 ms 404 KB Output is correct
5 Correct 2 ms 456 KB Output is correct
6 Correct 2 ms 456 KB Output is correct
7 Correct 2 ms 604 KB Output is correct
8 Correct 2 ms 604 KB Output is correct
9 Correct 2 ms 604 KB Output is correct
10 Correct 2 ms 604 KB Output is correct
11 Correct 2 ms 604 KB Output is correct
12 Correct 2 ms 604 KB Output is correct
13 Correct 2 ms 604 KB Output is correct
14 Correct 2 ms 604 KB Output is correct
15 Correct 2 ms 604 KB Output is correct
16 Correct 2 ms 604 KB Output is correct
17 Correct 2 ms 604 KB Output is correct
18 Correct 2 ms 604 KB Output is correct
19 Correct 2 ms 604 KB Output is correct
20 Correct 1 ms 604 KB Output is correct
21 Correct 2 ms 604 KB Output is correct
22 Correct 2 ms 604 KB Output is correct
23 Correct 2 ms 604 KB Output is correct
24 Correct 2 ms 604 KB Output is correct
25 Correct 2 ms 604 KB Output is correct
26 Correct 2 ms 604 KB Output is correct
27 Correct 1 ms 604 KB Output is correct
28 Correct 1 ms 604 KB Output is correct
29 Correct 2 ms 604 KB Output is correct
30 Correct 1 ms 604 KB Output is correct
31 Correct 2 ms 604 KB Output is correct
32 Correct 2 ms 604 KB Output is correct
33 Correct 2 ms 604 KB Output is correct
34 Correct 2 ms 604 KB Output is correct
35 Correct 1 ms 604 KB Output is correct
36 Correct 2 ms 604 KB Output is correct
37 Correct 2 ms 604 KB Output is correct
38 Correct 1 ms 604 KB Output is correct
39 Correct 1 ms 604 KB Output is correct
40 Correct 2 ms 604 KB Output is correct
41 Correct 2 ms 604 KB Output is correct
42 Correct 1 ms 604 KB Output is correct
43 Correct 2 ms 604 KB Output is correct
44 Correct 2 ms 604 KB Output is correct
45 Correct 2 ms 604 KB Output is correct
46 Correct 2 ms 620 KB Output is correct
47 Correct 1 ms 620 KB Output is correct
48 Correct 2 ms 620 KB Output is correct
49 Correct 2 ms 620 KB Output is correct
50 Correct 2 ms 620 KB Output is correct
51 Correct 2 ms 620 KB Output is correct
52 Correct 2 ms 620 KB Output is correct
53 Correct 2 ms 620 KB Output is correct
54 Correct 2 ms 620 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 84 ms 5716 KB Output is correct
2 Correct 83 ms 5804 KB Output is correct
3 Correct 81 ms 5804 KB Output is correct
4 Correct 85 ms 5804 KB Output is correct
5 Correct 85 ms 5804 KB Output is correct
6 Correct 75 ms 5804 KB Output is correct
7 Correct 77 ms 5804 KB Output is correct
8 Correct 76 ms 5804 KB Output is correct
9 Correct 78 ms 5804 KB Output is correct
10 Correct 83 ms 5804 KB Output is correct
11 Correct 68 ms 5804 KB Output is correct
12 Correct 2 ms 5804 KB Output is correct
13 Correct 2 ms 5804 KB Output is correct
14 Correct 2 ms 5804 KB Output is correct
15 Correct 1 ms 5804 KB Output is correct
16 Correct 2 ms 5804 KB Output is correct
17 Correct 2 ms 5804 KB Output is correct
18 Correct 2 ms 5804 KB Output is correct
19 Correct 2 ms 5804 KB Output is correct
20 Correct 2 ms 5804 KB Output is correct
21 Correct 2 ms 5804 KB Output is correct
22 Correct 2 ms 5804 KB Output is correct
23 Correct 2 ms 5804 KB Output is correct
24 Correct 2 ms 5804 KB Output is correct
25 Correct 2 ms 5804 KB Output is correct
26 Correct 2 ms 5804 KB Output is correct
27 Correct 2 ms 5804 KB Output is correct
28 Correct 2 ms 5804 KB Output is correct
29 Correct 1 ms 5804 KB Output is correct
30 Correct 2 ms 5804 KB Output is correct
31 Correct 1 ms 5804 KB Output is correct
32 Correct 2 ms 5804 KB Output is correct
33 Correct 1 ms 5804 KB Output is correct
34 Correct 2 ms 5804 KB Output is correct
35 Correct 1 ms 5804 KB Output is correct
36 Correct 2 ms 5804 KB Output is correct
37 Correct 2 ms 5804 KB Output is correct
38 Correct 1 ms 5804 KB Output is correct
39 Correct 2 ms 5804 KB Output is correct
40 Correct 2 ms 5804 KB Output is correct
41 Correct 2 ms 5804 KB Output is correct
42 Correct 2 ms 5804 KB Output is correct
43 Correct 1 ms 5804 KB Output is correct
44 Correct 2 ms 5804 KB Output is correct
45 Correct 1 ms 5804 KB Output is correct
46 Correct 1 ms 5804 KB Output is correct
47 Correct 1 ms 5804 KB Output is correct
48 Correct 1 ms 5804 KB Output is correct
49 Correct 1 ms 5804 KB Output is correct
50 Correct 1 ms 5804 KB Output is correct
51 Correct 1 ms 5804 KB Output is correct
52 Correct 1 ms 5804 KB Output is correct
53 Correct 1 ms 5804 KB Output is correct
54 Correct 1 ms 5804 KB Output is correct