oj.uz

Submission #400366

# Submission time Handle Problem Language Result Execution time Memory
400366 2021-05-07T22:19:37 Z duality Broken Device (JOI17_broken_device) C++11
77 / 100
 62 ms 3840 KB 
#define DEBUG 0

#include <bits/stdc++.h>
using namespace std;

#if DEBUG
// basic debugging macros
int __i__,__j__;
#define printLine(l) for(__i__=0;__i__<l;__i__++){cout<<"-";}cout<<endl
#define printLine2(l,c) for(__i__=0;__i__<l;__i__++){cout<<c;}cout<<endl
#define printVar(n) cout<<#n<<": "<<n<<endl
#define printArr(a,l) cout<<#a<<": ";for(__i__=0;__i__<l;__i__++){cout<<a[__i__]<<" ";}cout<<endl
#define print2dArr(a,r,c) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<a[__i__][__j__]<<" ";}cout<<endl;}
#define print2dArr2(a,r,c,l) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<setw(l)<<setfill(' ')<<a[__i__][__j__]<<" ";}cout<<endl;}

// advanced debugging class
// debug 1,2,'A',"test";
class _Debug {
    public:
        template<typename T>
        _Debug& operator,(T val) {
            cout << val << endl;
            return *this;
        }
};
#define debug _Debug(),
#else
#define printLine(l)
#define printLine2(l,c)
#define printVar(n)
#define printArr(a,l)
#define print2dArr(a,r,c)
#define print2dArr2(a,r,c,l)
#define debug
#endif

// define
#define MAX_VAL 999999999
#define MAX_VAL_2 999999999999999999LL
#define EPS 1e-6
#define mp make_pair
#define pb push_back

// typedef
typedef unsigned int UI;
typedef long long int LLI;
typedef unsigned long long int ULLI;
typedef unsigned short int US;
typedef pair<int,int> pii;
typedef pair<LLI,LLI> plli;
typedef vector<int> vi;
typedef vector<LLI> vlli;
typedef vector<pii> vpii;
typedef vector<plli> vplli;

// ---------- END OF TEMPLATE ----------
#include "Annalib.h"

LLI y = 183465789012354678LL;
vi v;
void Anna(int N,long long int X,int K,int P[]) {
    X ^= y;
    int i,j,c = 0,s = 0;
    v.pb(2);
    for (i = 0; i < 100; i++) v.pb(4);
    int bad[150];
    for (i = 0; i < N; i++) bad[i] = 0;
    for (i = 0; i < K; i++) bad[P[i]] = 1;
    i = 0;
    while (i < N) {
        if ((i+v[s]-1 < N) && !bad[i]) {
            for (j = 0; j < v[s]-1; j++) {
                if (bad[i+1+j] && (X & (1LL << (c+j)))) break;
            }
            if (j == v[s]-1) {
                Set(i,1);
                for (j = 0; j < v[s]-1; j++) {
                    if (X & (1LL << (c+j))) Set(i+1+j,1);
                    else Set(i+1+j,0);
                }
                i += v[s],c += v[s]-1,s++;
            }
            else Set(i,0),i++,s = 0;
        }
        else Set(i,0),i++,s = 0;
    }
}

#define DEBUG 0

#include <bits/stdc++.h>
using namespace std;

#if DEBUG
// basic debugging macros
int __i__,__j__;
#define printLine(l) for(__i__=0;__i__<l;__i__++){cout<<"-";}cout<<endl
#define printLine2(l,c) for(__i__=0;__i__<l;__i__++){cout<<c;}cout<<endl
#define printVar(n) cout<<#n<<": "<<n<<endl
#define printArr(a,l) cout<<#a<<": ";for(__i__=0;__i__<l;__i__++){cout<<a[__i__]<<" ";}cout<<endl
#define print2dArr(a,r,c) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<a[__i__][__j__]<<" ";}cout<<endl;}
#define print2dArr2(a,r,c,l) cout<<#a<<":\n";for(__i__=0;__i__<r;__i__++){for(__j__=0;__j__<c;__j__++){cout<<setw(l)<<setfill(' ')<<a[__i__][__j__]<<" ";}cout<<endl;}

// advanced debugging class
// debug 1,2,'A',"test";
class _Debug {
    public:
        template<typename T>
        _Debug& operator,(T val) {
            cout << val << endl;
            return *this;
        }
};
#define debug _Debug(),
#else
#define printLine(l)
#define printLine2(l,c)
#define printVar(n)
#define printArr(a,l)
#define print2dArr(a,r,c)
#define print2dArr2(a,r,c,l)
#define debug
#endif

