Submission #405289

#	Time	Username	Problem	Language	Result	Execution time	Memory
405289		ryansee	Ancient Machine (JOI21_ancient_machine)	C++17	0 / 100	99 ms	9172 KiB

Anna

#include "Anna.h"

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

#define FAST ios_base::sync_with_stdio(false); cin.tie(0);
#define pb push_back
#define eb emplace_back
#define ins insert
#define f first
#define s second
#define cbr cerr<<"hi\n"
#define mmst(x, v) memset((x), v, sizeof ((x)))
#define siz(x) ll(x.size())
#define all(x) (x).begin(), (x).end()
#define lbd(x,y) (lower_bound(all(x),y)-x.begin())
#define ubd(x,y) (upper_bound(all(x),y)-x.begin())
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
inline long long rand(long long x, long long y) { return rng() % (y+1-x) + x; } //inclusive
string inline to_string(char c) {string s(1,c);return s;} template<typename T> inline T gcd(T a,T b){ return a==0?llabs(b):gcd(b%a,a); }

using ll=long long;
using ld=long double;
#define FOR(i,s,e) for(ll i=s;i<=ll(e);++i)
#define DEC(i,s,e) for(ll i=s;i>=ll(e);--i)
using pi=pair<ll,ll>; using spi=pair<ll,pi>; using dpi=pair<pi,pi>; 

namespace {
	long long LLINF = 1e18;
	int INF = 1e9+1e6;
	#define MAXN (200006)
}

void Anna(int N, std::vector<char> S) {
	FOR(i,0,N-1) {
		if(S[i] == 'X') Send(0), Send(0);
		else if(S[i] == 'Y') Send(0), Send(1);
		else Send(1), Send(0);
	}
}

Bruno

#include "Bruno.h"

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

#define FAST ios_base::sync_with_stdio(false); cin.tie(0);
#define pb push_back
#define eb emplace_back
#define ins insert
#define f first
#define s second
#define cbr cerr<<"hi\n"
#define mmst(x, v) memset((x), v, sizeof ((x)))
#define siz(x) ll(x.size())
#define all(x) (x).begin(), (x).end()
#define lbd(x,y) (lower_bound(all(x),y)-x.begin())
#define ubd(x,y) (upper_bound(all(x),y)-x.begin())
// mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
// inline long long rand(long long x, long long y) { return rng() % (y+1-x) + x; } //inclusive
string inline to_string(char c) {string s(1,c);return s;} template<typename T> inline T gcd(T a,T b){ return a==0?llabs(b):gcd(b%a,a); }

using ll=long long;
using ld=long double;
#define FOR(i,s,e) for(ll i=s;i<=ll(e);++i)
#define DEC(i,s,e) for(ll i=s;i>=ll(e);--i)
using pi=pair<ll,ll>; using spi=pair<ll,pi>; using dpi=pair<pi,pi>; 

namespace {
	long long LLINF = 1e18;
	int INF = 1e9+1e6;
	#define MAXN (200006)
}

void Bruno(int n, int L, vector<int> I) {
	vector<char> A;
	for(int i=0;i<L;i+=2) {
		ll ans = I[i] * 2 + I[i+1];
		if(ans==0) A.eb('X');
		else if(ans==1) A.eb('Y');
		else A.eb('Z');
	}
	assert(A.size() == n);
	stack<int> stk;
	int Ys = 0;
	FOR(i,0,n-1) {
		if(A[i] == 'X') {
			stk.emplace(i);
		} else if(A[i] == 'Y') {
			++ Ys;
			if(stk.size()) stk.emplace(i);
			else Remove(i);
		} else {
			while(stk.size() && A[stk.top()] == 'X') Remove(stk.top()), stk.pop();
			while(stk.size() && Ys) Remove(stk.top()), Ys -= A[stk.top()] == 'Y', stk.pop();
			Remove(i);
		}
	}
	while(stk.size()) Remove(stk.top()), stk.pop();
	return;
}

Compilation message (stderr)

Anna.cpp:30:6: warning: '{anonymous}::INF' defined but not used [-Wunused-variable]
   30 |  int INF = 1e9+1e6;
      |      ^~~
Anna.cpp:29:12: warning: '{anonymous}::LLINF' defined but not used [-Wunused-variable]
   29 |  long long LLINF = 1e18;
      |            ^~~~~

In file included from /usr/include/c++/10/cassert:44,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:33,
                 from Bruno.cpp:3:
Bruno.cpp: In function 'void Bruno(int, int, std::vector<int>)':
Bruno.cpp:42:18: warning: comparison of integer expressions of different signedness: 'std::vector<char>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   42 |  assert(A.size() == n);
      |         ~~~~~~~~~^~~~
Bruno.cpp: At global scope:
Bruno.cpp:30:6: warning: '{anonymous}::INF' defined but not used [-Wunused-variable]
   30 |  int INF = 1e9+1e6;
      |      ^~~
Bruno.cpp:29:12: warning: '{anonymous}::LLINF' defined but not used [-Wunused-variable]
   29 |  long long LLINF = 1e18;
      |            ^~~~~

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