oj.uz

Submission #860778

# Submission time Handle Problem Language Result Execution time Memory
860778 2023-10-14T09:05:07 Z Ellinor Sequence (BOI14_sequence) C++14
34 / 100
 15 ms 720 KB 
#include <bits/stdc++.h>
using namespace std;

#pragma GCC optimize("Ofast,inline") // Ofast = O3,fast-math,allow-store-data-races,no-protect-parens
#pragma GCC optimize ("unroll-loops")

#pragma GCC target("bmi,bmi2,lzcnt,popcnt")                      // bit manipulation
#pragma GCC target("movbe")                                      // byte swap
#pragma GCC target("aes,pclmul,rdrnd")                           // encryption
#pragma GCC target("avx,avx2,f16c,fma,sse3,ssse3,sse4.1,sse4.2")

typedef long long ll;
#define rep(i, a, b) for (int i = (a); i < int(b); i++)
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
#define pb push_back

inline void fast() { ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); }

ll INF = 1000000000;
ll mod = 1e9 + 7;

#define int ll
#define float double

//
int K;
vector<char> ks;

int32_t main()
{
    fast();
    cin >> K;
    ks.assign(K, -1);
    bool same = true;
    rep(i,0,K) {
        cin >> ks[i];
        if (ks[i] != ks[0]) same = false;
    }

    if (same) 
    {
        ll nat = 1, at = 1;
        while (true)
        {
            if (at - nat == K) {
                cout << nat << "\n";
                exit(0);
            }

            string sat = to_string(at);
            bool bat = false;
            rep(i,0,sat.size()) {
                if (sat[i] == ks[0]) {
                    bat = true;
                    break;
                }
            }
            if (!bat) nat = at + 1;
            at++;
        }
    }
    else
    {
        rep(n,1,1001) {
            bool nat = true;
            rep(at,0,K) {
                string sat = to_string(n + at);
                bool bat = false;
                rep(i,0,sat.size()) {
                    if (sat[i] == ks[at]) {
                        bat = true;
                        break;
                    }
                }
                nat = nat && bat;
                if (!nat) break;
            }
            if (nat) {
                cout << n << "\n";
                exit(0);
            }
        }
    }
}

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 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 0 ms 348 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 360 KB Output is correct

Subtask #2
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 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 Incorrect 0 ms 348 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #3
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 2 ms 348 KB Output is correct
3 Correct 12 ms 492 KB Output is correct
4 Correct 2 ms 348 KB Output is correct
5 Correct 15 ms 468 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 6 ms 660 KB Output is correct
8 Correct 13 ms 592 KB Output is correct
9 Correct 11 ms 604 KB Output is correct
10 Correct 14 ms 720 KB Output is correct

Subtask #4
0 / 33.0

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