제출 #548000

#제출 시각아이디문제언어결과실행 시간메모리
548000SamNguyenAncient Machine (JOI21_ancient_machine)C++17
0 / 100
55 ms8096 KiB
#include "Anna.h"
#include <vector>
#include <iostream>
#include <math.h>
using namespace std;

void Anna(int N, vector<char> S) {
	const int MAX_BIT = log2(N - 1);

	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;
	}
}
#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);

	check_points.push_back(N);

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

		if (check_points[i] < N)
			Remove(check_points[i]);
	}

	for (int j = 0; j <= check_points[0]; j++)
		Remove(j);
}

컴파일 시 표준 에러 (stderr) 메시지

Anna.cpp: In function 'void Anna(int, std::vector<char>)':
Anna.cpp:8:12: warning: unused variable 'MAX_BIT' [-Wunused-variable]
    8 |  const int MAX_BIT = log2(N - 1);
      |            ^~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...