제출 #398191

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
398191		4fecta	Ancient Machine (JOI21_ancient_machine)	C++17	0 / 100	82 ms	9052 KiB

Anna

#include "Anna.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define pii pair<int, int>
#define f first
#define s second
#define boost() cin.tie(0), cin.sync_with_stdio(0)

void Anna(int N, vector<char> S) {
    for (char c : S) {
        if (c == 'X') Send(0), Send(0);
        else if (c == 'Y') Send(0), Send(1);
        else Send(1), Send(0);
    }
}

Bruno

#include "Bruno.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define pii pair<int, int>
#define f first
#define s second
#define boost() cin.tie(0), cin.sync_with_stdio(0)

const int MN = 200005;

int n;
char a[MN];

void Bruno(int N, int L, vector<int> A) {
    assert(L == 2 * N);
    n = N;
    for (int i = 0; i < N; i++) {
        if (!A[i * 2] && !A[i * 2 + 1]) a[i] = 'X';
        else if (!A[i * 2]) a[i] = 'Y';
        else a[i] = 'Z';
    }
    stack<pii> s; //type, index
    for (int i = 0; i < n; i++) {
        if (a[i] == 'X') s.push({0, i});
        else if (a[i] == 'Y') {
            while (s.size() && s.top().f) Remove(s.top().s), s.pop();
            if (s.empty()) Remove(i);
            else s.push({1, i});
        } else {
            while (s.size() && s.top().f != 1) Remove(s.top().s), s.pop();
            if (s.size()) Remove(s.top().s), s.pop(), Remove(s.top().s), s.pop();
            Remove(i);
        }
    }
}

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