QOJ.ac

QOJ

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#310819	#4675. Multiple Communications	11d10xy	0	3ms	3556kb	C++14	894b	2024-01-21 18:29:44	2024-01-21 18:29:44

Judging History

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

[2024-01-21 18:29:44]
评测

测评结果：0
用时：3ms
内存：3556kb

查看

[2024-01-21 18:29:44]
提交

answer

#include<bits/stdc++.h>
using namespace std;
using u64=unsigned long long;
u64 h(u64 i){return(i*i+998244853)*-i;}
u64 val(){
   string s;cin>>s;
   u64 v=0;
   for(int i=0;i<1000;i++)if(s[i]=='1')v^=h(i);
   return v;
}
int main(){
   string a;cin>>a;
   if(a=="Clara"s){
      string A,B;
      cin>>A>>B;
      u64 ha[100]{},hb[100]{};
      for(int i=0;i<100;i++)for(int k=0;k<30;k++)ha[i]|=A[i*30+k]-'0'<<k;
      for(int i=0;i<100;i++)for(int k=0;k<30;k++)hb[i]|=B[i*30+k]-'0'<<k;
      for(int i=0;i<100;i++){
         u64 x=val();
         for(int j=0,flg=0;!flg&&j<100;j++)for(int k=0;!flg&&k<100;k++)
         if(x==(ha[j]^hb[k])){
            cout<<j+1<<' '<<k+1<<endl;
            flg=1;
         }
      }
   }else{
      for(int i=0;i<100;i++){
         u64 x=val();
         for(int k=0;k<30;k++)putchar('0'+(x>>k&1));
      }
   }
   return 0;
}

源文件, 语言: C++14

详细

Test #1:

score: 0

Wrong Answer

time: 3ms

memory: 3556kb

First Run Input

Alice
111101001110010010001100100110111010100101011011100010101101001000010111100100110100000111101101111110010010000110000110111000111101010101011000000011011110000001000101110110101110010011110110110000100101110111000010010101010110011010001101100111001010100011001000100101100101010110000100001110...

First Run Output

010001101001011110101001101111001101100111010001100000000111011101101101111010001111101000010111111001100101110001000000011111000000010011101000100111000010101111110010101111100111011110010100110010110111011100011000000111101100000111100101011010100010111000111011010110001100101111001110010111000010...

Second Run Input

Bob
00000011100010001101011001011110011000101110001001000111010100011010001011101011100001110101110110110101111101110000110101010101000111101000110110001000010010100100100000110101000110110110111110100000101111101010100111000111100011000011111000000110000101101101001100111010001110110001101011101111...

Second Run Output

011001101101110001001010110111000011001101110010011001000011001001000111011110101010010001011001100011001111000011000100000110001010011000000101011111010001101100001001011100000101010000100010111100101010100010010111001001001000001111010011000010000001011001001110011100011001010100111111101001010110...

Third Run Input

Clara
010001101001011110101001101111001101100111010001100000000111011101101101111010001111101000010111111001100101110001000000011111000000010011101000100111000010101111110010101111100111011110010100110010110111011100011000000111101100000111100101011010100010111000111011010110001100101111001110010111...

Third Run Output

Manager to Checker

WA
Wrong Answer on Third Run: failed to read your solution

result:

wrong answer WA