oj.uz

답안 #43314

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
43314 2018-03-13T13:10:19 Z shihabsarar29 세 명의 친구들 (BOI14_friends) C++14
100 / 100
 101 ms 12560 KB 
#include<bits/stdc++.h>
using namespace std;

int main()
{
   string S,S1,S2,S3;
   int N,A;
   scanf("%d",&N);
   cin>>S;
   if(N%2==0){
      cout<<"NOT POSSIBLE\n";
      return 0;
   }
   A=N/2;
   for(int j=0,i=A;j<A && i<N;i++,j++){
      if(S[i]==S[j])
         S1+=S[i];
      else{
         for(int k=i+1,l=j;l<A && k<N;k++,l++){
            if(S[k]==S[l])
               S2+=S[k];
            else {
               S2.clear();
               break;
            }
         }
         if(S1.size()+S2.size()==A)
            S1+=S2;
         S2.clear();
         for(int k=i,l=j+1;l<A && k<N;k++,l++){
            if(S[k]==S[l])
               S2+=S[k];
            else {
               S2.clear();
               break;
            }
         }
         if(S1.size()+S2.size()==A)
            S1+=S2;
         S2.clear();
         break;
      }
   }
   for(int j=0,i=A+1;j<=A && i<N;i++,j++){
      if(S[i]==S[j])
         S3+=S[i];
      else{
         for(int k=i+1,l=j;l<=A && k<N;k++,l++){
            if(S[k]==S[l])
               S2+=S[k];
            else {
               S2.clear();
               break;
            }
         }
         if(S3.size()+S2.size()==A)
            S3+=S2;
         S2.clear();
         for(int k=i,l=j+1;l<=A && k<N;k++,l++){
            if(S[k]==S[l])
               S2+=S[k];
            else {
               S2.clear();
               break;
            }
         }
         if(S3.size()+S2.size()==A)
            S3+=S2;
         S2.clear();
         break;
      }
   }
   //cout<<S1<<endl;
   //cout<<S3<<endl;
   if(S1!=S3 && S1.size() == A && S3.size() == A)
      cout<<"NOT UNIQUE"<<endl;
   else if(S1.size()==A){
      cout<<S1<<endl;
   }
   else if(S3.size()==A){
      cout<<S3<<endl;
   }
   else
      cout<<"NOT POSSIBLE"<<endl;
   return 0;
}

Compilation message

friends.cpp: In function 'int main()':
friends.cpp:27:32: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
          if(S1.size()+S2.size()==A)
                                ^
friends.cpp:38:32: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
          if(S1.size()+S2.size()==A)
                                ^
friends.cpp:56:32: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
          if(S3.size()+S2.size()==A)
                                ^
friends.cpp:67:32: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
          if(S3.size()+S2.size()==A)
                                ^
friends.cpp:75:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    if(S1!=S3 && S1.size() == A && S3.size() == A)
                           ^
friends.cpp:75:45: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    if(S1!=S3 && S1.size() == A && S3.size() == A)
                                             ^
friends.cpp:77:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    else if(S1.size()==A){
                     ^
friends.cpp:80:21: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    else if(S3.size()==A){
                     ^
friends.cpp:8:18: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    scanf("%d",&N);
                  ^

Subtask #1
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 248 KB Output is correct
2 Correct 1 ms 352 KB Output is correct
3 Correct 1 ms 424 KB Output is correct
4 Correct 2 ms 496 KB Output is correct
5 Correct 2 ms 520 KB Output is correct
6 Correct 2 ms 520 KB Output is correct
7 Correct 1 ms 520 KB Output is correct
8 Correct 2 ms 520 KB Output is correct
9 Correct 2 ms 520 KB Output is correct
10 Correct 1 ms 520 KB Output is correct
11 Correct 1 ms 520 KB Output is correct
12 Correct 1 ms 520 KB Output is correct
13 Correct 2 ms 520 KB Output is correct
14 Correct 3 ms 584 KB Output is correct
15 Correct 1 ms 600 KB Output is correct
16 Correct 1 ms 600 KB Output is correct
17 Correct 1 ms 600 KB Output is correct
18 Correct 2 ms 600 KB Output is correct
19 Correct 1 ms 600 KB Output is correct
20 Correct 2 ms 600 KB Output is correct
21 Correct 2 ms 600 KB Output is correct
22 Correct 1 ms 600 KB Output is correct
23 Correct 1 ms 600 KB Output is correct
24 Correct 2 ms 600 KB Output is correct
25 Correct 2 ms 624 KB Output is correct
26 Correct 2 ms 656 KB Output is correct
27 Correct 2 ms 656 KB Output is correct
28 Correct 2 ms 656 KB Output is correct
29 Correct 2 ms 656 KB Output is correct
30 Correct 2 ms 656 KB Output is correct
31 Correct 2 ms 708 KB Output is correct
32 Correct 1 ms 708 KB Output is correct
33 Correct 1 ms 708 KB Output is correct
34 Correct 1 ms 708 KB Output is correct
35 Correct 1 ms 744 KB Output is correct
36 Correct 1 ms 752 KB Output is correct
37 Correct 2 ms 768 KB Output is correct
38 Correct 2 ms 768 KB Output is correct
39 Correct 2 ms 784 KB Output is correct
40 Correct 2 ms 784 KB Output is correct
41 Correct 2 ms 784 KB Output is correct
42 Correct 2 ms 784 KB Output is correct
43 Correct 2 ms 784 KB Output is correct
44 Correct 2 ms 796 KB Output is correct
45 Correct 2 ms 800 KB Output is correct
46 Correct 2 ms 800 KB Output is correct
47 Correct 2 ms 808 KB Output is correct
48 Correct 2 ms 808 KB Output is correct
49 Correct 2 ms 816 KB Output is correct
50 Correct 2 ms 816 KB Output is correct
51 Correct 2 ms 816 KB Output is correct
52 Correct 2 ms 828 KB Output is correct
53 Correct 2 ms 828 KB Output is correct
54 Correct 2 ms 828 KB Output is correct

Subtask #2
65.0 / 65.0

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