oj.uz

Submission #879236

# Submission time Handle Problem Language Result Execution time Memory
879236 2023-11-27T02:43:42 Z NeroZein Sorting (IOI15_sorting) C++17
100 / 100
 215 ms 19312 KB 
#include "sorting.h"
#include "bits/stdc++.h"

using namespace std; 

int findSwapPairs(int N, int S[], int M, int X[], int Y[], int P[], int Q[]) {
  if (is_sorted(S, S + N)) {
    return 0; 
  }
  auto check = [&](int mid) {
    vector<int> finalArray(N);
    for (int i = 0; i < N; ++i) {
      finalArray[i] = S[i];
    }
    for (int i = 0; i < mid; ++i) {
      swap(finalArray[X[i]], finalArray[Y[i]]); 
    }
    vector<int> next(N);
    vector<pair<int, int>> swaps;
    for (int i = 0; i < N; ++i) {
      next[i] = finalArray[i];
    }
    vector<bool> vis(N);
    for (int i = 0; i < N; ++i) {
      if (vis[i] || next[i] == i) continue; 
      int cur = i, nxt = next[i];
      vis[i] = true; 
      while (nxt != i) {
        vis[nxt] = true; 
        swaps.emplace_back(cur, nxt);
        cur = nxt;
        nxt = next[cur]; 
      }
    }
    vector<int> idx(N); 
    vector<int> currentArray(N);
    for (int i = 0; i < N; ++i) {
      idx[S[i]] = i; 
      currentArray[i] = S[i]; 
    }
    auto swapp = [&](int x, int y) {
      swap(idx[x], idx[y]); 
      swap(currentArray[idx[x]], currentArray[idx[y]]); 
    };
    for (int i = 0; i < (int) swaps.size(); ++i) {
      int x = currentArray[X[i]], y = currentArray[Y[i]];
      swapp(x, y); 
      auto [p, q] = swaps[i];
      P[i] = idx[p], Q[i] = idx[q]; 
      swapp(p, q); 
    }
    for (int i = (int) swaps.size(); i < mid; ++i) {
      P[i] = Q[i] = 0; 
    }
    return (int) swaps.size() <= mid; 
  };
  int l = 0, r = M; 
  while (l < r) {
    int mid = (l + r) / 2;
    if (check(mid)) {
      r = mid; 
    } else {
      l = mid + 1; 
    }
  }
  check(l); 
  return l; 
}

Subtask #1
8.0 / 8.0

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

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 420 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 432 KB Output is correct
8 Correct 0 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 1 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 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 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 348 KB Output is correct
2 Correct 0 ms 420 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 432 KB Output is correct
8 Correct 0 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 1 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 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 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 344 KB Output is correct
20 Correct 0 ms 352 KB Output is correct
21 Correct 1 ms 700 KB Output is correct
22 Correct 1 ms 604 KB Output is correct
23 Correct 1 ms 604 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 604 KB Output is correct

Subtask #5
20.0 / 20.0

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

Subtask #6
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 444 KB Output is correct
2 Correct 1 ms 608 KB Output is correct
3 Correct 1 ms 608 KB Output is correct
4 Correct 1 ms 352 KB Output is correct
5 Correct 1 ms 608 KB Output is correct
6 Correct 1 ms 604 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 1 ms 608 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 1 ms 608 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 1 ms 612 KB Output is correct
13 Correct 1 ms 612 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 175 ms 16328 KB Output is correct
16 Correct 201 ms 16572 KB Output is correct
17 Correct 201 ms 17308 KB Output is correct
18 Correct 33 ms 9812 KB Output is correct
19 Correct 165 ms 17192 KB Output is correct
20 Correct 168 ms 18284 KB Output is correct
21 Correct 166 ms 18604 KB Output is correct
22 Correct 176 ms 15452 KB Output is correct
23 Correct 210 ms 17952 KB Output is correct
24 Correct 204 ms 17836 KB Output is correct
25 Correct 206 ms 17392 KB Output is correct
26 Correct 157 ms 18080 KB Output is correct
27 Correct 140 ms 16816 KB Output is correct
28 Correct 201 ms 17716 KB Output is correct
29 Correct 193 ms 17492 KB Output is correct
30 Correct 113 ms 17976 KB Output is correct
31 Correct 193 ms 17720 KB Output is correct
32 Correct 189 ms 17336 KB Output is correct
33 Correct 211 ms 18100 KB Output is correct
34 Correct 200 ms 18720 KB Output is correct
35 Correct 160 ms 16784 KB Output is correct
36 Correct 59 ms 15988 KB Output is correct
37 Correct 215 ms 19312 KB Output is correct
38 Correct 199 ms 14112 KB Output is correct
39 Correct 204 ms 13088 KB Output is correct