oj.uz

답안 #710524

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
710524 2023-03-15T10:13:21 Z tanprodium Ancient Machine (JOI21_ancient_machine) C++17
69 / 100
 61 ms 8320 KB 
#include "Anna.h"
#include<bits/stdc++.h>

using namespace std;

const int LOG = 17;

int cnt = 0;

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

void tobit(int x) {
    for (int i = 0; i < LOG; i++) {
        int bit = (x >> i & 1);

        Send(bit);
    }
}

void Anna(int N, vector<char> S) {
    string s = "";

    for (int i = 0; i < N; i++) s += S[i];

    int sz = N;

    int u = -1, v = -1;

    for (int i = 0; i < N; 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)) {
        tobit((1 << LOG) - 1);
        return;
    }

    tobit(u);
    tobit(v);

    for (int i = u; i <= v; i++) {
        if (s[i] == 'Z') Send(1);
        else 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;
const int LOG = 17;

/*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) {
    bool ok = false;

    for (int i = 0; i < LOG; i++)
    if (A[i] == 0) {
        ok = true;
        break;
    }

    int sz = N;

    if (!ok) {
        Remseg(0, sz - 1);
        return;
    }

    int u = 0, v = 0;

    for (int i = 0; i < LOG; i++) {
        u += A[i] * (1 << i);
    }

    for (int i = LOG; i < 2 * LOG; i++) {
        v += A[i] * (1 << (i - LOG));
    }

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

    stack<int> inSta;

    for (int i = 2 * LOG; i < L; i++) {
        int cur = u + i - 2 * LOG;

        if (A[i] == 1) {
            while ((inSta.size() > 1)) {
                int pos = inSta.top();
                inSta.pop();

                Remove(pos);
            }

            Remove(cur);
        } else inSta.push(cur);
    }

    Remove(u);
}

/*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

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 508 KB Output is correct
2 Correct 1 ms 512 KB Output is correct
3 Correct 1 ms 512 KB Output is correct
4 Correct 2 ms 512 KB Output is correct
5 Correct 1 ms 520 KB Output is correct
6 Correct 1 ms 520 KB Output is correct
7 Correct 1 ms 512 KB Output is correct
8 Correct 0 ms 512 KB Output is correct
9 Correct 1 ms 520 KB Output is correct
10 Correct 1 ms 600 KB Output is correct
11 Correct 1 ms 520 KB Output is correct

Subtask #2
64.0 / 95.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 52 ms 7832 KB Partially correct
2 Partially correct 53 ms 8292 KB Partially correct
3 Partially correct 51 ms 8204 KB Partially correct
4 Partially correct 52 ms 8228 KB Partially correct
5 Partially correct 53 ms 8244 KB Partially correct
6 Partially correct 52 ms 8240 KB Partially correct
7 Partially correct 53 ms 8160 KB Partially correct
8 Partially correct 52 ms 8228 KB Partially correct
9 Partially correct 54 ms 8220 KB Partially correct
10 Partially correct 52 ms 8224 KB Partially correct
11 Partially correct 50 ms 8260 KB Partially correct
12 Partially correct 52 ms 8216 KB Partially correct
13 Partially correct 52 ms 8176 KB Partially correct
14 Partially correct 60 ms 8196 KB Partially correct
15 Partially correct 61 ms 8184 KB Partially correct
16 Partially correct 54 ms 8240 KB Partially correct
17 Correct 48 ms 7032 KB Output is correct
18 Correct 44 ms 7036 KB Output is correct
19 Correct 43 ms 7024 KB Output is correct
20 Partially correct 53 ms 8208 KB Partially correct
21 Partially correct 51 ms 8216 KB Partially correct
22 Partially correct 48 ms 8224 KB Partially correct
23 Partially correct 52 ms 8216 KB Partially correct
24 Partially correct 50 ms 8320 KB Partially correct
25 Correct 43 ms 6932 KB Output is correct
26 Correct 44 ms 6904 KB Output is correct
27 Correct 44 ms 7060 KB Output is correct
28 Correct 43 ms 7052 KB Output is correct
29 Correct 44 ms 7048 KB Output is correct
30 Correct 43 ms 7048 KB Output is correct
31 Correct 44 ms 6880 KB Output is correct
32 Partially correct 54 ms 8268 KB Partially correct
33 Partially correct 52 ms 8204 KB Partially correct