oj.uz

Submission #46336

# Submission time Handle Problem Language Result Execution time Memory
46336 2018-04-19T08:52:30 Z jun6873 Sorting (IOI15_sorting) C++11
100 / 100
 634 ms 29464 KB 
#include "sorting.h"
#include <bits/stdc++.h>
using namespace std;

typedef pair<int, int> pint;
#define x first
#define y second

int n, *s;
int m, *x, *y, *p, *q;

const int maxn = 200004;
bool vis[maxn];
int now[maxn], rev[maxn];
int dfs(int *nxt, vector<pint>& rec, int k) {
	if (vis[k]) return k; vis[k] = 1;
	int l = dfs(nxt, rec, nxt[k]);
	if (k!=l) rec.emplace_back(k, l);
	return l;
}

bool possible(int k) {
	copy(s, s+n, now);
	for (int i=0; i<k; i++) swap(now[x[i]], now[y[i]]);

	vector<pint> pr;
	memset(vis, 0, sizeof(vis));
	for (int i=0; i<n; i++) if (!vis[i]) dfs(now, pr, i);

	if (pr.size() > k) return false;

	iota(now, now+n, 0);
	iota(rev, rev+n, 0);
	for (int i=k-1; ~i; i--) {
		if (pr.size() <= i)	{
			p[i] = q[i] = 0;
		} else {
			p[i] = rev[pr[i].x];
			q[i] = rev[pr[i].y];
		}
		swap(rev[now[p[i]]], rev[now[q[i]]]); swap(now[p[i]], now[q[i]]);
		swap(rev[now[x[i]]], rev[now[y[i]]]); swap(now[x[i]], now[y[i]]);
	}

	return true;
}

int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {
	n = N; s = S; m = M; x = X; y = Y; p = P; q = Q;

	int l = -1, r = m+1;
	while (l+1<r) {
		int m = (l+r)/2;
		if (possible(m)) r = m;
		else l = m;
	}

	return r;
}

Compilation message

sorting.cpp: In function 'int dfs(int*, std::vector<std::pair<int, int> >&, int)':
sorting.cpp:16:2: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
  if (vis[k]) return k; vis[k] = 1;
  ^~
sorting.cpp:16:24: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
  if (vis[k]) return k; vis[k] = 1;
                        ^~~
sorting.cpp: In function 'bool possible(int)':
sorting.cpp:30:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  if (pr.size() > k) return false;
      ~~~~~~~~~~^~~
sorting.cpp:35:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   if (pr.size() <= i) {
       ~~~~~~~~~~^~~~
sorting.cpp: In function 'int findSwapPairs(int, int*, int, int*, int*, int*, int*)':
sorting.cpp:53:7: warning: declaration of 'm' shadows a global declaration [-Wshadow]
   int m = (l+r)/2;
       ^
sorting.cpp:10:5: note: shadowed declaration is here
 int m, *x, *y, *p, *q;
     ^

Subtask #1
8.0 / 8.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
16.0 / 16.0

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

Subtask #4
18.0 / 18.0

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

Subtask #5
20.0 / 20.0

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

Subtask #6
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 768 KB Output is correct
2 Correct 4 ms 768 KB Output is correct
3 Correct 4 ms 768 KB Output is correct
4 Correct 4 ms 768 KB Output is correct
5 Correct 4 ms 768 KB Output is correct
6 Correct 4 ms 768 KB Output is correct
7 Correct 4 ms 768 KB Output is correct
8 Correct 4 ms 768 KB Output is correct
9 Correct 3 ms 768 KB Output is correct
10 Correct 4 ms 768 KB Output is correct
11 Correct 3 ms 640 KB Output is correct
12 Correct 4 ms 768 KB Output is correct
13 Correct 4 ms 768 KB Output is correct
14 Correct 3 ms 640 KB Output is correct
15 Correct 486 ms 24300 KB Output is correct
16 Correct 507 ms 25496 KB Output is correct
17 Correct 634 ms 27712 KB Output is correct
18 Correct 118 ms 20504 KB Output is correct
19 Correct 289 ms 22332 KB Output is correct
20 Correct 242 ms 19120 KB Output is correct
21 Correct 302 ms 23304 KB Output is correct
22 Correct 533 ms 18964 KB Output is correct
23 Correct 500 ms 28804 KB Output is correct
24 Correct 594 ms 28292 KB Output is correct
25 Correct 452 ms 26980 KB Output is correct
26 Correct 250 ms 12240 KB Output is correct
27 Correct 257 ms 11832 KB Output is correct
28 Correct 568 ms 25728 KB Output is correct
29 Correct 308 ms 13196 KB Output is correct
30 Correct 181 ms 10864 KB Output is correct
31 Correct 357 ms 13264 KB Output is correct
32 Correct 467 ms 27956 KB Output is correct
33 Correct 611 ms 27796 KB Output is correct
34 Correct 406 ms 14400 KB Output is correct
35 Correct 327 ms 20436 KB Output is correct
36 Correct 95 ms 9848 KB Output is correct
37 Correct 483 ms 29464 KB Output is correct
38 Correct 630 ms 28284 KB Output is correct
39 Correct 477 ms 28512 KB Output is correct