oj.uz

Submission #398941

# Submission time Handle Problem Language Result Execution time Memory
398941 2021-05-04T22:33:49 Z Mohammed_Alsaad Sequence (BOI14_sequence) C++17
9 / 100
 1000 ms 332 KB 
#include <bits/stdc++.h>
using namespace std;

template <typename A, typename B> string to_string(pair<A, B> p);
template <typename A, typename B, typename C> string to_string(tuple<A, B, C> p);
template <typename A, typename B, typename C, typename D> string to_string(tuple<A, B, C, D> p);

string to_string(const string &s)
{
    return '"' + s + '"';
}
string to_string(const char *s)
{
    return to_string((string)s);
}
string to_string(bool b)
{
    return (b ? "true" : "false");
}
// string to_string(vector<bool> v)
// {
//     bool first = true;
//     string res = "{";
//     for (int i = 0; i < static_cast<int>(v.size()); i++)
//     {
//         if (!first)
//         {
//             res += ", ";
//         }
//         first = false;
//         res += to_string(v[i]);
//     }
//     res += "}";
//     return res;
// }
template <size_t N> string to_string(bitset<N> v)
{
    string res = "";
    for (size_t i = 0; i < N; i++)
    {
        res += static_cast<char>('0' + v[i]);
    }
    return res;
}
template <typename A> string to_string(A v)
{
    bool first = true;
    string res = "{";
    for (const auto &x : v)
    {
        if (!first)
        {
            res += ", ";
        }
        first = false;
        res += to_string(x);
    }
    res += "}";
    return res;
}
template <typename A, typename B> string to_string(pair<A, B> p)
{
    return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
template <typename A, typename B, typename C> string to_string(tuple<A, B, C> p)
{
    return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ")";
}
template <typename A, typename B, typename C, typename D> string to_string(tuple<A, B, C, D> p)
{
    return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ", " +
           to_string(get<3>(p)) + ")";
}
void dbg_out()
{
    cout << endl;
}
template <typename Head, typename... Tail> void dbg_out(Head H, Tail... T)
{
    cout << " " << to_string(H);
    dbg_out(T...);
}

#define FAST_IO                                                                                                        \
    ios_base::sync_with_stdio(false);                                                                                  \
    cin.tie(NULL);                                                                                                     \
    cout.tie(NULL);

#define dbg(...) cout << "[" << #__VA_ARGS__ << "]:", dbg_out(__VA_ARGS__)
#define edl() cout << endl;

#define rep(i, a, b) for (int i = a; i < b; i++)

#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define pb push_back
#define pf push_front

#define F first
#define S second

#define max_self(x, y) x = max(x, y)
#define min_self(x, y) x = min(x, y)

typedef long long ll;
ll const INF = 2147483647, R_INF = 9223372036854775807, MOD = 1e9 + 7;

// const int mxN =

int main()
{
    FAST_IO;

    int n;
    cin >> n;

    vector<char> input(n);
    rep(i, 0, n) cin >> input[i];

    rep(i, 1, 10000)
    {
        bool flag = false;
        rep(j, 0, n)
        {
            string str = to_string((i + j));
            bool t = false;
            for (char c : str)
                t |= (c == input[j]);

            if (!t)
                flag = true;
        }
        if (!flag)
            return cout << i, 0;
    }

    int val = (input.front() - '0') + !(input.front() - '0');
    assert(val);
    while (val < n)
        val *= 10;
    cout << val;
}

/*



*/

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 45 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 13 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 10 ms 308 KB Output is correct
8 Correct 122 ms 288 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 18 ms 308 KB Output is correct
11 Correct 10 ms 308 KB Output is correct
12 Correct 3 ms 204 KB Output is correct
13 Correct 9 ms 316 KB Output is correct
14 Correct 125 ms 324 KB Output is correct
15 Correct 125 ms 296 KB Output is correct

Subtask #2
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 42 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 13 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Execution timed out 1085 ms 204 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #3
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Execution timed out 1100 ms 204 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #4
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 42 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 13 ms 304 KB Output is correct
5 Execution timed out 1084 ms 332 KB Time limit exceeded
6 Halted 0 ms 0 KB -