Submission #730269

#	Time	Username	Problem	Language	Result	Execution time	Memory
730269		myrcella	Ancient Machine (JOI21_ancient_machine)	C++17	70 / 100	80 ms	8752 KiB

Anna

//by szh
#include<bits/stdc++.h>
using namespace std;

#define fi first
#define se second
#define pii pair<int,int>
#define pll pair<long long,long long>
#define pb push_back
#define debug(x) cerr<<#x<<"="<<x<<endl
#define pq priority_queue
#define inf 0x3f
#define rep(i,a,b) for (int i=a;i<(b);i++)
#define MP make_pair
#define SZ(x) (int(x.size()))
#define ll long long
#define mod 1000000007
#define ALL(x) x.begin(),x.end()
void inc(int &a,int b) {a=(a+b)%mod;}
void dec(int &a,int b) {a=(a-b+mod)%mod;}
int lowbit(int x) {return x&(-x);}
ll p0w(ll base,ll p) {ll ret=1;while(p>0){if (p%2ll==1ll) ret=ret*base%mod;base=base*base%mod;p/=2ll;}return ret;}

#include "Anna.h"

void Anna(int N, std::vector<char> S) {
	bool ok = false;
	vector <int> tmp;
	for (int i = N-1;i>=0;i--) {
		if (S[i]=='Z') tmp.pb(1),ok = true;
		else if (ok and S[i]=='Y') tmp.pb(1);
		else ok = false,tmp.pb(0);
	}
	while (!tmp.empty()) Send(tmp.back()),tmp.pop_back();
	return;
}

Bruno

//by szh
#include<bits/stdc++.h>
using namespace std;

#define fi first
#define se second
#define pii pair<int,int>
#define pll pair<long long,long long>
#define pb push_back
#define debug(x) cerr<<#x<<"="<<x<<endl
#define pq priority_queue
#define inf 0x3f
#define rep(i,a,b) for (int i=a;i<(b);i++)
#define MP make_pair
#define SZ(x) (int(x.size()))
#define ll long long
#define mod 1000000007
#define ALL(x) x.begin(),x.end()
void inc(int &a,int b) {a=(a+b)%mod;}
void dec(int &a,int b) {a=(a-b+mod)%mod;}
int lowbit(int x) {return x&(-x);}
ll p0w(ll base,ll p) {ll ret=1;while(p>0){if (p%2ll==1ll) ret=ret*base%mod;base=base*base%mod;p/=2ll;}return ret;}

#include "Bruno.h"

void Bruno(int N, int L, std::vector<int> A) {
	int pos = -1;
	for (int i=L-1;i>=0;i--) if (A[i]==1) {
		pos = i;
		break;
	}
	rep(i,0,pos) if (A[i]==1) Remove(i);
	for (int i=N-1;i>=0;i--) if (A[i]==0) Remove(i);
	if (pos!=-1) Remove(pos);
}

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