QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#311079#4675. Multiple Communicationslefy0 1ms3860kbC++141.3kb2024-01-21 21:34:212024-01-21 21:34:22

Judging History

你现在查看的是最新测评结果

  • [2024-01-21 21:34:22]
  • 评测
  • 测评结果:0
  • 用时:1ms
  • 内存:3860kb
  • [2024-01-21 21:34:21]
  • 提交

answer

#include<bits/stdc++.h>
using namespace std;
const int N=1010;
int a[N],A[N],B[N];
char ch[10],b[N],c[N*3],d[N*3];
int main(){
    srand(1311307);
    for(int i=1;i<=1000;i++){
        a[i]=(rand()<<15)|rand();
    }
    scanf("%s",ch+1);
    if(ch[0]=='A'||ch[0]=='B'){
		int tot=0;
        //~ for(int i=1;i<=100;i++){
            //~ scanf("%s",b+1);int now=0;
            //~ for(int j=1;j<=1000;j++)if(b[j]=='1'){
                //~ now^=a[j];
            //~ }
            //~ for(int j=29;j>=0;j--)if(now&(1<<j))c[++tot]='1';else c[++tot]='0';
        //~ }
        for(int i=1;i<=tot;i++)putchar(c[i]);
        return 0;
    }
    //~ scanf("%s%s",c+1,d+1);
    //~ int tot=1;
    //~ for(int i=1;i<=100;i++){
        //~ for(int j=1;j<=30;j++,tot++)A[i]<<=1,A[i]|=c[tot]-'0';
    //~ }
    //~ tot=1;
    //~ for(int i=1;i<=100;i++){
        //~ for(int j=1;j<=30;j++,tot++)B[i]<<=1,B[i]|=d[tot]-'0';
    //~ }
    //~ for(int id=1;id<=100;id++){
        //~ int ans=-1,ans2=-1,now=0;
        //~ scanf("%s",b+1);for(int i=1;i<=1000;i++)if(b[i]=='1')now^=a[i];
        //~ for(int i=1;i<=100;i++)for(int j=1;j<=100;j++)if((A[i]^B[j])==now){
            //~ ans=i,ans2=j;break;
        //~ }
        //~ printf("%d %d\n",ans,ans2);
    //~ }
    return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 0
Wrong Answer
time: 1ms
memory: 3860kb

First Run Input

Alice
111101001110010010001100100110111010100101011011100010101101001000010111100100110100000111101101111110010010000110000110111000111101010101011000000011011110000001000101110110101110010011110110110000100101110111000010010101010110011010001101100111001010100011001000100101100101010110000100001110...

First Run Output


Second Run Input


Second Run Output


Third Run Input


Third Run Output


Manager to Checker

WA
Wrong Answer on First Run: the length of the output should be exactly 3000.

result:

wrong answer WA