| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 14084 |
2015-04-27T10:09:05 Z |
gs13068 |
이상한 수열 (OJUZ10_bizarre) |
C++ |
|
224 ms |
28720 KB |
#include<cstdio>
#include<set>
std::set<int> S;
int a[555555];
int main()
{
int i,n,m;
scanf("%d",&n);
for(i=1;i<=n;i++)
{
scanf("%d",&a[i]);
S.insert(a[i]);
}
scanf("%d",&m);
for(i=1;i<=m;i++)
{
if(i>n)
{
a[i]=S.size();
S.insert(a[i]);
if(a[i]==a[i-1])
{
printf("%d",a[i]);
return 0;
}
}
}
printf("%d",a[m]);
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
3380 KB |
Output is correct |
| 2 |
Correct |
0 ms |
3380 KB |
Output is correct |
| 3 |
Correct |
0 ms |
3380 KB |
Output is correct |
| 4 |
Correct |
0 ms |
3380 KB |
Output is correct |
| 5 |
Correct |
0 ms |
3380 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
3380 KB |
Output is correct |
| 2 |
Correct |
0 ms |
3380 KB |
Output is correct |
| 3 |
Correct |
0 ms |
3380 KB |
Output is correct |
| 4 |
Correct |
0 ms |
3380 KB |
Output is correct |
| 5 |
Correct |
0 ms |
3380 KB |
Output is correct |
| 6 |
Correct |
0 ms |
3380 KB |
Output is correct |
| 7 |
Correct |
0 ms |
3380 KB |
Output is correct |
| 8 |
Correct |
0 ms |
3380 KB |
Output is correct |
| 9 |
Correct |
0 ms |
3380 KB |
Output is correct |
| 10 |
Correct |
0 ms |
3380 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
6 ms |
3776 KB |
Output is correct |
| 2 |
Correct |
31 ms |
6152 KB |
Output is correct |
| 3 |
Correct |
0 ms |
3380 KB |
Output is correct |
| 4 |
Correct |
27 ms |
5624 KB |
Output is correct |
| 5 |
Correct |
5 ms |
3776 KB |
Output is correct |
| 6 |
Correct |
15 ms |
5360 KB |
Output is correct |
| 7 |
Correct |
19 ms |
6284 KB |
Output is correct |
| 8 |
Correct |
8 ms |
3380 KB |
Output is correct |
| 9 |
Correct |
12 ms |
4040 KB |
Output is correct |
| 10 |
Correct |
40 ms |
6944 KB |
Output is correct |
| 11 |
Correct |
2 ms |
3644 KB |
Output is correct |
| 12 |
Correct |
32 ms |
5624 KB |
Output is correct |
| 13 |
Correct |
4 ms |
3908 KB |
Output is correct |
| 14 |
Correct |
30 ms |
5360 KB |
Output is correct |
| 15 |
Correct |
10 ms |
3380 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
3644 KB |
Output is correct |
| 2 |
Correct |
4 ms |
3776 KB |
Output is correct |
| 3 |
Runtime error |
208 ms |
27004 KB |
SIGSEGV Segmentation fault |
| 4 |
Runtime error |
224 ms |
28192 KB |
SIGSEGV Segmentation fault |
| 5 |
Correct |
28 ms |
5624 KB |
Output is correct |
| 6 |
Runtime error |
201 ms |
28720 KB |
SIGSEGV Segmentation fault |
| 7 |
Correct |
25 ms |
5624 KB |
Output is correct |
| 8 |
Runtime error |
206 ms |
27532 KB |
SIGSEGV Segmentation fault |
| 9 |
Runtime error |
224 ms |
27136 KB |
SIGSEGV Segmentation fault |
| 10 |
Correct |
27 ms |
5360 KB |
Output is correct |
| 11 |
Runtime error |
211 ms |
27532 KB |
Program hung waiting for input |
| 12 |
Runtime error |
195 ms |
27004 KB |
SIGSEGV Segmentation fault |
| 13 |
Runtime error |
189 ms |
28456 KB |
SIGSEGV Segmentation fault |
| 14 |
Correct |
51 ms |
10904 KB |
Output is correct |
| 15 |
Runtime error |
222 ms |
27664 KB |
SIGSEGV Segmentation fault |
