제출 #868120

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
868120	2023-10-30 12:59:47	waldi	정렬하기 (IOI15_sorting)	C++17	74 / 100	1090 ms	20372 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>
#define FOR(i,p,k) for(int i=(p);i<=(k);++i)
#define REP(i,n) FOR(i,0,(n)-1)
#define debug(a) cerr << #a << ": " << a << "\n";
#define fi first
#define se second
#define ssize(x) (int(x.size()))
#define all(x) x.begin(),x.end()
using namespace std;
typedef pair<int, int> pii;
int findSwapPairs(int n, int s[], int m, int x[], int y[], int p[], int q[]){
  auto sprawdz = [&](int wyn){
    vector<int> co_winno(n), gdzie_winno(n);
    REP(i, n) co_winno[i] = gdzie_winno[i] = i;
    for(int i = wyn; ~--i;){
      int a = x[i], b = y[i];
      swap(co_winno[a], co_winno[b]);
      swap(gdzie_winno[co_winno[a]], gdzie_winno[co_winno[b]]);
    }
    
    vector<int> co_jest(n), gdzie_jest(n);
    REP(i, n) co_jest[i] = s[i], gdzie_jest[s[i]] = i;
    
    vector<int> graf(n);// [wartosc teraz] = wartosc na koncu
    REP(i, n) graf[i] = co_winno[gdzie_jest[i]];
    
    vector<bool> odw(n, 0);
    vector<pii> zmiany_wart;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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