답안 #14608

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
14608	2015-05-21T16:00:43 Z	caphile98	버블 정렬 (OJUZ10_bubblesort)	C++	0 / 100	44 ms	2256 KB

bubblesort

#include <stdio.h>
#define MAX 100001
int arr[MAX];
int brr[MAX];
int check[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;
	for (i = 1; i <= k; i++)
	{
		for (j = 1; j < e; j++)
		{
			if (arr[j]>arr[j + 1]&&check[j]==0)
			{
				temp = arr[j];
				arr[j] = arr[j + 1];
				arr[j + 1] = temp;
			}
		}
		for (i = 1; i < e; i++)
		{
			if (arr[i] == brr[i])
				check[i] = 1;
			brr[i] = arr[i];
		}
		e -= 1;
	}
	for (i = 1; i <= n; i++)
		printf("%d ", arr[i]);
	return 0;
}	

Subtask #1

0.0 / 11.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	0 ms	2256 KB	Output isn't correct
2	Incorrect	0 ms	2256 KB	Output isn't correct
3	Correct	0 ms	2256 KB	Output is correct
4	Correct	0 ms	2256 KB	Output is correct
5	Incorrect	0 ms	2256 KB	Output isn't correct
6	Incorrect	0 ms	2256 KB	Output isn't correct
7	Incorrect	0 ms	2256 KB	Output isn't correct

Subtask #2

0.0 / 23.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	0 ms	2256 KB	Output isn't correct
2	Incorrect	0 ms	2256 KB	Output isn't correct
3	Incorrect	0 ms	2256 KB	Output isn't correct
4	Incorrect	0 ms	2256 KB	Output isn't correct
5	Incorrect	0 ms	2256 KB	Output isn't correct
6	Incorrect	0 ms	2256 KB	Output isn't correct
7	Incorrect	0 ms	2256 KB	Output isn't correct
8	Incorrect	0 ms	2256 KB	Output isn't correct
9	Incorrect	0 ms	2256 KB	Output isn't correct
10	Incorrect	0 ms	2256 KB	Output isn't correct

Subtask #3

0.0 / 47.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	34 ms	2256 KB	Output isn't correct
2	Incorrect	0 ms	2256 KB	Output isn't correct
3	Incorrect	20 ms	2256 KB	Output isn't correct
4	Incorrect	24 ms	2256 KB	Output isn't correct
5	Incorrect	22 ms	2256 KB	Output isn't correct
6	Incorrect	12 ms	2256 KB	Output isn't correct
7	Incorrect	0 ms	2256 KB	Output isn't correct
8	Incorrect	0 ms	2256 KB	Output isn't correct
9	Correct	31 ms	2256 KB	Output is correct
10	Incorrect	31 ms	2256 KB	Output isn't correct
11	Incorrect	0 ms	2256 KB	Output isn't correct
12	Incorrect	18 ms	2256 KB	Output isn't correct
13	Incorrect	23 ms	2256 KB	Output isn't correct
14	Incorrect	26 ms	2256 KB	Output isn't correct
15	Incorrect	30 ms	2256 KB	Output isn't correct

Subtask #4

0.0 / 19.0

#	결과	실행 시간	메모리	Grader output
1	Incorrect	28 ms	2256 KB	Output isn't correct
2	Incorrect	0 ms	2256 KB	Output isn't correct
3	Incorrect	36 ms	2256 KB	Output isn't correct
4	Incorrect	44 ms	2256 KB	Output isn't correct
5	Incorrect	13 ms	2256 KB	Output isn't correct
6	Incorrect	35 ms	2256 KB	Output isn't correct
7	Incorrect	0 ms	2256 KB	Output isn't correct
8	Incorrect	0 ms	2256 KB	Output isn't correct
9	Correct	33 ms	2256 KB	Output is correct
10	Incorrect	0 ms	2256 KB	Output isn't correct
11	Incorrect	27 ms	2256 KB	Output isn't correct
12	Incorrect	33 ms	2256 KB	Output isn't correct
13	Incorrect	31 ms	2256 KB	Output isn't correct
14	Incorrect	24 ms	2256 KB	Output isn't correct
15	Incorrect	0 ms	2256 KB	Output isn't correct