QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #394211 | #4913. 子集匹配 | lfxxx | 0 | 0ms | 0kb | C++17 | 225b | 2024-04-20 10:20:39 | 2024-04-20 10:20:39 |
answer
#include"hall.h"
int solve(int n,int K,int s)
{
int id = n, sum = 0, mn = 0;
for (int i = n - 1; i >= 0; --i) {
sum += ((s >> K) & 1 ? 1 : -1);
if (sum <= mn) mn = sum, id = i;
}
return s ^ (1 << (id - 1));
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 0
Runtime Error
input:
14 8
output:
result:
Test #2:
score: 0
Runtime Error
input:
15 8
output:
result:
Test #3:
score: 0
Runtime Error
input:
15 9
output:
result:
Test #4:
score: 0
Runtime Error
input:
15 10
output:
result:
Test #5:
score: 0
Runtime Error
input:
18 10
output:
result:
Test #6:
score: 0
Runtime Error
input:
19 10
output:
result:
Test #7:
score: 0
Runtime Error
input:
19 11
output:
result:
Test #8:
score: 0
Runtime Error
input:
19 12
output:
result:
Test #9:
score: 0
Runtime Error
input:
22 12
output:
result:
Test #10:
score: 0
Runtime Error
input:
23 12
output:
result:
Test #11:
score: 0
Runtime Error
input:
23 13
output:
result:
Test #12:
score: 0
Runtime Error
input:
23 14
output:
result:
Test #13:
score: 0
Runtime Error
input:
24 13
output:
result:
Test #14:
score: 0
Runtime Error
input:
25 13
output:
result:
Test #15:
score: 0
Runtime Error
input:
25 14
output:
result:
Test #16:
score: 0
Runtime Error
input:
25 15
output:
result:
Test #17:
score: 0
Runtime Error
input:
26 14
output:
result:
Test #18:
score: 0
Runtime Error
input:
27 14
output:
result:
Test #19:
score: 0
Runtime Error
input:
27 15
output:
result:
Test #20:
score: 0
Runtime Error
input:
27 16