oj.uz

Submission #14337

# Submission time Handle Problem Language Result Execution time Memory
14337 2015-05-12T07:02:21 Z Namnamseo 이상한 수열 (OJUZ10_bizarre) C++
62 / 100
 99 ms 9856 KB 
#include <cstdio>
#include <set>

using namespace std;
set<int> s;
int n;
int data[50010];

int main()
{
    scanf("%d",&n);
    int i;
    for(i=1;i<=n;++i) scanf("%d",data+i);
    int om,m;
    scanf("%d",&m);
    if(m<=n){
        printf("%d\n",data[m]);
    } else {
        for(i=1;i<=n;++i) s.insert(data[i]);
        m-=n+1;
        set<int>::iterator it;
        for(i=1;i<=3*n && m;++i){
            if(s.find(s.size()) != s.end()){
                break;
            }
            --m;
            s.insert(s.size());
        }
        if(i>3*n){
            printf("%d\n",s.size()+m);
        } else printf("%d\n",s.size());
    }
    return 0;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 1408 KB Output is correct
2 Correct 0 ms 1408 KB Output is correct
3 Correct 0 ms 1408 KB Output is correct
4 Correct 0 ms 1408 KB Output is correct
5 Correct 0 ms 1408 KB Output is correct

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 1408 KB Output is correct
2 Correct 0 ms 1408 KB Output is correct
3 Correct 0 ms 1408 KB Output is correct
4 Correct 0 ms 1408 KB Output is correct
5 Correct 0 ms 1408 KB Output is correct
6 Correct 0 ms 1408 KB Output is correct
7 Correct 0 ms 1408 KB Output is correct
8 Correct 0 ms 1408 KB Output is correct
9 Correct 0 ms 1408 KB Output is correct
10 Correct 0 ms 1408 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 3388 KB Output is correct
2 Correct 0 ms 1408 KB Output is correct
3 Correct 4 ms 1408 KB Output is correct
4 Correct 0 ms 1408 KB Output is correct
5 Correct 5 ms 1804 KB Output is correct
6 Correct 0 ms 1408 KB Output is correct
7 Correct 0 ms 1408 KB Output is correct
8 Correct 31 ms 4312 KB Output is correct
9 Correct 37 ms 4180 KB Output is correct
10 Correct 6 ms 1936 KB Output is correct
11 Correct 12 ms 2068 KB Output is correct
12 Correct 3 ms 1672 KB Output is correct
13 Correct 0 ms 1804 KB Output is correct
14 Correct 0 ms 1408 KB Output is correct
15 Correct 41 ms 4972 KB Output is correct

Subtask #4
0.0 / 38.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1804 KB Output is correct
2 Correct 99 ms 9856 KB Output is correct
3 Correct 3 ms 1672 KB Output is correct
4 Correct 52 ms 6688 KB Output is correct
5 Correct 60 ms 6952 KB Output is correct
6 Correct 14 ms 3256 KB Output is correct
7 Correct 20 ms 3388 KB Output is correct
8 Correct 78 ms 8008 KB Output is correct
9 Correct 27 ms 3652 KB Output is correct
10 Correct 91 ms 9064 KB Output is correct
11 Incorrect 0 ms 1408 KB Output isn't correct
12 Correct 30 ms 4972 KB Output is correct
13 Correct 78 ms 8404 KB Output is correct
14 Correct 26 ms 3652 KB Output is correct
15 Correct 84 ms 8404 KB Output is correct