oj.uz

Submission #829175

# Submission time Handle Problem Language Result Execution time Memory
829175 2023-08-18T06:03:33 Z GrindMachine Broken Device (JOI17_broken_device) C++17
41 / 100
 41 ms 2788 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> p(n);
    rep(i,n) p[i] = i;

    // ll big_rand = 87358979875987495ll;
    // X ^= big_rand;

    int seed = 123456789;
    mt19937 rng(seed);
    shuffle(all(p),rng);

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

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

    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> p(n);
    rep(i,n) p[i] = i;

    int seed = 123456789;
    mt19937 rng(seed);
    shuffle(all(p),rng);

    int bit = 0;
    ll ans = 0;

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

    return ans;
}

Subtask #1
41.0 / 100.0

# Verdict Execution time Memory Grader output
1 Partially correct 35 ms 2472 KB Output is partially correct - L* = 17
2 Partially correct 35 ms 2568 KB Output is partially correct - L* = 17
3 Partially correct 39 ms 2504 KB Output is partially correct - L* = 17
4 Partially correct 36 ms 2612 KB Output is partially correct - L* = 17
5 Partially correct 35 ms 2568 KB Output is partially correct - L* = 17
6 Partially correct 35 ms 2480 KB Output is partially correct - L* = 16
7 Partially correct 35 ms 2520 KB Output is partially correct - L* = 17
8 Partially correct 35 ms 2540 KB Output is partially correct - L* = 16
9 Partially correct 35 ms 2612 KB Output is partially correct - L* = 16
10 Partially correct 35 ms 2604 KB Output is partially correct - L* = 17
11 Partially correct 35 ms 2488 KB Output is partially correct - L* = 18
12 Partially correct 35 ms 2552 KB Output is partially correct - L* = 17
13 Partially correct 39 ms 2484 KB Output is partially correct - L* = 17
14 Partially correct 35 ms 2596 KB Output is partially correct - L* = 18
15 Partially correct 40 ms 2536 KB Output is partially correct - L* = 17
16 Partially correct 35 ms 2648 KB Output is partially correct - L* = 17
17 Partially correct 35 ms 2424 KB Output is partially correct - L* = 18
18 Partially correct 35 ms 2616 KB Output is partially correct - L* = 18
19 Partially correct 35 ms 2580 KB Output is partially correct - L* = 16
20 Partially correct 35 ms 2684 KB Output is partially correct - L* = 18
21 Partially correct 41 ms 2536 KB Output is partially correct - L* = 17
22 Partially correct 35 ms 2472 KB Output is partially correct - L* = 18
23 Partially correct 35 ms 2416 KB Output is partially correct - L* = 17
24 Partially correct 38 ms 2620 KB Output is partially correct - L* = 17
25 Partially correct 35 ms 2524 KB Output is partially correct - L* = 17
26 Partially correct 35 ms 2464 KB Output is partially correct - L* = 19
27 Partially correct 35 ms 2572 KB Output is partially correct - L* = 18
28 Partially correct 36 ms 2528 KB Output is partially correct - L* = 18
29 Partially correct 40 ms 2788 KB Output is partially correct - L* = 15
30 Partially correct 35 ms 2472 KB Output is partially correct - L* = 16
31 Partially correct 35 ms 2604 KB Output is partially correct - L* = 17
32 Partially correct 35 ms 2496 KB Output is partially correct - L* = 17
33 Partially correct 36 ms 2480 KB Output is partially correct - L* = 17
34 Partially correct 35 ms 2492 KB Output is partially correct - L* = 18
35 Partially correct 36 ms 2480 KB Output is partially correct - L* = 17
36 Partially correct 35 ms 2480 KB Output is partially correct - L* = 16
37 Partially correct 36 ms 2716 KB Output is partially correct - L* = 16
38 Partially correct 35 ms 2584 KB Output is partially correct - L* = 17
39 Partially correct 35 ms 2600 KB Output is partially correct - L* = 18
40 Partially correct 35 ms 2532 KB Output is partially correct - L* = 18