oj.uz

Submission #900527

# Submission time Handle Problem Language Result Execution time Memory
900527 2024-01-08T12:44:21 Z GrindMachine Ancient Machine (JOI21_ancient_machine) C++17
70 / 100
 51 ms 8436 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) (int)a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x,y) ((x+y-1)/(y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a,b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a,b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif

/*



*/

const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

#include "Anna.h"

void Anna(int n, std::vector<char> A) {
    vector<int> a(n);
    rep(i,n) a[i] = A[i]-'X';

    bool firstx = false;

    rep(i,n){
        if(a[i] != 0){
            if(!firstx){
                Send(0);
                conts;
            }
        }

        if(a[i] == 0){
            if(!firstx){
                firstx = true;
                Send(1);
            }
            else{
                Send(0);
            }
        }
        else if(a[i] == 1){
            Send(0);
        }
        else{
            Send(1);
        }
    }
}

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) (int)a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x,y) ((x+y-1)/(y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a,b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a,b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif

/*



*/

const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

#include "Bruno.h"

void Bruno(int n, int m, std::vector<int> a) {
    vector<int> curr;
    bool firstx = false;

    rep(i,n){
        if(!a[i]){
            if(!firstx){
                Remove(i);
                conts;
            }
        }

        curr.pb(i);

        if(!firstx){         
            firstx = true;
        }
        else if(a[i] == 1){
            curr.pop_back();
            while(sz(curr) > 1){
                Remove(curr.back());
                curr.pop_back();
            }
            Remove(i);
        }
    }

    while(!curr.empty()){
        Remove(curr.back());
        curr.pop_back();
    }
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 780 KB Output is correct
2 Correct 0 ms 792 KB Output is correct
3 Correct 1 ms 780 KB Output is correct
4 Correct 0 ms 776 KB Output is correct
5 Correct 0 ms 788 KB Output is correct
6 Correct 0 ms 788 KB Output is correct
7 Correct 1 ms 788 KB Output is correct
8 Correct 0 ms 784 KB Output is correct
9 Correct 0 ms 792 KB Output is correct
10 Correct 0 ms 784 KB Output is correct
11 Correct 0 ms 792 KB Output is correct

Subtask #2
65.0 / 95.0

# Verdict Execution time Memory Grader output
1 Partially correct 40 ms 8184 KB Partially correct
2 Partially correct 42 ms 8352 KB Partially correct
3 Partially correct 43 ms 8044 KB Partially correct
4 Partially correct 41 ms 8244 KB Partially correct
5 Partially correct 40 ms 8176 KB Partially correct
6 Partially correct 41 ms 8168 KB Partially correct
7 Partially correct 44 ms 8148 KB Partially correct
8 Partially correct 45 ms 8164 KB Partially correct
9 Partially correct 40 ms 8112 KB Partially correct
10 Partially correct 41 ms 8176 KB Partially correct
11 Partially correct 41 ms 8280 KB Partially correct
12 Partially correct 41 ms 8184 KB Partially correct
13 Partially correct 44 ms 8416 KB Partially correct
14 Partially correct 51 ms 8436 KB Partially correct
15 Partially correct 43 ms 8188 KB Partially correct
16 Partially correct 41 ms 8148 KB Partially correct
17 Partially correct 49 ms 8376 KB Partially correct
18 Partially correct 45 ms 8164 KB Partially correct
19 Partially correct 45 ms 8168 KB Partially correct
20 Partially correct 39 ms 8188 KB Partially correct
21 Partially correct 39 ms 8188 KB Partially correct
22 Partially correct 47 ms 8312 KB Partially correct
23 Partially correct 40 ms 8196 KB Partially correct
24 Partially correct 40 ms 8260 KB Partially correct
25 Partially correct 51 ms 8168 KB Partially correct
26 Partially correct 48 ms 8304 KB Partially correct
27 Partially correct 51 ms 8216 KB Partially correct
28 Partially correct 46 ms 8316 KB Partially correct
29 Partially correct 45 ms 8180 KB Partially correct
30 Partially correct 45 ms 8160 KB Partially correct
31 Partially correct 46 ms 8168 KB Partially correct
32 Partially correct 41 ms 8200 KB Partially correct
33 Partially correct 40 ms 8216 KB Partially correct