Submission #61319147


Source Code Expand

#include<bits/stdc++.h>
#include "Broken_device_lib.h"
#define ll long long
using namespace std;
const int maxn=150;
const int maxm=60;
// int cs[maxn];
// inline void Set(int x,int y){
// 	cs[x]=y;
// 	printf("%d %d\n",x,y);
// }
void Anna(int n,ll x,int k,int p[]){
	mt19937_64 rnd(20090327);
	ll c[maxn];
	for(int i=0;i<maxn;i++) c[i]=rnd()&((1ll<<60)-1);
	bool b[maxn];
	for(int i=0;i<k;i++) b[p[i]]=1;
	ll a[maxm];
	for(int j=0;j<maxm;j++) a[j]=0;
	bitset<maxn> bs[maxm],tmp;
	for(int i=0;i<maxn;i++){
		if(b[i]) continue;
		tmp.reset();
		tmp[i]=1;
		for(int j=maxm-1;j>=0;j--){
			if((c[i]>>j)&1){
				if(!a[j]){
					a[j]=c[i];
					bs[j]=tmp;
					break;
				}
				else{
					c[i]^=a[j];
					tmp^=bs[j];
				}
			}
		}
	}
	tmp.reset();
	for(int j=maxm-1;j>=0;j--){
		if((x>>j)&1){
			x^=a[j];
			tmp^=bs[j];
		}
	}
	for(int i=0;i<n;i++)
		Set(i,tmp[i]);
}
ll Bruno(int n,int a[]){
	mt19937_64 rnd(20090327);
	ll res=0;
	for(int i=0;i<n;i++)
		res^=a[i]*(rnd()&((1ll<<60)-1));
	return res;
}
// signed main(){
// 	int a[40];
// 	for(int i=0;i<40;i++) a[i]=i;
//     Anna(150,123456789101112ll,40,a);
// 	cout<<Bruno(150,cs);
// }

Submission Info

Submission Time
Task E - 壊れた機器 (Broken Device)
User DeepSeaSpray
Language C++ 20 (gcc 12.2)
Score 0
Code Size 1198 Byte
Status WA
Exec Time 50 ms
Memory 3924 KiB

Compile Error

In file included from Main.cpp:2:
Broken_device_lib.h: In function ‘int broken_device_header::main(int, char**)’:
Broken_device_lib.h:35:15: warning: unused parameter ‘argc’ [-Wunused-parameter]
   35 | int main( int argc, char** argv ){
      |           ~~~~^~~~

Judge Result

Set Name Subtask01
Score / Max Score 0 / 100
Status
WA × 41
Set Name Test Cases
Subtask01 01-00.txt, 01-01.txt, 01-02.txt, 01-03.txt, 01-04.txt, 01-05.txt, 01-06.txt, 01-07.txt, 01-08.txt, 01-09.txt, 01-10.txt, 01-11.txt, 01-12.txt, 01-13.txt, 01-14.txt, 01-15.txt, 01-16.txt, 01-17.txt, 01-18.txt, 01-19.txt, 01-20.txt, 01-21.txt, 01-22.txt, 01-23.txt, 01-24.txt, 01-25.txt, 01-26.txt, 01-27.txt, 01-28.txt, 01-29.txt, 01-30.txt, 01-31.txt, 01-32.txt, 01-33.txt, 01-34.txt, 01-35.txt, 01-36.txt, 01-37.txt, 01-38.txt, 01-39.txt, 01-40.txt
Case Name Status Exec Time Memory
01-00.txt WA 48 ms 3684 KiB
01-01.txt WA 48 ms 3852 KiB
01-02.txt WA 47 ms 3680 KiB
01-03.txt WA 48 ms 3852 KiB
01-04.txt WA 48 ms 3864 KiB
01-05.txt WA 47 ms 3856 KiB
01-06.txt WA 48 ms 3864 KiB
01-07.txt WA 48 ms 3788 KiB
01-08.txt WA 48 ms 3716 KiB
01-09.txt WA 47 ms 3836 KiB
01-10.txt WA 47 ms 3748 KiB
01-11.txt WA 47 ms 3796 KiB
01-12.txt WA 47 ms 3832 KiB
01-13.txt WA 50 ms 3800 KiB
01-14.txt WA 48 ms 3672 KiB
01-15.txt WA 47 ms 3680 KiB
01-16.txt WA 48 ms 3796 KiB
01-17.txt WA 48 ms 3836 KiB
01-18.txt WA 47 ms 3716 KiB
01-19.txt WA 47 ms 3712 KiB
01-20.txt WA 48 ms 3808 KiB
01-21.txt WA 47 ms 3904 KiB
01-22.txt WA 48 ms 3860 KiB
01-23.txt WA 47 ms 3856 KiB
01-24.txt WA 47 ms 3828 KiB
01-25.txt WA 48 ms 3924 KiB
01-26.txt WA 48 ms 3696 KiB
01-27.txt WA 48 ms 3696 KiB
01-28.txt WA 48 ms 3832 KiB
01-29.txt WA 48 ms 3748 KiB
01-30.txt WA 48 ms 3860 KiB
01-31.txt WA 48 ms 3864 KiB
01-32.txt WA 47 ms 3856 KiB
01-33.txt WA 48 ms 3784 KiB
01-34.txt WA 48 ms 3856 KiB
01-35.txt WA 48 ms 3712 KiB
01-36.txt WA 47 ms 3860 KiB
01-37.txt WA 48 ms 3784 KiB
01-38.txt WA 47 ms 3860 KiB
01-39.txt WA 48 ms 3836 KiB
01-40.txt WA 47 ms 3748 KiB