QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#142857	#3097. Shopping	Qingyu	0	3ms	3652kb	C++20	750b	2023-08-20 00:52:55	2023-08-20 01:27:59

Judging History

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

[2023-08-20 01:27:59]
管理员手动重测该提交记录

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

查看

[2023-08-20 01:08:44]
管理员手动重测该提交记录

测评结果：0
用时：2ms
内存：3724kb

查看

[2023-08-20 01:08:14]
管理员手动重测该提交记录

测评结果：0
用时：2ms
内存：3644kb

查看

[2023-08-20 00:52:58]
评测

测评结果：0
用时：2ms
内存：3688kb

查看

[2023-08-20 00:52:55]
提交

Anna

#include "Anna.h"
#include <vector>

namespace {

int N, L, R;
int count;

}  // namespace

void InitA(int N, int L, int R) {
  ::N = N;
  ::L = L;
  ::R = R;
  SendA(true);
  count = 1;
}

void ReceiveA(bool x) {
  if (count < 18) {
    SendA(x);
    ++count;
  }
}

int Answer() {
  return L;
}

Source code, Language: C++20

Bruno

#include "Bruno.h"
#include <vector>

namespace {

int N;
int variable_example[1000000];
int count;

bool FunctionExample(bool P) {
  return !P;
}

}  // namespace

void InitB(int N, std::vector<int> P) {
  ::N = N;
  for(int i = 0; i < N; i++) {
    variable_example[i] = P[i];
  }
  count = 0;
}

void ReceiveB(bool y) {
  if (count < 10000) {
    SendB(FunctionExample(y));
    ++count;
  }
}

Source code, Language: C++20

Details

Tip: Click on the bar to expand more detailed information

Subtask #1:

score: 0

Wrong Answer

Test #1:

score: 1

Accepted

time: 3ms

memory: 3508kb

input:

1
-1
0
-1
1
-1
0
-1
1
-1
0
-1
1
-1
0
-1
1
-1
0
-1
1
-1
0
-1
1
-1
0
-1
1
-1
0
-1
1
-1
0
-1
-1
-1

output:

-1
0
-1
1
-1
0
-1
1
-1
0
-1
1
-1
0
-1
1
-1
0
-1
1
-1
0
-1
1
-1
0
-1
1
-1
0
-1
1
-1
0
-1
1
-1
-1

input:

output:

Accepted: 18 18

result:

ok

Test #2:

score: 1

Accepted

time: 2ms

memory: 3564kb

input:

1
-1
0
-1
1
-1
0
-1
1
-1
0
-1
1
-1
0
-1
1
-1
0
-1
1
-1
0
-1
1
-1
0
-1
1
-1
0
-1
1
-1
0
-1
-1
-1

output:

-1
0
-1
1
-1
0
-1
1
-1
0
-1
1
-1
0
-1
1
-1
0
-1
1
-1
0
-1
1
-1
0
-1
1
-1
0
-1
1
-1
0
-1
1
-1
-1

input:

output:

Accepted: 18 18

result:

ok

Test #3:

score: 0

Wrong Answer

time: 2ms

memory: 3652kb

input:

1
-1
0
-1
1
-1
0
-1
1
-1
0
-1
1
-1
0
-1
1
-1
0
-1
1
-1
0
-1
1
-1
0
-1
1
-1
0
-1
1
-1
0
-1
-1
-1

output:

-1
0
-1
1
-1
0
-1
1
-1
0
-1
1
-1
0
-1
1
-1
0
-1
1
-1
0
-1
1
-1
0
-1
1
-1
0
-1
1
-1
0
-1
1
-1
-1

input:

output:

Wrong Answer [2]

result:

wrong answer

Subtask #2:

score: 0

Skipped

Subtask #3:

score: 0

Skipped