oj.uz

Submission #134459

# Submission time Handle Problem Language Result Execution time Memory
134459 2019-07-22T17:25:22 Z Kastanda Sequence (BOI14_sequence) C++11
0 / 100
 3 ms 376 KB 
// ItnoE
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
inline ll Solve(vector < int > A, bool w)
{
    int n = (int)A.size();
    bool Fail = 1;
    for (int a : A)
        if (a) Fail = 0;
    if (Fail)
        return (!w);
    if (n == 1)
    {
        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;
            }
        return (rs);
    }
    ll rs = (ll)1e18;
    for (int i = 0; i <= 9; i ++)
    {
        int d = i;
        vector < int > B;
        for (int j = 0; j < n; j ++)
        {
            if (!j || !d)
                B.push_back(0);
            int b = A[j];
            if (b >> d & 1)
                b ^= (1 << d);
            B.back() |= b;
            d ++;
            if (d == 10)
                d = 0;
        }
        if (A == B) continue;
        ll rt = Solve(B, w | (i > 0)) * 10 + i;
        if (!rt && (!w || A[0] & 1))
            continue;
        rs = min(rs, rt);
    }
    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));
}

Compilation message

sequence.cpp: In function 'int main()':
sequence.cpp:53:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &n);
     ~~~~~^~~~~~~~~~
sequence.cpp:56: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

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 3 ms 256 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Incorrect 2 ms 128 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #2
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 3 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Incorrect 2 ms 256 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
0 / 25.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 376 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 3 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Incorrect 2 ms 256 KB Output isn't correct
5 Halted 0 ms 0 KB -