oj.uz

답안 #448135

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
448135 2021-07-29T03:07:55 Z JovanB Broken Device (JOI17_broken_device) C++17
0 / 100
 40 ms 2468 KB 
#include "Annalib.h"
#include <bits/stdc++.h>

using namespace std;

using ll = long long;

static const ll K = 626237348924392349LL;

static int radi[1005];

void Anna(int _n, long long X, int K, int P[] ){
    int n = _n;
    for(int i=0; i<n; i++) radi[i] = 1;
    for(int i=0; i<K; i++) radi[P[i]] = 0;
    if(K > 37){
        for(int i=0; i<n; i++) Set(i, 1);
        return;
    }
    X ^= K;
    int j = 0;
    for(int i=0; i<38; i++){
        int treba = X%3;
        X /= 3;
        treba++;
        for(;;){
            if(treba/2 <= radi[j] && treba%2 <= radi[j+1]){
                Set(j, treba/2);
                Set(j+1, treba%2);
                j += 2;
                break;
            }
            Set(j, 0);
            Set(j+1, 0);
            j += 2;
        }
    }
    while(j < n){
        Set(j, 0);
        j++;
    }
}

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

using namespace std;

using ll = long long;

static const ll K = 626237348924392349LL;

long long Bruno( int N, int A[] ){
    int j = 0;
    ll p3 = 1;
    ll res = 0;
    for(int i=0; i<38; i++){
        int tr;
        for(;;){
            tr = 2*A[j] + A[j+1];
            j += 2;
            if(tr) break;
        }
        res += (tr-1)*p3;
        p3 *= 3;
    }
    return res ^ K;
}

Subtask #1
0.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 37 ms 2292 KB Output isn't correct - L* = 0
2 Partially correct 39 ms 2176 KB Output isn't correct - L* = 0
3 Partially correct 40 ms 2296 KB Output isn't correct - L* = 0
4 Partially correct 38 ms 2208 KB Output isn't correct - L* = 0
5 Partially correct 37 ms 2284 KB Output isn't correct - L* = 0
6 Partially correct 38 ms 2204 KB Output isn't correct - L* = 0
7 Partially correct 37 ms 2260 KB Output isn't correct - L* = 0
8 Partially correct 38 ms 2236 KB Output isn't correct - L* = 0
9 Partially correct 37 ms 2216 KB Output isn't correct - L* = 0
10 Partially correct 40 ms 2392 KB Output isn't correct - L* = 0
11 Partially correct 37 ms 2340 KB Output isn't correct - L* = 0
12 Partially correct 39 ms 2468 KB Output isn't correct - L* = 0
13 Partially correct 38 ms 2212 KB Output isn't correct - L* = 0
14 Partially correct 37 ms 2392 KB Output isn't correct - L* = 0
15 Partially correct 37 ms 2316 KB Output isn't correct - L* = 0
16 Partially correct 37 ms 2224 KB Output isn't correct - L* = 0
17 Partially correct 39 ms 2204 KB Output isn't correct - L* = 0
18 Partially correct 37 ms 2400 KB Output isn't correct - L* = 0
19 Partially correct 37 ms 2204 KB Output isn't correct - L* = 0
20 Partially correct 37 ms 2184 KB Output isn't correct - L* = 0
21 Partially correct 37 ms 2204 KB Output isn't correct - L* = 0
22 Partially correct 38 ms 2232 KB Output isn't correct - L* = 0
23 Partially correct 37 ms 2248 KB Output isn't correct - L* = 0
24 Partially correct 37 ms 2204 KB Output isn't correct - L* = 0
25 Partially correct 38 ms 2324 KB Output isn't correct - L* = 0
26 Partially correct 37 ms 2236 KB Output isn't correct - L* = 0
27 Partially correct 38 ms 2244 KB Output isn't correct - L* = 0
28 Partially correct 39 ms 2256 KB Output isn't correct - L* = 0
29 Partially correct 37 ms 2324 KB Output isn't correct - L* = 0
30 Partially correct 37 ms 2292 KB Output isn't correct - L* = 0
31 Partially correct 40 ms 2356 KB Output isn't correct - L* = 0
32 Partially correct 38 ms 2252 KB Output isn't correct - L* = 0
33 Partially correct 37 ms 2184 KB Output isn't correct - L* = 0
34 Partially correct 38 ms 2284 KB Output isn't correct - L* = 0
35 Partially correct 37 ms 2300 KB Output isn't correct - L* = 0
36 Partially correct 37 ms 2236 KB Output isn't correct - L* = 0
37 Partially correct 37 ms 2196 KB Output isn't correct - L* = 0
38 Partially correct 38 ms 2288 KB Output isn't correct - L* = 0
39 Partially correct 38 ms 2320 KB Output isn't correct - L* = 0
40 Partially correct 39 ms 2204 KB Output isn't correct - L* = 0