oj.uz

답안 #134393

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
134393 2019-07-22T15:40:37 Z Kastanda 수열 (BOI14_sequence) C++11
0 / 100
 1000 ms 1400 KB 
// ItnoE
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
inline ll Solve(vector < int > A, bool w, int dp)
{
    int n = (int)A.size();
    if (dp > 15)
        return (-1);
    if (n == 0)
        return (!w);
    if (n == 1)
    {
        if (A[0] == 0)
            return (!w);
        ll rs = 0;
        for (int i = 1; i <= 9; i ++)
            if (A[0] >> i & 1)
            {
                rs = rs * 10 + i;
                if (A[0] & 1)
                    rs *= 10, A[0] ^= 1;
            }
        if (!rs)
            rs = 10;
        return (rs);
    }
    ll rs = LLONG_MAX;
    for (int i = 0; i <= 9; i ++)
    {
        int d = i, k = 0;
        vector < int > B;
        for (int j = 0; j < n; j ++)
        {
            if (j && !d)
                B.push_back(k), k = 0;
            k |= A[j] ^ (A[j] & (1 << d));
            d ++;
            if (d >= 10)
                d -= 10;
        }
        if (k) B.push_back(k);
        ll rt = Solve(B, w | (i > 0), dp + 1);
        if (rt != -1)
            rs = min(rs, rt * 10 + i);
    }
    return (rs);
}
int main()
{
    int n;
    scanf("%d", &n);
    vector < int > A(n);
    for (int &a : A)
        scanf("%d", &a), a = 1 << a;
    return !printf("%lld\n", Solve(A, 0, 0));
}

Compilation message

sequence.cpp: In function 'int main()':
sequence.cpp:52:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &n);
     ~~~~~^~~~~~~~~~
sequence.cpp:55:24: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d", &a), a = 1 << a;
         ~~~~~~~~~~~~~~~^~~~~~~~~~~~

Subtask #1
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 8 ms 380 KB Output is correct
3 Correct 4 ms 256 KB Output is correct
4 Correct 4 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 4 ms 504 KB Output is correct
8 Incorrect 15 ms 404 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #2
0 / 33.0

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

Subtask #3
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 129 ms 516 KB Output is correct
3 Correct 128 ms 508 KB Output is correct
4 Correct 16 ms 504 KB Output is correct
5 Correct 16 ms 504 KB Output is correct
6 Correct 102 ms 376 KB Output is correct
7 Correct 793 ms 1068 KB Output is correct
8 Correct 489 ms 1016 KB Output is correct
9 Execution timed out 1076 ms 1400 KB Time limit exceeded
10 Halted 0 ms 0 KB -

Subtask #4
0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 7 ms 252 KB Output is correct
3 Correct 3 ms 376 KB Output is correct
4 Correct 4 ms 256 KB Output is correct
5 Correct 525 ms 888 KB Output is correct
6 Correct 2 ms 380 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 15 ms 376 KB Output is correct
9 Correct 4 ms 376 KB Output is correct
10 Incorrect 16 ms 376 KB Output isn't correct
11 Halted 0 ms 0 KB -