답안 #993862

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
993862 2024-06-06T15:39:43 Z onbert Broken Device (JOI17_broken_device) C++17
85 / 100
27 ms 3040 KB
#include "Annalib.h"
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int m = 37;
const int R[m+1] = {0, 1, 2, 1, 2, 1, 2, 1, 1, 0, 0, 1, 0, 2, 0, 1, 0, 0, 2, 2, 1, 0, 2, 0, 1, 0, 0, 0, 0, 2, 2, 1, 2, 1, 1, 0, 1, 0};
 
void Anna(int32_t n, long long X, int32_t k, int32_t p[]){
    int a[n];
    for (int i=0;i<n;i++) a[i] = 1;
    for (int i=0;i<k;i++) a[p[i]] = 0;
    // for (int i=0;i<n;i++) if (a[i ^ 1]==0) a[i] = 0;
    int cur = 0;
    for (int i=0;i<n && cur<=m;i+=2) {
        int val = (X + R[cur]) % 3;
        int x = 1, y = 1;
        if (val==0) x = 0, y = 1;
        if (val==1) x = 1, y = 0;
        if ((!a[i] && x) || (!a[i+1] && y)) {
            a[i] = 0, a[i+1] = 0;
            continue;
        }
        a[i] = x, a[i+1] = y;
        X /= 3;
        cur++;
    }
    // for (int i=0;i<n;i++) cout << a[i]; cout << endl;
    for (int i=0;i<n;i++) Set(i, (int32_t)a[i]);
}
#include "Brunolib.h"
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int m = 37;
const int R[m+1] = {0, 1, 2, 1, 2, 1, 2, 1, 1, 0, 0, 1, 0, 2, 0, 1, 0, 0, 2, 2, 1, 0, 2, 0, 1, 0, 0, 0, 0, 2, 2, 1, 2, 1, 1, 0, 1, 0};
 
long long Bruno(int32_t n, int32_t a[]){
    int pwr[m+1];
    pwr[0] = 1;
    for (int i=1;i<=m;i++) pwr[i] = pwr[i-1] * 3;
    int x = 0;
    int cur = 0;
    for (int i=0;i<n && cur<=m;i+=2) if (a[i] || a[i+1]) {
        int bit = 0;
        if (a[i]==1 && a[i+1]==0) bit = 1;
        if (a[i]==1 && a[i+1]==1) bit = 2;
        bit = (bit - R[cur] + 3) % 3;
        x += bit * pwr[cur];
        cur++;
    }
    // cout << endl;
    return x;
}
# 결과 실행 시간 메모리 Grader output
1 Partially correct 26 ms 2816 KB Output is partially correct - L* = 37
2 Partially correct 22 ms 2720 KB Output is partially correct - L* = 37
3 Partially correct 20 ms 2776 KB Output is partially correct - L* = 37
4 Partially correct 20 ms 2772 KB Output is partially correct - L* = 37
5 Partially correct 20 ms 2652 KB Output is partially correct - L* = 37
6 Partially correct 22 ms 2784 KB Output is partially correct - L* = 37
7 Partially correct 22 ms 2776 KB Output is partially correct - L* = 37
8 Partially correct 23 ms 3040 KB Output is partially correct - L* = 37
9 Partially correct 23 ms 2776 KB Output is partially correct - L* = 37
10 Partially correct 20 ms 2756 KB Output is partially correct - L* = 37
11 Partially correct 22 ms 2784 KB Output is partially correct - L* = 37
12 Partially correct 22 ms 2784 KB Output is partially correct - L* = 37
13 Partially correct 22 ms 2828 KB Output is partially correct - L* = 37
14 Partially correct 23 ms 2780 KB Output is partially correct - L* = 37
15 Partially correct 22 ms 2772 KB Output is partially correct - L* = 37
16 Partially correct 20 ms 2772 KB Output is partially correct - L* = 37
17 Partially correct 22 ms 2768 KB Output is partially correct - L* = 37
18 Partially correct 20 ms 2776 KB Output is partially correct - L* = 37
19 Partially correct 20 ms 2788 KB Output is partially correct - L* = 37
20 Partially correct 22 ms 2776 KB Output is partially correct - L* = 37
21 Partially correct 22 ms 2768 KB Output is partially correct - L* = 37
22 Partially correct 20 ms 2772 KB Output is partially correct - L* = 37
23 Partially correct 23 ms 2752 KB Output is partially correct - L* = 37
24 Partially correct 24 ms 2776 KB Output is partially correct - L* = 37
25 Partially correct 23 ms 2776 KB Output is partially correct - L* = 37
26 Partially correct 22 ms 2860 KB Output is partially correct - L* = 37
27 Partially correct 20 ms 2776 KB Output is partially correct - L* = 37
28 Partially correct 23 ms 3028 KB Output is partially correct - L* = 37
29 Partially correct 20 ms 2772 KB Output is partially correct - L* = 37
30 Partially correct 23 ms 2692 KB Output is partially correct - L* = 37
31 Partially correct 23 ms 2768 KB Output is partially correct - L* = 38
32 Partially correct 24 ms 2776 KB Output is partially correct - L* = 37
33 Partially correct 24 ms 2764 KB Output is partially correct - L* = 37
34 Partially correct 22 ms 2772 KB Output is partially correct - L* = 37
35 Partially correct 24 ms 2776 KB Output is partially correct - L* = 37
36 Partially correct 23 ms 2776 KB Output is partially correct - L* = 37
37 Partially correct 22 ms 2776 KB Output is partially correct - L* = 37
38 Partially correct 22 ms 2748 KB Output is partially correct - L* = 37
39 Partially correct 20 ms 2860 KB Output is partially correct - L* = 37
40 Partially correct 27 ms 2688 KB Output is partially correct - L* = 37