Submission #14612

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
14612	2015-05-21T16:29:07 Z	caphile98	버블 정렬 (OJUZ10_bubblesort)	C++	34 / 100	1000 ms	1864 KB

bubblesort

#include <stdio.h>
#define MAX 100001
int arr[MAX];
int brr[MAX];

int main()
{
	int n, k;
	scanf("%d%d", &n, &k);

	int i, j;
	for (i = 1; i <= n; i++)
	{
		scanf("%d", &arr[i]);
		brr[i] = arr[i];
	}
	int temp;
	int e = n;
	int l;
	int a;
	for (i = 1; i <= k; i++)
	{
		a = 0;
		for (j = 1; j < e; j++)
		{
			if (arr[j]>arr[j + 1])
			{
				temp = arr[j];
				arr[j] = arr[j + 1];
				arr[j + 1] = temp;
			}
			else
			{
				a += 1;
				if (a == e)
					break;
			}
		}
		e -= 1;
	}
	for (i = 1; i <= n; i++)
		printf("%d ", arr[i]);
	return 0;
}

Subtask #1

11.0 / 11.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	1864 KB	Output is correct
2	Correct	0 ms	1864 KB	Output is correct
3	Correct	0 ms	1864 KB	Output is correct
4	Correct	0 ms	1864 KB	Output is correct
5	Correct	0 ms	1864 KB	Output is correct
6	Correct	0 ms	1864 KB	Output is correct
7	Correct	0 ms	1864 KB	Output is correct

Subtask #2

23.0 / 23.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	1864 KB	Output is correct
2	Correct	0 ms	1864 KB	Output is correct
3	Correct	4 ms	1864 KB	Output is correct
4	Correct	3 ms	1864 KB	Output is correct
5	Correct	0 ms	1864 KB	Output is correct
6	Correct	0 ms	1864 KB	Output is correct
7	Correct	4 ms	1864 KB	Output is correct
8	Correct	0 ms	1864 KB	Output is correct
9	Correct	0 ms	1864 KB	Output is correct
10	Correct	2 ms	1864 KB	Output is correct

Subtask #3

0.0 / 47.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	237 ms	1864 KB	Output is correct
2	Execution timed out	1000 ms	1860 KB	Program timed out
3	Correct	108 ms	1864 KB	Output is correct
4	Execution timed out	1000 ms	1860 KB	Program timed out
5	Correct	30 ms	1864 KB	Output is correct
6	Execution timed out	1000 ms	1860 KB	Program timed out
7	Correct	49 ms	1864 KB	Output is correct
8	Execution timed out	1000 ms	1860 KB	Program timed out
9	Execution timed out	1000 ms	1860 KB	Program timed out
10	Execution timed out	1000 ms	1860 KB	Program timed out
11	Execution timed out	1000 ms	1860 KB	Program timed out
12	Execution timed out	1000 ms	1860 KB	Program timed out
13	Execution timed out	1000 ms	1860 KB	Program timed out
14	Correct	115 ms	1864 KB	Output is correct
15	Correct	43 ms	1864 KB	Output is correct

Subtask #4

0.0 / 19.0

#	Verdict	Execution time	Memory	Grader output
1	Execution timed out	1000 ms	1860 KB	Program timed out
2	Correct	130 ms	1864 KB	Output is correct
3	Execution timed out	1000 ms	1860 KB	Program timed out
4	Execution timed out	1000 ms	1860 KB	Program timed out
5	Correct	45 ms	1864 KB	Output is correct
6	Execution timed out	1000 ms	1860 KB	Program timed out
7	Correct	115 ms	1864 KB	Output is correct
8	Execution timed out	1000 ms	1860 KB	Program timed out
9	Execution timed out	1000 ms	1860 KB	Program timed out
10	Correct	48 ms	1864 KB	Output is correct
11	Correct	22 ms	1864 KB	Output is correct
12	Execution timed out	1000 ms	1860 KB	Program timed out
13	Execution timed out	1000 ms	1860 KB	Program timed out
14	Correct	241 ms	1864 KB	Output is correct
15	Execution timed out	1000 ms	1860 KB	Program timed out