QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #101332 | #4913. 子集匹配 | lingchen | 0 | 0ms | 0kb | C++14 | 245b | 2023-04-29 10:24:45 | 2023-04-29 10:24:48 |
Judging History
answer
#include "hall.h"
// #include "grader.cpp"
#include<bitset>
using namespace std;
bitset<1<<15> b;
int solve(int n,int K,int s)
{
for(int i=0; i<n; i++)
if(((s>>i)&1)&&!b[s^(1<<i)])
{
b[s^(1<<i)]=1;
return s^(1<<i);
}
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 0
Time Limit Exceeded
input:
14 8
output:
result:
Test #2:
score: 0
Time Limit Exceeded
input:
15 8
output:
result:
Test #3:
score: 0
Time Limit Exceeded
input:
15 9
output:
result:
Test #4:
score: 0
Time Limit Exceeded
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