結果
問題 | No.1530 Permutation and Popcount |
ユーザー | torisasami4 |
提出日時 | 2021-06-04 23:26:06 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 1,503 ms / 2,000 ms |
コード長 | 7,580 bytes |
コンパイル時間 | 1,722 ms |
コンパイル使用メモリ | 178,964 KB |
実行使用メモリ | 6,944 KB |
最終ジャッジ日時 | 2024-05-03 17:37:46 |
合計ジャッジ時間 | 47,883 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
6,812 KB |
testcase_01 | AC | 1,503 ms
6,940 KB |
testcase_02 | AC | 2 ms
6,940 KB |
testcase_03 | AC | 1,502 ms
6,940 KB |
testcase_04 | AC | 2 ms
6,940 KB |
testcase_05 | AC | 1,503 ms
6,944 KB |
testcase_06 | AC | 1,503 ms
6,940 KB |
testcase_07 | AC | 1,503 ms
6,940 KB |
testcase_08 | AC | 1,502 ms
6,940 KB |
testcase_09 | AC | 1,502 ms
6,940 KB |
testcase_10 | AC | 1,503 ms
6,944 KB |
testcase_11 | AC | 1,503 ms
6,940 KB |
testcase_12 | AC | 1,503 ms
6,940 KB |
testcase_13 | AC | 1,503 ms
6,940 KB |
testcase_14 | AC | 1,502 ms
6,944 KB |
testcase_15 | AC | 1,503 ms
6,940 KB |
testcase_16 | AC | 1,502 ms
6,944 KB |
testcase_17 | AC | 7 ms
6,944 KB |
testcase_18 | AC | 1,503 ms
6,940 KB |
testcase_19 | AC | 1,503 ms
6,940 KB |
testcase_20 | AC | 2 ms
6,944 KB |
testcase_21 | AC | 1,503 ms
6,940 KB |
testcase_22 | AC | 1,502 ms
6,944 KB |
testcase_23 | AC | 1,503 ms
6,944 KB |
testcase_24 | AC | 1,503 ms
6,940 KB |
testcase_25 | AC | 1,503 ms
6,940 KB |
testcase_26 | AC | 1,502 ms
6,944 KB |
testcase_27 | AC | 1,503 ms
6,944 KB |
testcase_28 | AC | 1,503 ms
6,944 KB |
testcase_29 | AC | 1,503 ms
6,940 KB |
testcase_30 | AC | 1 ms
6,944 KB |
testcase_31 | AC | 1,503 ms
6,944 KB |
testcase_32 | AC | 11 ms
6,944 KB |
testcase_33 | AC | 1,503 ms
6,940 KB |
testcase_34 | AC | 1,503 ms
6,940 KB |
testcase_35 | AC | 15 ms
6,940 KB |
testcase_36 | AC | 2 ms
6,940 KB |
testcase_37 | AC | 1,502 ms
6,940 KB |
testcase_38 | AC | 763 ms
6,940 KB |
testcase_39 | AC | 13 ms
6,944 KB |
testcase_40 | AC | 12 ms
6,944 KB |
testcase_41 | AC | 2 ms
6,940 KB |
testcase_42 | AC | 11 ms
6,944 KB |
testcase_43 | AC | 6 ms
6,940 KB |
ソースコード
#include <bits/stdc++.h> using namespace std; typedef long long ll; #define pb(x) push_back(x) #define mp(a, b) make_pair(a, b) #define all(x) x.begin(), x.end() #define rall(x) x.rbegin(), x.rend() #define lscan(x) scanf("%I64d", &x) #define lprint(x) printf("%I64d", x) #define rep(i, n) for (ll i = 0; i < (n); i++) #define rep2(i, n) for (ll i = (ll)n - 1; i >= 0; i--) #define REP(i, l, r) for (ll i = l; i < (r); i++) #define REP2(i, l, r) for (ll i = (ll)r - 1; i >= (l); i--) #define siz(x) (ll)x.size() template <class T> using rque = priority_queue<T, vector<T>, greater<T>>; const ll mod = 998244353; template <class T> bool chmin(T &a, const T &b) { if (b < a) { a = b; return 1; } return 0; } template <class T> bool chmax(T &a, const T &b) { if (b > a) { a = b; return 1; } return 0; } ll gcd(ll a, ll b) { if(a == 0) return b; if(b == 0) return a; ll c = a % b; while (c != 0) { a = b; b = c; c = a % b; } return b; } long long extGCD(long long a, long long b, long long &x, long long &y) { if (b == 0) { x = 1; y = 0; return a; } long long d = extGCD(b, a % b, y, x); y -= a / b * x; return d; } struct UnionFind { vector<ll> data; int num; UnionFind(int sz) { data.assign(sz, -1); num = sz; } bool unite(int x, int y) { x = find(x), y = find(y); if (x == y) return (false); if (data[x] > data[y]) swap(x, y); data[x] += data[y]; data[y] = x; num--; return (true); } int find(int k) { if (data[k] < 0) return (k); return (data[k] = find(data[k])); } ll size(int k) { return (-data[find(k)]); } }; ll M = 1000000007; template <int mod> struct ModInt { int x; ModInt() : x(0) {} ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {} ModInt &operator+=(const ModInt &p) { if ((x += p.x) >= mod) x -= mod; return *this; } ModInt &operator-=(const ModInt &p) { if ((x += mod - p.x) >= mod) x -= mod; return *this; } ModInt &operator*=(const ModInt &p) { x = (int)(1LL * x * p.x % mod); return *this; } ModInt &operator/=(const ModInt &p) { *this *= p.inverse(); return *this; } ModInt operator-() const { return ModInt(-x); } ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; } ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; } ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; } ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; } bool operator==(const ModInt &p) const { return x == p.x; } bool operator!=(const ModInt &p) const { return x != p.x; } ModInt inverse() const { int a = x, b = mod, u = 1, v = 0, t; while (b > 0) { t = a / b; swap(a -= t * b, b); swap(u -= t * v, v); } return ModInt(u); } ModInt pow(int64_t n) const { ModInt ret(1), mul(x); while (n > 0) { if (n & 1) ret *= mul; mul *= mul; n >>= 1; } return ret; } friend ostream &operator<<(ostream &os, const ModInt &p) { return os << p.x; } friend istream &operator>>(istream &is, ModInt &a) { int64_t t; is >> t; a = ModInt<mod>(t); return (is); } static int get_mod() { return mod; } }; using mint = ModInt<mod>; mint mpow(ll x, ll n) { mint ans = 1; while (n != 0) { if (n & 1) ans *= x; x = x * x % mod; n = n >> 1; } return ans; } ll mpow2(ll x, ll n, ll mod) { ll ans = 1; while (n != 0) { if (n & 1) ans = ans * x % mod; x = x * x % mod; n = n >> 1; } return ans; } vector<mint> fac; vector<mint> ifac; void setcomb(int sz = 2000010) { fac.assign(sz + 1, 0); ifac.assign(sz + 1, 0); fac[0] = 1; for (ll i = 0; i < sz; i++) { fac[i + 1] = fac[i] * (i + 1); // n!(mod M) } ifac[sz] = fac[sz].inverse(); for (ll i = sz; i > 0; i--) { ifac[i - 1] = ifac[i] * i; } } mint comb(ll a, ll b) { if(fac.size() == 0) setcomb(); if (a == 0 && b == 0) return 1; if (a < b || a < 0) return 0; return ifac[a - b] * ifac[b] * fac[a]; } mint perm(ll a, ll b) { if(fac.size() == 0) setcomb(); if (a == 0 && b == 0) return 1; if (a < b || a < 0) return 0; return fac[a] * ifac[a - b]; } long long modinv(long long a) { long long b = M, u = 1, v = 0; while (b) { long long t = a / b; a -= t * b; swap(a, b); u -= t * v; swap(u, v); } u %= M; if (u < 0) u += M; return u; } ll modinv2(ll a, ll mod) { ll b = mod, u = 1, v = 0; while (b) { ll t = a / b; a -= t * b; swap(a, b); u -= t * v; swap(u, v); } u %= mod; if (u < 0) u += mod; return u; } struct Timer { private: chrono::high_resolution_clock::time_point start, end; public: Timer() { set(); } void set() { start = chrono::high_resolution_clock::now(); } int time() { end = chrono::high_resolution_clock::now(); return chrono::duration_cast<chrono::milliseconds>(end - start).count(); } void print() { cerr << "elapsed time: " << (double)time() / 1000 << " sec" << endl; } }; struct Random { private: uint32_t a, b, c, d; public: Random(uint32_t seed = 517) { set_seed(seed); } void set_seed(uint32_t seed) { a = seed = 1812433253u * (seed ^ (seed >> 30)); b = seed = 1812433253u * (seed ^ (seed >> 30)) + 1; c = seed = 1812433253u * (seed ^ (seed >> 30)) + 2; d = seed = 1812433253u * (seed ^ (seed >> 30)) + 3; } uint32_t operator()() { uint32_t t = (a ^ (a << 11)); a = b; b = c; c = d; return d = (d ^ (d >> 19)) ^ (t ^ (t >> 8)); } // [0,MAX) uint32_t operator()(int MAX) { return (uint64_t) operator()() * MAX >> 32; } // [L,R) uint32_t operator()(int L, int R) { return L + operator()(R - L); } // [0,1) の実数 double drnd() { return (double)operator()() / (1LL << 32); } // 確率 p で true を返す bool prob(const double p) { return (uint32_t)(p * (1LL << 32)) > operator()(); } }; int main(){ ios::sync_with_stdio(false); std::cin.tie(nullptr); Timer T; Random rnd; std::mt19937 get_rand_mt; T.set(); ll n, m; cin >> n >> m; vector<ll> x[2]; ll a[n + 1][n + 1]; REP(i, 1, n + 1) REP(j, 1, n + 1) a[i][j] = (__builtin_popcount(i * j) % 2) ^ 1; REP(i, 1, n + 1) x[0].pb(i); ll sc = 0; rep(i, n) rep(j, n) sc += a[i + 1][j + 1]; double st = n * 2, et = 1; double start_time = T.time(), TL = 1500; ll cnt = 0; while(1){ double now_time = T.time(); if(now_time > TL) break; if (sc == m) break; ll f = rnd(2); if(!x[f].empty()){ ll nsc = sc; shuffle(all(x[f]), get_rand_mt); ll now = x[f].back(); rep(i, x[f].size() - 1) nsc += a[x[f][i]][now] * 2 * (2 * f - 1); rep(i, x[f ^ 1].size()) nsc += a[x[f ^ 1][i]][now] * 2 * (2 * f - 1); nsc += a[now][now] * 2 * (2 * f - 1); double temp = st + (et - st) * (now_time - start_time) / TL; double p = exp((abs(sc - m) - abs(nsc - m)) / temp); if(rnd.prob(p)){ x[f ^ 1].pb(now); x[f].pop_back(); sc = nsc; // if(sc < 10){ // cout << sc << endl; // cout << x[0].size() << " " << x[1].size() << endl; // rep(i, x[0].size()) cout << x[0][i] << (i + 1 == x[0].size() ? '\n' : ' '); // rep(i, x[1].size()) cout << x[1][i] << (i + 1 == x[1].size() ? '\n' : ' '); // cnt++; // } } } } if(sc == m){ cout << x[0].size() << " " << x[1].size() << endl; rep(i, x[0].size()) cout << x[0][i] << (i + 1 == x[0].size() ? '\n' : ' '); rep(i, x[1].size()) cout << x[1][i] << (i + 1 == x[1].size() ? '\n' : ' '); } else cout << -1 << endl; }