oj.uz

답안 #756478

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
756478 2023-06-11T17:44:16 Z Nelt Binary Subsequences (info1cup17_binary) C++
30.1 / 100
 93 ms 464 KB 
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx,avx2,fma")

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

/* DEFINES */
#define S second
#define F first
#define ll long long
#define ull unsigned long long
#define ld long double
#define npos ULLONG_MAX
#define INF LLONG_MAX
#define vv(a) vector<a>
#define pp(a, b) pair<a, b>
#define pq(a) priority_queue<a>
#define qq(a) queue<a>
#define ss(a) set<a>
#define mm(a, b) map<a, b>
#define ump(a, b) unordered_map<a, b>
#define ANDROID                   \
    ios_base::sync_with_stdio(0); \
    cin.tie(0);                   \
    cout.tie(0);
#define elif else if
#define endl "\n"
#define allc(a) begin(a), end(a)
#define all(a) a, a + sizeof(a) / sizeof(a[0])
#define pb push_back
#define logi(a) __lg(a)
#define sqrt(a) sqrtl(a)
#define mpr make_pair
#define ins insert
using namespace std;
using namespace __gnu_pbds;
using namespace __cxx11;
typedef char chr;
typedef basic_string<chr> str;
template <typename T, typename key = less<T>>
using ordered_set = tree<T, null_type, key, rb_tree_tag, tree_order_statistics_node_update>;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const ll N = 2e3 + 5;
ll mn[N], len[N];
ll cntdiff(ll msk, ll n)
{
    ll dp[2] = {0, 0};
    for (ll i = 0; i < n; i++)
        dp[msk >> i & 1] = dp[0] + dp[1] + 1;
    return dp[0] + dp[1];
}

void precomp()
{
    for (ll i = 0; i < N; i++)
        mn[i] = -1, len[i] = 1e9;
    ll tmp;
    for (ll i = 1; i <= 20; i++)
    for (ll msk = 0; msk < (1 << i); msk++)
    {
        tmp = cntdiff(msk, i);
        if (tmp < N and len[tmp] > i)
            mn[tmp] = msk, len[tmp] = i;
    }
    for (ll i = 1; i < N; i++)
        assert(mn[i] != -1 and cntdiff(mn[i], len[i]) == i);
}

void solve()
{
    ll n;
    cin >> n;
    cout << "-1\n";
    for (ll i = 0; i < len[n]; i++)
        cout << (mn[n] >> i & 1) << " \n"[i == len[n] - 1];
}
/*

*/
int main()
{
    ANDROID
    precomp();
    ll t = 1;
    cin >> t;
    for (ll i = 1; i <= t; i++)
        // cout << "Case #" << i << ": ",
        solve();
    cerr << "\nTime elapsed : " << clock() * 1000.0 / CLOCKS_PER_SEC << " ms\n";
}

Subtask #1
30.1 / 43.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 93 ms 340 KB Output is partially correct

Subtask #2
0 / 39.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 72 ms 460 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #3
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 76 ms 464 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -