제출 #1326022

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1326022		PlayVoltz	Ancient Machine (JOI21_ancient_machine)	C++20	5 / 100	33 ms	6364 KiB

Anna

#include "Anna.h"
#include <bits/stdc++.h>
using namespace std;

#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define fi first
#define se second

void Anna(int n, vector<char> s){
	vector<int> res(n, 0);
	bool found=0;
	for (int i=0; i<n; ++i){
		if (!found){
			if (s[i]=='X')found=1, res[i]=1;
			continue;
		}
		if (s[i]=='Z'&&(i==n-1||s[i+1]!='Z')&&!(s[i-1]=='X'&&res[i-1]))res[i]=1;
	}
	for (auto a:res)Send(a);
}

Bruno

#include "Bruno.h"
#include <bits/stdc++.h>
using namespace std;

#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define fi first
#define se second

void Bruno(int n, int l, vector<int> a){
	vector<int> vect;
	for (int i=0; i<n; ++i)if (a[i])vect.pb(i);
	if (vect.size()<=1){
		for (int i=0; i<n; ++i)Remove(i);
		return;
	}
	for (int i=0; i<vect[0]; ++i)Remove(i);
	for (int i=vect.back()+1; i<n; ++i)Remove(i);
	for (int i=1; i<vect.size(); ++i){
		for (int j=vect[i]-1; j>vect[i-1]; --j)Remove(j);
		Remove(vect[i]);
	}
	Remove(vect[0]);
}

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