제출 #1153757

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1153757		aycnl	Ancient Machine (JOI21_ancient_machine)	C++20	0 / 100	40 ms	6384 KiB

Anna

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

#define ii pair <int, int>
#define ff first
#define ss second
#define bit(i) (1 << (i))

#define fto(i, a, b) for (int i = (a); i <= (b); ++i)
#define fdto(i, a, b) for (int i = (a); i >= (b); --i)
#define flto(i, a, b) for (int i = (a); (1 << i) <= (b); ++i)

#define pb push_back
#define pf push_front

#define endl "\n"
#define oo (int)(998244353)
#define maxN 305

#define l(s) s.length()

#define vi vector <int>
#define vii vector <ii>

#define fat(x, y) for (auto x : y)
#define fit(x, y) for (int x : y)
#define fiit(x, y) for (ii x : y)

#define EPS 1e-9
#define pi (acos(-1))
#define ll long long

void Anna(int N, std::vector<char> S) {
    int ok = 0, ko = 0;
    fto(i, 0, N-1) {
        if (S[i] != 'X' && !ok) {
            Send(0);
            continue;
        }
        if (!ok && S[i] == 'X') {
            Send(1);
            ok = 1;
            continue;
        }
        if (!ko) {
            if (S[i] == 'Y') ko = 1, Send(1);
            else Send(0);
            continue;
        }
        if (S[i] == 'Z') {
            ko = 0;
            Send(1);
        } else {
            Send(0);
        }
    }
}

Bruno

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

#define ii pair <int, int>
#define ff first
#define ss second
#define bit(i) (1 << (i))

#define fto(i, a, b) for (int i = (a); i <= (b); ++i)
#define fdto(i, a, b) for (int i = (a); i >= (b); --i)
#define flto(i, a, b) for (int i = (a); (1 << i) <= (b); ++i)

#define pb push_back
#define pf push_front

#define endl "\n"
#define oo (int)(998244353)
#define maxN 305

#define l(s) s.length()

#define vi vector <int>
#define vii vector <ii>

#define fat(x, y) for (auto x : y)
#define fit(x, y) for (int x : y)
#define fiit(x, y) for (ii x : y)

#define EPS 1e-9
#define pi (acos(-1))
#define ll long long

void Bruno(int N, int L, std::vector<int> A) {
    vi a;
    fto(i, 0, N-1) {
        if (A[i] == 0) Remove(i);
        else a.pb(i);
    }
    if (a.size() == 0) return;
    fto(i, 1, int(a.size()) - 1) Remove(a[i]);
    Remove(a[0]);
}

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