제출 #599148

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
599148	2022-07-19 10:48:56	sofapuden	정렬하기 (IOI15_sorting)	C++14	100 / 100	581 ms	28860 KiB

sorting

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#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[]) {
  int l = 0, r = M, bes = M;
  while(l <= r){
    vector<int> seq(N);
    for(int i = 0; i < N; ++i)seq[i] = S[i];
    int m = (l+r)>>1;
    for(int i = 0; i < m; ++i)swap(seq[X[i]],seq[Y[i]]);
    int cn = 0;
    for(int i = 0; i < N; ++i){
      while(seq[i] != i){
        cn++;
        swap(seq[i],seq[seq[i]]);
      }
    }
    if(cn > m)l = m+1;
    else bes = m, r = m-1;
  }
  map<int,int> Ma;
  for(int i = 0; i < N; ++i)Ma[S[i]] = i;
  vector<int> seq(N);
  for(int i = 0; i < N; ++i)seq[i] = S[i];
  for(int i = 0; i < bes; ++i)swap(seq[X[i]],seq[Y[i]]);
  int cn = 0;
  for(int i = 0; i < N; ++i){
    while(seq[i] != i){
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 8 / 8
• Subtask 2: 12 / 12
• Subtask 3: 16 / 16
• Subtask 4: 18 / 18
• Subtask 5: 20 / 20
• Subtask 6: 26 / 26