oj.uz

Submission #21551

# Submission time Handle Problem Language Result Execution time Memory
21551 2017-04-14T08:58:03 Z Ushio Broken Device (JOI17_broken_device) C++14
69 / 100
 75 ms 4644 KB 
#include "Annalib.h"
#include <algorithm>
#include <iostream>
#include <cstdlib>
#include <vector>
using namespace std;

const int FCT = 2;

void Anna( int N, long long X, int K, int P[] ){
    vector<int> per(N + FCT);
    srand(141417941L);
    for (int i = 0; i < N + FCT; ++i) {
        per[i] = i;
    }
    for (int i = 0; i < N; ++i) {
        int pos = i + rand() % (N - i);
        swap(per[i], per[pos]);
    }
    int bit = 0;
    int validity = 0;
    vector<bool> bad(N + FCT, false);
    for (int i = 0; i < FCT; ++i) {
        bad[per[N + i]] = true;
    }
    for (int i = 0; i < K; ++i) {
        bad[P[i]] = true;
    }
    for (int i = 0; i < N; ++i) {
        if (validity == 0) {
            bool ok = bad[per[i]];
            for (int j = 1; j <= FCT; ++j) {
                ok |= bad[per[i + j]] && bit + j - 1 <= 59 && 
                    (X & (1LL << (bit + j - 1))) != 0;
            }
            if (ok) {
                Set(per[i], 0);
                validity = 0;
            } else {
                Set(per[i], 1);
                validity = FCT;
            }
        } else {
            if (bit <= 59) {
                if (X & (1LL << bit)) {
                    Set(per[i], 1);
                } else {
                    Set(per[i], 0);
                }
                bit++;
            } else {
                Set(per[i], 0);
            }
            validity--;
        }
    }
    cerr << "In: " << X << endl;
}

#include "Brunolib.h"
#include <algorithm>
#include <iostream>
#include <cstdlib>
#include <vector>
using namespace std;

const int FCT = 2;

long long Bruno( int N, int A[] ){
    vector<int> per(N + 1);
    srand(141417941L);
    for (int i = 0; i < N + 1; ++i) {
        per[i] = i;
    }
    for (int i = 0; i < N; ++i) {
        int pos = i + rand() % (N - i);
        swap(per[i], per[pos]);
    }
    int validity = 0;
    int bit = 0;
    int64_t ans = 0;
    for (int i = 0; i < N; ++i) {
        if (validity == 0) {
            validity = A[per[i]] * FCT;
        } else {
            if (bit <= 59) {
                ans |= ((int64_t) A[per[i]]) << bit;
                ++bit;
            }
            validity--;
        }
    }
    cerr << "Out: " << ans << endl;
    return ans;
}

Subtask #1
69.0 / 100.0

# Verdict Execution time Memory Grader output
1 Partially correct 52 ms 4644 KB Output is partially correct - L* = 33
2 Partially correct 35 ms 4644 KB Output is partially correct - L* = 33
3 Partially correct 58 ms 4644 KB Output is partially correct - L* = 29
4 Partially correct 41 ms 4644 KB Output is partially correct - L* = 33
5 Partially correct 45 ms 4644 KB Output is partially correct - L* = 34
6 Partially correct 49 ms 4644 KB Output is partially correct - L* = 34
7 Partially correct 41 ms 4644 KB Output is partially correct - L* = 35
8 Partially correct 55 ms 4644 KB Output is partially correct - L* = 29
9 Partially correct 39 ms 4644 KB Output is partially correct - L* = 33
10 Partially correct 48 ms 4644 KB Output is partially correct - L* = 30
11 Partially correct 45 ms 4644 KB Output is partially correct - L* = 31
12 Partially correct 75 ms 4644 KB Output is partially correct - L* = 31
13 Partially correct 52 ms 4644 KB Output is partially correct - L* = 34
14 Partially correct 65 ms 4644 KB Output is partially correct - L* = 32
15 Partially correct 49 ms 4644 KB Output is partially correct - L* = 34
16 Partially correct 41 ms 4644 KB Output is partially correct - L* = 33
17 Partially correct 52 ms 4644 KB Output is partially correct - L* = 36
18 Partially correct 45 ms 4644 KB Output is partially correct - L* = 30
19 Partially correct 55 ms 4644 KB Output is partially correct - L* = 35
20 Partially correct 55 ms 4644 KB Output is partially correct - L* = 31
21 Partially correct 59 ms 4644 KB Output is partially correct - L* = 32
22 Partially correct 52 ms 4644 KB Output is partially correct - L* = 33
23 Partially correct 52 ms 4644 KB Output is partially correct - L* = 32
24 Partially correct 45 ms 4644 KB Output is partially correct - L* = 30
25 Partially correct 65 ms 4644 KB Output is partially correct - L* = 30
26 Partially correct 32 ms 4644 KB Output is partially correct - L* = 34
27 Partially correct 62 ms 4644 KB Output is partially correct - L* = 32
28 Partially correct 66 ms 4644 KB Output is partially correct - L* = 29
29 Partially correct 62 ms 4644 KB Output is partially correct - L* = 31
30 Partially correct 52 ms 4644 KB Output is partially correct - L* = 33
31 Partially correct 45 ms 4644 KB Output is partially correct - L* = 33
32 Partially correct 57 ms 4644 KB Output is partially correct - L* = 33
33 Partially correct 52 ms 4644 KB Output is partially correct - L* = 35
34 Partially correct 52 ms 4644 KB Output is partially correct - L* = 33
35 Partially correct 72 ms 4644 KB Output is partially correct - L* = 30
36 Partially correct 55 ms 4644 KB Output is partially correct - L* = 32
37 Partially correct 45 ms 4644 KB Output is partially correct - L* = 33
38 Partially correct 52 ms 4644 KB Output is partially correct - L* = 35
39 Partially correct 49 ms 4644 KB Output is partially correct - L* = 30
40 Partially correct 72 ms 4644 KB Output is partially correct - L* = 33