Submission #590883

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
590883	2022-07-06 12:45:18	FatihSolak	Sorting (IOI15_sorting)	C++17	100 / 100	496 ms	20600 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;
bool ck(int n,int s[],int m,int x[],int y[]){
  if(is_sorted(s,s+n))
    return 1;
  vector<int> fnal;
  vector<int> now;
  vector<int> pfnal(n,0);
  vector<int> pnow(n,0);
  int cnt = 0;
  for(int i = 0;i<n;i++){
    fnal.push_back(s[i]);
    pfnal[s[i]] = i;
    now.push_back(s[i]);
    pnow[s[i]] = i;
    cnt += (s[i] == i);
  }
  for(int i = 0;i<m;i++){
    swap(pfnal[fnal[x[i]]],pfnal[fnal[y[i]]]);
    swap(fnal[x[i]],fnal[y[i]]);
  }
  int num = 0;
  for(int i = 0;i<m;i++){
    if(pnow[now[x[i]]] == now[x[i]])cnt--;
    if(pnow[now[y[i]]] == now[y[i]])cnt--;
    swap(now[x[i]],now[y[i]]);
    swap(pnow[now[x[i]]],pnow[now[y[i]]]);
    if(pnow[now[x[i]]] == now[x[i]])cnt++;
    if(pnow[now[y[i]]] == now[y[i]])cnt++;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
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