oj.uz

답안 #829131

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
829131 2023-08-18T05:13:50 Z GrindMachine Broken Device (JOI17_broken_device) C++17
41 / 100
 33 ms 2692 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;

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

    for(int i = 0; i < n-1; ){
        if(!blocked[i] and !blocked[i+1] and bit < 60){
            val[i] = 1;
            if(X & (1ll<<bit)) val[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[] ){
    int bit = 0;
    ll ans = 0;

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

    return ans;
}

Subtask #1
41.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 26 ms 2504 KB Output is partially correct - L* = 15
2 Partially correct 27 ms 2484 KB Output is partially correct - L* = 15
3 Partially correct 26 ms 2480 KB Output is partially correct - L* = 17
4 Partially correct 26 ms 2488 KB Output is partially correct - L* = 16
5 Partially correct 28 ms 2644 KB Output is partially correct - L* = 15
6 Partially correct 27 ms 2568 KB Output is partially correct - L* = 15
7 Partially correct 27 ms 2636 KB Output is partially correct - L* = 18
8 Partially correct 26 ms 2572 KB Output is partially correct - L* = 18
9 Partially correct 26 ms 2596 KB Output is partially correct - L* = 16
10 Partially correct 27 ms 2548 KB Output is partially correct - L* = 16
11 Partially correct 27 ms 2620 KB Output is partially correct - L* = 17
12 Partially correct 26 ms 2596 KB Output is partially correct - L* = 17
13 Partially correct 26 ms 2552 KB Output is partially correct - L* = 15
14 Partially correct 25 ms 2404 KB Output is partially correct - L* = 15
15 Partially correct 25 ms 2556 KB Output is partially correct - L* = 16
16 Partially correct 26 ms 2484 KB Output is partially correct - L* = 15
17 Partially correct 26 ms 2528 KB Output is partially correct - L* = 17
18 Partially correct 26 ms 2572 KB Output is partially correct - L* = 16
19 Partially correct 26 ms 2512 KB Output is partially correct - L* = 18
20 Partially correct 27 ms 2576 KB Output is partially correct - L* = 15
21 Partially correct 26 ms 2500 KB Output is partially correct - L* = 15
22 Partially correct 26 ms 2524 KB Output is partially correct - L* = 15
23 Partially correct 26 ms 2652 KB Output is partially correct - L* = 15
24 Partially correct 26 ms 2584 KB Output is partially correct - L* = 17
25 Partially correct 33 ms 2608 KB Output is partially correct - L* = 15
26 Partially correct 26 ms 2576 KB Output is partially correct - L* = 16
27 Partially correct 28 ms 2684 KB Output is partially correct - L* = 15
28 Partially correct 27 ms 2560 KB Output is partially correct - L* = 16
29 Partially correct 26 ms 2492 KB Output is partially correct - L* = 15
30 Partially correct 26 ms 2692 KB Output is partially correct - L* = 16
31 Partially correct 26 ms 2524 KB Output is partially correct - L* = 15
32 Partially correct 25 ms 2596 KB Output is partially correct - L* = 16
33 Partially correct 27 ms 2492 KB Output is partially correct - L* = 15
34 Partially correct 30 ms 2564 KB Output is partially correct - L* = 16
35 Partially correct 25 ms 2592 KB Output is partially correct - L* = 15
36 Partially correct 26 ms 2484 KB Output is partially correct - L* = 15
37 Partially correct 25 ms 2472 KB Output is partially correct - L* = 16
38 Partially correct 25 ms 2568 KB Output is partially correct - L* = 17
39 Partially correct 26 ms 2480 KB Output is partially correct - L* = 15
40 Partially correct 25 ms 2556 KB Output is partially correct - L* = 15