oj.uz

답안 #930699

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
930699 2024-02-20T09:42:46 Z yeehaw 세 명의 친구들 (BOI14_friends) C++17
100 / 100
 31 ms 9980 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long
// #pragma GCC optimize("O3,unroll-loops")
// #pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")

int32_t main(){
    ios::sync_with_stdio(0);cin.tie(0);
    int n;cin>>n;
    if(n%2==0){
        cout<<"NOT POSSIBLE";
        return 0;
    }
    int s=n/2;
    char a[n],a1[s+1],a2[s],b1[s+1],b2[s];
    for(int i=0;i<n;i++)cin>>a[i];
    for(int i=0;i<s+1;i++)a1[i]=a[i];
    for(int i=0;i<s;i++)a2[i]=a[i+s+1];
    for(int i=0;i<s;i++)b2[i]=a[i];
    for(int i=0;i<s+1;i++)b1[i]=a[i+s];
    // for(int i=0;i<s+1;i++)cout<<a1[i];
    // cout<<"\n";
    // for(int i=0;i<s;i++)cout<<a2[i];
    // cout<<"\n";
    // for(int i=0;i<s+1;i++)cout<<b1[i];
    // cout<<"\n";
    // for(int i=0;i<s;i++)cout<<b2[i];
    // cout<<"\n";
    string s1,s2;
    int c=0,one=1,two=1;
    for(int i=0;i<s;i++){
        if(a1[i+c]==a2[i])s1+=a2[i];
        else{
            if(c){
                one=0;
                break;
            }
            c++;
            i--;
        }
    }
    c=0;
    for(int i=0;i<s;i++){
        if(b1[i+c]==b2[i])s2+=b2[i];
        else{
            if(c){
                two=0;
                break;
            }
            c++;
            i--;
        }
    }
    if(one==0&&two==0)cout<<"NOT POSSIBLE";
    else if(one&&two){
        if(s1==s2)cout<<s1;
        else cout<<"NOT UNIQUE";
    }else{
        if(one)cout<<s1;
        else cout<<s2;
    }
}

Subtask #1
35.0 / 35.0

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

Subtask #2
65.0 / 65.0

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