結果

問題 No.1530 Permutation and Popcount
ユーザー leaf_1415leaf_1415
提出日時 2021-06-06 03:31:30
言語 C++11
(gcc 11.4.0)
結果
WA  
実行時間 -
コード長 5,771 bytes
コンパイル時間 778 ms
コンパイル使用メモリ 90,044 KB
実行使用メモリ 254,224 KB
最終ジャッジ日時 2024-05-01 22:09:26
合計ジャッジ時間 10,515 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 4 ms
12,396 KB
testcase_01 AC 5 ms
14,576 KB
testcase_02 AC 9 ms
34,976 KB
testcase_03 WA -
testcase_04 AC 4 ms
10,084 KB
testcase_05 WA -
testcase_06 WA -
testcase_07 WA -
testcase_08 AC 5 ms
12,276 KB
testcase_09 AC 4 ms
10,360 KB
testcase_10 WA -
testcase_11 WA -
testcase_12 AC 203 ms
222,868 KB
testcase_13 WA -
testcase_14 WA -
testcase_15 WA -
testcase_16 WA -
testcase_17 AC 115 ms
152,560 KB
testcase_18 WA -
testcase_19 AC 5 ms
14,328 KB
testcase_20 AC 7 ms
26,288 KB
testcase_21 WA -
testcase_22 AC 123 ms
159,252 KB
testcase_23 AC 95 ms
135,344 KB
testcase_24 WA -
testcase_25 WA -
testcase_26 AC 18 ms
61,936 KB
testcase_27 WA -
testcase_28 WA -
testcase_29 AC 22 ms
64,544 KB
testcase_30 AC 3 ms
8,296 KB
testcase_31 AC 225 ms
247,660 KB
testcase_32 AC 221 ms
247,408 KB
testcase_33 WA -
testcase_34 WA -
testcase_35 AC 224 ms
247,732 KB
testcase_36 WA -
testcase_37 WA -
testcase_38 WA -
testcase_39 AC 216 ms
243,424 KB
testcase_40 AC 219 ms
243,440 KB
testcase_41 WA -
testcase_42 AC 221 ms
245,236 KB
testcase_43 AC 135 ms
169,564 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
main.cpp: In function ‘int main()’:
main.cpp:176:34: warning: iteration 99999 invokes undefined behavior [-Waggressive-loop-optimizations]
  176 |         rep(i, 1, 100000) pop[i] = pop[i&(i-1)]+1;
      |                           ~~~~~~~^~~~~~~~~~~~~~~~
main.cpp:19:47: note: within this loop
   19 | #define rep(x, s, t) for(llint (x) = (s); (x) <= (t); (x)++)
      |                                           ~~~~^~~~~~
main.cpp:176:9: note: in expansion of macro ‘rep’
  176 |         rep(i, 1, 100000) pop[i] = pop[i&(i-1)]+1;
      |         ^~~

ソースコード

diff # 

#include <iostream>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstdlib>
#include <cassert>
#include <vector>
#include <list>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <bitset>
#include <string>
#include <algorithm>
#include <utility>
#include <complex>
#define rep(x, s, t) for(llint (x) = (s); (x) <= (t); (x)++)
#define per(x, s, t) for(llint (x) = (s); (x) >= (t); (x)--)
#define reps(x, s) for(llint (x) = 0; (x) < (llint)(s).size(); (x)++)
#define chmin(x, y) (x) = min((x), (y))
#define chmax(x, y) (x) = max((x), (y))
#define sz(x) ((ll)(x).size())
#define ceil(x, y) (((x)+(y)-1) / (y))
#define all(x) (x).begin(),(x).end()
#define outl(...) dump_func(__VA_ARGS__)
#define inf 1e18

using namespace std;

typedef long long llint;
typedef long long ll;
typedef pair<ll, ll> P;

struct edge{
	ll to, cost;
	edge(){}
	edge(ll a, ll b){ to = a, cost = b;}
};
const ll dx[] = {1, 0, -1, 0}, dy[] = {0, -1, 0, 1};

//const ll mod = 1000000007;
const ll mod = 998244353;

struct mint{
	ll x = 0;
	mint(ll y = 0){x = y; if(x < 0 || x >= mod) x = (x%mod+mod)%mod;}
	mint(const mint &ope) {x = ope.x;}
	
	mint operator-(){return mint(-x);}
	mint operator+(const mint &ope){return mint(x) += ope;}
	mint operator-(const mint &ope){return mint(x) -= ope;}
	mint operator*(const mint &ope){return mint(x) *= ope;}
	mint operator/(const mint &ope){return mint(x) /= ope;}
	mint& operator+=(const mint &ope){
		x += ope.x;
		if(x >= mod) x -= mod;
		return *this;
	}
	mint& operator-=(const mint &ope){
		x += mod - ope.x;
		if(x >= mod) x -= mod;
		return *this;
	}
	mint& operator*=(const mint &ope){
		x *= ope.x, x %= mod;
		return *this;
	}
	mint& operator/=(const mint &ope){
		ll n = mod-2; mint mul = ope;
		while(n){
			if(n & 1) *this *= mul;
			mul *= mul;
			n >>= 1;
		}
		return *this;
	}
	mint inverse(){return mint(1) / *this;}
	bool operator ==(const mint &ope){return x == ope.x;}
	bool operator !=(const mint &ope){return x != ope.x;}
};
mint modpow(mint a, ll n){
	if(n == 0) return mint(1);
	if(n % 2) return a * modpow(a, n-1);
	else return modpow(a*a, n/2);
}
istream& operator >>(istream &is, mint &ope){
	ll t; is >> t, ope.x = t;
	return is;
}
ostream& operator <<(ostream &os, mint &ope){return os << ope.x;}
ostream& operator <<(ostream &os, const mint &ope){return os << ope.x;}

