oj.uz

Submission #1018724

# Submission time Handle Problem Language Result Execution time Memory
1018724 2024-07-10T08:58:59 Z AmirAli_H1 Sorting (IOI15_sorting) C++17
74 / 100
 1000 ms 16212 KB 
// In the name of Allah

#include <bits/stdc++.h>
#include "sorting.h"
using namespace std;

typedef		long long int			ll;
typedef		long double				ld;
typedef		pair<int, int>			pii;
typedef		pair<ll, ll>			pll;
typedef		complex<ld>				cld;

#define		all(x)					(x).begin(),(x).end()
#define		len(x)					((ll) (x).size())
#define		F						first
#define		S						second
#define		pb						push_back
#define		sep						' '
#define		endl					'\n'
#define		Mp						make_pair
#define		kill(x)					cout << x << '\n', exit(0)
#define		set_dec(x)				cout << fixed << setprecision(x);
#define		file_io(x,y)			freopen(x, "r", stdin); freopen(y, "w", stdout);
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

int n, q;
const int maxn = 2e5 + 7;
int A1[maxn], A2[maxn], mark[maxn];

void dfs(int v) {
	mark[v] = 1; int u = A1[v];
	if (!mark[u]) dfs(u);
}

bool ok(int n, int S[], int q, int X[], int Y[]) {
	for (int i = 0; i < n; i++) A1[i] = S[i];
	for (int i = 0; i < q; i++) {
		int i1 = X[i], i2 = Y[i];
		swap(A1[i1], A1[i2]);
	}
	fill(mark, mark + n, 0); int c = 0;
	for (int i = 0; i < n; i++) {
		if (!mark[i]) {
			dfs(i); c++;
		}
	}
	return (n - c <= q);
}

int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {
    int l = -1, r = M;
	while (r - l > 1) {
		int mid = (l + r) / 2;
		if (ok(N, S, mid, X, Y)) r = mid;
		else l = mid;
	}
	n = N; q = r;
    
    for (int i = 0; i < n; i++) {
    	A1[i] = S[i]; A2[i] = S[i];
	}
	for (int i = 0; i < q; i++) {
		int i1 = X[i], i2 = Y[i];
		P[i] = 0; Q[i] = 0;
		swap(A2[i1], A2[i2]);
	}
	
	for (int i = 0; i < q; i++) {
		int i1 = X[i], i2 = Y[i];
		swap(A1[i1], A1[i2]);
		int x1 = -1, x2 = -1;
		for (int j = 0; j < n; j++) {
			if (A2[j] != j) {
				x1 = A2[j], x2 = A2[A2[j]];
				swap(A2[j], A2[A2[j]]);
				break;
			}
		}
		if (x1 != -1 && x2 != -1) {
			P[i] = find(A1, A1 + n, x1) - A1;
			Q[i] = find(A1, A1 + n, x2) - A1;
		}
		i1 = P[i], i2 = Q[i];
		swap(A1[i1], A1[i2]);
	}
	return q;
}

Compilation message

sorting.cpp: In function 'bool ok(int, int*, int, int*, int*)':
sorting.cpp:35:29: warning: declaration of 'q' shadows a global declaration [-Wshadow]
   35 | bool ok(int n, int S[], int q, int X[], int Y[]) {
      |                         ~~~~^
sorting.cpp:26:8: note: shadowed declaration is here
   26 | int n, q;
      |        ^
sorting.cpp:35:13: warning: declaration of 'n' shadows a global declaration [-Wshadow]
   35 | bool ok(int n, int S[], int q, int X[], int Y[]) {
      |         ~~~~^
sorting.cpp:26:5: note: shadowed declaration is here
   26 | int n, q;
      |     ^
sorting.cpp: In function 'int findSwapPairs(int, int*, int, int*, int*, int*, int*)':
sorting.cpp:80:32: warning: conversion from 'long int' to 'int' may change value [-Wconversion]
   80 |    P[i] = find(A1, A1 + n, x1) - A1;
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~
sorting.cpp:81:32: warning: conversion from 'long int' to 'int' may change value [-Wconversion]
   81 |    Q[i] = find(A1, A1 + n, x2) - A1;
      |           ~~~~~~~~~~~~~~~~~~~~~^~~~

Subtask #1
8.0 / 8.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
16.0 / 16.0

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

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 448 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 448 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 452 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 1 ms 572 KB Output is correct
22 Correct 1 ms 604 KB Output is correct
23 Correct 1 ms 656 KB Output is correct
24 Correct 1 ms 604 KB Output is correct
25 Correct 1 ms 604 KB Output is correct
26 Correct 1 ms 604 KB Output is correct
27 Correct 1 ms 600 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 604 KB Output is correct
2 Correct 1 ms 604 KB Output is correct
3 Correct 2 ms 600 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 3 ms 788 KB Output is correct
9 Correct 2 ms 528 KB Output is correct
10 Correct 2 ms 604 KB Output is correct
11 Correct 2 ms 608 KB Output is correct
12 Correct 1 ms 608 KB Output is correct
13 Correct 1 ms 604 KB Output is correct
14 Correct 1 ms 600 KB Output is correct

Subtask #6
0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 604 KB Output is correct
2 Correct 1 ms 604 KB Output is correct
3 Correct 2 ms 600 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 3 ms 788 KB Output is correct
9 Correct 2 ms 528 KB Output is correct
10 Correct 2 ms 604 KB Output is correct
11 Correct 2 ms 608 KB Output is correct
12 Correct 1 ms 608 KB Output is correct
13 Correct 1 ms 604 KB Output is correct
14 Correct 1 ms 600 KB Output is correct
15 Execution timed out 1038 ms 16212 KB Time limit exceeded
16 Halted 0 ms 0 KB -