oj.uz

Submission #935618

# Submission time Handle Problem Language Result Execution time Memory
935618 2024-02-29T09:50:47 Z wii Ancient Machine (JOI21_ancient_machine) C++17
100 / 100
 53 ms 8196 KB 
#include <vector>
#include <iostream>
using namespace std;

typedef long long ll;

void Anna(int N, std::vector<char> S);
void Send(int a);

void Anna(int N, std::vector<char> S) {
    const int Lim = 83;
    const int LOG = 58;

    vector<int> a;
    a.assign(N, 0);

    int res = 0;
    for (int i = 0; i < N; ++i)
    if (S[i] == 'X') {
        res = i; break;
    }

    for (int i = 1; i <= 17; ++i)
        Send(res >> i - 1 & 1);

    for (int i = 0; i < N; ++i) if (i > res)
        a[i] = (S[i] == 'Z');

    for (int i = 1; i < N; ++i)
        if (a[i - 1] == 1 && a[i] == 1)
            a[i - 1] = 0;

    vector<ll> fibo(95);
    fibo[0] = 1; fibo[1] = 1;
    for (int i = 2; i <= Lim; ++i)
        fibo[i] = fibo[i - 1] + fibo[i - 2];

    for (int i = 0; i < N; i += Lim) {
        ll hash_num = 0;
        for (int j = i; j < N && j < i + Lim; ++j)
            if (a[j] == 1)
                hash_num += fibo[j - i + 1];

        for (int u = 1; u <= LOG; ++u)
            Send(hash_num >> u - 1 & 1);
    }
}

#include <deque>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;

typedef long long ll;

void Bruno(int N, int L, std::vector<int> A);
void Remove(int d);

// 11 XYZXZYXYXYZ

void Bruno(int N, int L, std::vector<int> A) {
    const int Lim = 83;
    const int LOG = 58;

    int ptr = 0;

    int first_x = 0;
    for (int i = 1; i <= 17; ++i) {
        if (A[ptr] == 1)
            first_x += 1LL << i - 1;
        ++ptr;
    }

    vector<int> pos_z;
    pos_z.push_back(first_x);

    vector<ll> fibo(95);
    fibo[0] = 1; fibo[1] = 1;
    for (int i = 2; i <= Lim; ++i)
        fibo[i] = fibo[i - 1] + fibo[i - 2];

    int cur = 0;
    for (int i = ptr; i < A.size(); i += LOG) {
        ll hash_num = 0;
        for (int j = 1; j <= LOG && i + j - 1 < A.size(); ++j)
            if (A[i + j - 1] == 1)
                hash_num += 1LL << j - 1;

        for (int u = Lim ; u >= 1; --u) if (hash_num >= fibo[u]) {
            pos_z.push_back(cur + u - 1);
            hash_num -= fibo[u];
        } cur += Lim;
    } sort(pos_z.begin(), pos_z.end());

    for (int i = 1; i < pos_z.size(); ++i) {
        int l = pos_z[i - 1];
        int r = pos_z[i];

        // cout << l << " " << r << "\n";

        for (int u = r - 1; u > l; --u)
            Remove(u);
        Remove(r);
    }

    for (int i = pos_z.back() + 1; i < N; ++i)
        Remove(i);

    for (int i = 0; i <= pos_z[0]; ++i)
        Remove(i);
}

Compilation message

Anna.cpp: In function 'void Anna(int, std::vector<char>)':
Anna.cpp:24:23: warning: suggest parentheses around '-' inside '>>' [-Wparentheses]
   24 |         Send(res >> i - 1 & 1);
      |                     ~~^~~
Anna.cpp:45:32: warning: suggest parentheses around '-' inside '>>' [-Wparentheses]
   45 |             Send(hash_num >> u - 1 & 1);
      |                              ~~^~~

Bruno.cpp: In function 'void Bruno(int, int, std::vector<int>)':
Bruno.cpp:23:33: warning: suggest parentheses around '-' inside '<<' [-Wparentheses]
   23 |             first_x += 1LL << i - 1;
      |                               ~~^~~
Bruno.cpp:36:25: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   36 |     for (int i = ptr; i < A.size(); i += LOG) {
      |                       ~~^~~~~~~~~~
Bruno.cpp:38:47: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   38 |         for (int j = 1; j <= LOG && i + j - 1 < A.size(); ++j)
      |                                     ~~~~~~~~~~^~~~~~~~~~
Bruno.cpp:40:38: warning: suggest parentheses around '-' inside '<<' [-Wparentheses]
   40 |                 hash_num += 1LL << j - 1;
      |                                    ~~^~~
Bruno.cpp:48:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   48 |     for (int i = 1; i < pos_z.size(); ++i) {
      |                     ~~^~~~~~~~~~~~~~

Subtask #1
5.0 / 5.0

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

Subtask #2
95.0 / 95.0

# Verdict Execution time Memory Grader output
1 Correct 37 ms 8188 KB Output is correct
2 Correct 42 ms 7900 KB Output is correct
3 Correct 41 ms 7920 KB Output is correct
4 Correct 41 ms 7948 KB Output is correct
5 Correct 38 ms 7940 KB Output is correct
6 Correct 51 ms 7880 KB Output is correct
7 Correct 37 ms 7896 KB Output is correct
8 Correct 36 ms 7968 KB Output is correct
9 Correct 38 ms 7948 KB Output is correct
10 Correct 39 ms 7944 KB Output is correct
11 Correct 45 ms 7832 KB Output is correct
12 Correct 36 ms 7896 KB Output is correct
13 Correct 45 ms 7984 KB Output is correct
14 Correct 44 ms 8012 KB Output is correct
15 Correct 43 ms 7864 KB Output is correct
16 Correct 45 ms 8000 KB Output is correct
17 Correct 50 ms 8180 KB Output is correct
18 Correct 42 ms 7920 KB Output is correct
19 Correct 50 ms 7992 KB Output is correct
20 Correct 37 ms 8124 KB Output is correct
21 Correct 41 ms 7932 KB Output is correct
22 Correct 48 ms 7972 KB Output is correct
23 Correct 39 ms 7888 KB Output is correct
24 Correct 42 ms 7904 KB Output is correct
25 Correct 53 ms 7968 KB Output is correct
26 Correct 42 ms 7884 KB Output is correct
27 Correct 47 ms 8032 KB Output is correct
28 Correct 43 ms 8020 KB Output is correct
29 Correct 43 ms 8196 KB Output is correct
30 Correct 42 ms 7836 KB Output is correct
31 Correct 44 ms 8060 KB Output is correct
32 Correct 37 ms 7992 KB Output is correct
33 Correct 52 ms 8148 KB Output is correct