oj.uz

답안 #426581

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
426581 2021-06-14T07:16:12 Z 최서현(#7489) Ancient Machine (JOI21_ancient_machine) C++17
30 / 100
 101 ms 8984 KB 
#include "Anna.h"
#include <bits/stdc++.h>
#define pii pair<int, int>
#define ff first
#define ss second

using namespace std;

namespace
{

}

void Anna(int N, vector<char> S)
{
    int start = -1, last = -1;
    for(int i = 0; i < N; ++i)
    {
        if(start == -1 && S[i] == 'X') start = i;
        if(S[i] == 'Z') last = i;
    }

    if(start == -1 || last == -1)
    {
        for(int i = 0; i < N; ++i)
            Send(1);
        return;
    }

    for(int i = 0; i < start; ++i) Send(0);
    Send(1);
    for(int i = start + 1; i < last; ++i)
    {
        if(S[i] == 'X' && S[i - 1] == 'Y') Send(1);
        else if(S[i] == 'Y' && S[i + 1] == 'X') Send(1);
        else Send(0);
    }
    Send(1);
    for(int i = last + 1; i < N; ++i) Send(0);
}

#include "Bruno.h"
#include <bits/stdc++.h>

using namespace std;

namespace
{

}

void Bruno(int N, int L, vector<int> A)
{
    int last = -1;
    for(int i = 0; i < N; ++i) if(A[i]) last = i;
    for(int i = 0; i < N; ++i) if(!A[i]) Remove(i);
    for(int i = last - 1; i >= 0; --i) if(A[i]) Remove(i);
    Remove(last);
}

Subtask #1
5.0 / 5.0

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

Subtask #2
25.0 / 95.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 88 ms 7680 KB Partially correct
2 Partially correct 89 ms 7700 KB Partially correct
3 Partially correct 82 ms 7564 KB Partially correct
4 Partially correct 80 ms 7604 KB Partially correct
5 Partially correct 77 ms 7668 KB Partially correct
6 Partially correct 84 ms 7552 KB Partially correct
7 Partially correct 84 ms 7612 KB Partially correct
8 Partially correct 82 ms 7688 KB Partially correct
9 Partially correct 72 ms 7732 KB Partially correct
10 Partially correct 79 ms 7580 KB Partially correct
11 Partially correct 88 ms 7716 KB Partially correct
12 Partially correct 80 ms 7544 KB Partially correct
13 Partially correct 74 ms 7716 KB Partially correct
14 Partially correct 89 ms 7636 KB Partially correct
15 Partially correct 84 ms 7640 KB Partially correct
16 Partially correct 86 ms 7676 KB Partially correct
17 Partially correct 81 ms 7600 KB Partially correct
18 Partially correct 73 ms 7556 KB Partially correct
19 Partially correct 74 ms 7728 KB Partially correct
20 Partially correct 69 ms 7632 KB Partially correct
21 Partially correct 81 ms 7680 KB Partially correct
22 Partially correct 72 ms 7716 KB Partially correct
23 Partially correct 72 ms 7704 KB Partially correct
24 Partially correct 84 ms 7688 KB Partially correct
25 Partially correct 101 ms 7608 KB Partially correct
26 Partially correct 72 ms 7660 KB Partially correct
27 Partially correct 89 ms 8984 KB Partially correct
28 Partially correct 73 ms 7672 KB Partially correct
29 Partially correct 99 ms 7752 KB Partially correct
30 Partially correct 71 ms 7632 KB Partially correct
31 Partially correct 73 ms 7628 KB Partially correct
32 Partially correct 70 ms 7656 KB Partially correct
33 Partially correct 69 ms 7712 KB Partially correct