| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 14149 |
2015-05-02T08:56:21 Z |
ggoh |
버블 정렬 (OJUZ10_bubblesort) |
C++ |
|
242 ms |
11836 KB |
#include<cstdio>
#include<algorithm>
#include<map>
int a,b,i,j,t,p,q,m,n,s,x[160001],y[160001];
std::map<int,int>D,U;
main()
{
scanf("%d%d",&a,&b);
for(i=0;i<a;i++)
{
scanf("%d",&x[i]);
y[i]=x[i];
U[x[i]]++;
}
if(a<=2000)
{
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("%d ",x[i]);
}
return 0;
}
std::sort(y,y+a);
for(i=a-b;i<a;i++)
{
D[y[i]]++;
}
for(i=0;i<a;i++)
{
if(D[x[i]]!=U[x[i]])
{
printf("%d ",x[i]);
D[x[i]]++;
}
}
for(i=a-b;i<a;i++)
{
printf("%d ",y[i]);
}
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
2464 KB |
Output is correct |
| 2 |
Correct |
0 ms |
2464 KB |
Output is correct |
| 3 |
Correct |
0 ms |
2464 KB |
Output is correct |
| 4 |
Correct |
0 ms |
2464 KB |
Output is correct |
| 5 |
Correct |
0 ms |
2464 KB |
Output is correct |
| 6 |
Correct |
0 ms |
2464 KB |
Output is correct |
| 7 |
Correct |
0 ms |
2464 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
2464 KB |
Output is correct |
| 2 |
Correct |
6 ms |
2464 KB |
Output is correct |
| 3 |
Correct |
0 ms |
2464 KB |
Output is correct |
| 4 |
Correct |
5 ms |
2464 KB |
Output is correct |
| 5 |
Correct |
0 ms |
2464 KB |
Output is correct |
| 6 |
Correct |
7 ms |
2464 KB |
Output is correct |
| 7 |
Correct |
0 ms |
2464 KB |
Output is correct |
| 8 |
Correct |
8 ms |
2464 KB |
Output is correct |
| 9 |
Correct |
11 ms |
2464 KB |
Output is correct |
| 10 |
Correct |
0 ms |
2464 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
220 ms |
11836 KB |
Output isn't correct |
| 2 |
Incorrect |
219 ms |
11836 KB |
Output isn't correct |
| 3 |
Incorrect |
221 ms |
11836 KB |
Output isn't correct |
| 4 |
Incorrect |
166 ms |
9856 KB |
Output isn't correct |
| 5 |
Incorrect |
214 ms |
11836 KB |
Output isn't correct |
| 6 |
Incorrect |
157 ms |
8932 KB |
Output isn't correct |
| 7 |
Incorrect |
223 ms |
11836 KB |
Output isn't correct |
| 8 |
Incorrect |
217 ms |
11836 KB |
Output isn't correct |
| 9 |
Correct |
197 ms |
11836 KB |
Output is correct |
| 10 |
Incorrect |
242 ms |
11836 KB |
Output isn't correct |
| 11 |
Incorrect |
213 ms |
11836 KB |
Output isn't correct |
| 12 |
Incorrect |
190 ms |
11836 KB |
Output isn't correct |
| 13 |
Incorrect |
51 ms |
6028 KB |
Output isn't correct |
| 14 |
Incorrect |
231 ms |
11836 KB |
Output isn't correct |
| 15 |
Incorrect |
183 ms |
10648 KB |
Output isn't correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
169 ms |
8272 KB |
Output isn't correct |
| 2 |
Incorrect |
169 ms |
8404 KB |
Output isn't correct |
| 3 |
Incorrect |
181 ms |
8272 KB |
Output isn't correct |
| 4 |
Incorrect |
113 ms |
6556 KB |
Output isn't correct |
| 5 |
Incorrect |
189 ms |
8272 KB |
Output isn't correct |
| 6 |
Incorrect |
172 ms |
8404 KB |
Output isn't correct |
| 7 |
Incorrect |
171 ms |
8272 KB |
Output isn't correct |
| 8 |
Incorrect |
61 ms |
4708 KB |
Output isn't correct |
| 9 |
Incorrect |
193 ms |
8272 KB |
Output isn't correct |
| 10 |
Incorrect |
162 ms |
8272 KB |
Output isn't correct |
| 11 |
Incorrect |
184 ms |
8272 KB |
Output isn't correct |
| 12 |
Incorrect |
164 ms |
7612 KB |
Output isn't correct |
| 13 |
Correct |
183 ms |
8272 KB |
Output is correct |
| 14 |
Incorrect |
187 ms |
8272 KB |
Output isn't correct |
| 15 |
Incorrect |
136 ms |
7084 KB |
Output isn't correct |
