| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 14128 |
2015-05-02T07:13:55 Z |
ggoh |
버블 정렬 (OJUZ10_bubblesort) |
C++ |
|
1000 ms |
3584 KB |
#include<cstdio>
#include<algorithm>
#include<vector>
#include<queue>
#include<cstring>
long long a,b,i,j,t,p,q,m,n,s,x[160001],y[160001];
main()
{
scanf("%lld%lld",&a,&b);
for(i=0;i<a;i++)
{
scanf("%lld",&x[i]);
}
while(b--)
{
for(i=0;i<a-1;i++)
{
if(x[i]>x[i+1])
{
t=x[i];
x[i]=x[i+1];
x[i+1]=t;
}
}
}
for(i=0;i<a;i++)
{
printf("%lld ",x[i]);
}
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
3584 KB |
Output is correct |
| 2 |
Correct |
0 ms |
3584 KB |
Output is correct |
| 3 |
Correct |
0 ms |
3584 KB |
Output is correct |
| 4 |
Correct |
0 ms |
3584 KB |
Output is correct |
| 5 |
Correct |
0 ms |
3584 KB |
Output is correct |
| 6 |
Correct |
0 ms |
3584 KB |
Output is correct |
| 7 |
Correct |
0 ms |
3584 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
3584 KB |
Output is correct |
| 2 |
Correct |
0 ms |
3584 KB |
Output is correct |
| 3 |
Correct |
2 ms |
3584 KB |
Output is correct |
| 4 |
Correct |
1 ms |
3584 KB |
Output is correct |
| 5 |
Correct |
0 ms |
3584 KB |
Output is correct |
| 6 |
Correct |
4 ms |
3584 KB |
Output is correct |
| 7 |
Correct |
0 ms |
3584 KB |
Output is correct |
| 8 |
Correct |
3 ms |
3584 KB |
Output is correct |
| 9 |
Correct |
3 ms |
3584 KB |
Output is correct |
| 10 |
Correct |
7 ms |
3584 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
128 ms |
3584 KB |
Output is correct |
| 2 |
Execution timed out |
1000 ms |
3580 KB |
Program timed out |
| 3 |
Execution timed out |
1000 ms |
3580 KB |
Program timed out |
| 4 |
Correct |
119 ms |
3584 KB |
Output is correct |
| 5 |
Execution timed out |
1000 ms |
3580 KB |
Program timed out |
| 6 |
Correct |
57 ms |
3584 KB |
Output is correct |
| 7 |
Execution timed out |
1000 ms |
3580 KB |
Program timed out |
| 8 |
Execution timed out |
1000 ms |
3580 KB |
Program timed out |
| 9 |
Correct |
21 ms |
3584 KB |
Output is correct |
| 10 |
Execution timed out |
1000 ms |
3580 KB |
Program timed out |
| 11 |
Execution timed out |
1000 ms |
3580 KB |
Program timed out |
| 12 |
Correct |
33 ms |
3584 KB |
Output is correct |
| 13 |
Execution timed out |
1000 ms |
3580 KB |
Program timed out |
| 14 |
Execution timed out |
1000 ms |
3580 KB |
Program timed out |
| 15 |
Correct |
251 ms |
3584 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
1000 ms |
3580 KB |
Program timed out |
| 2 |
Execution timed out |
1000 ms |
3580 KB |
Program timed out |
| 3 |
Execution timed out |
1000 ms |
3580 KB |
Program timed out |
| 4 |
Execution timed out |
1000 ms |
3580 KB |
Program timed out |
| 5 |
Correct |
119 ms |
3584 KB |
Output is correct |
| 6 |
Execution timed out |
1000 ms |
3580 KB |
Program timed out |
| 7 |
Correct |
47 ms |
3584 KB |
Output is correct |
| 8 |
Correct |
113 ms |
3584 KB |
Output is correct |
| 9 |
Execution timed out |
1000 ms |
3580 KB |
Program timed out |
| 10 |
Execution timed out |
1000 ms |
3580 KB |
Program timed out |
| 11 |
Correct |
31 ms |
3584 KB |
Output is correct |
| 12 |
Correct |
29 ms |
3584 KB |
Output is correct |
| 13 |
Correct |
240 ms |
3584 KB |
Output is correct |
| 14 |
Execution timed out |
1000 ms |
3580 KB |
Program timed out |
| 15 |
Execution timed out |
1000 ms |
3580 KB |
Program timed out |
