QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#884494	#4675. Multiple Communications	hzjoiineg	0	1ms	3840kb	C++14	1.2kb	2025-02-06 08:51:35	2025-02-06 08:51:37

Judging History

This is the latest submission verdict.

[2025-02-06 08:51:37]
Judged

Verdict: 0
Time: 1ms
Memory: 3840kb

Show

[2025-02-06 08:51:35]
Submitted

answer

#include<bits/stdc++.h>
#define rep(i, j, k) for(int i=j;i<=k;i++)
#define rep1(i, j, k) for(int i=k;i>=j;i--)
#define ll long long
#define pb push_back
#define pii pair<int, int>
#define ft first
#define sd second
using namespace std;


mt19937 rd(20090303);
const int N=1e2+5, M=3e3+5;
int rm[N];
char s[N];
bool ans[M];

void solve(){
	rep(i, 1, 100) rm[i]=rd()%10000000000;
	
	rep(i, 1, 100){
		scanf("%s", s+1); int res=0;
		rep(j, 1, 1000) if(s[j]=='1') res^=rm[j];
		rep(j, 1, 30) ans[(i-1)*30+j]=(res>>(j-1))&1;
	}
	
	rep(i, 1, 3000) putchar(ans[i]+'0');
	puts("");
}

bool a[N], b[N];

void chk(int x){
	rep(j, 1, 100) rep(k, 1, 100){
		if(a[j]^b[k]==x) return printf("%d %d\n", j, k), void();
	}
	puts("1 1");
}

int main(){
	
	scanf("%s", s+1);
	if(s[1]=='A' || s[1]=='B') solve();
	if(s[1]=='C'){
		scanf("%s", s+1);
		rep(i, 1, 100){
			rep(j, 1, 30){
				a[i]+=(s[(i-1)*30+j]-'0')<<(j-1);
			}
		}
		scanf("%s", s+1);
		rep(i, 1, 100){
			rep(j, 1, 30){
				b[i]+=(s[(i-1)*30+j]-'0')<<(j-1);
			}
		}
		
		rep(i, 1, 100){
			scanf("%s", s+1); int res=0;
			rep(j, 1, 1000) res^=rm[i];
			chk(res);
		}
	}
	
	return 0;
}
/*

1.1->2.2->2.1->3->1.2->1.3

*/

Source code, Language: C++14

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 0

Wrong Answer

time: 1ms

memory: 3840kb

First Run Input

Alice
111101001110010010001100100110111010100101011011100010101101001000010111100100110100000111101101111110010010000110000110111000111101010101011000000011011110000001000101110110101110010011110110110000100101110111000010010101010110011010001101100111001010100011001000100101100101010110000100001110...

First Run Output

111010101000000000100101110110011001011001100011000011011100011101100110110100110011001000000001100101000110001111111111101011111011101011010110110010010111111111110011101110111001011000111111110000110100010000101011000000111000011100111111010000100011110101001001100110010011100111000100101100101000...

Second Run Input

Bob
00000011100010001101011001011110011000101110001001000111010100011010001011101011100001110101110110110101111101110000110101010101000111101000110110001000010010100100100000110101000110110110111110100000101111101010100111000111100011000011111000000110000101101101001100111010001110110001101011101111...

Second Run Output

011000011111111111101011101011001100100100110001011001111100100100000000101000101100000000010100010010001000011101110001001000001110111110110100100101000100010100011110110100000101110001101111101000111100001101001110111000110110111100101011001110011001001100000110111001010001000000010011101110110101...

Third Run Input

Clara
111010101000000000100101110110011001011001100011000011011100011101100110110100110011001000000001100101000110001111111111101011111011101011010110110010010111111111110011101110111001011000111111110000110100010000101011000000111000011100111111010000100011110101001001100110010011100111000100101100...

Third Run Output

Manager to Checker

WA
You answered 0 (out of 100) questions correctly

result:

wrong answer WA