oj.uz

Submission #426586

# Submission time Handle Problem Language Result Execution time Memory
426586 2021-06-14T07:18:00 Z 최서현(#7489) Ancient Machine (JOI21_ancient_machine) C++17
70 / 100
 136 ms 8080 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 || start > last)
    {
        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

# Verdict Execution time Memory Grader output
1 Correct 1 ms 484 KB Output is correct
2 Correct 2 ms 484 KB Output is correct
3 Correct 2 ms 484 KB Output is correct
4 Correct 2 ms 484 KB Output is correct
5 Correct 1 ms 492 KB Output is correct
6 Correct 1 ms 484 KB Output is correct
7 Correct 1 ms 480 KB Output is correct
8 Correct 2 ms 484 KB Output is correct
9 Correct 1 ms 484 KB Output is correct
10 Correct 1 ms 548 KB Output is correct
11 Correct 4 ms 488 KB Output is correct

Subtask #2
65.0 / 95.0

# Verdict Execution time Memory Grader output
1 Partially correct 84 ms 7596 KB Partially correct
2 Partially correct 74 ms 7596 KB Partially correct
3 Partially correct 83 ms 7608 KB Partially correct
4 Partially correct 80 ms 7636 KB Partially correct
5 Partially correct 84 ms 7676 KB Partially correct
6 Partially correct 86 ms 7660 KB Partially correct
7 Partially correct 80 ms 7692 KB Partially correct
8 Partially correct 80 ms 7640 KB Partially correct
9 Partially correct 79 ms 7592 KB Partially correct
10 Partially correct 82 ms 7756 KB Partially correct
11 Partially correct 88 ms 7648 KB Partially correct
12 Partially correct 78 ms 7724 KB Partially correct
13 Partially correct 77 ms 7620 KB Partially correct
14 Partially correct 77 ms 7588 KB Partially correct
15 Partially correct 83 ms 7636 KB Partially correct
16 Partially correct 71 ms 7640 KB Partially correct
17 Partially correct 74 ms 7616 KB Partially correct
18 Partially correct 78 ms 7612 KB Partially correct
19 Partially correct 74 ms 7996 KB Partially correct
20 Partially correct 68 ms 7996 KB Partially correct
21 Partially correct 136 ms 8044 KB Partially correct
22 Partially correct 81 ms 7972 KB Partially correct
23 Partially correct 87 ms 7980 KB Partially correct
24 Partially correct 80 ms 7972 KB Partially correct
25 Partially correct 73 ms 8012 KB Partially correct
26 Partially correct 84 ms 7976 KB Partially correct
27 Partially correct 74 ms 7952 KB Partially correct
28 Partially correct 73 ms 8056 KB Partially correct
29 Partially correct 75 ms 7944 KB Partially correct
30 Partially correct 74 ms 7964 KB Partially correct
31 Partially correct 91 ms 8056 KB Partially correct
32 Partially correct 70 ms 7984 KB Partially correct
33 Partially correct 94 ms 8080 KB Partially correct