QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#604769 | #7510. Independent Set | cjx | TL | 1ms | 3820kb | C++14 | 1.7kb | 2024-10-02 13:49:26 | 2024-10-02 13:49:27 |
Judging History
answer
#include<bits/stdc++.h>
#define ll long long
using namespace std;
long long read(){
long long x=0,f=1;char ch=getchar();
while(!isdigit(ch))
{if(ch=='-') f=-1;ch=getchar();}
while(isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;
}
void write(long long x){
if(x<0) putchar('-'),x=-x;
if(x>9) write(x/10);
putchar(x%10+'0');
}
const int N=4010;
int n;
int edge[N][N],sum;
vector<int>a,b,ep;
vector<int>ask(vector<int>e){
vector<int>g;
printf("? %d",e.size());
for(register auto x:e)printf(" %d",x);
puts("");
fflush(stdout);
g.clear();
for(register int i=0;i<e.size();i++){
g.push_back(read());
}
return g;
}
int main(){
//freopen(".in","r",stdin);
//freopen(".out","w",stdout);
n=read();
for(register int i=1;i<=n;i++){
for(register int j=1;j<=n;j++){
edge[i][j]=-1;
}
}
for(register int i=1;i<=n;i++){
a.clear();a.push_back(i);
a.push_back(i);
b=ask(a);
edge[i][i]=b[1];
}
for(register int i=1;i<n;i++){
while(1){
a.clear();a.push_back(i);
for(register int j=i+1;j<=n;j++){
if(edge[i][j]==-1){
a.push_back(j);
}
}
if(a.size()==1)break;
b=ask(a);
ep.clear();ep.push_back(i);
for(register int j=1;j<a.size();j++){
if(!b[j]){
for(register auto x:ep)edge[a[j]][x]=edge[x][a[j]]=0;
ep.push_back(a[j]);
}
else if(ep.size()==1){
edge[i][a[j]]=edge[a[j]][i]=b[j];
}
}
}
}
for(register int i=1;i<=n;i++){
for(register int j=i;j<=n;j++){
sum+=edge[i][j];
}
}
printf("! %d",sum);
for(register int i=1;i<=n;i++){
for(register int j=i;j<=n;j++){
for(register int k=1;k<=edge[i][j];k++)
printf(" %d %d",i,j);
}
}
puts("");
fflush(stdout);
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 3820kb
input:
4 0 0 0 0 0 0 0 1 0 2 1 0 0 0 0
output:
? 2 1 1 ? 2 2 2 ? 2 3 3 ? 2 4 4 ? 4 1 2 3 4 ? 3 2 3 4 ! 4 1 2 1 2 1 3 4 4
result:
ok Ok, Accepted!
Test #2:
score: -100
Time Limit Exceeded
input:
4000 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0...
output:
? 2 1 1 ? 2 2 2 ? 2 3 3 ? 2 4 4 ? 2 5 5 ? 2 6 6 ? 2 7 7 ? 2 8 8 ? 2 9 9 ? 2 10 10 ? 2 11 11 ? 2 12 12 ? 2 13 13 ? 2 14 14 ? 2 15 15 ? 2 16 16 ? 2 17 17 ? 2 18 18 ? 2 19 19 ? 2 20 20 ? 2 21 21 ? 2 22 22 ? 2 23 23 ? 2 24 24 ? 2 25 25 ? 2 26 26 ? 2 27 27 ? 2 28 28 ? 2 29 29 ? 2 30 30 ? 2 31 31 ? 2 32 3...