QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#375557 | #5531. ICC | sichengzhou | 0 | 1ms | 4324kb | C++14 | 1.5kb | 2024-04-03 12:41:39 | 2024-07-01 04:28:40 |
Judging History
answer
#include "icc.h"
#include<bits/stdc++.h>
using namespace std;
const int N=105;
int n;
vector<int>c[N];
int a[N],b[N],lena,lenb;
void run(int n)
{
for(int i=1;i<=n;i++)
{
c[i].clear();
c[i].push_back(i);
}
for(int t=1;t<n;t++)
{
for(int j=0;j<=6;j++)
{
lena=lenb=0;
for(int i=1;i<=n;i++)
{
for(int k=0;k<c[i].size();k++)
{
if(i>>j&1)
{
a[lena++]=c[i][k];
}else{
b[lenb++]=c[i][k];
}
}
}
if(query(lena,lenb,a,b))
{
int la,ra;
la=0,ra=lena;
while(la+1<ra)
{
int mid=(la+ra)/2;
if(query(ra-la,lenb,a+la,b))
{
la=mid;
}else{
ra=mid;
}
}
int lb,rb;
lb=0,rb=lenb;
while(lb+1<rb)
{
int mid=(lb+rb)/2;
if(query(lena,rb-lb,a,b+lb))
{
lb=mid;
}else{
rb=mid;
}
}
setRoad(a[la],b[lb]);
for(int v=0;v<c[b[lb]].size();v++)
{
c[a[la]].push_back(c[b[lb]][v]);
}
c[b[lb]].clear();
break;
}
}
}
}
详细
Subtask #1:
score: 0
Wrong Answer
Test #1:
score: 0
Wrong Answer
time: 1ms
memory: 4172kb
input:
1 1500 3 15 0 2 0.0 2.5 0 3.5 0 1 1
output:
0 Wrong road!
result:
wrong answer
Subtask #2:
score: 0
Wrong Answer
Test #3:
score: 0
Wrong Answer
time: 1ms
memory: 4192kb
input:
1 2500 4 50 0 0 0.0 3.5 0 2.5 5 1 1
output:
0 Wrong road!
result:
wrong answer
Subtask #3:
score: 0
Wrong Answer
Test #6:
score: 0
Wrong Answer
time: 1ms
memory: 4248kb
input:
1 2250 6 100 0.05 2.3 0.1 0.7 0 1.5 1.7 1.1 1
output:
0 Wrong road!
result:
wrong answer
Subtask #4:
score: 0
Wrong Answer
Test #10:
score: 0
Wrong Answer
time: 1ms
memory: 4132kb
input:
1 2000 5 100 0.01 1.00 0.10 1.70 0.00 1.50 5.0 1.20 1
output:
0 Wrong road!
result:
wrong answer
Subtask #5:
score: 0
Wrong Answer
Test #14:
score: 0
Wrong Answer
time: 0ms
memory: 4260kb
input:
1 1775 4 100 0.00 0.00 0.00 2.70 0.10 7.55 0.0 1.15 1
output:
0 Wrong road!
result:
wrong answer
Subtask #6:
score: 0
Wrong Answer
Test #20:
score: 0
Wrong Answer
time: 1ms
memory: 4324kb
input:
1 1625 5 100 0.00 0.00 0.00 3.00 0.00 1.00 0.0 3 1
output:
0 Wrong road!
result:
wrong answer