Submission #1219902

#TimeUsernameProblemLanguageResultExecution timeMemory
1219902islam_2010Arranging Shoes (IOI19_shoes)C++20
0 / 100
0 ms328 KiB
// #include "shoes.h" 
#include <bits/stdc++.h>
using namespace std;

long long count_swaps(vector<int> s){
    int n = s.size();
    vector<pair<int, int>> v;
    int c = 0;
    for(int i = 0; i < n/2; i++){
        for(int j = n/2 ; j < n; j++){
            if(abs(s[i])==abs(s[j])){
                c += (j-i-1);
                break;
            }
        } 
    }return c;
}
#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...