oj.uz

Submission #990049

# Submission time Handle Problem Language Result Execution time Memory
990049 2024-05-29T12:27:01 Z AdamGS Sorting (IOI15_sorting) C++17
74 / 100
 1000 ms 15048 KB 
#include "sorting.h"
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(a, b) for(int a = 0; a < (b); ++a)
#define st first
#define nd second
#define pb push_back
#define all(a) a.begin(), a.end()
const int LIM=2e5+7;
int F[LIM];
int fnd(int x) {
  if(F[x]==x) return x;
  return F[x]=fnd(F[x]);
}
bool uni(int a, int b) {
  if(fnd(a)==fnd(b)) return false;
  F[fnd(b)]=fnd(a);
  return true;
}
int findSwapPairs(int n, int S[], int m, int X[], int Y[], int P[], int Q[]) {
  int po=0, ko=m;
  while(po<ko) {
    int sr=(po+ko)/2;
    vector<int>T(n);
    rep(i, n) T[i]=S[i];
    rep(i, sr) swap(T[X[i]], T[Y[i]]);
    rep(i, n) F[i]=i;
    int p=0;
    rep(i, n) if(uni(i, T[i])) ++p;
    if(p<=sr) ko=sr; else po=sr+1;
  }
  m=po;
  vector<int>T(n);
  rep(i, n) T[i]=S[i];
  vector<int>C=T;
  rep(i, m) swap(T[X[i]], T[Y[i]]);
  int l=0;
  rep(i, m) {
    swap(C[X[i]], C[Y[i]]);
    while(l<n && T[l]==l) ++l;
    if(l==n) {
      P[i]=Q[i]=0;
      continue;
    }
    int a=-1, b=-1;
    rep(j, n) if(C[j]==T[l]) a=j;
    rep(j, n) if(C[j]==T[T[l]]) b=j;
    P[i]=a;
    Q[i]=b;
    swap(C[a], C[b]);
    swap(T[l], T[T[l]]);
  }
  return m;
}

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 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 344 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 348 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 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 344 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 348 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 0 ms 348 KB Output is correct
12 Correct 1 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 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 344 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 348 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 0 ms 348 KB Output is correct
12 Correct 1 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 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 1 ms 604 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 3 ms 348 KB Output is correct
2 Correct 5 ms 604 KB Output is correct
3 Correct 4 ms 604 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 712 KB Output is correct
7 Correct 3 ms 604 KB Output is correct
8 Correct 4 ms 600 KB Output is correct
9 Correct 4 ms 584 KB Output is correct
10 Correct 4 ms 600 KB Output is correct
11 Correct 4 ms 604 KB Output is correct
12 Correct 3 ms 604 KB Output is correct
13 Correct 4 ms 612 KB Output is correct
14 Correct 1 ms 456 KB Output is correct

Subtask #6
0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 348 KB Output is correct
2 Correct 5 ms 604 KB Output is correct
3 Correct 4 ms 604 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 712 KB Output is correct
7 Correct 3 ms 604 KB Output is correct
8 Correct 4 ms 600 KB Output is correct
9 Correct 4 ms 584 KB Output is correct
10 Correct 4 ms 600 KB Output is correct
11 Correct 4 ms 604 KB Output is correct
12 Correct 3 ms 604 KB Output is correct
13 Correct 4 ms 612 KB Output is correct
14 Correct 1 ms 456 KB Output is correct
15 Execution timed out 1056 ms 15048 KB Time limit exceeded
16 Halted 0 ms 0 KB -