제출 #1144755

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1144755		Almonther	Broken Device (JOI17_broken_device)	C++20	8 / 100	19 ms	1548 KiB

Anna

#include "Annalib.h"

long long arr[150]={71, 128, 65, 136, 13, 36, 79, 89, 33, 14, 107, 24, 140, 87, 18, 73, 21, 4, 30, 103, 148, 78, 104, 32, 121, 110, 62, 51, 115, 47, 117, 34, 141, 74, 69, 135, 99, 83, 20, 45, 118, 119, 59, 16, 94, 102, 41, 111, 84, 124, 68, 37, 9, 77, 97, 29, 145, 81, 27, 7, 58, 109, 82, 5, 125, 52, 75, 112, 123, 138, 86, 129, 126, 17, 130, 6, 149, 106, 40, 57, 139, 70, 2, 61, 134, 42, 122, 76, 12, 22, 95, 35, 23, 85, 80, 46, 44, 132, 10, 8, 3, 48, 88, 66, 60, 96, 120, 39, 92, 98, 143, 133, 93, 0, 63, 15, 108, 101, 100, 147, 50, 28, 53, 90, 116, 91, 11, 105, 144, 56, 55, 26, 114, 19, 113, 49, 1, 146, 142, 67, 38, 64, 72, 54, 127, 25, 31, 131, 43, 137};
long long a[60]={2, 3, 2, 2, 3, 3, 2, 3, 3, 3, 3, 2, 3, 3, 2, 2, 3, 3, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 2, 3, 3, 2, 2, 2, 3, 2, 2, 2, 3, 2, 3, 3, 2, 2, 2, 3, 2, 3, 2, 2, 3, 3, 3, 2, 3, 2, 3, 3, 2, 2};

void Anna( int N, long long X, int K, int P[] ){
    long long idx=0;
    for(int i=0;i<60;i++){
        for(int j=0;j<a[i];j++){
            Set(arr[j+idx],((1ll<<i)&X)>0);
        }
        idx+=a[i];
    }
}



// int main(){
    
// }

Bruno

#include "Brunolib.h"

long long arr[150]={71, 128, 65, 136, 13, 36, 79, 89, 33, 14, 107, 24, 140, 87, 18, 73, 21, 4, 30, 103, 148, 78, 104, 32, 121, 110, 62, 51, 115, 47, 117, 34, 141, 74, 69, 135, 99, 83, 20, 45, 118, 119, 59, 16, 94, 102, 41, 111, 84, 124, 68, 37, 9, 77, 97, 29, 145, 81, 27, 7, 58, 109, 82, 5, 125, 52, 75, 112, 123, 138, 86, 129, 126, 17, 130, 6, 149, 106, 40, 57, 139, 70, 2, 61, 134, 42, 122, 76, 12, 22, 95, 35, 23, 85, 80, 46, 44, 132, 10, 8, 3, 48, 88, 66, 60, 96, 120, 39, 92, 98, 143, 133, 93, 0, 63, 15, 108, 101, 100, 147, 50, 28, 53, 90, 116, 91, 11, 105, 144, 56, 55, 26, 114, 19, 113, 49, 1, 146, 142, 67, 38, 64, 72, 54, 127, 25, 31, 131, 43, 137};
long long a[60]={2, 3, 2, 2, 3, 3, 2, 3, 3, 3, 3, 2, 3, 3, 2, 2, 3, 3, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 2, 3, 3, 2, 2, 2, 3, 2, 2, 2, 3, 2, 3, 3, 2, 2, 2, 3, 2, 3, 2, 2, 3, 3, 3, 2, 3, 2, 3, 3, 2, 2};

long long Bruno( int N, int A[] ){
    long long ans=0;
    long long idx=0;
    for(int i=0;i<60;i++){
        bool yes=0;
        for(int j=0;j<a[i];j++) yes|=A[arr[j+idx]];
        if(yes) ans+=(1ll<<i);
        idx+=a[i];
    }
    return ans;
}

• Subtask 1: 8 / 100