oj.uz

답안 #990664

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
990664 2024-05-31T00:16:08 Z efishel Broken Device (JOI17_broken_device) C++17
0 / 100
 37 ms 3096 KB 
#include "Annalib.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vll = vector <ll>;

void Anna (int n, ll x, int k, int p[]) {
    vector <char> broken(n, false);
    for (ll i : vll(p, p+k)) broken[i] = true;
    vll th(38);
    for (ll i = 0; i < 38; i++) {
        th[i] = x%3;
        x /= 3;
    }
    // 00 none
    // 01 0
    // 10 1
    // 11 2
    ll at = 0;
    ll i = 0;
    vll set(n, 0);
    for (; i < n; i += 2) {
        if (at == 38) break;
        switch (th[at]) {
            case 0:
            if (broken[i+1]) break;
            set[i] = 1;
            set[i+1] = 0;
            at++;
            break;
            case 1:
            if (broken[i]) break;
            set[i] = 0;
            set[i+1] = 1;
            at++;
            break;
            case 2:
            if (broken[i] || broken[i+1]) break;
            set[i] = 1;
            set[i+1] = 1;
            at++;
            break;
        }
    }
    for (ll i = 0; i < n; i++) {
        Set(i, set[i]);
    }
}

#include "Brunolib.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vll = vector <ll>;

ll Bruno (int n, int a[]) {
    vll ve(a, a+n);
    vll th(38);
    ll at = 0;
    for (ll i = 0; i < n; i += 2) {
        if (at == 38) break;
        if (ve[i] == 0 && ve[i+1] == 0) continue;
        th[at++] = (
            ve[i] == 0 && ve[i+1] == 1 ? 0 :
            ve[i] == 1 && ve[i+1] == 0 ? 1 :
            ve[i] == 1 && ve[i+1] == 1 ? 2 : -15
        );
    }
    ll ans = 0;
    ll thr = 1;
    for (ll i = 0; i < 38; i++) {
        ans += th[i]*thr;
        thr *= 3;
    }
    return ans;
}

Subtask #1
0.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 20 ms 2768 KB Output isn't correct - L* = 0
2 Partially correct 20 ms 3096 KB Output isn't correct - L* = 0
3 Partially correct 20 ms 2776 KB Output isn't correct - L* = 0
4 Partially correct 20 ms 2772 KB Output isn't correct - L* = 0
5 Partially correct 20 ms 2684 KB Output isn't correct - L* = 0
6 Partially correct 20 ms 2804 KB Output isn't correct - L* = 0
7 Partially correct 25 ms 2840 KB Output isn't correct - L* = 0
8 Partially correct 22 ms 2776 KB Output isn't correct - L* = 0
9 Partially correct 20 ms 2752 KB Output isn't correct - L* = 0
10 Partially correct 20 ms 2756 KB Output isn't correct - L* = 0
11 Partially correct 27 ms 2760 KB Output isn't correct - L* = 0
12 Partially correct 20 ms 2772 KB Output isn't correct - L* = 0
13 Partially correct 20 ms 2752 KB Output isn't correct - L* = 0
14 Partially correct 20 ms 2776 KB Output isn't correct - L* = 0
15 Partially correct 20 ms 2772 KB Output isn't correct - L* = 0
16 Partially correct 20 ms 2776 KB Output isn't correct - L* = 0
17 Partially correct 20 ms 2764 KB Output isn't correct - L* = 0
18 Partially correct 29 ms 2748 KB Output isn't correct - L* = 0
19 Partially correct 20 ms 2856 KB Output isn't correct - L* = 0
20 Partially correct 25 ms 2780 KB Output isn't correct - L* = 0
21 Partially correct 20 ms 2772 KB Output isn't correct - L* = 0
22 Partially correct 20 ms 2772 KB Output isn't correct - L* = 0
23 Partially correct 24 ms 2776 KB Output isn't correct - L* = 0
24 Partially correct 20 ms 2844 KB Output isn't correct - L* = 0
25 Partially correct 20 ms 2784 KB Output isn't correct - L* = 0
26 Partially correct 20 ms 2784 KB Output isn't correct - L* = 0
27 Partially correct 20 ms 2780 KB Output isn't correct - L* = 0
28 Partially correct 20 ms 2736 KB Output isn't correct - L* = 0
29 Partially correct 27 ms 2756 KB Output isn't correct - L* = 0
30 Partially correct 26 ms 2776 KB Output isn't correct - L* = 0
31 Partially correct 20 ms 2772 KB Output isn't correct - L* = 0
32 Partially correct 20 ms 2752 KB Output isn't correct - L* = 0
33 Partially correct 20 ms 2772 KB Output isn't correct - L* = 0
34 Partially correct 37 ms 2712 KB Output isn't correct - L* = 0
35 Partially correct 20 ms 2768 KB Output isn't correct - L* = 0
36 Partially correct 20 ms 2776 KB Output isn't correct - L* = 0
37 Partially correct 20 ms 2916 KB Output isn't correct - L* = 0
38 Partially correct 20 ms 2848 KB Output isn't correct - L* = 0
39 Partially correct 20 ms 2568 KB Output isn't correct - L* = 0
40 Partially correct 20 ms 2776 KB Output isn't correct - L* = 0