oj.uz

Submission #537845

# Submission time Handle Problem Language Result Execution time Memory
537845 2022-03-15T16:41:24 Z Jarif_Rahman Ancient Machine (JOI21_ancient_machine) C++17
70 / 100
 73 ms 8180 KB 
#include "Anna.h"
#include <bits/stdc++.h>
#define pb push_back
#define f first
#define sc second
using namespace std;
typedef long long int ll;
typedef string str;

namespace {
}

void Anna(int n, vector<char> s){
    vector<int> rt(n, 0);
    int fx = -1;
    for(int i = 0; i < n; i++) if(s[i] == 'X'){
        fx = i;
        break;
    }

    if(fx == -1){
        for(int x: rt) Send(x);
        return;
    }

    rt[fx] = 1;

    for(int i = fx+1; i < n; i++) if(s[i] == 'Z' && (i == n-1 || s[i+1] != 'Z')) rt[i] = 1;

    for(int x: rt) Send(x);
}
#include "Bruno.h"
#include <bits/stdc++.h>
#define pb push_back
#define f first
#define sc second
using namespace std;
typedef long long int ll;
typedef string str;

namespace {
}

void Bruno(int n, int m, vector<int> A){
    int fx = -1;
    for(int i = 0; i < n; i++) if(A[i] == 1){
        fx = i;
        break;
    }

    if(fx == -1){
        for(int i = 0; i < n; i++) Remove(i);
        return;
    }

    for(int i = 0; i < fx; i++) Remove(i);

    int ls = fx+1;
    
    for(int i = fx+1; i < n; i++){
        if(A[i] != 1) continue;
        for(int j = i-1; j >= ls; j--) Remove(j);
        Remove(i);
        ls = i+1;
    }

    Remove(fx);

    for(int i = ls; i < n; i++) Remove(i);
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 508 KB Output is correct
2 Correct 0 ms 516 KB Output is correct
3 Correct 2 ms 508 KB Output is correct
4 Correct 0 ms 516 KB Output is correct
5 Correct 1 ms 508 KB Output is correct
6 Correct 0 ms 508 KB Output is correct
7 Correct 0 ms 516 KB Output is correct
8 Correct 1 ms 516 KB Output is correct
9 Correct 1 ms 508 KB Output is correct
10 Correct 1 ms 508 KB Output is correct
11 Correct 0 ms 508 KB Output is correct

Subtask #2
65.0 / 95.0

# Verdict Execution time Memory Grader output
1 Partially correct 56 ms 8056 KB Partially correct
2 Partially correct 56 ms 8016 KB Partially correct
3 Partially correct 58 ms 8084 KB Partially correct
4 Partially correct 56 ms 8080 KB Partially correct
5 Partially correct 56 ms 8100 KB Partially correct
6 Partially correct 55 ms 8080 KB Partially correct
7 Partially correct 57 ms 8060 KB Partially correct
8 Partially correct 57 ms 8068 KB Partially correct
9 Partially correct 62 ms 8180 KB Partially correct
10 Partially correct 63 ms 8036 KB Partially correct
11 Partially correct 63 ms 8016 KB Partially correct
12 Partially correct 57 ms 8104 KB Partially correct
13 Partially correct 71 ms 8076 KB Partially correct
14 Partially correct 70 ms 8128 KB Partially correct
15 Partially correct 57 ms 8072 KB Partially correct
16 Partially correct 60 ms 8096 KB Partially correct
17 Partially correct 73 ms 8068 KB Partially correct
18 Partially correct 64 ms 8172 KB Partially correct
19 Partially correct 61 ms 8072 KB Partially correct
20 Partially correct 65 ms 8088 KB Partially correct
21 Partially correct 65 ms 8148 KB Partially correct
22 Partially correct 71 ms 8076 KB Partially correct
23 Partially correct 61 ms 8044 KB Partially correct
24 Partially correct 61 ms 8168 KB Partially correct
25 Partially correct 66 ms 8116 KB Partially correct
26 Partially correct 68 ms 8112 KB Partially correct
27 Partially correct 60 ms 8148 KB Partially correct
28 Partially correct 69 ms 8060 KB Partially correct
29 Partially correct 64 ms 8120 KB Partially correct
30 Partially correct 62 ms 8112 KB Partially correct
31 Partially correct 61 ms 8064 KB Partially correct
32 Partially correct 62 ms 8160 KB Partially correct
33 Partially correct 56 ms 8148 KB Partially correct