oj.uz

Submission #710490

# Submission time Handle Problem Language Result Execution time Memory
710490 2023-03-15T09:32:25 Z tanprodium Ancient Machine (JOI21_ancient_machine) C++17
30 / 100
 92 ms 10468 KB 
#include "Anna.h"
#include<bits/stdc++.h>

using namespace std;

/*void Send(int a) {
    cout << a << ' ';
}*/

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

/*void solve() {
    int n;
    string s;
    vector<char> vs;
    cin >> n >> s;

    for (int i = 0; i < n; i++)
        vs.push_back(s[i]);

    Anna(n, vs);
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0); cout.tie(0);
    solve();
    return 0;
}*/

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

using namespace std;

template<class X, class Y>
    bool maximize(X &x, const Y &y) {
        if (y > x) {
            x = y;
            return (true);
        } else return (false);
    }

const int oo = 1e9;

/*void Remove(int d) {
    cout << d << ' ';
}*/

// sub1

/*void Bruno(int N, int L, vector<int> A) {
    string s = "";

    for (int i = 0; i < L; i += 2) {
        if (A[i] == 0) {
            if (A[i + 1] == 0)
                s += 'X';
            else s += 'Y';
        } else s += 'Z';
    }

    int sz = N;
    int all = (1 << sz);
    vector<int> dp(all + 5, -oo), rem(all + 5, 0);
    dp[0] = 0;

    for (int mask = 0; mask < all; mask++) {
        vector<int> pos;

        for (int i = 0; i < sz; i++)
            if (!(mask >> i & 1))
                pos.push_back(i);

        int spos = (int)pos.size();

        for (int i = 0; i < spos; i++) {
            bool good = false;
            int cur = pos[i];

            if (i > 0 && i < spos - 1) {
                int pre = pos[i - 1];
                int suf = pos[i + 1];

                if (s[pre] == 'X' && s[cur] == 'Y' && s[suf] == 'Z')
                    good = true;
            }

            int nmask = mask | (1 << cur);

            if (maximize(dp[nmask], dp[mask] + good))
                rem[nmask] = cur;
        }
    }

    vector<int> ans;

    int mask = all - 1;
    while (mask) {
        int bit = rem[mask];
        ans.push_back(bit);
        mask ^= (1 << bit);
    }

    reverse(ans.begin(), ans.end());

    for (int x : ans) Remove(x);
}*/

// sub2

void Remseg(int l, int r) {
    if (l > r) return;
    for (int i = l; i <= r; i++) Remove(i);
}

void Bruno(int N, int L, vector<int> A) {
    string s = "";

    for (int i = 0; i < L; i += 2) {
        if (A[i] == 0) {
            if (A[i + 1] == 0)
                s += 'X';
            else s += 'Y';
        } else s += 'Z';
    }

    int sz = N;

    vector<char> vec;

    int u = -1, v = -1;

    for (int i = 0; i < sz; i++)
    if (s[i] == 'X') {
        u = i;
        break;
    }

    for (int i = sz - 1; i >= 0; i--)
    if (s[i] == 'Z') {
        v = i;
        break;
    }

    if (u == -1 || v == -1 || (u > v)) {
        for (int i = 0; i < sz; i++) Remove(i);
        return;
    }

    Remseg(0, u - 1);
    Remseg(v + 1, sz - 1);

    int l = u;
    vector<int> from, to;
    string str = "";

    while (l <= v) {
        int r = l;

        while (r <= v && s[r] == s[l]) ++r;

        str += s[l];
        from.push_back(l);
        to.push_back(r - 1);

        l = r;
        //cout << l << ' ' << r << '\n';
    }

    int siz = (int)str.size();

    stack<int> inSta;

    for (int i = 0; i < siz; i++) {
        char c = str[i];

        if (c == 'X') {
            inSta.push(i);
        }

        if (c == 'Y')
            inSta.push(i);

        if (c == 'Z') {
            while ((int)inSta.size() > 1) {
                int pos = inSta.top();
                inSta.pop();

                int f = from[pos], t = to[pos];

                Remseg(f, t);
            }

            int f = from[i], t = to[i];
            Remseg(f, t);
        }
    }

    int f = from[0], t = to[0];
    Remseg(f, t);
}

/*void solve() {
    int n;
    int l;
    vector<int> a;

    cin >> n >> l;

    for (int i = 1; i <= l; i++) {
        int x;
        cin >> x;
        a.push_back(x);
    }

    Bruno(n, l, a);
}

int main() {
    //ios_base::sync_with_stdio(false);
    //cin.tie(0); cout.tie(0);
    solve();
    return 0;
}*/

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 512 KB Output is correct
2 Correct 1 ms 520 KB Output is correct
3 Correct 1 ms 604 KB Output is correct
4 Correct 1 ms 520 KB Output is correct
5 Correct 1 ms 520 KB Output is correct
6 Correct 1 ms 520 KB Output is correct
7 Correct 2 ms 524 KB Output is correct
8 Correct 1 ms 512 KB Output is correct
9 Correct 1 ms 520 KB Output is correct
10 Correct 1 ms 512 KB Output is correct
11 Correct 1 ms 512 KB Output is correct

Subtask #2
25.0 / 95.0

# Verdict Execution time Memory Grader output
1 Partially correct 81 ms 10116 KB Partially correct
2 Partially correct 75 ms 10016 KB Partially correct
3 Partially correct 74 ms 10060 KB Partially correct
4 Partially correct 79 ms 10080 KB Partially correct
5 Partially correct 78 ms 9976 KB Partially correct
6 Partially correct 73 ms 10028 KB Partially correct
7 Partially correct 74 ms 10016 KB Partially correct
8 Partially correct 73 ms 10008 KB Partially correct
9 Partially correct 76 ms 9960 KB Partially correct
10 Partially correct 70 ms 10056 KB Partially correct
11 Partially correct 78 ms 9964 KB Partially correct
12 Partially correct 76 ms 9984 KB Partially correct
13 Partially correct 68 ms 10248 KB Partially correct
14 Partially correct 88 ms 10304 KB Partially correct
15 Partially correct 78 ms 10300 KB Partially correct
16 Partially correct 71 ms 10328 KB Partially correct
17 Partially correct 76 ms 9356 KB Partially correct
18 Partially correct 81 ms 9432 KB Partially correct
19 Partially correct 74 ms 9564 KB Partially correct
20 Partially correct 68 ms 10364 KB Partially correct
21 Partially correct 72 ms 10468 KB Partially correct
22 Partially correct 79 ms 9508 KB Partially correct
23 Partially correct 69 ms 10292 KB Partially correct
24 Partially correct 72 ms 10316 KB Partially correct
25 Partially correct 86 ms 9580 KB Partially correct
26 Partially correct 78 ms 9524 KB Partially correct
27 Partially correct 74 ms 9536 KB Partially correct
28 Partially correct 92 ms 9672 KB Partially correct
29 Partially correct 89 ms 9504 KB Partially correct
30 Partially correct 77 ms 9528 KB Partially correct
31 Partially correct 80 ms 9700 KB Partially correct
32 Partially correct 80 ms 10160 KB Partially correct
33 Partially correct 70 ms 10132 KB Partially correct