oj.uz

답안 #935570

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
935570 2024-02-29T09:22:25 Z thieunguyenhuy Ancient Machine (JOI21_ancient_machine) C++17
0 / 100
 56 ms 8484 KB 
#include <bits/stdc++.h>
using namespace std;

#ifndef hwe
    #include "Anna.h"
#endif // hwe

void Send(int a);

void Anna(int n, vector<char> S) {
    int p = 0;
    while (p < n && S[p] != 'X') {
        Send(0); ++p;
    }

    while (p < n) {
        Send(1); ++p;
        while (p < n && S[p] != 'Z') {
            Send(0), ++p;
        }
    }
}
#include <bits/stdc++.h>
using namespace std;

#ifndef hwe
    #include "Bruno.h"
#endif // hwe

#define MASK(n) (1ll << (n))
#define BIT(n, i) ((n) >> (i) & 1)
#define FLIP(n, i) ((n) ^ (1ll << (i)))

bool maximize(int &x, int y) {
    if (x < y) {
        x = y;
        return true;
    }
    return false;
}

void Remove(int d);

void Bruno(int n, int L, vector<int> A) {
//    for (auto &x : A) cout << x << ' ';
//    cout << '\n';

    int p = 0;
    while (p < L && A[p] == 0) {
        Remove(p), ++p;
    }

    int start = p;
    while (p < L) {
        int cur = p; ++p;
        while (p < L && A[p] == 0) ++p;
        for (int i = min(L, p) - 1; i > cur; --i) {
            Remove(i);
        }
        if (p < L) Remove(p);
    }
    Remove(start);
}

Subtask #1
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 788 KB Output is correct
2 Correct 0 ms 796 KB Output is correct
3 Correct 0 ms 796 KB Output is correct
4 Correct 0 ms 784 KB Output is correct
5 Correct 0 ms 780 KB Output is correct
6 Correct 0 ms 796 KB Output is correct
7 Correct 0 ms 796 KB Output is correct
8 Correct 0 ms 784 KB Output is correct
9 Correct 1 ms 792 KB Output is correct
10 Incorrect 0 ms 796 KB Wrong Answer [3]
11 Halted 0 ms 0 KB -

Subtask #2
0 / 95.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 46 ms 8288 KB Partially correct
2 Partially correct 43 ms 8216 KB Partially correct
3 Partially correct 43 ms 8368 KB Partially correct
4 Partially correct 41 ms 8040 KB Partially correct
5 Partially correct 51 ms 8452 KB Partially correct
6 Partially correct 40 ms 8384 KB Partially correct
7 Partially correct 52 ms 8200 KB Partially correct
8 Partially correct 47 ms 8352 KB Partially correct
9 Partially correct 49 ms 8200 KB Partially correct
10 Partially correct 55 ms 8360 KB Partially correct
11 Partially correct 41 ms 8352 KB Partially correct
12 Partially correct 44 ms 8136 KB Partially correct
13 Partially correct 56 ms 8360 KB Partially correct
14 Partially correct 53 ms 8328 KB Partially correct
15 Partially correct 50 ms 8276 KB Partially correct
16 Partially correct 48 ms 8372 KB Partially correct
17 Partially correct 48 ms 8484 KB Partially correct
18 Incorrect 45 ms 7988 KB Wrong Answer [3]
19 Halted 0 ms 0 KB -