# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1004689 | zh_h | Arranging Shoes (IOI19_shoes) | C++17 | 1 ms | 348 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define lint long long int
#define pb push_back
using namespace std;
lint count_swaps(vector<int> s){
vector<pair<int, int>> v;
for(int i = 0; i < s.size(); i ++){
if(s[i] < 0){v.pb({s[i], -i});}
else{v.pb({s[i], i});}
// if(s[i] > s[i-1]){
// if(s[i]+s[i-1] == 0){
// v.erase(v.begin()+i-1);
// v.erase(v.begin()+i);
// }
// }
}
lint ans = 0;
sort(v.begin(), v.end());
// for(auto i : v){cout << i.first << " " << i.second << endl;}
//* 0 1 2 3 4 5 6 7 8 9
for(int i = 0; i < s.size()/2; i ++){
// cout << ans;
int temp = v[(s.size()/2)+i].second + v[(s.size()/2)-1-i].second;
if(temp > 0){
ans += temp-1;
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |