Submission #798374

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
798374	2023-07-30T16:14:26 Z	ymm	Ancient Machine (JOI21_ancient_machine)	C++17	70 / 100	47 ms	8400 KB

Anna

#include "Anna.h"
#include <bits/stdc++.h>
#define Loop(x,l,r) for (ll x = (l); x < (r); ++x)
#define LoopR(x,l,r) for (ll x = (r)-1; x >= (l); --x)
typedef long long ll;
using namespace std;

namespace {

int variable_example = 0;

}

void Anna(int N, std::vector<char> S) {
	int p = 0;
	while (p < N && S[p] != 'X')
		++p;
	if (p == N) {
		Loop (i,0,N)
			Send(0);
		return;
	}
	Loop (i,0,p)
		Send(0);
	Send(1);
	Loop (i,p+1,N)
		Send(S[i] == 'Z');
}

Bruno

#include "Bruno.h"
#include <bits/stdc++.h>
#define Loop(x,l,r) for (ll x = (l); x < (r); ++x)
#define LoopR(x,l,r) for (ll x = (r)-1; x >= (l); --x)
typedef long long ll;
using namespace std;

namespace {

int variable_example = 0;

int FunctionExample(int P) { return 1 - P; }

}  // namespace

void Bruno(int N, int L, std::vector<int> A) {
	int p = 0;
	while (p < N && !A[p])
		++p;
	if (p == N) {
		Loop (i,0,N)
			Remove(i);
		return;
	}
	int lst = p+1;
	Loop (p2,p+1,N) {
		if (!A[p2])
			continue;
		LoopR (j,lst,p2)
			Remove(j);
		Remove(p2);
		lst = p2+1;
	}
	Loop (i,0,p+1)
		Remove(i);
	Loop (i,lst,N)
		Remove(i);
}

Compilation message

Anna.cpp:10:5: warning: '{anonymous}::variable_example' defined but not used [-Wunused-variable]
   10 | int variable_example = 0;
      |     ^~~~~~~~~~~~~~~~

Bruno.cpp:12:5: warning: 'int {anonymous}::FunctionExample(int)' defined but not used [-Wunused-function]
   12 | int FunctionExample(int P) { return 1 - P; }
      |     ^~~~~~~~~~~~~~~
Bruno.cpp:10:5: warning: '{anonymous}::variable_example' defined but not used [-Wunused-variable]
   10 | int variable_example = 0;
      |     ^~~~~~~~~~~~~~~~

Subtask #1

5.0 / 5.0

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

Subtask #2

65.0 / 95.0

#	Verdict	Execution time	Memory	Grader output
1	Partially correct	42 ms	8400 KB	Partially correct
2	Partially correct	39 ms	8100 KB	Partially correct
3	Partially correct	39 ms	8116 KB	Partially correct
4	Partially correct	39 ms	8136 KB	Partially correct
5	Partially correct	39 ms	8108 KB	Partially correct
6	Partially correct	41 ms	8092 KB	Partially correct
7	Partially correct	39 ms	8068 KB	Partially correct
8	Partially correct	39 ms	8012 KB	Partially correct
9	Partially correct	40 ms	8116 KB	Partially correct
10	Partially correct	39 ms	8052 KB	Partially correct
11	Partially correct	40 ms	8096 KB	Partially correct
12	Partially correct	39 ms	8068 KB	Partially correct
13	Partially correct	45 ms	8088 KB	Partially correct
14	Partially correct	45 ms	8108 KB	Partially correct
15	Partially correct	40 ms	8004 KB	Partially correct
16	Partially correct	40 ms	8080 KB	Partially correct
17	Partially correct	47 ms	8064 KB	Partially correct
18	Partially correct	44 ms	8092 KB	Partially correct
19	Partially correct	44 ms	8076 KB	Partially correct
20	Partially correct	40 ms	8056 KB	Partially correct
21	Partially correct	40 ms	8244 KB	Partially correct
22	Partially correct	44 ms	8180 KB	Partially correct
23	Partially correct	38 ms	8156 KB	Partially correct
24	Partially correct	38 ms	8208 KB	Partially correct
25	Partially correct	44 ms	8000 KB	Partially correct
26	Partially correct	44 ms	8112 KB	Partially correct
27	Partially correct	45 ms	8116 KB	Partially correct
28	Partially correct	45 ms	8096 KB	Partially correct
29	Partially correct	44 ms	8144 KB	Partially correct
30	Partially correct	44 ms	8220 KB	Partially correct
31	Partially correct	44 ms	8120 KB	Partially correct
32	Partially correct	40 ms	8152 KB	Partially correct
33	Partially correct	40 ms	8116 KB	Partially correct