QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #423863 | #8174. Set Construction | Iratis | WA | 1ms | 3968kb | C++14 | 1.3kb | 2024-05-28 18:34:12 | 2024-05-28 18:34:12 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define md(a) a=(a%mod+mod)%mod
#define file(a) freopen(#a".in","r",stdin);freopen(#a".out","w",stdout)
bool ST;
int n,m,S;
namespace Force
{
vector<int>a,ans;bool vst[1<<16],fg;
inline void check()
{
if((int)a.size()!=m)return ;
for(int x:a)for(int y:a)if(!vst[x&y]||!vst[x|y])return ;ans=a;fg=1;
}
void dfs(int k)
{
if(k==S){check();return ;}
if((int)a.size()+1<=m)a.push_back(k),vst[k]=1,dfs(k+1),a.pop_back(),vst[k]=0;if(fg)return ;
if(k>0&&k<S-1)dfs(k+1);
}
inline void main(){if(m==2){cout<<0<<' '<<S-1<<'\n';return ;}fg=0,dfs(0);for(int x:ans)cout<<x<<' ';cout<<'\n';}
};
vector<int>ans;
inline void solve()
{
cin>>n>>m,S=(1ll<<n);if(n<=5||m==2){Force::main();return ;}ans.clear(),ans.push_back(0);
int x=0;vector<int>op;while(m>1){if(m&1)op.push_back(1),m--;else op.push_back(2),m/=2;}reverse(op.begin(),op.end());
for(int o:op)
{
if(o==1)x++,ans.push_back((1ll<<x)-1);
else {vector<int>t=ans;for(int w:t)ans.push_back(w|(1ll<<x));x++;}
}
ans.pop_back(),ans.push_back(S-1);for(int x:ans)cout<<x<<' ';cout<<'\n';
}
bool ED;
signed main()
{
int time_st=clock();
cerr<<(&ST-&ED)/1024.0/1024<<endl;ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
int T;cin>>T;while(T--)solve();
cerr<<(clock()-time_st)/1e6<<endl;return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 3964kb
input:
3 3 5 4 8 60 2
output:
0 1 2 3 7 0 1 2 3 5 7 11 15 0 1152921504606846975
result:
ok AC
Test #2:
score: -100
Wrong Answer
time: 1ms
memory: 3968kb
input:
30 6 2 6 3 6 4 6 5 6 6 6 7 6 8 6 9 6 10 6 11 6 12 6 13 6 14 6 15 6 16 6 17 6 18 6 19 6 20 6 21 7 2 7 3 7 4 7 5 7 6 7 7 7 8 7 9 7 10 7 11
output:
0 63 0 1 63 0 1 2 63 0 1 2 3 63 0 1 3 4 5 63 0 1 3 4 5 7 63 0 1 2 3 4 5 6 63 0 1 2 3 4 5 6 7 63 0 1 2 3 7 8 9 10 11 63 0 1 2 3 7 8 9 10 11 15 63 0 1 3 4 5 7 8 9 11 12 13 63 0 1 3 4 5 7 8 9 11 12 13 15 63 0 1 3 4 5 7 15 16 17 19 20 21 23 63 0 1 3 4 5 7 15 16 17 19 20 21 23 31 63 0 1 2 3 ...
result:
wrong answer (1 OR 2) is not in A