// define
#define MAX_VAL 999999999
#define MAX_VAL_2 999999999999999999LL
#define EPS 1e-6
#define mp make_pair
#define pb push_back

// typedef
typedef unsigned int UI;
typedef long long int LLI;
typedef unsigned long long int ULLI;
typedef unsigned short int US;
typedef pair<int,int> pii;
typedef pair<LLI,LLI> plli;
typedef vector<int> vi;
typedef vector<LLI> vlli;
typedef vector<pii> vpii;
typedef vector<plli> vplli;

// ---------- END OF TEMPLATE ----------
#include "Brunolib.h"

LLI yy = 183465789012354678LL;
vi vv;
long long int Bruno(int N,int A[]) {
    int i,j,s = 0,c = 0;
    vv.pb(2);
    for (i = 0; i < 100; i++) vv.pb(4);
    LLI X = 0;
    i = 0;
    while (i < N) {
        if ((i+vv[s]-1 < N) && A[i]) {
            for (j = 0; j < vv[s]-1; j++) {
                if (A[i+1+j]) X |= (1LL << (c+j));
            }
            i += vv[s],c += vv[s]-1,s++;
        }
        else i++,s = 0;
    }
    X ^= yy;
    return X;
}

Subtask #1
77.0 / 100.0

# Verdict Execution time Memory Grader output
1 Partially correct 47 ms 3604 KB Output is partially correct - L* = 35
2 Partially correct 48 ms 3700 KB Output is partially correct - L* = 37
3 Partially correct 50 ms 3600 KB Output is partially correct - L* = 33
4 Partially correct 49 ms 3532 KB Output is partially correct - L* = 35
5 Partially correct 62 ms 3556 KB Output is partially correct - L* = 34
6 Partially correct 41 ms 3664 KB Output is partially correct - L* = 34
7 Partially correct 46 ms 3840 KB Output is partially correct - L* = 35
8 Partially correct 43 ms 3704 KB Output is partially correct - L* = 37
9 Partially correct 62 ms 3668 KB Output is partially correct - L* = 34
10 Partially correct 49 ms 3560 KB Output is partially correct - L* = 34
11 Partially correct 43 ms 3616 KB Output is partially correct - L* = 37
12 Partially correct 59 ms 3620 KB Output is partially correct - L* = 36
13 Partially correct 42 ms 3724 KB Output is partially correct - L* = 37
14 Partially correct 42 ms 3584 KB Output is partially correct - L* = 35
15 Partially correct 41 ms 3628 KB Output is partially correct - L* = 36
16 Partially correct 43 ms 3724 KB Output is partially correct - L* = 35
17 Partially correct 51 ms 3552 KB Output is partially correct - L* = 35
18 Partially correct 45 ms 3640 KB Output is partially correct - L* = 34
19 Partially correct 43 ms 3592 KB Output is partially correct - L* = 35
20 Partially correct 41 ms 3700 KB Output is partially correct - L* = 35
21 Partially correct 44 ms 3644 KB Output is partially correct - L* = 35
22 Partially correct 44 ms 3584 KB Output is partially correct - L* = 34
23 Partially correct 51 ms 3644 KB Output is partially correct - L* = 35
24 Partially correct 50 ms 3824 KB Output is partially correct - L* = 36
25 Partially correct 49 ms 3692 KB Output is partially correct - L* = 34
26 Partially correct 41 ms 3744 KB Output is partially correct - L* = 35
27 Partially correct 46 ms 3676 KB Output is partially correct - L* = 37
28 Partially correct 58 ms 3600 KB Output is partially correct - L* = 33
29 Partially correct 52 ms 3656 KB Output is partially correct - L* = 37
30 Partially correct 43 ms 3656 KB Output is partially correct - L* = 35
31 Partially correct 43 ms 3700 KB Output is partially correct - L* = 35
32 Partially correct 42 ms 3636 KB Output is partially correct - L* = 35
33 Partially correct 41 ms 3536 KB Output is partially correct - L* = 34
34 Partially correct 47 ms 3556 KB Output is partially correct - L* = 35
35 Partially correct 41 ms 3644 KB Output is partially correct - L* = 35
36 Partially correct 52 ms 3612 KB Output is partially correct - L* = 34
37 Partially correct 42 ms 3604 KB Output is partially correct - L* = 34
38 Partially correct 45 ms 3708 KB Output is partially correct - L* = 35
39 Partially correct 57 ms 3604 KB Output is partially correct - L* = 35
40 Partially correct 41 ms 3660 KB Output is partially correct - L* = 36