Compeititive-Programming/1092C.cpp at master · dharmeshprataps/Compeititive-Programming · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
#include<bits/stdc++.h>
using namespace std;
int main(){
    int n;
    cin>>n;
    int p=2*n-2;
    string s[p];
    string s1[2];
    unordered_map<int,char>um;
    int j=0;
    for(int i=0;i<p;i++){
        cin>>s[i];
        if(s[i].length()==n-1){
            s1[j++]=s[i];
        }
    }
    string pr,su;
    string t=s1[0][0]+s1[1];
    int f2=0;
    for(int i=0;i<p;i++){
        int f=0,f1=0;
        for(int i1=0;i1<s[i].length();i1++){
            if(s[i][i1]!=t[i1]){
                f=1;
                break;
            }
        }
        int ko=t.length()-1;
        for(int i1=s[i].length()-1;i1>=0;i1--){
            if(s[i][i1]!=t[ko--]){
                f1=1;
                break;
            }
        }
        if(f && f1){
            f2=1;
            break;
        }
    }
    if(f2){
        pr=s1[1];
        su=s1[0];
    }
    else{
        su=s1[1];
        pr=s1[0];
    }
    cout<<pr[0]+su<<"\n";
    string t1="";
    for(int i=0;i<p;i++){
        if(um[s[i].length()]){
            t1+=um[s[i].length()];
            continue;
        }
        if(s[i]==pr){
            t1+='P';
        }
        else if(s[i]==su){
            t1+='S';
        }
        else{
            int f=1;
            int l=s[i].length()-1;
            int m=su.length()-1;
            for(int i1=0;i1<s[i].length();i1++){
                if(s[i][l--]!=su[m--]){
                    t1+='P';
                    f=0;
                    break;
                }
                if(s[i][i1]!=pr[i1]){
                    t1+='S';
                    f=0;
                    break;
                }
            }
            if(f)
            t1+='P';
        }
        if(t1[t1.length()-1]=='P')
        um[s[i].length()]='S';
        else
        um[s[i].length()]='P';
    }
    cout<<t1<<"\n";
}