結果
| 問題 | No.1530 Permutation and Popcount |
| ユーザー |
 PCTprobability
|
| 提出日時 | 2021-05-29 17:51:02 |
| 言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
CE
(最新)
AC
(最初)
|
| 実行時間 | - |
| コード長 | 4,518 bytes |
| コンパイル時間 | 3,497 ms |
| コンパイル使用メモリ | 241,416 KB |
| 最終ジャッジ日時 | 2025-01-21 20:36:05 |
|
ジャッジサーバーID （参考情報） |
judge1 / judge3 |
（要ログイン）
コンパイルエラー時のメッセージ・ソースコードは、提出者また管理者しか表示できないようにしております。（リジャッジ後のコンパイルエラーは公開されます）
ただし、clay言語の場合は開発者のデバッグのため、公開されます。
ただし、clay言語の場合は開発者のデバッグのため、公開されます。
コンパイルメッセージ
In file included from /usr/include/c++/13/string:43,
from /usr/include/c++/13/bitset:52,
from /usr/include/x86_64-linux-gnu/c++/13/bits/stdc++.h:52,
from main.cpp:4:
/usr/include/c++/13/bits/allocator.h: In destructor ‘std::_Bvector_base<std::allocator<bool> >::_Bvector_impl::~_Bvector_impl()’:
/usr/include/c++/13/bits/allocator.h:184:7: error: inlining failed in call to ‘always_inline’ ‘std::allocator< <template-parameter-1-1> >::~allocator() noexcept [with _Tp = long unsigned int]’: target specific option mismatch
184 | ~allocator() _GLIBCXX_NOTHROW { }
| ^
In file included from /usr/include/c++/13/vector:67,
from /usr/include/c++/13/functional:64,
from /usr/include/x86_64-linux-gnu/c++/13/bits/stdc++.h:53:
/usr/include/c++/13/bits/stl_bvector.h:590:14: note: called from here
590 | struct _Bvector_impl
| ^~~~~~~~~~~~~
ソースコード
#pragma GCC target("avx2")#pragma GCC optimize("O3")#pragma GCC optimize("unroll-loops")#include <bits/stdc++.h>#include <unistd.h>using namespace std;#if __has_include(<atcoder/all>)#include <atcoder/all>using namespace atcoder;#endifusing ll = long long;using ld = long double;using ull = long long;#define REP3(i, m, n) for (int i = (m); (i) < int(n); ++ (i))#define ALL(x) begin(x), end(x)#define all(s) (s).begin(),(s).end()#define rep2(i, m, n) for (int i = (m); i < (n); ++i)#define rep(i, n) rep2(i, 0, n)#define drep2(i, m, n) for (int i = (m)-1; i >= (n); --i)#define drep(i, n) drep2(i, n, 0)#define rever(vec) reverse(vec.begin(), vec.end())#define sor(vec) sort(vec.begin(), vec.end())#define fi first#define se second#define pb push_back#define pll pair<ll,ll>#define REP(i, n) for (int i = 0; i < (n); ++i)#define in scanner.read_int()//const ll mod = 998244353;const ll mod = 1000000007;const ll inf = 2000000000000000000ll;static const long double pi = 3.141592653589793;template<class T>void vcin(vector<T> &n){for(int i=0;i<int(n.size());i++) cin>>n[i];}template<class T>void vcout(vector<T> &n){for(int i=0;i<int(n.size());i++){cout<<n[i]<<" ";}cout<<endl;}void YesNo(bool a){if(a){cout<<"Yes"<<endl;}else{cout<<"No"<<endl;}}void YESNO(bool a){if(a){cout<<"YES"<<endl;}else{cout<<"NO"<<endl;}}template<class T,class U> void chmax(T& t,const U& u){if(t<u) t=u;}template<class T,class U> void chmin(T& t,const U& u){if(t>u) t=u;}template<class T> void ifmin(T t,T u){if(t>u){cout<<-1<<endl;}else{cout<<t<<endl;}}template<class T> void ifmax(T t,T u){if(t>u){cout<<-1<<endl;}else{cout<<t<<endl;}}template<typename T,typename ...Args>auto make_vector(T x,int arg,Args ...args){if constexpr(sizeof...(args)==0)return vector<T>(arg,x);else returnvector(arg,make_vector<T>(x,args...));}ll modPow(ll a, ll n, ll mod) { ll ret = 1; ll p = a % mod; while (n) { if (n & 1) ret = ret * p % mod; p = p * p % mod; n >>= 1; } return ret; }const ll t0=1,t1=10,t2=100,t3=1000,t4=10000,t5=100000,t6=1000000,t7=10000000,t8=t7*10,t9=t8*10,t10=t9*10,t11=t10*10,t12=t11*10,t13=t12*10,t14=t13*10,t15=t14*10,t16=t15*10,t17=t16*10,t18=t17*10;void gbjsmzmfuuvdf(){ios::sync_with_stdio(false);std::cin.tie(nullptr);cout<< fixed << setprecision(20);}class Scanner {vector<char> buffer;ssize_t n_written;ssize_t n_read;public:Scanner(): buffer(1024*1024) { do_read(); }int64_t read_int() {int64_t ret = 0, sgn = 1;int ch = current_char();while (isspace(ch)) { ch = next_char(); }if (ch == '-') { sgn = -1; ch = next_char(); }for (; isdigit(ch); ch = next_char())ret = (ret * 10) + (ch - '0');return sgn * ret;}private:void do_read() {ssize_t r = read(0, &buffer[0], buffer.size());if (r < 0) {throw runtime_error(strerror(errno));}n_written = r;n_read = 0;}inline int next_char() {++n_read;if (n_read == n_written) { do_read(); }return current_char();}inline int current_char() {return (n_read == n_written) ? EOF : buffer[n_read];}};//Scanner scanner;//void vin(vector<ll> &n){for(int i=0;i<int(n.size());i++) n[i]=in;}ll pop(ll a){ll ans=0;while(a>0){ans+=a%2;a/=2;}return ans;}int main() {gbjsmzmfuuvdf();ll n,m;cin>>n>>m;assert(2<=n&&n<=300&&0<=m&&m<=n*n);vector<ll> count(n+1);for(int i=1;i<=n;i++){for(int j=1;j<=n;j++){if(pop(i*j)%2==0){count[i]++;}}}for(int i=1;i<=n;i++){m+=count[i];}if(m%2!=0){cout<<-1<<endl;return 0;}m/=2;ll sum=0;for(int i=1;i<=n;i++){sum+=count[i];}vector<vector<bool>> dp(n+1,vector<bool>(m+1,false));dp[0][0]=true;for(int i=0;i<n;i++){for(int j=0;j<=m;j++){if(dp[i][j]){dp[i+1][j]=true;if(j+count[i+1]<=m){dp[i+1][j+count[i+1]]=true;}}}}//cout<<sum<<endl;if(dp[n][m]==false){cout<<-1<<endl;return 0;}vector<ll> p,q;ll now=m;for(int i=n;i>=1;i--){if(dp[i-1][now]==false){p.pb(i);now-=count[i];}else{q.pb(i);}}// cout<<sum<<endl;for(int i=0;i<p.size();i++){for(int j=0;j<q.size();j++){if(count[p[i]]==count[q[j]]){swap(p[i],q[j]);}}}cout<<p.size()<<" "<<q.size()<<endl;vcout(p);vcout(q);}