Submission #14333

# Submission time Handle Problem Language Result Execution time Memory
14333 2015-05-12T06:51:31 Z Namnamseo 이상한 수열 (OJUZ10_bizarre) C++
8 / 100
39 ms 5104 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 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;
        for(i=1;m && i<=n;++i){
            if(s.find(s.size()) != s.end()){
                break;
            }
            --m;
            s.insert(s.size());
        }
        printf("%d\n",s.size());
    }
    return 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
# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 1408 KB Output isn't correct
2 Incorrect 0 ms 1408 KB Output isn't correct
3 Incorrect 0 ms 1408 KB Output isn't correct
4 Incorrect 0 ms 1408 KB Output isn't 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 Incorrect 0 ms 1408 KB Output isn't correct
9 Correct 0 ms 1408 KB Output is correct
10 Incorrect 0 ms 1408 KB Output isn't correct
# Verdict Execution time Memory Grader output
1 Incorrect 30 ms 4972 KB Output isn't correct
2 Correct 5 ms 1804 KB Output is correct
3 Correct 0 ms 1408 KB Output is correct
4 Correct 4 ms 1408 KB Output is correct
5 Incorrect 6 ms 1936 KB Output isn't correct
6 Incorrect 12 ms 3124 KB Output isn't correct
7 Correct 0 ms 1408 KB Output is correct
8 Incorrect 10 ms 2068 KB Output isn't correct
9 Incorrect 36 ms 4180 KB Output isn't correct
10 Correct 5 ms 1804 KB Output is correct
11 Correct 0 ms 1408 KB Output is correct
12 Correct 0 ms 1672 KB Output is correct
13 Incorrect 11 ms 2596 KB Output isn't correct
14 Correct 0 ms 1408 KB Output is correct
15 Correct 0 ms 1408 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 23 ms 3652 KB Output is correct
2 Correct 24 ms 3388 KB Output is correct
3 Correct 0 ms 1672 KB Output is correct
4 Incorrect 29 ms 3652 KB Output isn't correct
5 Incorrect 18 ms 3124 KB Output isn't correct
6 Correct 6 ms 1804 KB Output is correct
7 Incorrect 28 ms 3784 KB Output isn't correct
8 Incorrect 39 ms 5104 KB Output isn't correct
9 Incorrect 28 ms 3652 KB Output isn't correct
10 Incorrect 39 ms 4312 KB Output isn't correct
11 Incorrect 10 ms 2596 KB Output isn't correct
12 Incorrect 0 ms 1408 KB Output isn't correct
13 Incorrect 20 ms 3256 KB Output isn't correct
14 Incorrect 6 ms 1936 KB Output isn't correct
15 Correct 16 ms 3652 KB Output is correct