oj.uz

Submission #935547

# Submission time Handle Problem Language Result Execution time Memory
935547 2024-02-29T09:01:49 Z thieunguyenhuy Ancient Machine (JOI21_ancient_machine) C++17
0 / 100
 40 ms 7932 KB 
#include <bits/stdc++.h>
using namespace std;

#ifndef hwe
    #include "Anna.h"
#endif // hwe

void Send(int a);

void Anna(int n, vector<char> S) {
    int p = 0;
    while (p < n && S[p] != 'X') {
        Send(0); ++p;
    }

    while (p < n) {
        Send(1);
        if (p + 1 < n) Send(0);
        p += 2;
        while (p < n && S[p] != 'Z') {
            Send(0), ++p;
        }
    }
}
#include <bits/stdc++.h>
using namespace std;

#ifndef hwe
    #include "Bruno.h"
#endif // hwe

#define MASK(n) (1ll << (n))
#define BIT(n, i) ((n) >> (i) & 1)
#define FLIP(n, i) ((n) ^ (1ll << (i)))

bool maximize(int &x, int y) {
    if (x < y) {
        x = y;
        return true;
    }
    return false;
}

void Remove(int d);

void Bruno(int n, int L, vector<int> A) {
//    for (auto &x : A) cout << x << ' ';
//    cout << '\n';

    int p = 0;
    while (p < n && A[p] == 0) {
        Remove(p), ++p;
    }

    int start = p;
    while (p < n) {
        int cur = p; p += 2;
        while (p < n && A[p] == 0) ++p;
        for (int i = min(n, p) - 1; i > cur; --i) {
            Remove(i);
        }
        if (p < n) Remove(p);
    }
    Remove(start);
}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 788 KB Wrong Answer [6]
2 Halted 0 ms 0 KB -

Subtask #2
0 / 95.0

# Verdict Execution time Memory Grader output
1 Incorrect 40 ms 7932 KB Wrong Answer [6]
2 Halted 0 ms 0 KB -