QOJ.ac
QOJ
The 2nd Universal Cup Finals is coming! Check out our event page, schedule, and competition rules!
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#425886 | #7281. How to Avoid Disqualification in 75 Easy Steps | Lynkcat# | 0 | 2ms | 3928kb | C++20 | 1.1kb | 2024-05-30 18:30:34 | 2024-05-30 18:30:34 |
Judging History
answer
#include<bits/stdc++.h>
#include "avoid.h"
#define poly vector<int>
#define IOS ios::sync_with_stdio(false)
#define ll long long
#define mp make_pair
#define mt make_tuple
#define pa pair < int,int >
#define fi first
#define se second
#define inf 1e18
#define mod 998244353
#define sz(x) ((int)((x).size()))
// #define int ll
// #define N
using namespace std;
const int d[4]={3,5,7,11};
const int B=40;
mt19937_64 rnd(time(0));
ll val[1005];
pair<int,int> scout(int R, int H)
{
for (int i=1;i<=1000;i++)
val[i]=rnd()%(1ll<<B);
for (int i=0;i<B;i++)
{
poly now;
for (int j=1;j<=1000;j++)
if ((val[j]>>i)&1) now.push_back(j);
send(now);
}
poly now=wait();
ll res=0;
for (int i=0;i<sz(now);i++)
if (now[i]) res|=(1ll<<i);
for (int i=1;i<=1000;i++)
for (int j=i;j<=1000;j++)
if (res==(val[i]|val[j]))
{
return mp(i,j);
}
}
/*list:
1.mod 998244353 or 1e9+7 or ???
2.N
3.duipai shuju xingtai duoyidian
...
*/
Details
Tip: Click on the bar to expand more detailed information
Subtask #1:
score: 0
Wrong Answer
Test #1:
score: 0
Wrong Answer
time: 1ms
memory: 3848kb
input:
output:
result:
wrong answer Not correct
Subtask #2:
score: 0
Wrong Answer
Test #11:
score: 0
Wrong Answer
time: 1ms
memory: 3928kb
input:
\x14
output:
result:
wrong answer Not correct
Subtask #3:
score: 0
Wrong Answer
Test #66:
score: 0
Wrong Answer
time: 0ms
memory: 3692kb
input:
\x1e
output:
result:
wrong answer Not correct
Subtask #4:
score: 0
Wrong Answer
Test #120:
score: 0
Wrong Answer
time: 2ms
memory: 3696kb
input:
K
output:
result:
wrong answer Not correct