oj.uz

Submission #709596

# Submission time Handle Problem Language Result Execution time Memory
709596 2023-03-14T01:15:02 Z yuuhi Ancient Machine (JOI21_ancient_machine) C++17
70 / 100
 73 ms 8340 KB 
#include<bits/stdc++.h>
#include "Anna.h"

#define f first
#define s second
#define double long double
#define _size(x) ((int)((x).size()))

using namespace std ;

typedef pair< int , int > ii ;

void Anna (int n , vector< char > s) {
    int flag = 0 ;
    for (int i = 0 ; i < n ; ++ i) {
        if (!flag && s[i] == 'X') {
            flag = 1 ;
            Send(1) ;
            continue ;
        }
        if (!flag) {
            Send(0) ;
            continue ;
        }
        if (s[i] == 'Z') {
            Send(1) ;
        }
        else {
            Send(0) ;
        }
    }
}

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

#define f first
#define s second
#define double long double
#define _size(x) ((int)((x).size()))

using namespace std ;

typedef pair< int , int > ii ;

void Bruno (int n , int L , vector< int > b) {
    vector< int > erased(n) ;
    auto Erase = [&](int x) {
        if (erased[x]) return ;
        erased[x] = 1 ;
        Remove(x) ;
    };

    for (int i = 0 , last = -1 ; i < n ; ++ i) if (b[i]) {
        if (last != -1) {
            for (int j = i - 1 ; j >= last + 1 ; -- j) Erase(j) ;
            Erase(i) ;
        }
        last = i ;
    }
    for (int i = 0 ; i < n ; ++ i) Erase(i) ;
}
/*
10
X Y Y X Z Y X Z Y Z
*/

Subtask #1
5.0 / 5.0

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

Subtask #2
65.0 / 95.0

# Verdict Execution time Memory Grader output
1 Partially correct 57 ms 8288 KB Partially correct
2 Partially correct 68 ms 8240 KB Partially correct
3 Partially correct 56 ms 8328 KB Partially correct
4 Partially correct 59 ms 8284 KB Partially correct
5 Partially correct 57 ms 8232 KB Partially correct
6 Partially correct 57 ms 8216 KB Partially correct
7 Partially correct 55 ms 8296 KB Partially correct
8 Partially correct 56 ms 8232 KB Partially correct
9 Partially correct 66 ms 8204 KB Partially correct
10 Partially correct 60 ms 8224 KB Partially correct
11 Partially correct 51 ms 8212 KB Partially correct
12 Partially correct 54 ms 8340 KB Partially correct
13 Partially correct 64 ms 8212 KB Partially correct
14 Partially correct 65 ms 8216 KB Partially correct
15 Partially correct 53 ms 8296 KB Partially correct
16 Partially correct 54 ms 8216 KB Partially correct
17 Partially correct 67 ms 8328 KB Partially correct
18 Partially correct 57 ms 8264 KB Partially correct
19 Partially correct 66 ms 8260 KB Partially correct
20 Partially correct 53 ms 8236 KB Partially correct
21 Partially correct 53 ms 8220 KB Partially correct
22 Partially correct 57 ms 8248 KB Partially correct
23 Partially correct 51 ms 8232 KB Partially correct
24 Partially correct 48 ms 8292 KB Partially correct
25 Partially correct 62 ms 8292 KB Partially correct
26 Partially correct 59 ms 8204 KB Partially correct
27 Partially correct 60 ms 8228 KB Partially correct
28 Partially correct 67 ms 8196 KB Partially correct
29 Partially correct 64 ms 8308 KB Partially correct
30 Partially correct 60 ms 8292 KB Partially correct
31 Partially correct 57 ms 8176 KB Partially correct
32 Partially correct 72 ms 8268 KB Partially correct
33 Partially correct 73 ms 8296 KB Partially correct