Submission #544612

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
544612	2022-04-02T13:35:54 Z	rainboy	Three Friends (BOI14_friends)	C	100 / 100	11 ms	5136 KB

friends

#include <stdio.h>
#include <string.h>

#define N	2000001

int solve(char *aa, char *bb, int n) {
	int i;

	i = 0;
	while (i < n && aa[i] == bb[i])
		i++;
	i++;
	while (i <= n && aa[i] == bb[i - 1])
		i++;
	return i > n;
}

int main() {
	static char cc[N + 1];
	int n, pref, suff;

	scanf("%d%s", &n, cc);
	if (n % 2 == 0) {
		printf("NOT POSSIBLE\n");
		return 0;
	}
	pref = solve(cc + n / 2, cc, n / 2);
	suff = solve(cc, cc + n / 2 + 1, n / 2);
	if (!pref && !suff)
		printf("NOT POSSIBLE\n");
	else if (pref && suff)
		printf("%s\n", strncmp(cc, cc + n / 2 + 1, n / 2) != 0 ? "NOT UNIQUE" : cc + n / 2 + 1);
	else if (pref) {
		cc[n / 2] = 0;
		printf("%s\n", cc);
	} else
		printf("%s\n", cc + n / 2 + 1);
	return 0;
}

Compilation message

friends.c: In function 'main':
friends.c:22:2: warning: ignoring return value of 'scanf' declared with attribute 'warn_unused_result' [-Wunused-result]
   22 |  scanf("%d%s", &n, cc);
      |  ^~~~~~~~~~~~~~~~~~~~~

Subtask #1

35.0 / 35.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	0 ms	292 KB	Output is correct
3	Correct	0 ms	292 KB	Output is correct
4	Correct	0 ms	212 KB	Output is correct
5	Correct	0 ms	212 KB	Output is correct
6	Correct	0 ms	292 KB	Output is correct
7	Correct	0 ms	340 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	0 ms	212 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	1 ms	212 KB	Output is correct
13	Correct	1 ms	292 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	0 ms	212 KB	Output is correct
17	Correct	0 ms	212 KB	Output is correct
18	Correct	0 ms	212 KB	Output is correct
19	Correct	0 ms	212 KB	Output is correct
20	Correct	0 ms	212 KB	Output is correct
21	Correct	0 ms	292 KB	Output is correct
22	Correct	0 ms	212 KB	Output is correct
23	Correct	0 ms	340 KB	Output is correct
24	Correct	0 ms	212 KB	Output is correct
25	Correct	1 ms	288 KB	Output is correct
26	Correct	0 ms	212 KB	Output is correct
27	Correct	1 ms	292 KB	Output is correct
28	Correct	0 ms	292 KB	Output is correct
29	Correct	0 ms	212 KB	Output is correct
30	Correct	0 ms	212 KB	Output is correct
31	Correct	1 ms	212 KB	Output is correct
32	Correct	0 ms	212 KB	Output is correct
33	Correct	0 ms	212 KB	Output is correct
34	Correct	0 ms	212 KB	Output is correct
35	Correct	0 ms	212 KB	Output is correct
36	Correct	0 ms	212 KB	Output is correct
37	Correct	0 ms	212 KB	Output is correct
38	Correct	0 ms	288 KB	Output is correct
39	Correct	1 ms	292 KB	Output is correct
40	Correct	0 ms	288 KB	Output is correct
41	Correct	0 ms	212 KB	Output is correct
42	Correct	0 ms	212 KB	Output is correct
43	Correct	0 ms	212 KB	Output is correct
44	Correct	0 ms	212 KB	Output is correct
45	Correct	0 ms	212 KB	Output is correct
46	Correct	1 ms	292 KB	Output is correct
47	Correct	0 ms	212 KB	Output is correct
48	Correct	0 ms	212 KB	Output is correct
49	Correct	0 ms	292 KB	Output is correct
50	Correct	1 ms	212 KB	Output is correct
51	Correct	0 ms	212 KB	Output is correct
52	Correct	1 ms	292 KB	Output is correct
53	Correct	0 ms	292 KB	Output is correct
54	Correct	0 ms	212 KB	Output is correct

Subtask #2

65.0 / 65.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	10 ms	5136 KB	Output is correct
2	Correct	11 ms	5084 KB	Output is correct
3	Correct	11 ms	5112 KB	Output is correct
4	Correct	10 ms	5108 KB	Output is correct
5	Correct	9 ms	5100 KB	Output is correct
6	Correct	9 ms	4084 KB	Output is correct
7	Correct	10 ms	5112 KB	Output is correct
8	Correct	8 ms	3788 KB	Output is correct
9	Correct	9 ms	4576 KB	Output is correct
10	Correct	10 ms	4592 KB	Output is correct
11	Correct	8 ms	3448 KB	Output is correct
12	Correct	1 ms	212 KB	Output is correct
13	Correct	0 ms	212 KB	Output is correct
14	Correct	0 ms	212 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	0 ms	292 KB	Output is correct
17	Correct	1 ms	212 KB	Output is correct
18	Correct	0 ms	212 KB	Output is correct
19	Correct	0 ms	212 KB	Output is correct
20	Correct	0 ms	212 KB	Output is correct
21	Correct	0 ms	212 KB	Output is correct
22	Correct	0 ms	212 KB	Output is correct
23	Correct	1 ms	212 KB	Output is correct
24	Correct	1 ms	212 KB	Output is correct
25	Correct	1 ms	212 KB	Output is correct
26	Correct	1 ms	212 KB	Output is correct
27	Correct	0 ms	292 KB	Output is correct
28	Correct	0 ms	212 KB	Output is correct
29	Correct	0 ms	212 KB	Output is correct
30	Correct	0 ms	212 KB	Output is correct
31	Correct	0 ms	212 KB	Output is correct
32	Correct	0 ms	288 KB	Output is correct
33	Correct	0 ms	212 KB	Output is correct
34	Correct	0 ms	212 KB	Output is correct
35	Correct	0 ms	212 KB	Output is correct
36	Correct	0 ms	292 KB	Output is correct
37	Correct	0 ms	212 KB	Output is correct
38	Correct	0 ms	212 KB	Output is correct
39	Correct	1 ms	212 KB	Output is correct
40	Correct	0 ms	212 KB	Output is correct
41	Correct	0 ms	292 KB	Output is correct
42	Correct	0 ms	288 KB	Output is correct
43	Correct	0 ms	212 KB	Output is correct
44	Correct	1 ms	292 KB	Output is correct
45	Correct	0 ms	212 KB	Output is correct
46	Correct	0 ms	212 KB	Output is correct
47	Correct	0 ms	212 KB	Output is correct
48	Correct	0 ms	212 KB	Output is correct
49	Correct	0 ms	212 KB	Output is correct
50	Correct	1 ms	224 KB	Output is correct
51	Correct	0 ms	212 KB	Output is correct
52	Correct	0 ms	212 KB	Output is correct
53	Correct	1 ms	212 KB	Output is correct
54	Correct	0 ms	212 KB	Output is correct