oj.uz

Submission #829136

# Submission time Handle Problem Language Result Execution time Memory
829136 2023-08-18T05:19:40 Z GrindMachine Broken Device (JOI17_broken_device) C++17
45 / 100
 41 ms 2412 KB 
// Om Namah Shivaya

#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) 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

/*

refs:
https://ivaniscoding.wordpress.com/2018/08/25/communication-3-broken-device/

*/

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

#include "Annalib.h"

void Anna( int n, long long X, int k, int a[] ){
    vector<int> blocked(n);
    rep(i,k) blocked[a[i]] = 1;

    vector<int> pos(n);
    rep(i,n) pos[i] = i;

    int seed = 123456789;
    mt19937 rng(seed);

    shuffle(all(pos),rng);

    int bit = 0;
    vector<int> val(n);

    for(int i = 0; i < n-1; ){
        if(!blocked[pos[i]] and !blocked[pos[i+1]] and bit < 60){
            val[pos[i]] = 1;
            if(X & (1ll<<bit)) val[pos[i+1]] = 1;
            bit++;
            i += 2;
        }
        else{
            i++;
        }
    }

    rep(i,n){
        Set(i,val[i]);
    }
}

// Om Namah Shivaya

#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) 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

/*

refs:
https://ivaniscoding.wordpress.com/2018/08/25/communication-3-broken-device/

*/

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

#include "Brunolib.h"

long long Bruno( int n, int a[] ){
    vector<int> pos(n);
    rep(i,n) pos[i] = i;

    int seed = 123456789;
    mt19937 rng(seed);

    shuffle(all(pos),rng);

    int bit = 0;
    ll ans = 0;

    for(int i = 0; i < n-1; ){
        if(a[pos[i]] == 1){
            if(a[pos[i+1]]){
                ans |= (1ll<<bit);
            }
            bit++;
            i += 2;
        }
        else{
            i++;
        }
    }

    return ans;
}

Subtask #1
45.0 / 100.0

# Verdict Execution time Memory Grader output
1 Partially correct 35 ms 2228 KB Output is partially correct - L* = 19
2 Partially correct 36 ms 2316 KB Output is partially correct - L* = 19
3 Partially correct 36 ms 2244 KB Output is partially correct - L* = 18
4 Partially correct 35 ms 2412 KB Output is partially correct - L* = 18
5 Partially correct 36 ms 2248 KB Output is partially correct - L* = 19
6 Partially correct 35 ms 2260 KB Output is partially correct - L* = 19
7 Partially correct 35 ms 2248 KB Output is partially correct - L* = 19
8 Partially correct 35 ms 2316 KB Output is partially correct - L* = 19
9 Partially correct 39 ms 2404 KB Output is partially correct - L* = 19
10 Partially correct 40 ms 2236 KB Output is partially correct - L* = 18
11 Partially correct 35 ms 2308 KB Output is partially correct - L* = 19
12 Partially correct 35 ms 2288 KB Output is partially correct - L* = 19
13 Partially correct 34 ms 2228 KB Output is partially correct - L* = 19
14 Partially correct 36 ms 2324 KB Output is partially correct - L* = 19
15 Partially correct 35 ms 2344 KB Output is partially correct - L* = 19
16 Partially correct 39 ms 2256 KB Output is partially correct - L* = 19
17 Partially correct 40 ms 2252 KB Output is partially correct - L* = 17
18 Partially correct 39 ms 2268 KB Output is partially correct - L* = 18
19 Partially correct 41 ms 2240 KB Output is partially correct - L* = 18
20 Partially correct 36 ms 2256 KB Output is partially correct - L* = 19
21 Partially correct 35 ms 2252 KB Output is partially correct - L* = 18
22 Partially correct 36 ms 2300 KB Output is partially correct - L* = 18
23 Partially correct 37 ms 2280 KB Output is partially correct - L* = 19
24 Partially correct 35 ms 2244 KB Output is partially correct - L* = 18
25 Partially correct 40 ms 2272 KB Output is partially correct - L* = 19
26 Partially correct 39 ms 2248 KB Output is partially correct - L* = 19
27 Partially correct 36 ms 2288 KB Output is partially correct - L* = 18
28 Partially correct 35 ms 2224 KB Output is partially correct - L* = 18
29 Partially correct 36 ms 2292 KB Output is partially correct - L* = 18
30 Partially correct 36 ms 2276 KB Output is partially correct - L* = 18
31 Partially correct 35 ms 2228 KB Output is partially correct - L* = 20
32 Partially correct 35 ms 2348 KB Output is partially correct - L* = 19
33 Partially correct 35 ms 2324 KB Output is partially correct - L* = 18
34 Partially correct 35 ms 2244 KB Output is partially correct - L* = 19
35 Partially correct 37 ms 2292 KB Output is partially correct - L* = 18
36 Partially correct 35 ms 2264 KB Output is partially correct - L* = 18
37 Partially correct 35 ms 2228 KB Output is partially correct - L* = 20
38 Partially correct 36 ms 2264 KB Output is partially correct - L* = 18
39 Partially correct 35 ms 2252 KB Output is partially correct - L* = 18
40 Partially correct 36 ms 2272 KB Output is partially correct - L* = 19