Submission #1315877

#TimeUsernameProblemLanguageResultExecution timeMemory
1315877raqin_shahrierArranging Shoes (IOI19_shoes)C++20
0 / 100
0 ms332 KiB
#include<bits/stdc++.h> using namespace std; int32_t count_swaps(vector<int>S){ int n = S.size()/2; vector<int>s(2*n); for(int i = 0; i<2*n; i++){ cin>>s[i]; } 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...