oj.uz

Submission #14615

# Submission time Handle Problem Language Result Execution time Memory
14615 2015-05-21T16:46:16 Z caphile98 버블 정렬 (OJUZ10_bubblesort) C++
34 / 100
 1000 ms 1472 KB 
#include <stdio.h>
#define MAX 100001
int arr[MAX];

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

	int i, j;
	for (i = 1; i <= n; i++)
		scanf("%d", &arr[i]);

	int temp;
	int e = n;
	bool flag;
	for (i = 1; i <= k; i++)
	{
		flag = true;
		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
				flag = false;
		}
		if (flag == true)
			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 1472 KB Output is correct
2 Correct 0 ms 1472 KB Output is correct
3 Correct 0 ms 1472 KB Output is correct
4 Correct 0 ms 1472 KB Output is correct
5 Correct 0 ms 1472 KB Output is correct
6 Correct 0 ms 1472 KB Output is correct
7 Correct 0 ms 1472 KB Output is correct

Subtask #2
23.0 / 23.0

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

Subtask #3
0.0 / 47.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1000 ms 1468 KB Program timed out
2 Execution timed out 1000 ms 1468 KB Program timed out
3 Execution timed out 1000 ms 1468 KB Program timed out
4 Execution timed out 1000 ms 1468 KB Program timed out
5 Execution timed out 1000 ms 1468 KB Program timed out
6 Execution timed out 1000 ms 1468 KB Program timed out
7 Correct 112 ms 1472 KB Output is correct
8 Correct 30 ms 1472 KB Output is correct
9 Correct 61 ms 1472 KB Output is correct
10 Execution timed out 1000 ms 1468 KB Program timed out
11 Correct 111 ms 1472 KB Output is correct
12 Execution timed out 1000 ms 1468 KB Program timed out
13 Execution timed out 1000 ms 1468 KB Program timed out
14 Correct 48 ms 1472 KB Output is correct
15 Correct 234 ms 1472 KB Output is correct

Subtask #4
0.0 / 19.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1000 ms 1468 KB Program timed out
2 Execution timed out 1000 ms 1468 KB Program timed out
3 Execution timed out 1000 ms 1468 KB Program timed out
4 Correct 35 ms 1472 KB Output is correct
5 Execution timed out 1000 ms 1468 KB Program timed out
6 Execution timed out 1000 ms 1468 KB Program timed out
7 Correct 107 ms 1472 KB Output is correct
8 Correct 114 ms 1472 KB Output is correct
9 Correct 240 ms 1472 KB Output is correct
10 Execution timed out 1000 ms 1468 KB Program timed out
11 Execution timed out 1000 ms 1468 KB Program timed out
12 Correct 50 ms 1472 KB Output is correct
13 Execution timed out 1000 ms 1468 KB Program timed out
14 Execution timed out 1000 ms 1468 KB Program timed out
15 Correct 39 ms 1472 KB Output is correct