QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #394455 | #4913. 子集匹配 | Andy_Lin | 5 | 716ms | 20116kb | C++14 | 262b | 2024-04-20 14:53:00 | 2024-04-20 14:53:00 |
Judging History
answer
#include<bits/stdc++.h>
#include"hall.h"
using namespace std;
int solve(int n,int K,int s){
int mi=0,sum=0,ps;
for(int i=0;i<n;++i){
if((s>>i)&1)++sum;
else --sum;
if(sum<=mi){
ps=i;mi=sum;
}
}
return (s^(1<<ps+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
Wrong Answer
time: 1ms
memory: 3640kb
input:
15 8
output:
WA
result:
wrong answer 1st words differ - expected: 'OK', found: 'WA'
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: 5
Accepted
time: 716ms
memory: 20116kb
input:
27 14
output:
OK
result:
ok "OK"
Test #19:
score: 0
Runtime Error
input:
27 15
output:
result:
Test #20:
score: 0
Runtime Error
input:
27 16