Submission #898650

#TimeUsernameProblemLanguageResultExecution timeMemory
898650ozner77Arranging Shoes (IOI19_shoes)C++17
50 / 100
1070 ms3256 KiB
#include "shoes.h"
#include <bits/stdc++.h>
#include <vector>
#include <iostream>
#include <string>
using namespace std;
long long count_swaps(std::vector<int> s) {
	int c,d,e=s.size();
    long long swaps=0;
	for(int i=0;i<e;i+=2){
                c=s[i+1];
                if(s[i]>0){
                    swaps++;
                }
                for(int k=i+1;k<e;k++){
                    if(s[k]+s[i]==0){
                        swaps+=(k-(i+1));
                        s[i+1]=s[k];
                        s[k]=c;
                        break;
                    }else{
                        d=s[k];
                        s[k]=c;
                        c=d;
                    }
                }
            }
    return swaps;
}
#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...