Submission #474105

# Submission time Handle Problem Language Result Execution time Memory
474105 2021-09-16T22:13:32 Z ValiAntonie Arranging Shoes (IOI19_shoes) C++14
0 / 100
0 ms 204 KB
#include "shoes.h"
#include<bits/stdc++.h>
using namespace std;
long long count_swaps(vector<int> v){
int indice = 0;
int i = 0, nr = 0, numar = 0, j = 0, j2 = 0;
int n = v.size();
for(i=indice;i<=n;i++){
    if(v[i] < 0){
        indice++;
        numar = -v[i];
        for(j=i;j>indice;j--){
            swap(v[j],v[j-1]);
            nr++;
        }
        indice++;
        for(j2=1;j2<=n;j2++){
            if(v[j2] == numar){
           for(j=i;j>indice;j--){
             swap(v[j],v[j-1]);
             nr++;
            }
            }
        }
        i = indice;
    }
}
return nr;
}
# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Incorrect 0 ms 204 KB Output isn't correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Incorrect 0 ms 204 KB Output isn't correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Incorrect 0 ms 204 KB Output isn't correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Incorrect 0 ms 204 KB Output isn't correct
3 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Incorrect 0 ms 204 KB Output isn't correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Incorrect 0 ms 204 KB Output isn't correct