oj.uz

Submission #136100

# Submission time Handle Problem Language Result Execution time Memory
136100 2019-07-24T17:42:10 Z forelax Sequence (BOI14_sequence) C++14
34 / 100
 72 ms 1016 KB 
#include<bits/stdc++.h>
using namespace std;
vector<bool> digs(int ind){
    vector<bool> rez(10);
    do{
        rez[ind%10]=true;
    }while(ind/=10);
    return rez;
}
int n;
vector<int> v;
int main(){
    cin>>n;
    v.resize(n);
    vector<int> g(10);
    for(int i = 0 ; i < n ; i ++){
        cin>>v[i];
        g[v[i]]++;
    }
    int t=0,td;
    for(int i = 0 ; i < g.size() ; i ++)
        if(g[i]){
            t++;
            td=i;
        }
    if(t==1){
        int rez=1;
        while(true){
            bool good=true;
            for(int k = 0 ; k < n ; k ++){
                if(!digs(rez+k)[td]){
                    rez+=k+1;
                    good=false;
                }
            }
            if(good)
                break;
        }
        cout<<rez;
        return 0;
    }
    for(int i = 1 ; i <= 1000 ; i ++){
        bool good=true;
        for(int k = 0 ; k < n ; k ++){
            if(!digs(i+k)[v[k]]){
                good=false;
                break;
            }
        }
        if(good){
            cout<<i;
            return 0;
        }
    }
}

Compilation message

sequence.cpp: In function 'int main()':
sequence.cpp:21:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i = 0 ; i < g.size() ; i ++)
                     ~~^~~~~~~~~~

Subtask #1
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 2 ms 256 KB Output is correct
8 Correct 2 ms 292 KB Output is correct
9 Correct 2 ms 256 KB Output is correct
10 Correct 2 ms 256 KB Output is correct
11 Correct 2 ms 256 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 504 KB Output is correct
15 Correct 2 ms 256 KB Output is correct

Subtask #2
0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 252 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 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 Incorrect 2 ms 256 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 2 ms 256 KB Output is correct
2 Correct 8 ms 376 KB Output is correct
3 Correct 33 ms 504 KB Output is correct
4 Correct 8 ms 376 KB Output is correct
5 Correct 36 ms 376 KB Output is correct
6 Correct 5 ms 380 KB Output is correct
7 Correct 38 ms 764 KB Output is correct
8 Correct 29 ms 636 KB Output is correct
9 Correct 60 ms 888 KB Output is correct
10 Correct 72 ms 1016 KB Output is correct

Subtask #4
0 / 33.0

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