# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
365472 | Sparky_09 | Sorting (IOI15_sorting) | C++17 | 178 ms | 21356 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "sorting.h"
#include "bits/stdc++.h"
using namespace std;
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define trav(a, x) for(auto& a : x)
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<ll, ll> pii;
typedef vector<ll> vi;
typedef vector<pii> vpi;
void usaco(string s){
freopen((s+".in").c_str(), "r", stdin);
freopen((s+".out").c_str(), "w", stdout);
}
const int N = 6e5 + 9;
int C[N], n, *A, *B, pt[N], dy[N];
bool vis[N];
bool Check(int x){
int cnt = 0, cb = 0;
for (int i = 0; i < n; ++i) if (!vis[i]) {
++cnt;
for (int j = i; ; j = C[j]){
vis[j] = 1;
if (!vis[C[j]]) A[cb] = i, B[cb] = C[j], ++cb;
else break;
}
}
if(cb > x) return 0;
for(int i = cb; i < x; ++i) A[i] = B[i] = 0;
return 1;
}
int findSwapPairs(int NN, int S[], int M, int X[], int Y[], int P[], int Q[]){
int l = 0, r = NN, mid; A = P; B = Q; n = NN;
while (l <= r){
mid = (l + r) >> 1;
for(int i = 0; i < n; ++i) C[i] = S[i], vis[i] = 0;
for(int i = 0; i < mid; ++i) swap(C[X[i]], C[Y[i]]);
if(Check(mid)) r = mid - 1;
else l = mid + 1;
}
for(int i = 0; i < n; ++i) C[i] = S[i], vis[i] = 0;
for(int i = 0; i < l; ++i) swap(C[X[i]], C[Y[i]]);
Check(l);
for(int i = 0; i < n; ++i) pt[i] = dy[i] = i;
for(int i = l - 1; ~i; --i){
P[i] = dy[P[i]]; Q[i] = dy[Q[i]];
swap(pt[X[i]], pt[Y[i]]);
dy[pt[X[i]]] = X[i];
dy[pt[Y[i]]] = Y[i];
}
return l;
}
/*
int main() {
cin.tie(0)->sync_with_stdio(0);
cin.exceptions(cin.failbit);
#ifdef LOCAL_DEFINE
freopen("input.txt", "r", stdin);
#endif
}
*/
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |