Submission #600016

#TimeUsernameProblemLanguageResultExecution timeMemory
600016PiejanVDCSorting (IOI15_sorting)C++17
0 / 100
1093 ms424 KiB
#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[]) { auto sorted = [&] () -> bool { for(int i = 0 ; i < n ; i++) if(s[i] != i) return 0; return 1; }; for(int T = 1 ; T <= m ; T++) { vector<int>c(n); for(int i = 0 ; i < n ; i++) c[i]= i; for(int i = 0 ; i < T ; i++) swap(c[X[i]], c[Y[i]]); vector<int>go(n); for(int i = 0 ; i < n ; i++) { go[c[i]] = i; } vector<int>v(n); auto S = [&] (int W) { for(int i = 0 ; i < n ; i++) if(v[i] == W) return i; assert(0); }; for(int i = 0 ; i < n ; i++) v[i] = s[i]; int cnt = 0; for(int i = 0 ; i < T ; i++) { if(sorted()) return cnt; cnt++; swap(v[X[i]], v[Y[i]]); swap(go[X[i]], go[Y[i]]); for(int j = 0 ; j < n ; j++) { if(go[j] != v[j]) { int p = S(go[j]); P[cnt] = p; Q[cnt] = i; swap(v[p], v[j]); break; } } // do the swappings // look for first element not correct in go } if(sorted()) return cnt; } }

Compilation message (stderr)

sorting.cpp: In function 'int findSwapPairs(int, int*, int, int*, int*, int*, int*)':
sorting.cpp:51:1: warning: control reaches end of non-void function [-Wreturn-type]
   51 | }
      | ^
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...