oj.uz

답안 #753515

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
753515 2023-06-05T12:21:56 Z piOOE Broken Device (JOI17_broken_device) C++17
8 / 100
 40 ms 2452 KB 
#include "Annalib.h"
#include <bits/stdc++.h>

using namespace std;
using ll = long long;

constexpr ll Y = 983154202215176696LL;
vector<int> p = {76, 28, 65, 116, 25, 94, 61, 39, 87, 128, 55, 79, 73, 107, 52, 89, 82, 74, 109, 1, 115, 18, 88, 9, 72, 21, 77, 127, 130, 30, 8, 35, 56, 63, 27, 59, 78, 60, 41, 148, 46, 124, 143, 93, 4, 96, 10, 100, 44, 67, 149, 36, 85, 50, 138, 122, 132, 49, 105, 118, 91, 84, 113, 110, 83, 2, 101, 6, 97, 43, 22, 134, 119, 31, 45, 20, 66, 57, 80, 120, 33, 108, 14, 54, 104, 146, 3, 24, 69, 37, 141, 70, 117, 15, 64, 19, 111, 86, 129, 140, 136, 51, 106, 102, 58, 126, 92, 145, 26, 13, 7, 121, 12, 38, 16, 103, 99, 71, 114, 34, 5, 53, 40, 147, 144, 98, 142, 90, 135, 32, 17, 29, 68, 133, 81, 0, 125, 48, 42, 123, 23, 139, 11, 112, 131, 95, 75, 47, 137, 62};
const string B = "101110010101111001100011001010100001001010010100010111100111101100010000001101010100101000000011011010011010101100110100110111101101000101000001001111";

void Anna(int N, long long X, int K, int P[]) {
    vector<int> a(N), used(N);
    X ^= Y;

    for (int i = 0; i < K; ++i) {
        used[P[i]] = true;
    }

    for (int i = 0, b = 0; i < N; ++i) {
        if (!used[p[i]] && (X >> b & 1) == (B[i] - '0')) {
            a[p[i]] = 1;
            b += 1;
        }
    }

    for (int i = 0; i < N; i++) {
        Set(i, a[i]);
    }
}

#include "Brunolib.h"
#include <bits/stdc++.h>

using namespace std;
using ll = long long;

constexpr ll Y = 983154202215176696LL;
vector<int> p = {76, 28, 65, 116, 25, 94, 61, 39, 87, 128, 55, 79, 73, 107, 52, 89, 82, 74, 109, 1, 115, 18, 88, 9, 72, 21, 77, 127, 130, 30, 8, 35, 56, 63, 27, 59, 78, 60, 41, 148, 46, 124, 143, 93, 4, 96, 10, 100, 44, 67, 149, 36, 85, 50, 138, 122, 132, 49, 105, 118, 91, 84, 113, 110, 83, 2, 101, 6, 97, 43, 22, 134, 119, 31, 45, 20, 66, 57, 80, 120, 33, 108, 14, 54, 104, 146, 3, 24, 69, 37, 141, 70, 117, 15, 64, 19, 111, 86, 129, 140, 136, 51, 106, 102, 58, 126, 92, 145, 26, 13, 7, 121, 12, 38, 16, 103, 99, 71, 114, 34, 5, 53, 40, 147, 144, 98, 142, 90, 135, 32, 17, 29, 68, 133, 81, 0, 125, 48, 42, 123, 23, 139, 11, 112, 131, 95, 75, 47, 137, 62};
const string B = "101110010101111001100011001010100001001010010100010111100111101100010000001101010100101000000011011010011010101100110100110111101101000101000001001111";

long long Bruno(int N, int A[]) {
    ll X = 0;

    for (int i = 0, b = 0; i < N; ++i) {
        if (A[p[i]]) {
            X |= ll(B[i] - '0') << b;
            b += 1;
        }
    }

    X ^= Y;

    return X;
}

Subtask #1
8.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 32 ms 2192 KB Output is partially correct - L* = 23
2 Partially correct 30 ms 2340 KB Output is partially correct - L* = 20
3 Partially correct 30 ms 2356 KB Output is partially correct - L* = 20
4 Partially correct 30 ms 2452 KB Output is partially correct - L* = 22
5 Partially correct 30 ms 2240 KB Output is partially correct - L* = 22
6 Partially correct 30 ms 2228 KB Output is partially correct - L* = 19
7 Partially correct 31 ms 2256 KB Output is partially correct - L* = 25
8 Partially correct 28 ms 2252 KB Output is partially correct - L* = 20
9 Partially correct 28 ms 2220 KB Output is partially correct - L* = 16
10 Partially correct 30 ms 2332 KB Output is partially correct - L* = 21
11 Partially correct 32 ms 2332 KB Output is partially correct - L* = 20
12 Partially correct 39 ms 2416 KB Output is partially correct - L* = 19
13 Partially correct 35 ms 2256 KB Output is partially correct - L* = 23
14 Partially correct 33 ms 2284 KB Output is partially correct - L* = 19
15 Partially correct 31 ms 2228 KB Output is partially correct - L* = 21
16 Partially correct 28 ms 2340 KB Output is partially correct - L* = 16
17 Partially correct 36 ms 2284 KB Output is partially correct - L* = 18
18 Partially correct 31 ms 2292 KB Output is partially correct - L* = 17
19 Partially correct 37 ms 2248 KB Output is partially correct - L* = 15
20 Partially correct 31 ms 2272 KB Output is partially correct - L* = 18
21 Partially correct 31 ms 2276 KB Output is partially correct - L* = 21
22 Partially correct 33 ms 2356 KB Output is partially correct - L* = 16
23 Partially correct 36 ms 2284 KB Output is partially correct - L* = 20
24 Partially correct 40 ms 2264 KB Output is partially correct - L* = 22
25 Partially correct 31 ms 2376 KB Output is partially correct - L* = 15
26 Partially correct 33 ms 2368 KB Output is partially correct - L* = 15
27 Partially correct 32 ms 2280 KB Output is partially correct - L* = 17
28 Partially correct 30 ms 2228 KB Output is partially correct - L* = 14
29 Partially correct 40 ms 2452 KB Output is partially correct - L* = 21
30 Partially correct 34 ms 2312 KB Output is partially correct - L* = 21
31 Partially correct 32 ms 2412 KB Output is partially correct - L* = 23
32 Partially correct 30 ms 2248 KB Output is partially correct - L* = 19
33 Partially correct 28 ms 2424 KB Output is partially correct - L* = 16
34 Partially correct 35 ms 2232 KB Output is partially correct - L* = 18
35 Partially correct 30 ms 2172 KB Output is partially correct - L* = 16
36 Partially correct 28 ms 2336 KB Output is partially correct - L* = 17
37 Partially correct 30 ms 2232 KB Output is partially correct - L* = 18
38 Partially correct 31 ms 2332 KB Output is partially correct - L* = 22
39 Partially correct 29 ms 2232 KB Output is partially correct - L* = 21
40 Partially correct 28 ms 2236 KB Output is partially correct - L* = 16