oj.uz

Submission #1072778

# Submission time Handle Problem Language Result Execution time Memory
1072778 2024-08-24T04:28:22 Z GusterGoose27 Ancient Machine (JOI21_ancient_machine) C++17
69 / 100
 68 ms 9468 KB 
#include "Anna.h"

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

#define sz(s) (int(s.size()))

void Anna(int n, vector<char> S) {
    vector<int> conv;
    int p = 1;
    for (int i = 0; i < n && S[i] != 'X'; i++) S[i] = 'Y';
    int r = n-1;
    for (; r >= 0 && S[r] != 'Z'; r--) S[r] = 'Y';
    if (r < 2) return;
    for (char c: S) {
        int v = c-'X';
        if ((v&1)==(p&1)) conv.push_back(1);
        else {
            conv.push_back(v);
            p = v;
        }
    }
    bool real = S[r-1] == 'Y';
    conv.resize(r);
    conv.push_back(1);
    for (int i = 0; i < sz(conv); i++) {
        if (conv[i] == 1) Send(0);
        else {
            Send(1);
            Send(conv[i] == 2);
            i++;
        }
    }
    Send(real);
}

#include "Bruno.h"
#include <bits/stdc++.h>

using namespace std;

#define sz(s) (int(s.size()))

void Bruno(int n, int l, vector<int> A) {
    if (sz(A) == 0) {
        for (int i = 0; i < n; i++) Remove(i);
        return;
    }
    vector<int> tp;
    set<int> xz, y;
    for (int i = 0; i < l-1; i++) {
        if (A[i] == 0) tp.push_back(1);
        else {
            i++;
            tp.push_back(2*A[i]);
            tp.push_back(1);
        }
    }
    int r = sz(tp)-1;
    tp[r] = 2;
    while (sz(tp) < n) tp.push_back(1);
    for (int i = 0; i < n; i++) {
        if (tp[i]&1) y.insert(i);
        else xz.insert(i);
    }
    auto del = [&](int v) {
        if (tp[v]&1) {
            if (y.find(v) == y.end()) return;
            y.erase(v);
        }
        else {
            if (xz.find(v) == xz.end()) return;
            xz.erase(v);
        }
        Remove(v);
    };
    if (!A[l-1]) {
        auto x = xz.find(r);
        int v = *(--x);
        for (; v < r; v++) del(v);
    }
    if (sz(xz) > 1) {
        int lim = *(xz.begin());
        for (int s = *(xz.begin()); s != *(xz.rbegin()); ) {
            int nxt = *(xz.upper_bound(s));
            if (nxt == r) break;
            if (tp[nxt] == 0) {
                s = nxt;
                lim = nxt;
                continue;
            }
            for (int i = lim+1; i <= nxt; i++) del(i);
            lim = nxt;
        }
        int s = *(xz.rbegin());
        lim = s;
        while (sz(xz) > 1) {
            int p = *(--xz.find(s));
            for (int i = p+1; i < lim; i++) del(i);
            del(p);
            lim = p;
        }
    }
    for (int i = 0; i < n; i++) del(i);
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 776 KB Output is correct
2 Correct 0 ms 780 KB Output is correct
3 Correct 1 ms 792 KB Output is correct
4 Correct 0 ms 792 KB Output is correct
5 Correct 0 ms 780 KB Output is correct
6 Correct 0 ms 780 KB Output is correct
7 Correct 0 ms 788 KB Output is correct
8 Correct 0 ms 792 KB Output is correct
9 Correct 0 ms 788 KB Output is correct
10 Correct 1 ms 776 KB Output is correct
11 Correct 0 ms 792 KB Output is correct

Subtask #2
64.0 / 95.0

# Verdict Execution time Memory Grader output
1 Partially correct 67 ms 8852 KB Partially correct
2 Partially correct 55 ms 8828 KB Partially correct
3 Partially correct 55 ms 8824 KB Partially correct
4 Partially correct 53 ms 8824 KB Partially correct
5 Partially correct 55 ms 9020 KB Partially correct
6 Partially correct 54 ms 8876 KB Partially correct
7 Partially correct 54 ms 9108 KB Partially correct
8 Partially correct 55 ms 8820 KB Partially correct
9 Partially correct 53 ms 8812 KB Partially correct
10 Partially correct 60 ms 8880 KB Partially correct
11 Partially correct 54 ms 8912 KB Partially correct
12 Partially correct 56 ms 9196 KB Partially correct
13 Partially correct 62 ms 8832 KB Partially correct
14 Partially correct 68 ms 8812 KB Partially correct
15 Partially correct 58 ms 9248 KB Partially correct
16 Partially correct 62 ms 9296 KB Partially correct
17 Correct 33 ms 6808 KB Output is correct
18 Correct 35 ms 6896 KB Output is correct
19 Correct 32 ms 7048 KB Output is correct
20 Partially correct 59 ms 9204 KB Partially correct
21 Partially correct 60 ms 9076 KB Partially correct
22 Partially correct 60 ms 9468 KB Partially correct
23 Partially correct 59 ms 9392 KB Partially correct
24 Partially correct 58 ms 9276 KB Partially correct
25 Correct 32 ms 6796 KB Output is correct
26 Correct 33 ms 7492 KB Output is correct
27 Correct 36 ms 6984 KB Output is correct
28 Correct 32 ms 6820 KB Output is correct
29 Correct 31 ms 6928 KB Output is correct
30 Correct 31 ms 6976 KB Output is correct
31 Correct 30 ms 6848 KB Output is correct
32 Partially correct 60 ms 9012 KB Partially correct
33 Partially correct 53 ms 9364 KB Partially correct