제출 #1151164

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1151164		iah	Ancient Machine (JOI21_ancient_machine)	C++20	70 / 100	44 ms	6488 KiB

Anna

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

#define ll long long
#define pii pair < int , int >
#define fi first
#define se second
#define FOR(i, a, b) for (int i = (a), _b = (b); i <= _b; i ++)
#define FORD(i, a, b) for (int i = (a), _b = (b); i >= _b; i --)
#define REP(i, n) for (int i = 0, _n = (n); i < _n; i ++)
#define bit(x, i) (((x) >> (i)) & 1ll)
#define mask(x) (1ll << (x))
#define mem(f, x) memset(f, x, sizeof(f))
#define sz(x) (int32_t) (x.size())

void Anna(int N, std::vector<char> S) {
  bool used = 0;
  for (auto x: S) {
    if (x == 'X' && !used) {
      Send(1);
      used = 1;
    }
    else if (x == 'Z' && used) {
      Send(1);
    }
    else {
      Send(0);
    }
  }
}

Bruno

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

#define ll long long
#define pii pair < int , int >
#define fi first
#define se second
#define FOR(i, a, b) for (int i = (a), _b = (b); i <= _b; i ++)
#define FORD(i, a, b) for (int i = (a), _b = (b); i >= _b; i --)
#define REP(i, n) for (int i = 0, _n = (n); i < _n; i ++)
#define bit(x, i) (((x) >> (i)) & 1ll)
#define mask(x) (1ll << (x))
#define mem(f, x) memset(f, x, sizeof(f))
#define sz(x) (int32_t) (x.size())

void Bruno(int N, int L, std::vector<int> A) {

  vector < int > pos;
  REP(i, L) {
    if (A[i]) {
      pos.push_back(i);
    }
  }

  if (!sz(pos)) {
    REP(i, N) {
      Remove(i);
    }
    return;
  }

  REP(i, pos[0]) {
    Remove(i);
  }

  FOR(i, 1, sz(pos) - 1) {
    FORD(j, pos[i] - 1, pos[i - 1] + 1) {
      Remove(j);
    }
    Remove(pos[i]);
  }

  FOR(i, pos[sz(pos) - 1] + 1, N - 1) {
    Remove(i);
  }

  Remove(pos[0]);
}

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