oj.uz

Submission #396744

# Submission time Handle Problem Language Result Execution time Memory
396744 2021-04-30T17:08:40 Z rainboy Sorting (IOI15_sorting) C
100 / 100
 336 ms 19672 KB 
#include "sorting.h"
#include <string.h>

#define N	200000

int findSwapPairs(int n, int pp[], int m, int aa[], int bb[], int ii[], int jj[]) {
	static char visited[N];
	static int vv[N];
	int h, i, j, r, p, q, u, v, lower, upper, cnt;

	for (i = 0; i < n; i++)
		vv[pp[i]] = i;
	lower = -1, upper = m;
	while (upper - lower > 1) {
		r = (lower + upper) / 2;
		for (h = 0; h < r; h++) {
			p = pp[aa[h]], q = pp[bb[h]], u = aa[h], v = bb[h];
			pp[v] = p, vv[p] = v, pp[u] = q, vv[q] = u;
		}
		memset(visited, 0, n * sizeof *visited);
		cnt = 0;
		for (i = 0; i < n; i++)
			if (!visited[i]) {
				visited[i] = 1;
				for (j = pp[i]; !visited[j]; j = pp[j])
					visited[j] = 1, cnt++;
			}
		for (h = r - 1; h >= 0; h--) {
			p = pp[aa[h]], q = pp[bb[h]], u = aa[h], v = bb[h];
			pp[v] = p, vv[p] = v, pp[u] = q, vv[q] = u;
		}
		if (cnt <= r)
			upper = r;
		else
			lower = r;
	}
	r = upper;
	for (h = 0; h < r; h++) {
		p = pp[aa[h]], q = pp[bb[h]], u = aa[h], v = bb[h];
		pp[v] = p, vv[p] = v, pp[u] = q, vv[q] = u;
	}
	memset(visited, 0, n * sizeof *visited);
	cnt = 0;
	for (i = 0; i < n; i++)
		if (!visited[i]) {
			visited[i] = 1;
			for (j = pp[i]; !visited[j]; j = pp[j])
				visited[j] = 1, ii[cnt] = pp[i], jj[cnt] = pp[j], cnt++;
		}
	for (h = r - 1; h >= 0; h--) {
		if (h < cnt)
			ii[h] = vv[ii[h]], jj[h] = vv[jj[h]];
		else
			ii[h] = 0, jj[h] = 0;
		p = pp[aa[h]], q = pp[bb[h]], u = aa[h], v = bb[h];
		pp[v] = p, vv[p] = v, pp[u] = q, vv[q] = u;
	}
	return r;
}

Compilation message

sorting.c: In function 'findSwapPairs':
sorting.c:20:24: warning: conversion to 'long unsigned int' from 'int' may change the sign of the result [-Wsign-conversion]
   20 |   memset(visited, 0, n * sizeof *visited);
      |                        ^
sorting.c:42:23: warning: conversion to 'long unsigned int' from 'int' may change the sign of the result [-Wsign-conversion]
   42 |  memset(visited, 0, n * sizeof *visited);
      |                       ^

Subtask #1
8.0 / 8.0

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

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 280 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 204 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 204 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 280 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 204 KB Output is correct
19 Correct 1 ms 208 KB Output is correct
20 Correct 1 ms 208 KB Output is correct
21 Correct 2 ms 460 KB Output is correct
22 Correct 2 ms 460 KB Output is correct
23 Correct 2 ms 460 KB Output is correct
24 Correct 2 ms 460 KB Output is correct
25 Correct 2 ms 456 KB Output is correct
26 Correct 2 ms 460 KB Output is correct
27 Correct 2 ms 460 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 332 KB Output is correct
2 Correct 2 ms 332 KB Output is correct
3 Correct 2 ms 364 KB Output is correct
4 Correct 1 ms 360 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 2 ms 332 KB Output is correct
8 Correct 2 ms 332 KB Output is correct
9 Correct 2 ms 332 KB Output is correct
10 Correct 2 ms 332 KB Output is correct
11 Correct 2 ms 332 KB Output is correct
12 Correct 2 ms 332 KB Output is correct
13 Correct 2 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct

Subtask #6
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 332 KB Output is correct
2 Correct 2 ms 332 KB Output is correct
3 Correct 2 ms 364 KB Output is correct
4 Correct 1 ms 360 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 2 ms 332 KB Output is correct
8 Correct 2 ms 332 KB Output is correct
9 Correct 2 ms 332 KB Output is correct
10 Correct 2 ms 332 KB Output is correct
11 Correct 2 ms 332 KB Output is correct
12 Correct 2 ms 332 KB Output is correct
13 Correct 2 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 167 ms 9080 KB Output is correct
16 Correct 227 ms 16828 KB Output is correct
17 Correct 290 ms 18320 KB Output is correct
18 Correct 83 ms 14380 KB Output is correct
19 Correct 210 ms 16956 KB Output is correct
20 Correct 227 ms 17660 KB Output is correct
21 Correct 248 ms 17700 KB Output is correct
22 Correct 164 ms 13096 KB Output is correct
23 Correct 218 ms 18500 KB Output is correct
24 Correct 283 ms 18512 KB Output is correct
25 Correct 306 ms 18612 KB Output is correct
26 Correct 224 ms 17496 KB Output is correct
27 Correct 203 ms 16928 KB Output is correct
28 Correct 302 ms 18108 KB Output is correct
29 Correct 285 ms 18244 KB Output is correct
30 Correct 146 ms 16452 KB Output is correct
31 Correct 290 ms 18768 KB Output is correct
32 Correct 187 ms 17864 KB Output is correct
33 Correct 304 ms 18708 KB Output is correct
34 Correct 223 ms 18372 KB Output is correct
35 Correct 207 ms 16884 KB Output is correct
36 Correct 52 ms 15300 KB Output is correct
37 Correct 336 ms 19672 KB Output is correct
38 Correct 302 ms 18552 KB Output is correct
39 Correct 304 ms 19024 KB Output is correct