oj.uz

답안 #1000496

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1000496 2024-06-17T15:34:19 Z LOLOLO 수열 (BOI14_sequence) C++14
34 / 100
 113 ms 1372 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
 
#define           f     first
#define           s     second
#define           pb    push_back
#define           ep    emplace
#define           eb    emplace_back
#define           lb    lower_bound
#define           ub    upper_bound
#define       all(x)    x.begin(), x.end()
#define      rall(x)    x.rbegin(), x.rend()
#define   uniquev(v)    sort(all(v)), (v).resize(unique(all(v)) - (v).begin())
#define     mem(f,x)    memset(f , x , sizeof(f))
#define        sz(x)    (ll)(x).size()
#define  __lcm(a, b)    (1ll * ((a) / __gcd((a), (b))) * (b))
#define          mxx    *max_element
#define          mnn    *min_element
#define    cntbit(x)    __builtin_popcountll(x)
#define       len(x)    (int)(x.length())
 
const int N = 1e3 + 10;

ll cal(vector <int> v, int is) {
    if (sz(v) == 1) {
        ll ans = 0;
        for (int i = 1; i <= 9; i++) {
            if (v[0] & (1 << i))
                ans = ans * 10 + i;
        }

        if (ans == 0 && (v[0] & 1))
            ans = 10;

        return ans;
    } else {
        ll ans = 1e15;

        for (int dig = 0; dig <= 9 - is; dig++) {
            vector <int> nxt;
            int j = dig, mask = 0, zero = 0;
            for (int i = 0; i < sz(v); i++) {
                int cur = v[i];
                if (cur & (1 << j)) {
                    cur ^= (1 << j);
                }

                mask |= cur;
                if ((v[i] & 1) && j == 0)
                    zero = 1;

                if (j == 9 || i + 1 == sz(v)) {
                    nxt.pb(mask);
                    mask = 0;
                }

                j = (j + 1) % 10;
            }

            ll tt = cal(nxt, sz(v) == 2 && dig == 9) * 10 + dig;
            if (tt == 0 && zero) {
                tt = 10;
            }

            ans = min(ans, tt);
        }

        return ans;
    }

    return -1;
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    int n;
    cin >> n;

    vector <int> v(n);

    for (auto &x : v) {
        cin >> x;
        x = (1 << x);
    }

    cout << cal(v, 0) << '\n';
    return 0;
}


/*
x + s
*/

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 2 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 380 KB Output is correct

Subtask #2
0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Incorrect 2 ms 348 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #3
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 12 ms 560 KB Output is correct
3 Correct 13 ms 560 KB Output is correct
4 Correct 13 ms 560 KB Output is correct
5 Correct 12 ms 344 KB Output is correct
6 Correct 11 ms 348 KB Output is correct
7 Correct 75 ms 860 KB Output is correct
8 Correct 51 ms 860 KB Output is correct
9 Correct 109 ms 1116 KB Output is correct
10 Correct 113 ms 1372 KB Output is correct

Subtask #4
0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Incorrect 52 ms 856 KB Output isn't correct
6 Halted 0 ms 0 KB -