제출 #1144752

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

Anna

#include "Annalib.h"

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



// int main(){
    
// }

Bruno

#include "Brunolib.h"

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