oj.uz

답안 #107564

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
107564 2019-04-25T07:58:39 Z patrikpavic2 세 명의 친구들 (BOI14_friends) C++17
100 / 100
 69 ms 6136 KB 
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <ctime>
#include <algorithm>
#include <set>
#include <vector>
#include <queue>
#include <map>

#define X first
#define Y second
#define PB push_back

using namespace std;

typedef long long ll;
typedef long double ld;
typedef pair < int, int > pii;
typedef vector < int > vi;
typedef set < int > si;

const int N = 1e5 + 500;
const int M = 1e6 + 500;
const int INF = 0x3f3f3f3f;
const int MOD = 1e9 + 7;
const int OFF = (1 << 18);
const int LOG = 20;
const double EPS = 1e-9;
const double PI = 3.1415926535;

char s[2 * M], ans[2 * M];
int cnt, n, can = 0;

int main(){
    scanf("%d", &n);
    if(n % 2 == 0){
        printf("NOT POSSIBLE\n");
        return 0;
    }
    scanf("%s", s);
    int j = n / 2;
    for(int i = 0;2 * i + 1 < n;i++,j++){
        if(s[i] != s[j]) cnt++,i--;
        if(cnt > 1) break;
    }
    if(cnt <= 1){
        for(int i = 0;2 * i + 1 < n;i++)
            ans[i] = s[i];
        can++;
    }
    cnt = 0;j = 0;
    for(int i = n / 2 + 1;i < n;i++,j++){
        if(s[i] != s[j]) cnt++,i--;
        if(cnt > 1) break;
    }
    if(cnt <= 1){
        for(int i = n / 2 + 1;i < n;i++){
            if(ans[i - n / 2  - 1] != s[i] && can){
                printf("NOT UNIQUE\n");
                return 0;
            }
            ans[i - n / 2  - 1] = s[i];
        }
        can++;
    }

    if(!can) printf("NOT POSSIBLE\n");
    else{
        for(int i = 0;2 * i + 1 < n;i++)
            printf("%c", ans[i]);
        printf("\n");
    }
    return 0;
}

Compilation message

friends.cpp: In function 'int main()':
friends.cpp:36:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &n);
     ~~~~~^~~~~~~~~~
friends.cpp:41:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%s", s);
     ~~~~~^~~~~~~~~

Subtask #1
35.0 / 35.0

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

Subtask #2
65.0 / 65.0

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