제출 #991254

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
991254		onbert	Broken Device (JOI17_broken_device)	C++14	0 / 100	1 ms	604 KiB

Anna

#include "Annalib.h"
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int m = 38;

void Anna(int32_t n, long long x, int32_t k, int32_t p[]){
    int pwr[m+1];
    pwr[0] = 1;
    for (int i=1;i<=m;i++) pwr[i] = pwr[i-1] * 3;
    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]) a[i] = 0;
    int cur = 0;
    for (int i=0;i<n;i+=2) if (a[i]) {
        int val = (x/pwr[cur])%3;
        if (val==0) a[i] = 0, a[i+1] = 1;
        if (val==1) a[i] = 1, a[i+1] = 0;
        cur++;
    }
    for (int i=0;i<n;i++) Set(i, a[i]);
}

Bruno

#include "Brunolib.h"
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int m = 38;

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]==1 || a[i+1]==1) {
        if (a[i]==1 && a[i+1]==0) x += pwr[cur];
        if (a[i]==1 && a[i+1]==1) x += 2*pwr[cur];
        cur++;
    }
    return x;
}

• Subtask 1: 0 / 100