Submission #426542

# Submission time Handle Problem Language Result Execution time Memory
426542 2021-06-14T06:14:05 Z 반딧불(#7615) Ancient Machine (JOI21_ancient_machine) C++17
70 / 100
90 ms 8152 KB
#include "Anna.h"
#include <bits/stdc++.h>

using namespace std;

namespace {
    int n;
}

void Anna(int N, vector<char> S) {
    n = N;

    int xOpen = -1;
    for(int i=0; i<n; i++){
        if(xOpen == -1){
            if(S[i] != 'X') Send(0);
            else{
                Send(1);
                xOpen = i;
            }
            continue;
        }

        if(S[i] == 'Z') Send(1);
        else Send(0);
    }
}
#include "Bruno.h"
#include <bits/stdc++.h>

using namespace std;

namespace {
    int n;
    int arr[100002];
    vector<int> X, Z;
}  // namespace

void Bruno(int N, int L, vector<int> A) {
    n = N;
    for(int i=0; i<n; i++){
        arr[i] = A[i];
    }

    int f = -1;
    for(int i=0; i<n; i++){
        if(f == -1){
            if(!A[i]) Remove(i);
            else f=i;
            continue;
        }
        if(A[i]){
            Remove(i);
            continue;
        }
        int j = i;
        while(j+1<n && !arr[j+1]) j++;
        for(int k=j; k>=i; k--) Remove(k);
        i=j;
    }

    if(f != -1) Remove(f);
}
# Verdict Execution time Memory Grader output
1 Correct 2 ms 484 KB Output is correct
2 Correct 1 ms 484 KB Output is correct
3 Correct 2 ms 484 KB Output is correct
4 Correct 1 ms 484 KB Output is correct
5 Correct 1 ms 484 KB Output is correct
6 Correct 3 ms 492 KB Output is correct
7 Correct 0 ms 484 KB Output is correct
8 Correct 0 ms 484 KB Output is correct
9 Correct 2 ms 556 KB Output is correct
10 Correct 1 ms 488 KB Output is correct
11 Correct 2 ms 484 KB Output is correct
# Verdict Execution time Memory Grader output
1 Partially correct 68 ms 7960 KB Partially correct
2 Partially correct 70 ms 8016 KB Partially correct
3 Partially correct 74 ms 8068 KB Partially correct
4 Partially correct 63 ms 8072 KB Partially correct
5 Partially correct 64 ms 7964 KB Partially correct
6 Partially correct 73 ms 8056 KB Partially correct
7 Partially correct 78 ms 8036 KB Partially correct
8 Partially correct 63 ms 8036 KB Partially correct
9 Partially correct 69 ms 7964 KB Partially correct
10 Partially correct 73 ms 8080 KB Partially correct
11 Partially correct 63 ms 8104 KB Partially correct
12 Partially correct 74 ms 7956 KB Partially correct
13 Partially correct 90 ms 8004 KB Partially correct
14 Partially correct 78 ms 8036 KB Partially correct
15 Partially correct 68 ms 8052 KB Partially correct
16 Partially correct 80 ms 8080 KB Partially correct
17 Partially correct 75 ms 8008 KB Partially correct
18 Partially correct 78 ms 7952 KB Partially correct
19 Partially correct 76 ms 7932 KB Partially correct
20 Partially correct 75 ms 8100 KB Partially correct
21 Partially correct 71 ms 8136 KB Partially correct
22 Partially correct 74 ms 8064 KB Partially correct
23 Partially correct 64 ms 8088 KB Partially correct
24 Partially correct 63 ms 8100 KB Partially correct
25 Partially correct 78 ms 8016 KB Partially correct
26 Partially correct 74 ms 8076 KB Partially correct
27 Partially correct 78 ms 8024 KB Partially correct
28 Partially correct 72 ms 8020 KB Partially correct
29 Partially correct 71 ms 8072 KB Partially correct
30 Partially correct 86 ms 8152 KB Partially correct
31 Partially correct 76 ms 8056 KB Partially correct
32 Partially correct 69 ms 8016 KB Partially correct
33 Partially correct 66 ms 7932 KB Partially correct