QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #487374 | #2674. Vision program | snpmrnhlol | 0 | 1ms | 8868kb | C++14 | 870b | 2024-07-22 20:47:25 | 2024-07-22 20:47:26 |
answer
#include "vision.h"
#include <bits/stdc++.h>
using namespace std;
void construct_network(int n, int m, int k) {
vector <int> cand;
int l = 0,r = n*m - 1;
while(l != r){
int mij = (l + r)/2;
for(int i = l;i < mij;i++){
cand.push_back(i);
}
if(add_or(cand) == 1){
r = mij;
}else l = mij + 1;
}
int pos1 = l;
l = 0,r = n*m - 1;
while(l != r){
int mij = (l + r)/2;
for(int i = l;i < mij;i++){
cand.push_back(n*m - 1 - i);
}
if(add_or(cand) == 1){
r = mij;
}else l = mij + 1;
}
int pos2 = r;
int x1 = pos1/m,y1 = pos1%m;
int x2 = pos2/m,y2 = pos2%m;
if(abs(x1 - y1) + abs(x2 - y2) == k){
add_or({pos1});
}else{
add_not(add_or({pos1}));
}
}
詳細信息
Subtask #1:
score: 0
Wrong Answer
Test #1:
score: 0
Wrong Answer
time: 0ms
memory: 3864kb
input:
c2675211-ade0-44b0-8c15-741dd835f3d2 1 3 1 -1
output:
b17553fd-ba5a-4140-836c-491f938c515b OK 4 1 1 0 1 2 0 2 1 1 2 3 5
result:
wrong answer on inputs (0, 1), (0, 2), expected 1, but computed 0
Subtask #2:
score: 0
Wrong Answer
Test #19:
score: 0
Wrong Answer
time: 0ms
memory: 3748kb
input:
c2675211-ade0-44b0-8c15-741dd835f3d2 1 9 3 -1
output:
b17553fd-ba5a-4140-836c-491f938c515b OK 8 1 4 0 1 2 3 1 5 0 1 2 3 5 1 5 0 1 2 3 5 1 9 0 1 2 3 5 8 7 6 5 1 10 0 1 2 3 5 8 7 6 5 3 1 10 0 1 2 3 5 8 7 6 5 3 1 1 8 3 15
result:
wrong answer on inputs (0, 0), (0, 1), expected 0, but computed 1
Subtask #3:
score: 0
Skipped
Dependency #2:
0%
Subtask #4:
score: 0
Skipped
Dependency #3:
0%
Subtask #5:
score: 0
Wrong Answer
Test #48:
score: 0
Wrong Answer
time: 1ms
memory: 3832kb
input:
c2675211-ade0-44b0-8c15-741dd835f3d2 1 199 1 -1
output:
b17553fd-ba5a-4140-836c-491f938c515b OK 16 1 99 0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 8...
result:
wrong answer on inputs (0, 0), (0, 2), expected 0, but computed 1
Subtask #6:
score: 0
Wrong Answer
Test #70:
score: 8
Accepted
time: 0ms
memory: 3764kb
input:
c2675211-ade0-44b0-8c15-741dd835f3d2 2 2 1 3 128 128 129 128 130 128 131
output:
b17553fd-ba5a-4140-836c-491f938c515b OK 6 1 1 0 1 1 0 1 2 0 3 1 2 0 3 1 1 3 3 8
result:
ok
Test #71:
score: 0
Wrong Answer
time: 0ms
memory: 3812kb
input:
c2675211-ade0-44b0-8c15-741dd835f3d2 2 2 2 3 129 129 128 129 131 129 130
output:
b17553fd-ba5a-4140-836c-491f938c515b OK 6 1 1 0 1 1 0 1 2 0 3 1 2 0 3 1 1 3 3 8
result:
wrong answer on inputs (0, 0), (0, 1), expected 0, but computed 1
Subtask #7:
score: 0
Wrong Answer
Test #101:
score: 0
Wrong Answer
time: 0ms
memory: 8868kb
input:
c2675211-ade0-44b0-8c15-741dd835f3d2 200 200 1 100 524 24804 34853 20956 34628 18830 29184 28919 32573 11364 24911 2226 5624 3715 30838 2206 17143 21162 27531 20198 27242 5007 12724 27160 32586 3535 7307 17015 25466 626 13891 9132 26194 9198 33073 815 7328 6938 21395 9489 30995 10804 21530 14698 394...
output:
b17553fd-ba5a-4140-836c-491f938c515b WA Too many inputs
result:
wrong answer WA in grader: Too many inputs
Subtask #8:
score: 0
Skipped
Dependency #1:
0%