bool exceed(ll x, ll y, ll m){return x >= m / y + 1;}
void mark(){ cout << "*" << endl; }
void yes(){ cout << "YES" << endl; }
void no(){ cout << "NO" << endl; }
ll sgn(ll x){ if(x > 0) return 1; if(x < 0) return -1; return 0;}
ll gcd(ll a, ll b){if(b == 0) return a; return gcd(b, a%b);}
ll lcm(ll a, ll b){return a/gcd(a, b)*b;}
ll digitnum(ll x, ll b = 10){ll ret = 0; for(; x; x /= b) ret++; return ret;}
ll digitsum(ll x, ll b = 10){ll ret = 0; for(; x; x /= b) ret += x % b; return ret;}
string lltos(ll x){string ret; for(;x;x/=10) ret += x % 10 + '0'; reverse(ret.begin(), ret.end()); return ret;}
ll stoll(string &s){ll ret = 0; for(auto c : s) ret *= 10, ret += c - '0'; return ret;}
template<typename T>
void uniq(T &vec){ sort(vec.begin(), vec.end()); vec.erase(unique(vec.begin(), vec.end()), vec.end());}

template<typename T>
ostream& operator << (ostream& os, vector<T>& vec) {
	for(int i = 0; i < vec.size(); i++) os << vec[i] << (i + 1 == vec.size() ? "" : " ");
	return os;
}
template<typename T>
ostream& operator << (ostream& os, deque<T>& deq) {
	for(int i = 0; i < deq.size(); i++) os << deq[i] << (i + 1 == deq.size() ? "" : " ");
	return os;
}
template<typename T, typename U>
ostream& operator << (ostream& os, pair<T, U>& pair_var) {
	os << "(" << pair_var.first << ", " << pair_var.second << ")";
	return os;
}
template<typename T, typename U>
ostream& operator << (ostream& os, const pair<T, U>& pair_var) {
	os << "(" << pair_var.first << ", " << pair_var.second << ")";
	return os;
}
template<typename T, typename U>
ostream& operator << (ostream& os, map<T, U>& map_var) {
	for(typename map<T, U>::iterator itr = map_var.begin(); itr != map_var.end(); itr++) {
		os << "(" << itr->first << ", " << itr->second << ")";
		itr++; if(itr != map_var.end()) os << ","; itr--;
	}
	return os;
}
template<typename T>
ostream& operator << (ostream& os, set<T>& set_var) {
	for(typename set<T>::iterator itr = set_var.begin(); itr != set_var.end(); itr++) {
		os << *itr; ++itr; if(itr != set_var.end()) os << " "; itr--;
	}
	return os;
}
template<typename T>
ostream& operator << (ostream& os, multiset<T>& set_var) {
	for(typename multiset<T>::iterator itr = set_var.begin(); itr != set_var.end(); itr++) {
		os << *itr; ++itr; if(itr != set_var.end()) os << " "; itr--;
	}
	return os;
}
template<typename T>
void outa(T a[], ll s, ll t){
	for(ll i = s; i <= t; i++){ cout << a[i]; if(i < t) cout << " ";}
	cout << endl;
}
void dump_func() {cout << endl;}
template <class Head, class... Tail>
void dump_func(Head &&head, Tail &&... tail) {
	cout << head;
	if(sizeof...(Tail) > 0) cout << " ";
	dump_func(std::move(tail)...);
}


ll n, m;
ll p[305];
int dp[305][400005];
ll pop[100000];
ll zero = 200002;

int main(void)
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	
	rep(i, 1, 100000) pop[i] = pop[i&(i-1)]+1;
	
	cin >> n >> m;
	rep(i, 1, n){
		rep(j, 1, n) if(pop[i*j]%2 == 0) p[i]++, p[j]++;
	}
	
	rep(i, 0, n) rep(j, -n*n, n*n) dp[i][zero+j] = -1;
	dp[0][zero] = 0;
	
	rep(i, 0, n-1) rep(j, -n*n, n*n){
		if(dp[i][zero+j] == -1) continue;
		dp[i+1][zero+j+p[i+1]] = j;
		dp[i+1][zero+j-p[i+1]] = j;
	}
	if(dp[n][zero+2*m] == -1){
		outl(-1);
		return 0;
	}
	
	vector<ll> ans[2];
	ll J = 2*m;
	per(i, n, 1){
		if(J >= dp[i][zero+J]) ans[0].push_back(i);
		else ans[1].push_back(i);
		J = dp[i][zero+J];
	}
	outl(sz(ans[0]), sz(ans[1]));
	outl(ans[0]), outl(ans[1]);
	
	return 0;
}
0