QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #137772 | #3097. Shopping | Mohammed_Atalah | 0 | 5ms | 3968kb | C++20 | 1.2kb | 2023-08-10 17:27:32 | 2023-08-10 17:27:33 |
Judging History
Anna
#include "Anna.h"
#include <vector>
#include <bits/stdc++.h>
using namespace std;
namespace {
int N, L, R;
int cnt;
vector<int> status;
int res;
} // namespace
void InitA(int N, int L, int R) {
::N = N;
::L = L;
::R = R;
res = L;
cnt = 0;
int l = L;
for (int i = 0; i <= 14; i ++) {
if (l >> i) {
SendA(1);
} else {
SendA(0);
}
}
}
void getans() {
for (int i = L; i <= R; i ++) {
if (status[i]) {
res = i;
}
}
}
void ReceiveA(bool x) {
// cout << x << ' ';
status.push_back(x);
cnt++;
if (cnt == N) {
getans();
}
}
int Answer() {
return res;
}
Bruno
#include "Bruno.h"
#include <vector>
#include <bits/stdc++.h>
using namespace std;
namespace {
int N;
vector<int> nums;
int cnt = 0;
int L = 0;
}
void minel() {
for (int i = 0; i < L; i ++) {
SendB(0);
}
int mn = nums[L];
SendB(1);
for (int i = L + 1; i < N; i ++) {
if (nums[i] < mn) {
mn = nums[i];
SendB(1);
} else {
SendB(0);
}
}
}
void InitB(int N, std::vector<int> P) {
::N = N;
nums = P;
}
void ReceiveB(bool y) {
if (y)
L += pow(2, cnt);
cnt++;
if (cnt == 15) {
minel();
}
}
详细
Subtask #1:
score: 0
Wrong Answer
Test #1:
score: 1
Accepted
time: 1ms
memory: 3560kb
input:
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 -1 -1
output:
-1 1 -1 -1
input:
output:
Accepted: 15 1
result:
ok
Test #2:
score: 1
Accepted
time: 1ms
memory: 3736kb
input:
1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 -1 -1
output:
-1 0 1 -1 -1
input:
output:
Accepted: 15 2
result:
ok
Test #3:
score: 1
Accepted
time: 0ms
memory: 3620kb
input:
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 -1 -1
output:
-1 1 1 0 -1 -1
input:
output:
Accepted: 15 3
result:
ok
Test #4:
score: 1
Accepted
time: 1ms
memory: 3620kb
input:
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 -1 -1
output:
-1 1 1 1 0 -1 -1
input:
output:
Accepted: 15 4
result:
ok
Test #5:
score: 1
Accepted
time: 1ms
memory: 3784kb
input:
1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 -1 -1
output:
-1 0 0 0 1 1 -1 -1
input:
output:
Accepted: 15 5
result:
ok
Test #6:
score: 1
Accepted
time: 2ms
memory: 3864kb
input:
1 1 1 1 1 1 1 0 0 0 0 0 0 0 0 -1 -1 -1
output:
-1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 0 0 0 0 1 0 0 0 0 0 0 0 0 0 1 1 0 0 0 0...
input:
output:
Accepted: 15 977
result:
ok
Test #7:
score: 1
Accepted
time: 5ms
memory: 3800kb
input:
1 1 1 1 1 1 1 0 0 0 0 0 0 0 0 -1 -1 -1
output:
-1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1...
input:
output:
Accepted: 15 978
result:
ok
Test #8:
score: 0
Wrong Answer
time: 0ms
memory: 3968kb
input:
1 1 1 1 1 1 1 1 1 0 0 0 0 0 0 -1 -1 -1
output:
-1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0...
input:
output:
Wrong Answer [2]
result:
wrong answer
Subtask #2:
score: 0
Skipped
Subtask #3:
score: 0
Skipped