QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#655218 | #1834. Eulerian? | jiangzhihui | WA | 3ms | 3920kb | C++20 | 973b | 2024-10-19 01:35:28 | 2024-10-19 01:35:29 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
const int N=1919810;
typedef long long ll;
typedef pair<ll,ll> PII;
int n,m,k;
int a[N],b[N];
char s[N];
vector<PII> e[N];
int d[N];
bool tf[N];
int query(vector<int> &v){
cout<<"? "<<v.size()<<" ";
for(auto x:v) cout<<x<<" ";
cout<<endl;
int x;
cin>>x;
return x;
}
mt19937 rnd(time(0));
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
cin>>n;
vector<int> v;
for(int i=1;i<=n;i++) v.push_back(i);
int tot=query(v);
if(tot<n){
cout<<"! NO"<<endl;
return 0;
}
for(int i=1;i<=30;i++){
vector<int> v1,v2;
for(int j=1;j<=n;j++){
int x=rnd()%2;
if(x) v2.push_back(j);
else v1.push_back(j);
if((tot-query(v1)-query(v2))%2){
cout<<"! NO"<<endl;
return 0;
}
}
}
cout<<"! YES"<<endl;
}
详细
Test #1:
score: 100
Accepted
time: 3ms
memory: 3704kb
input:
3 2
output:
? 3 1 2 3 ! NO
result:
ok correct
Test #2:
score: -100
Wrong Answer
time: 2ms
memory: 3920kb
input:
3 3 0 0
output:
? 3 1 2 3 ? 1 1 ? 0 ! NO
result:
wrong answer the participant answered wrong