oj.uz

Submission #798486

# Submission time Handle Problem Language Result Execution time Memory
798486 2023-07-30T18:29:17 Z fatemetmhr Ancient Machine (JOI21_ancient_machine) C++17
70 / 100
 48 ms 8352 KB 
#include "Anna.h"

#include <bits/stdc++.h>

//#pragma GCC optimize ("O3")
//#pragma GCC target("avx2")
//#pragma GCC optimize("unroll-loops,Ofast")

using namespace std;

typedef long long ll;

#define pb       push_back
#define mp       make_pair
#define all(x)   x.begin(), x.end()
#define fi       first
#define se       second

void Anna(int n, std::vector<char> s) {
    bool found = false;
    for(int i = 0; i < n; i++){
        if(s[i] == 'X'){
            Send(found);
            found = true;
        }
        if(s[i] == 'Y'){
            Send(1);
        }
        if(s[i] == 'Z'){
            Send(found ^ 1);
        }
    }
}

//  ~ Be Name Khoda ~  //

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

//#pragma GCC optimize ("O3")
//#pragma GCC target("avx2")
//#pragma GCC optimize("unroll-loops,Ofast")

using namespace std;

typedef long long ll;

#define pb       push_back
#define mp       make_pair
#define all(x)   x.begin(), x.end()
#define fi       first
#define se       second


void Bruno(int n, int l, std::vector<int> a){
    vector <int> av, have;
    int found = -1;
    for(int i = 0; i < n; i++){
        if(a[i])
            av.pb(i);
        else if(found == -1){
            found = i;
            av.pb(i);
        }
        else{
            while(av.size() && av.back() != found){
                Remove(av.back());
                av.pop_back();
            }
            Remove(i);
        }
    }
    while(av.size()){
        Remove(av.back());
        av.pop_back();
    }
}

Subtask #1
5.0 / 5.0

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

Subtask #2
65.0 / 95.0

# Verdict Execution time Memory Grader output
1 Partially correct 39 ms 7916 KB Partially correct
2 Partially correct 40 ms 8044 KB Partially correct
3 Partially correct 40 ms 8088 KB Partially correct
4 Partially correct 40 ms 8088 KB Partially correct
5 Partially correct 46 ms 8024 KB Partially correct
6 Partially correct 39 ms 8216 KB Partially correct
7 Partially correct 40 ms 8088 KB Partially correct
8 Partially correct 39 ms 8128 KB Partially correct
9 Partially correct 39 ms 8116 KB Partially correct
10 Partially correct 40 ms 8104 KB Partially correct
11 Partially correct 39 ms 8116 KB Partially correct
12 Partially correct 40 ms 8132 KB Partially correct
13 Partially correct 47 ms 8292 KB Partially correct
14 Partially correct 48 ms 8144 KB Partially correct
15 Partially correct 43 ms 8068 KB Partially correct
16 Partially correct 43 ms 8076 KB Partially correct
17 Partially correct 44 ms 8328 KB Partially correct
18 Partially correct 44 ms 8284 KB Partially correct
19 Partially correct 45 ms 8300 KB Partially correct
20 Partially correct 39 ms 8104 KB Partially correct
21 Partially correct 40 ms 8036 KB Partially correct
22 Partially correct 45 ms 8196 KB Partially correct
23 Partially correct 39 ms 8060 KB Partially correct
24 Partially correct 38 ms 8044 KB Partially correct
25 Partially correct 44 ms 8328 KB Partially correct
26 Partially correct 44 ms 8248 KB Partially correct
27 Partially correct 44 ms 8312 KB Partially correct
28 Partially correct 48 ms 8304 KB Partially correct
29 Partially correct 44 ms 8352 KB Partially correct
30 Partially correct 44 ms 8236 KB Partially correct
31 Partially correct 44 ms 8228 KB Partially correct
32 Partially correct 39 ms 8100 KB Partially correct
33 Partially correct 40 ms 8136 KB Partially correct