Submission #1144759

#	Time	Username	Problem	Language	Result	Execution time	Memory
1144759		Almonther	Broken Device (JOI17_broken_device)	C++20	8 / 100	19 ms	1568 KiB

Anna

#include "Annalib.h"

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