oj.uz

답안 #935577

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
935577 2024-02-29T09:25:42 Z thieunguyenhuy Ancient Machine (JOI21_ancient_machine) C++17
70 / 100
 48 ms 8924 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);
    }
    if (start < L) Remove(start);
}

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 792 KB Output is correct
2 Correct 0 ms 776 KB Output is correct
3 Correct 0 ms 792 KB Output is correct
4 Correct 0 ms 780 KB Output is correct
5 Correct 0 ms 780 KB Output is correct
6 Correct 0 ms 792 KB Output is correct
7 Correct 0 ms 792 KB Output is correct
8 Correct 0 ms 792 KB Output is correct
9 Correct 0 ms 792 KB Output is correct
10 Correct 1 ms 792 KB Output is correct
11 Correct 0 ms 788 KB Output is correct

Subtask #2
65.0 / 95.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 47 ms 8176 KB Partially correct
2 Partially correct 43 ms 7928 KB Partially correct
3 Partially correct 41 ms 7928 KB Partially correct
4 Partially correct 46 ms 7760 KB Partially correct
5 Partially correct 41 ms 7924 KB Partially correct
6 Partially correct 40 ms 7924 KB Partially correct
7 Partially correct 41 ms 7944 KB Partially correct
8 Partially correct 41 ms 7720 KB Partially correct
9 Partially correct 40 ms 7904 KB Partially correct
10 Partially correct 45 ms 7872 KB Partially correct
11 Partially correct 41 ms 7932 KB Partially correct
12 Partially correct 40 ms 7924 KB Partially correct
13 Partially correct 46 ms 7936 KB Partially correct
14 Partially correct 46 ms 7944 KB Partially correct
15 Partially correct 41 ms 7916 KB Partially correct
16 Partially correct 45 ms 7912 KB Partially correct
17 Partially correct 46 ms 7920 KB Partially correct
18 Partially correct 46 ms 7876 KB Partially correct
19 Partially correct 46 ms 8924 KB Partially correct
20 Partially correct 40 ms 8384 KB Partially correct
21 Partially correct 40 ms 8384 KB Partially correct
22 Partially correct 46 ms 8464 KB Partially correct
23 Partially correct 44 ms 8668 KB Partially correct
24 Partially correct 41 ms 8220 KB Partially correct
25 Partially correct 46 ms 8396 KB Partially correct
26 Partially correct 46 ms 8464 KB Partially correct
27 Partially correct 48 ms 8320 KB Partially correct
28 Partially correct 47 ms 8436 KB Partially correct
29 Partially correct 46 ms 8364 KB Partially correct
30 Partially correct 46 ms 8368 KB Partially correct
31 Partially correct 48 ms 8312 KB Partially correct
32 Partially correct 43 ms 8320 KB Partially correct
33 Partially correct 40 ms 8464 KB Partially correct