Submission #666493

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
666493	2022-11-28T17:47:10 Z	rainboy	Ancient Machine (JOI21_ancient_machine)	C++17	70 / 100	66 ms	8280 KB

Anna

#include "Anna.h"
#include <vector>

using namespace std;

typedef vector<char> str;

namespace {}

void Anna(int n, str cc) {
	str aa(n, 0);
	int ix = 0;
	while (ix < n && cc[ix] != 'X')
		ix++;
	int iz = n - 1;
	while (iz >= 0 && cc[iz] != 'Z')
		iz--;
	if (ix < iz) {
		aa[ix] = 1;
		for (int i = ix + 1; i < iz; i++)
			if (cc[i] == 'Z' && cc[i + 1] == 'Y')
				aa[i] = 1;
		aa[iz] = 1;
	}
	for (int i = 0; i < n; i++)
		Send(aa[i]);
}

Bruno

#include "Bruno.h"
#include <vector>

using namespace std;

typedef vector<int> vi;

namespace {}

void Bruno(int n, int l, vi aa) {
	int ix = 0;
	while (ix < n && aa[ix] == 0)
		ix++;
	if (ix == n) {
		for (int i = 0; i < n; i++)
			Remove(i);
		return;
	}
	int iz = n - 1;
	while (iz >= 0 && aa[iz] == 0)
		iz--;
	for (int h = ix, i = ix + 1; i <= iz; i++)
		if (aa[i] == 1) {
			for (int j = i - 1; j > h; j--)
				Remove(j);
			h = i + 1;
		}
	for (int i = ix + 1; i <= iz; i++)
		if (aa[i] == 1) {
			Remove(i);
			if (i < iz)
				Remove(i + 1);
		}
	for (int i = ix; i >= 0; i--)
		Remove(i);
	for (int i = iz + 1; i < n; i++)
		Remove(i);
}

Subtask #1

5.0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	504 KB	Output is correct
2	Correct	1 ms	604 KB	Output is correct
3	Correct	0 ms	512 KB	Output is correct
4	Correct	0 ms	520 KB	Output is correct
5	Correct	0 ms	588 KB	Output is correct
6	Correct	1 ms	512 KB	Output is correct
7	Correct	0 ms	512 KB	Output is correct
8	Correct	1 ms	520 KB	Output is correct
9	Correct	1 ms	588 KB	Output is correct
10	Correct	1 ms	592 KB	Output is correct
11	Correct	0 ms	512 KB	Output is correct

Subtask #2

65.0 / 95.0

#	Verdict	Execution time	Memory	Grader output
1	Partially correct	52 ms	8184 KB	Partially correct
2	Partially correct	52 ms	8108 KB	Partially correct
3	Partially correct	52 ms	8180 KB	Partially correct
4	Partially correct	52 ms	8232 KB	Partially correct
5	Partially correct	57 ms	8220 KB	Partially correct
6	Partially correct	53 ms	8172 KB	Partially correct
7	Partially correct	55 ms	8216 KB	Partially correct
8	Partially correct	51 ms	8188 KB	Partially correct
9	Partially correct	52 ms	8212 KB	Partially correct
10	Partially correct	57 ms	8124 KB	Partially correct
11	Partially correct	53 ms	8124 KB	Partially correct
12	Partially correct	50 ms	8220 KB	Partially correct
13	Partially correct	62 ms	8160 KB	Partially correct
14	Partially correct	60 ms	8204 KB	Partially correct
15	Partially correct	63 ms	8084 KB	Partially correct
16	Partially correct	51 ms	8120 KB	Partially correct
17	Partially correct	63 ms	8280 KB	Partially correct
18	Partially correct	60 ms	8140 KB	Partially correct
19	Partially correct	62 ms	8232 KB	Partially correct
20	Partially correct	49 ms	8124 KB	Partially correct
21	Partially correct	52 ms	8260 KB	Partially correct
22	Partially correct	60 ms	8208 KB	Partially correct
23	Partially correct	51 ms	8224 KB	Partially correct
24	Partially correct	50 ms	8224 KB	Partially correct
25	Partially correct	60 ms	8220 KB	Partially correct
26	Partially correct	57 ms	8236 KB	Partially correct
27	Partially correct	66 ms	8176 KB	Partially correct
28	Partially correct	65 ms	8268 KB	Partially correct
29	Partially correct	57 ms	8188 KB	Partially correct
30	Partially correct	57 ms	8120 KB	Partially correct
31	Partially correct	59 ms	8068 KB	Partially correct
32	Partially correct	52 ms	8184 KB	Partially correct
33	Partially correct	50 ms	8252 KB	Partially correct