oj.uz

Submission #931595

# Submission time Handle Problem Language Result Execution time Memory
931595 2024-02-22T06:22:21 Z lamter Ancient Machine (JOI21_ancient_machine) C++17
0 / 100
 40 ms 8240 KB 
#include "Anna.h"
#include <bits/stdc++.h>

void Anna(int n, std::vector <char> a) {
	bool found = 0;
	for (int i = 0; i < n; i += 1) {
		int bit = 0;

		if (not found and a[i] == 'X') {
			bit = 1;
			found = true;
		}

		if (a[i] == 'Z') {
			bit = 1;
		}

		Send(bit);
	}
}

#include "Bruno.h"
#include <bits/stdc++.h>

void Bruno(int n, int l, std::vector <int> a) {
	assert(n == l);
	std::vector <int> posOne;
	for (int i = 0; i < n; i += 1) if (a[i])
		posOne.push_back(i);
	assert(posOne.size());
	int x = posOne[0];
	for (int i = 0; i < x; i += 1) {
		Remove(i);
	}
	for (int i = 0; i + 1 < (int) posOne.size(); i += 1) {
		for (int j = posOne[i + 1] - 1; j > posOne[i]; j -= 1)
			Remove(j);
		Remove(posOne[i + 1]);
	}
	for (int j = posOne.back() + 1; j < n; j += 1) {
		Remove(j);
	}
	Remove(x);
}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 780 KB Output is correct
2 Correct 0 ms 796 KB Output is correct
3 Incorrect 0 ms 784 KB Wrong Answer [6]
4 Halted 0 ms 0 KB -

Subtask #2
0 / 95.0

# Verdict Execution time Memory Grader output
1 Partially correct 39 ms 7788 KB Partially correct
2 Incorrect 40 ms 8240 KB Wrong Answer [6]
3 Halted 0 ms 0 KB -