oj.uz

답안 #272452

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
272452 2020-08-18T11:52:10 Z egekabas Binary Subsequences (info1cup17_binary) C++14
100 / 100
 749 ms 480 KB 
#include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll, ll> pll;
typedef pair<ull, ull> pull;
typedef pair<int, int> pii;
typedef pair<ld, ld> pld;
int mod = 1e9+7;
int eul(int x, int y){
    if(x == 0 && y == 0) return 0;
    if(x == y) return -1e9;
    if(x > y)
        return (x/(y+1))+eul(x%(y+1), y);
    else
        return (y/(x+1))+eul(x, y%(x+1));
}
void getans(int x, int y){
    if(x == 0 && y == 0) return;
    if(x > y){
        for(int i = 0; i < x/(y+1); ++i)
            cout << "0 ";
        getans(x%(y+1), y);
    }
    else{
        for(int i = 0; i < y/(x+1); ++i)
            cout << "1 ";
        getans(x, y%(x+1));
    }
    
}
void solve(){
    int k;
    cin >> k;
    int ans = 0;
    pii use = {1e9, 1e9};
    for(int i = 0; i <= k; ++i){
        int cur = eul(i, k-i);
        if(cur >= 0){
            ++ans;
            use = min(use, {cur, i});
        }
    }
    cout << ans << '\n';
    getans(use.ss, k-use.ss);
    cout << '\n';
}
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    
    //freopen("in.txt", "r", stdin);
    //freopen("out.txt", "w", stdout);

    int t;
    cin >> t;
    while(t--){
        solve();
    }
}

Subtask #1
43.0 / 43.0

# 결과 실행 시간 메모리 Grader output
1 Correct 83 ms 384 KB Output is correct

Subtask #2
39.0 / 39.0

# 결과 실행 시간 메모리 Grader output
1 Correct 30 ms 384 KB Output is correct
2 Correct 62 ms 384 KB Output is correct
3 Correct 60 ms 384 KB Output is correct

Subtask #3
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 712 ms 384 KB Output is correct
2 Correct 735 ms 384 KB Output is correct
3 Correct 749 ms 480 KB Output is correct