oj.uz

답안 #753528

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

using namespace std;
using ll = long long;

constexpr ll Y = 983154202215176696LL;
vector<int> p = {76, 28, 116, 65, 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 = "101010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101010";

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;
    }
    
    if (X & 1) {
        if (!used[p[0]]) {
            a[p[0]] = 1;
        } else if (!used[p[1]]) {
            a[p[1]] = 1;
        } else {
            a[p[2]] = 1;
        }
    }

    for (int i = 3, b = 1; 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 = "101010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101010101010";

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

    if (A[p[0]] || A[p[1]] || A[p[2]]) {
        X = 1;
    }

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

    X ^= Y;

    return X;
}

Subtask #1
0.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 29 ms 2232 KB Output isn't correct - L* = 0
2 Partially correct 37 ms 2340 KB Output isn't correct - L* = 0
3 Partially correct 30 ms 2348 KB Output isn't correct - L* = 0
4 Partially correct 30 ms 2268 KB Output isn't correct - L* = 0
5 Partially correct 30 ms 2248 KB Output isn't correct - L* = 0
6 Partially correct 28 ms 2456 KB Output isn't correct - L* = 0
7 Partially correct 28 ms 2388 KB Output isn't correct - L* = 0
8 Partially correct 28 ms 2168 KB Output isn't correct - L* = 0
9 Partially correct 38 ms 2228 KB Output isn't correct - L* = 0
10 Partially correct 31 ms 2336 KB Output isn't correct - L* = 0
11 Partially correct 34 ms 2436 KB Output isn't correct - L* = 0
12 Partially correct 28 ms 2388 KB Output isn't correct - L* = 0
13 Partially correct 30 ms 2244 KB Output isn't correct - L* = 0
14 Partially correct 32 ms 2364 KB Output isn't correct - L* = 0
15 Partially correct 33 ms 2284 KB Output isn't correct - L* = 0
16 Partially correct 32 ms 2316 KB Output isn't correct - L* = 0
17 Partially correct 31 ms 2372 KB Output isn't correct - L* = 0
18 Partially correct 28 ms 2168 KB Output isn't correct - L* = 0
19 Partially correct 37 ms 2344 KB Output isn't correct - L* = 0
20 Partially correct 31 ms 2168 KB Output isn't correct - L* = 0
21 Partially correct 35 ms 2172 KB Output isn't correct - L* = 0
22 Partially correct 28 ms 2244 KB Output isn't correct - L* = 0
23 Partially correct 31 ms 2272 KB Output isn't correct - L* = 0
24 Partially correct 28 ms 2256 KB Output isn't correct - L* = 0
25 Partially correct 30 ms 2256 KB Output isn't correct - L* = 0
26 Partially correct 30 ms 2336 KB Output isn't correct - L* = 0
27 Partially correct 39 ms 2252 KB Output isn't correct - L* = 0
28 Partially correct 31 ms 2392 KB Output isn't correct - L* = 0
29 Partially correct 28 ms 2212 KB Output isn't correct - L* = 0
30 Partially correct 28 ms 2260 KB Output isn't correct - L* = 0
31 Partially correct 31 ms 2400 KB Output isn't correct - L* = 0
32 Partially correct 35 ms 2276 KB Output isn't correct - L* = 0
33 Partially correct 30 ms 2292 KB Output isn't correct - L* = 0
34 Partially correct 36 ms 2320 KB Output isn't correct - L* = 0
35 Partially correct 30 ms 2304 KB Output isn't correct - L* = 0
36 Partially correct 30 ms 2340 KB Output isn't correct - L* = 0
37 Partially correct 28 ms 2252 KB Output isn't correct - L* = 0
38 Partially correct 31 ms 2232 KB Output isn't correct - L* = 0
39 Partially correct 30 ms 2316 KB Output isn't correct - L* = 0
40 Partially correct 32 ms 2252 KB Output isn't correct - L* = 0