Submission #1315878

#TimeUsernameProblemLanguageResultExecution timeMemory
1315878raqin_shahrierArranging Shoes (IOI19_shoes)C++20
50 / 100
1095 ms1948 KiB
#include<bits/stdc++.h>
using namespace std;


int32_t count_swaps(vector<int>S){
    int n = S.size()/2;
    int ans = 0;
    for(int i = 0; i<2*n; i+=2){
      int x = -S[i];
      for(int j = i+1; j<2*n; j++){
        if(S[j] == x){
          for(int k = j; k>i+1; k--){
            swap(S[k],S[k-1]);
            ans++;
          }
          if(S[i] > 0){
            swap(S[i], S[i+1]);
            ans++;
          }
          break;
        }
      }
    }
    return ans;

}

// int32_t main(){
//   int n;
//   cin>>n;
//   vector<int>S(2*n);
//   for(int i = 0; i<2*n; i++){
//     cin>>S[i];
//   }
  
// }
#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...