QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#794733#8955. 排列misfits#100 ✓1ms3912kbC++141.1kb2024-11-30 15:42:092024-11-30 15:42:09

Judging History

This is the latest submission verdict.

  • [2024-11-30 15:42:09]
  • Judged
  • Verdict: 100
  • Time: 1ms
  • Memory: 3912kb
  • [2024-11-30 15:42:09]
  • Submitted

answer

#include<bits/stdc++.h>
#include"interactor.h"
#define uint64_t unsigned long long
#define uint32_t unsigned int
using namespace std;

// concatenate two 32-bit integers to a 64-bit integer
uint64_t to64(uint32_t low,uint32_t high)
{
	return (uint64_t)low|(uint64_t)high<<32;
}

// Split a 64-bit integer to two 32-bit integers
void to32(uint64_t x,uint32_t &low,uint32_t &high)
{
	low=x;
	high=x>>32;
}

#define ull unsigned long long
namespace GenHelper{
  ull seed=19260817ull;
  inline void Get(){seed^=(seed<<7);seed^=(seed>>11);seed^=(seed<<13);return ;}
  inline ull Rand(){Get();return (seed^(seed<<32ull));}
}using GenHelper::Rand;
//inline LL random(LL a,LL b){return (Rand()%(b-a+1)+a);}

#define ui unsigned int

int guessb()
{
  ull X=Rand();ui x0=0,x1=0;to32(X,x0,x1);
  ull D=Rand();ui dt=0,tm=0;to32(D,dt,tm);

  ull _X_=getperm(to64(x0,x1),0);ui x3=0,x4=0;to32(_X_,x3,x4);

  ui y0=(x0^dt),y1=x1;ull _Y_=getperm(to64(y0,y1),0);ui y3=0,y4=0;to32(_Y_,y3,y4);

  ui z4=(x4^dt),z3=x3;ull _Z_=getperm(to64(z3,z4),1);ui z0=0,z1=0;to32(_Z_,z0,z1);

  return (((y1^y3)==(z1^z3))?(1):(0));
}

Details

Tip: Click on the bar to expand more detailed information

Subtask #1:

score: 20
Accepted

Test #1:

score: 20
Accepted
time: 0ms
memory: 3856kb

input:

1
12824419990230211502 6284770797132110889

Test #2:

score: 20
Accepted
time: 0ms
memory: 3912kb

input:

1
12762739041067830349 11433405002106668439

Test #3:

score: 20
Accepted
time: 0ms
memory: 3804kb

input:

1
15392126947150969160 5793114871588882562

Test #4:

score: 20
Accepted
time: 0ms
memory: 3852kb

input:

1
5403124586151704163 13246826124085219982

Subtask #2:

score: 20
Accepted

Dependency #1:

100%
Accepted

Test #5:

score: 20
Accepted
time: 0ms
memory: 3856kb

input:

4
12858195064120798737 1991848486890255815

Test #6:

score: 20
Accepted
time: 0ms
memory: 3864kb

input:

4
4215194446341029033 532011002147104333

Test #7:

score: 20
Accepted
time: 0ms
memory: 3912kb

input:

4
14938454278325758444 7968986768611348785

Test #8:

score: 20
Accepted
time: 0ms
memory: 3816kb

input:

4
13774895601524998134 2915392846985319377

Subtask #3:

score: 60
Accepted

Dependency #1:

100%
Accepted

Dependency #2:

100%
Accepted

Test #9:

score: 60
Accepted
time: 1ms
memory: 3844kb

input:

100
7388216795551052497 13719330562290875706

Test #10:

score: 60
Accepted
time: 1ms
memory: 3868kb

input:

100
10572899502107715125 745983082109321559

Test #11:

score: 60
Accepted
time: 0ms
memory: 3852kb

input:

100
17723176268630430996 12841950687728405137

Test #12:

score: 60
Accepted
time: 1ms
memory: 3812kb

input:

100
8945431235884021644 14776825312425534426

Test #13:

score: 60
Accepted
time: 0ms
memory: 3860kb

input:

100
6594131267363786116 9980162954088470562

Test #14:

score: 60
Accepted
time: 1ms
memory: 3864kb

input:

100
7119583533562698863 1761591402319344194

Test #15:

score: 60
Accepted
time: 0ms
memory: 3872kb

input:

100
2681022238916974379 8182351237431726406

Test #16:

score: 60
Accepted
time: 1ms
memory: 3876kb

input:

100
4978487412409460166 1633639412652822097

Test #17:

score: 60
Accepted
time: 1ms
memory: 3820kb

input:

100
9344137772339081966 9926540854104637874

Test #18:

score: 60
Accepted
time: 0ms
memory: 3788kb

input:

100
4240406447361230263 15758957544660231693

Test #19:

score: 60
Accepted
time: 0ms
memory: 3860kb

input:

100
16804675904569566283 10955664802868632378

Test #20:

score: 60
Accepted
time: 1ms
memory: 3812kb

input:

100
15399036156042107153 4908539726546110961