제출 #548013

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
548013		SamNguyen	Ancient Machine (JOI21_ancient_machine)	C++17	0 / 100	45 ms	7996 KiB

Anna

#include "Anna.h"
#include <vector>
#include <iostream>
using namespace std;

void Anna(int N, vector<char> S) {
	char target = 'X';

	for (int i = 0; i < N; target = target ^ 'X' ^ 'Z') {
		int j = i;	
		while (j < N and S[j] != target) {
			Send(0);
			j++;
		}
		if (j >= N) break;

		Send(1);
		i = j + 1;
	}
}

Bruno

#include "Bruno.h"
#include <vector>
#include <string>
#include <cstring>
#include <iostream>
#include <bitset>
using namespace std;

namespace {
	
}

void Bruno(int N, int L, std::vector<int> A) {
	vector<int> check_points;

	for (int i = 0; i < L; i++) 
		if (A[i])
			check_points.push_back(i);

	if (check_points.size() & 1)
		check_points.pop_back();

	for (int i = 0; i < (int)check_points.size(); i += 2) {
		for (int j = check_points[i + 1] - 1; j > check_points[i]; j--)
			Remove(j);
	}

	for (int i = 1; i < (int)check_points.size(); i += 2) {
		Remove(check_points[i]);
		Remove(check_points[i + 1]);
		for (int j = check_points[i] + 1; j < check_points[i + 1]; j++)
			Remove(j);
	}

	for (int j = 0; j < check_points.front(); j++)
		Remove(j);

	for (int j = N - 1; j > check_points.back(); j--)
		Remove(j);
}

• Subtask 1: 0 / 5
• Subtask 2: 0 / 95