QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#375556 | #5531. ICC | sichengzhou | Compile Error | / | / | C++14 | 1.5kb | 2024-04-03 12:40:58 | 2024-04-03 12:40:58 |
Judging History
你现在查看的是测评时间为 2024-04-03 12:40:58 的历史记录
- [2024-07-01 04:28:38]
- 管理员手动重测本题所有提交记录
- 测评结果:Compile Error
- 用时:0ms
- 内存:0kb
- [2024-04-03 12:40:58]
- 评测
- 测评结果:Compile Error
- 用时:0ms
- 内存:0kb
- [2024-04-03 12:40:58]
- 提交
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;
}
}
}
}
int main()
{
return 0;
}
Details
/usr/bin/ld: /tmp/ccRuKHJV.o: in function `main': answer.code:(.text.startup+0x0): multiple definition of `main'; /tmp/ccLECVwU.o:implementer.cpp:(.text.startup+0x0): first defined here collect2: error: ld returned 1 exit status