oj.uz

답안 #547923

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
547923 2022-04-12T03:14:00 Z tht2005 Ancient Machine (JOI21_ancient_machine) C++17
70 / 100
 72 ms 7752 KB 
#include "Anna.h"
#include <array>
#include <vector>

void Anna(int N, std::vector<char> S) {
    int i = 0;
    std::array<int, 3> cnt;
    cnt.fill(0);
    for(int i = 0; i < N; ++i)
        ++cnt[S[i] - 'X'];
    if(!cnt[0] || !cnt[1] || !cnt[2])
        return;
    while(S[i] != 'X')
        ++i;
    for(int j = 0; j < i; ++j)
        Send(0);
    Send(1);
    for(int j = i + 1; j < N; ++j)
        Send((int)(S[j] == 'Z'));
}

#include "Bruno.h"
#include <algorithm>
#include <vector>
#include <iostream>
#include <cassert>

void Bruno(int N, int L, std::vector<int> A) {
    if(L == 0) {
        for(int i = 0; i < N; ++i)
            Remove(i);
    }
    else {
        int i = 0;
        while(!A[i])
            ++i;
        for(int j = 0; j < i; ++j)
            Remove(j);
        for(int j = i + 1; j < N; ++j) {
            if(A[j]) {
                for(int k = j - 1; !A[k]; --k)
                    Remove(k);
                Remove(j);
            }
        }
        for(int j = N - 1; !A[j]; --j)
            Remove(j);
        Remove(i);
    }
}

Subtask #1
5.0 / 5.0

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

Subtask #2
65.0 / 95.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 50 ms 7648 KB Partially correct
2 Partially correct 52 ms 7740 KB Partially correct
3 Partially correct 55 ms 7720 KB Partially correct
4 Partially correct 49 ms 7752 KB Partially correct
5 Partially correct 48 ms 7688 KB Partially correct
6 Partially correct 48 ms 7680 KB Partially correct
7 Partially correct 54 ms 7720 KB Partially correct
8 Partially correct 59 ms 7644 KB Partially correct
9 Partially correct 56 ms 7592 KB Partially correct
10 Partially correct 48 ms 7660 KB Partially correct
11 Partially correct 49 ms 7608 KB Partially correct
12 Partially correct 51 ms 7688 KB Partially correct
13 Partially correct 65 ms 7656 KB Partially correct
14 Partially correct 72 ms 7608 KB Partially correct
15 Partially correct 52 ms 7692 KB Partially correct
16 Partially correct 51 ms 7640 KB Partially correct
17 Correct 41 ms 6432 KB Output is correct
18 Correct 43 ms 6460 KB Output is correct
19 Correct 41 ms 6328 KB Output is correct
20 Partially correct 57 ms 7696 KB Partially correct
21 Partially correct 48 ms 7680 KB Partially correct
22 Partially correct 55 ms 7572 KB Partially correct
23 Partially correct 48 ms 7624 KB Partially correct
24 Partially correct 54 ms 7636 KB Partially correct
25 Correct 45 ms 6420 KB Output is correct
26 Correct 49 ms 6332 KB Output is correct
27 Partially correct 56 ms 7660 KB Partially correct
28 Correct 43 ms 6432 KB Output is correct
29 Correct 45 ms 6520 KB Output is correct
30 Correct 46 ms 6464 KB Output is correct
31 Correct 48 ms 6348 KB Output is correct
32 Partially correct 48 ms 7652 KB Partially correct
33 Partially correct 49 ms 7640 KB Partially correct