QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#540100 | #8726. Magic Show | zzafanti | 0 | 0ms | 1872kb | C++23 | 1.3kb | 2024-08-31 16:26:02 | 2024-08-31 16:26:02 |
Alice
#include <vector>
#include "Alice.h"
#include<bits/stdc++.h>
// you may define some global variables, but it does not work if you try to transfer any information from function Alice() to function Bob() through these variables.
// you had better not use the same global variables in function Alice() and in function Bob().
using namespace std;
std::vector<std::pair<int,int>> Alice(){
long long X=setN(5000);
vector<pair<int,int>> T;
int P=100;
for(int i=1; i<=2500; i++){
int u=(i-1)%P;
if(((i-1)/P%2)&&(X>>u&1)||((i-1)/P%2==0)&&(X>>(P-u-1)&1)) T.emplace_back(i,i*2+1);
else T.emplace_back(i,i*2);
}
for(int i=2501; i<5000; i++) T.emplace_back(i,i+1);
assert(T.size()==4999);
return T;
}
Bob
#include <vector>
#include "Bob.h"
// you may define some global variables, but it does not work if you try to transfer any information from function Alice() to function Bob() through these variables.
// you had better not use the same global variables in function Alice() and in function Bob().
using namespace std;
long long Bob(std::vector<std::pair<int,int>> V){
long long ret=0;
for(auto pt:V){
int x=(pt.first-1)%100,y=(pt.first-1)/100;
if(pt.second==pt.first*2) continue;
if(y%2) ret|=(1<<(100-x-1));
else ret|=(1<<x);
}
return ret;
}
Details
Tip: Click on the bar to expand more detailed information
Subtask #1:
score: 0
Wrong Answer
Test #1:
score: 0
Wrong Answer
time: 0ms = 0ms + 0ms
memory: 1872kb,1768kb
input:
1 4005
output:
9ff923928e5675d6f7ae686fcfb20beac84bc7b1a47cf13bde24b59497bcae3b4900097049e1c568aa409defdbadf4cfc599c0e496e22068170cce547295ffa4 Edges returned by Alice() have invalid node.
input:
9ff923928e5675d6f7ae686fcfb20beac84bc7b1a47cf13bde24b59497bcae3b4900097049e1c568aa409defdbadf4cfc599c0e496e22068170cce547295ffa4 Edges returned by Alice() have invalid node.
output:
9ff923928e5675d6f7ae686fcfb20beac84bc7b1a47cf13bde24b59497bcae3b4900097049e1c568aa409defdbadf4cfc599c0e496e22068170cce547295ffa4 Edges returned by Alice() have invalid node.
input:
9ff923928e5675d6f7ae686fcfb20beac84bc7b1a47cf13bde24b59497bcae3b4900097049e1c568aa409defdbadf4cfc599c0e496e22068170cce547295ffa4 Edges returned by Alice() have invalid node.
output:
9ff923928e5675d6f7ae686fcfb20beac84bc7b1a47cf13bde24b59497bcae3b4900097049e1c568aa409defdbadf4cfc599c0e496e22068170cce547295ffa4 Edges returned by Alice() have invalid node.
Subtask #2:
score: 0
Wrong Answer
Test #13:
score: 0
Wrong Answer
time: 0ms = 0ms + 0ms
memory: 1872kb,1844kb
input:
1 17476204
output:
a890c6696058af3ad84e267191c856938f206a8ef7c63581510cdfa15e45f9c07d82b6a58fe3c8183e2b8f4b976dd90fbca50f420ce3dcf29a3d6a73adf47022 1 5000 1 2 2 4 3 6 4 8 5 10 6 12 7 14 8 16 9 18 10 20 11 22 12 25 13 26 14 28 15 30 16 32 17 35 18 36 19 39 20 40 21 43 22 44 23 47 24 48 25 51 26 52 27 55 28 56 29 58 30 ...
input:
a890c6696058af3ad84e267191c856938f206a8ef7c63581510cdfa15e45f9c07d82b6a58fe3c8183e2b8f4b976dd90fbca50f420ce3dcf29a3d6a73adf47022 1 5000 1 2 2 4 3 6 4 8 5 10 6 12 7 14 8 16 9 18 10 20 11 22 12 25 13 26 14 28 15 30 16 32 17 35 18 36 19 39 20 40 21 43 22 44 23 47 24 48 25 51 26 52 27 55 28 56 29 58 30 ...
output:
2 5000 4921 1 2 2 4 3 6 4 8 5 10 6 12 7 14 8 16 9 18 10 20 11 22 13 26 14 28 15 30 16 32 17 35 18 36 19 39 20 40 21 43 22 44 23 47 24 48 25 51 26 52 27 55 28 56 29 58 30 61 31 63 32 64 33 67 34 69 35 70 36 72 37 74 38 76 39 78 40 80 41 82 42 84 43 86 44 88 45 90 46 92 47 94 48 96 49 98 50 100 51 102...
input:
2 5000 4921 1 2 2 4 3 6 4 8 5 10 6 12 7 14 8 16 9 18 10 20 11 22 13 26 14 28 15 30 16 32 17 35 18 36 19 39 20 40 21 43 22 44 23 47 24 48 25 51 26 52 27 55 28 56 29 58 30 61 31 63 32 64 33 67 34 69 35 70 36 72 37 74 38 76 39 78 40 80 41 82 42 84 43 86 44 88 45 90 46 92 47 94 48 96 49 98 50 100 51 102...
output:
9ff923928e5675d6f7ae686fcfb20beac84bc7b1a47cf13bde24b59497bcae3b4900097049e1c568aa409defdbadf4cfc599c0e496e22068170cce547295ffa4 Incorrect answer.
Subtask #3:
score: 0
Wrong Answer
Test #25:
score: 0
Wrong Answer
time: 0ms = 0ms + 0ms
memory: 1868kb,1768kb
input:
1 355365355024496523
output:
9ff923928e5675d6f7ae686fcfb20beac84bc7b1a47cf13bde24b59497bcae3b4900097049e1c568aa409defdbadf4cfc599c0e496e22068170cce547295ffa4 Edges returned by Alice() have invalid node.
input:
9ff923928e5675d6f7ae686fcfb20beac84bc7b1a47cf13bde24b59497bcae3b4900097049e1c568aa409defdbadf4cfc599c0e496e22068170cce547295ffa4 Edges returned by Alice() have invalid node.
output:
9ff923928e5675d6f7ae686fcfb20beac84bc7b1a47cf13bde24b59497bcae3b4900097049e1c568aa409defdbadf4cfc599c0e496e22068170cce547295ffa4 Edges returned by Alice() have invalid node.
input:
9ff923928e5675d6f7ae686fcfb20beac84bc7b1a47cf13bde24b59497bcae3b4900097049e1c568aa409defdbadf4cfc599c0e496e22068170cce547295ffa4 Edges returned by Alice() have invalid node.
output:
9ff923928e5675d6f7ae686fcfb20beac84bc7b1a47cf13bde24b59497bcae3b4900097049e1c568aa409defdbadf4cfc599c0e496e22068170cce547295ffa4 Edges returned by Alice() have invalid node.