oj.uz

답안 #21832

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
21832 2017-04-26T04:01:18 Z ngkan146 세 명의 친구들 (BOI14_friends) C++
35 / 100
 23 ms 44344 KB 
#include <bits/stdc++.h>
using namespace std;
string s;
int n;
int ans = 0;
void no(){
   cout << "NOT POSSIBLE";
   exit(0);
}
int l[5000005],r[5000005], ansPOS;
vector <int> poss;
void check(){
   for(int i=n/2;i<n-1;i++){
      if (s[i-n/2] == s[i]) l[i] = l[i-1] + 1;
      else l[i] = - (int)1e9;
   }
   for(int i=n-1;i>n/2;i--)
      if (s[i-n/2-1] == s[i]) r[i] = r[i+1] + 1;
      else r[i] = - (int) 1e9;

   for(int i=n/2;i<n;i++){
      if (l[i-1] + r[i+1] == n/2) ans++, ansPOS = i, poss.push_back(i);
   }

   for(int i=0;i<n/2;i++){
      if (s[i] == s[i+n/2+1]) l[i] = (i ? l[i-1] : 0) + 1;
      else l[i] = -(int) 1e9;
   }
   r[n/2+1] = 0;
   for(int i=n/2;i>=1;i--){
      if (s[i] == s[i+n/2]) r[i] = r[i+1] + 1;
      else r[i] = -(int) 1e9;
   }
   for(int i=0;i<n/2;i++){
      if ((i?l[i-1]:0) + r[i+1] == n/2) ans++, ansPOS = i, poss.push_back(i);
   }
}
int main(){
   iostream::sync_with_stdio(0);
   cin >> n >> s;
   if (n%2==0) no();
   check();
   int cnt = 0;
   if (!ans) no();
   else{
      bool ok = 1;
      sort(poss.begin(),poss.end());
      for(int i=0;i<(int)poss.size()-1;i++){
         if (abs(poss[i]-poss[i+1]) != 1 || s[poss[i]]!=s[poss[i+1]]) ok = 0;
      }
      if (!ok) cout << "NOT UNIQUE";
      else{
         for(int i=0;i<n;i++) if (cnt<n/2 && i != ansPOS) cnt++, cout << s[i];
      }
   }
}

Subtask #1
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 41240 KB Output is correct
2 Correct 0 ms 41240 KB Output is correct
3 Correct 0 ms 41240 KB Output is correct
4 Correct 0 ms 41240 KB Output is correct
5 Correct 0 ms 41240 KB Output is correct
6 Correct 0 ms 41240 KB Output is correct
7 Correct 0 ms 41240 KB Output is correct
8 Correct 0 ms 41240 KB Output is correct
9 Correct 0 ms 41240 KB Output is correct
10 Correct 0 ms 41240 KB Output is correct
11 Correct 0 ms 41240 KB Output is correct
12 Correct 0 ms 41240 KB Output is correct
13 Correct 0 ms 41240 KB Output is correct
14 Correct 0 ms 41240 KB Output is correct
15 Correct 0 ms 41240 KB Output is correct
16 Correct 0 ms 41240 KB Output is correct
17 Correct 0 ms 41240 KB Output is correct
18 Correct 0 ms 41240 KB Output is correct
19 Correct 0 ms 41240 KB Output is correct
20 Correct 0 ms 41240 KB Output is correct
21 Correct 0 ms 41240 KB Output is correct
22 Correct 0 ms 41240 KB Output is correct
23 Correct 0 ms 41240 KB Output is correct
24 Correct 0 ms 41240 KB Output is correct
25 Correct 0 ms 41240 KB Output is correct
26 Correct 0 ms 41240 KB Output is correct
27 Correct 0 ms 41240 KB Output is correct
28 Correct 0 ms 41240 KB Output is correct
29 Correct 0 ms 41240 KB Output is correct
30 Correct 0 ms 41240 KB Output is correct
31 Correct 0 ms 41240 KB Output is correct
32 Correct 0 ms 41240 KB Output is correct
33 Correct 0 ms 41240 KB Output is correct
34 Correct 0 ms 41240 KB Output is correct
35 Correct 0 ms 41240 KB Output is correct
36 Correct 0 ms 41240 KB Output is correct
37 Correct 0 ms 41240 KB Output is correct
38 Correct 0 ms 41240 KB Output is correct
39 Correct 0 ms 41240 KB Output is correct
40 Correct 0 ms 41240 KB Output is correct
41 Correct 0 ms 41240 KB Output is correct
42 Correct 0 ms 41240 KB Output is correct
43 Correct 0 ms 41240 KB Output is correct
44 Correct 0 ms 41240 KB Output is correct
45 Correct 0 ms 41240 KB Output is correct
46 Correct 0 ms 41240 KB Output is correct
47 Correct 0 ms 41240 KB Output is correct
48 Correct 0 ms 41240 KB Output is correct
49 Correct 0 ms 41240 KB Output is correct
50 Correct 0 ms 41240 KB Output is correct
51 Correct 0 ms 41240 KB Output is correct
52 Correct 0 ms 41240 KB Output is correct
53 Correct 0 ms 41240 KB Output is correct
54 Correct 0 ms 41240 KB Output is correct

Subtask #2
0 / 65.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 23 ms 44344 KB Execution killed because of forbidden syscall writev (20)
2 Halted 0 ms 0 KB -