oj.uz

Submission #713290

# Submission time Handle Problem Language Result Execution time Memory
713290 2023-03-21T16:11:46 Z marvinthang Ancient Machine (JOI21_ancient_machine) C++17
70 / 100
 69 ms 8132 KB 
/*************************************
*    author: marvinthang             *
*    created: 21.03.2023 23:00:23    *
*************************************/

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

using namespace std;

#define                  fi  first
#define                  se  second
#define                left  ___left
#define               right  ___right
#define                TIME  (1.0 * clock() / CLOCKS_PER_SEC)
#define             MASK(i)  (1LL << (i))
#define           BIT(x, i)  ((x) >> (i) & 1)
#define  __builtin_popcount  __builtin_popcountll
#define              ALL(v)  (v).begin(), (v).end()
#define           REP(i, n)  for (int i = 0, _n = (n); i < _n; ++i)
#define          REPD(i, n)  for (int i = (n); i--; )
#define        FOR(i, a, b)  for (int i = (a), _b = (b); i < _b; ++i) 
#define       FORD(i, b, a)  for (int i = (b), _a = (a); --i >= _a; ) 
#define       FORE(i, a, b)  for (int i = (a), _b = (b); i <= _b; ++i) 
#define      FORDE(i, b, a)  for (int i = (b), _a = (a); i >= _a; --i) 

namespace {

}

void Anna(int n, vector <char> s) {
    bool first_x = false;
    for (char c: s) {
        if (!first_x && c == 'X') {
            first_x = true;
            Send(1);
        } else if (first_x && c == 'Z') Send(1);
        else Send(0);
    }
}
/*************************************
*    author: marvinthang             *
*    created: 21.03.2023 23:03:23    *
*************************************/

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

using namespace std;

#define                  fi  first
#define                  se  second
#define                left  ___left
#define               right  ___right
#define                TIME  (1.0 * clock() / CLOCKS_PER_SEC)
#define             MASK(i)  (1LL << (i))
#define           BIT(x, i)  ((x) >> (i) & 1)
#define  __builtin_popcount  __builtin_popcountll
#define              ALL(v)  (v).begin(), (v).end()
#define           REP(i, n)  for (int i = 0, _n = (n); i < _n; ++i)
#define          REPD(i, n)  for (int i = (n); i--; )
#define        FOR(i, a, b)  for (int i = (a), _b = (b); i < _b; ++i) 
#define       FORD(i, b, a)  for (int i = (b), _a = (a); --i >= _a; ) 
#define       FORE(i, a, b)  for (int i = (a), _b = (b); i <= _b; ++i) 
#define      FORDE(i, b, a)  for (int i = (b), _a = (a); i >= _a; --i) 

namespace {

}

void Bruno(int N, int L, std::vector<int> A) {
    int first_x = -1;
    int last = -1;
    REP(i, N) if (A[i]) {
        if (first_x == -1) {
            first_x = i;
            REP(j, i) Remove(j);
        } else {
            FORD(j, i, last + 1) Remove(j);
            Remove(i);
        }
        last = i;
    }
    FOR(j, last + 1, N) Remove(j);
    if (first_x != -1) Remove(first_x);
}

Subtask #1
5.0 / 5.0

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

Subtask #2
65.0 / 95.0

# Verdict Execution time Memory Grader output
1 Partially correct 54 ms 7684 KB Partially correct
2 Partially correct 53 ms 7680 KB Partially correct
3 Partially correct 52 ms 7612 KB Partially correct
4 Partially correct 52 ms 7624 KB Partially correct
5 Partially correct 69 ms 7808 KB Partially correct
6 Partially correct 52 ms 7736 KB Partially correct
7 Partially correct 51 ms 7668 KB Partially correct
8 Partially correct 53 ms 7664 KB Partially correct
9 Partially correct 56 ms 7744 KB Partially correct
10 Partially correct 52 ms 7640 KB Partially correct
11 Partially correct 51 ms 7612 KB Partially correct
12 Partially correct 53 ms 7800 KB Partially correct
13 Partially correct 62 ms 7672 KB Partially correct
14 Partially correct 62 ms 7628 KB Partially correct
15 Partially correct 54 ms 7644 KB Partially correct
16 Partially correct 57 ms 7672 KB Partially correct
17 Partially correct 63 ms 7632 KB Partially correct
18 Partially correct 59 ms 7688 KB Partially correct
19 Partially correct 64 ms 8112 KB Partially correct
20 Partially correct 49 ms 8000 KB Partially correct
21 Partially correct 61 ms 8104 KB Partially correct
22 Partially correct 68 ms 8092 KB Partially correct
23 Partially correct 55 ms 8032 KB Partially correct
24 Partially correct 55 ms 8120 KB Partially correct
25 Partially correct 62 ms 8000 KB Partially correct
26 Partially correct 61 ms 8108 KB Partially correct
27 Partially correct 68 ms 8012 KB Partially correct
28 Partially correct 61 ms 8132 KB Partially correct
29 Partially correct 62 ms 8116 KB Partially correct
30 Partially correct 63 ms 8120 KB Partially correct
31 Partially correct 65 ms 8096 KB Partially correct
32 Partially correct 53 ms 8112 KB Partially correct
33 Partially correct 59 ms 8128 KB Partially correct