# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
474109 | 2021-09-16T22:19:17 Z | ValiAntonie | Arranging Shoes (IOI19_shoes) | C++14 | 1 ms | 588 KB |
#include "shoes.h" #include<bits/stdc++.h> using namespace std; long long count_swaps(vector<int> v){ int indice = -1; int v2[100001]; int i = 0, nr = 0, numar = 0, j = 0, j2 = 0, nr2; int n = v.size(); for(i=0;i<n;i++) v2[i] = v[i]; for(i=0;i<n;i++){ if(v2[i] > 0 && v2[i+1] < 0){ swap(v2[i],v2[i+1]); nr2++; } } for(i=0;i<n;i++){ if(v2[i] != -v2[i+1] && v2[i+1] != -v2[i+2] && v2[i] > 0){ swap(v2[i],v2[i+1]); nr2++; } } 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 min(nr,nr2); }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 588 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 588 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 588 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 588 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 588 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 588 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |