제출 #105583

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
105583		Leonardo_Paes	Three Friends (BOI14_friends)	C++11	0 / 100	1070 ms	6280 KiB

friends

#include <bits/stdc++.h>
 
using namespace std;
 
int mark[27];
 
int main(){
 
  map<string, int> m;
 
	int n;
 
	cin >> n;
 
 
		string t;
 
		cin >> t;
 
		for(int i=0; i<n; i++){
			mark[t[i]-'A']++;
		}
 
  	if(n%2==0){
		cout << "NOT POSSIBLE" << endl;
    return 0;
	}
 
		int x=-1;
 
    bool resp=true;
 
		for(int i=0; i<=26; i++){
			if(mark[i]%2==1){
        if(x!=-1)resp=false;
				x=i;
			}
		}
    if(resp==false){
      cout << "NOT POSSIBLE" << endl;
      return 0;
    }
    string y;
    string p;
    for(int i=0; i<n; i++){
 
      if(t[i]-'A'==x){
              int u=0;
      string h;
        for(int j=0; j<n; j++){
          if(i!=j){
            h+=t[j];
            u++;
          }
          if(u==(n-1)/2)break;
        }
        string q;

      for(int e=u; e<n; e++){
        if(e!=i)q+=t[e];
      }
      if(q==h and m.find(q)==m.end()){
        y=q;
        m[q]=2;
      }
      else{
          p="NOT UNIQUE\n";
      }
      }
    }
    if(resp==false){
      cout << "NOT POSSIBLE\n";
    }
    else if(p=="NOT UNIQUE\n"){
      cout << p;
    }
    else{
      cout << y << endl;
    }
	
 
}

• Subtask 1: 0 / 35
• Subtask 2: 0 / 65