Submission #14334

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
14334	2015-05-12T06:53:17 Z	Namnamseo	이상한 수열 (OJUZ10_bizarre)	C++	8 / 100	40 ms	5104 KB

bizarre

#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+1;
        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;
}

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

0.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	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	Correct	0 ms	1408 KB	Output is correct
9	Incorrect	0 ms	1408 KB	Output isn't correct
10	Correct	0 ms	1408 KB	Output is correct

Subtask #3

0.0 / 30.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	4 ms	1804 KB	Output is correct
2	Correct	0 ms	1804 KB	Output is correct
3	Correct	0 ms	1672 KB	Output is correct
4	Correct	0 ms	1936 KB	Output is correct
5	Correct	0 ms	1408 KB	Output is correct
6	Correct	6 ms	1408 KB	Output is correct
7	Correct	40 ms	4972 KB	Output is correct
8	Incorrect	21 ms	3124 KB	Output isn't correct
9	Correct	30 ms	4180 KB	Output is correct
10	Correct	6 ms	1408 KB	Output is correct
11	Correct	9 ms	1408 KB	Output is correct
12	Incorrect	14 ms	2596 KB	Output isn't correct
13	Correct	0 ms	1408 KB	Output is correct
14	Correct	2 ms	1408 KB	Output is correct
15	Correct	8 ms	2068 KB	Output is correct

Subtask #4

0.0 / 38.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	17 ms	3256 KB	Output isn't correct
2	Incorrect	28 ms	3652 KB	Output isn't correct
3	Incorrect	11 ms	2596 KB	Output isn't correct
4	Correct	4 ms	1804 KB	Output is correct
5	Correct	23 ms	3652 KB	Output is correct
6	Incorrect	40 ms	5104 KB	Output isn't correct
7	Correct	23 ms	3388 KB	Output is correct
8	Incorrect	0 ms	1408 KB	Output isn't correct
9	Correct	2 ms	1672 KB	Output is correct
10	Incorrect	6 ms	1936 KB	Output isn't correct
11	Incorrect	18 ms	3124 KB	Output isn't correct
12	Incorrect	38 ms	4312 KB	Output isn't correct
13	Incorrect	29 ms	3784 KB	Output isn't correct
14	Correct	29 ms	3652 KB	Output is correct
15	Incorrect	27 ms	3652 KB	Output isn't correct