oj.uz

Submission #684475

# Submission time Handle Problem Language Result Execution time Memory
684475 2023-01-21T10:38:59 Z mjhmjh1104 Ancient Machine (JOI21_ancient_machine) C++17
5 / 100
 60 ms 8760 KB 
#include "Anna.h"
#include <vector>
using namespace std;

void Anna(int n, vector<char> s) {
    int k = 0;
    vector<int> v;
    for (int i = 0; i < n; i++) {
        if (s[i] != 'X') {
            if (!v.empty() && v.back() == 1) v.back() = 2;
            else if (!v.empty() && v.back() == 2) v.back() = 3;
            else v.push_back(1);
        } else {
            v.push_back(-1);
            //for (int j = i; j < i + 1; j++) if (j < n && s[j] == 'Z') k = j;
            // /i++;
        }
        if (i < n && s[i] == 'Z') k = i;
    }
    for (auto &i: v) {
        if (i == 1) Send(0), Send(0);
        else if (i == 2) Send(0), Send(1);
        else if (i == 3) Send(1), Send(0);
        else Send(1), Send(1);
    }
    for (int t = 0; t <= 16; t++) Send(k & 1 << t ? 1 : 0);
}
#include "Bruno.h"
#include <vector>
using namespace std;

void Bruno(int n, int l, vector<int> b) {
    int lt = n, rt = 0;
    vector<int> a;
    for (int i = 0; i < (int)b.size() - 17; i += 2) {
        if (!b[i] && !b[i + 1]) a.push_back(0);
        else if (!b[i]) a.push_back(0), a.push_back(0);
        else if (!b[i + 1]) a.push_back(0), a.push_back(0), a.push_back(0);
        else a.push_back(1);//, a.push_back(0);
    }
    for (int i = (int)b.size() - 17; i < (int)b.size(); i++) a.push_back(b[i]);
    for (int t = 0; t <= 16; t++) if (a[n + t]) rt |= 1 << t;
    for (int i = n - 1; i >= 0; i--) if (a[i] || !i) {
        for (int j = i + 1; j < lt; j++) if (a[j]) Remove(j);
        for (int j = i + 1; j < lt; j++) if (!a[j] && j != rt) Remove(j);
        if (i != rt) Remove(i);
        lt = i;
    }
    Remove(rt);
}

Subtask #1
5.0 / 5.0

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

Subtask #2
0 / 95.0

# Verdict Execution time Memory Grader output
1 Partially correct 56 ms 8756 KB Partially correct
2 Partially correct 59 ms 8744 KB Partially correct
3 Partially correct 56 ms 8680 KB Partially correct
4 Partially correct 57 ms 8760 KB Partially correct
5 Partially correct 56 ms 8600 KB Partially correct
6 Partially correct 56 ms 8624 KB Partially correct
7 Partially correct 56 ms 8704 KB Partially correct
8 Partially correct 56 ms 8732 KB Partially correct
9 Partially correct 60 ms 8672 KB Partially correct
10 Partially correct 56 ms 8668 KB Partially correct
11 Partially correct 57 ms 8612 KB Partially correct
12 Partially correct 56 ms 8672 KB Partially correct
13 Incorrect 6 ms 2676 KB Wrong Answer [2]
14 Halted 0 ms 0 KB -