제출 #523835

#제출 시각아이디문제언어결과실행 시간메모리
523835pakhomoveeArranging Shoes (IOI19_shoes)C++17
50 / 100
1092 ms3100 KiB
#include "shoes.h"
#include <cmath>

using namespace std;

long long count_swaps(std::vector<int> s) {
    const int n = s.size();
    long long ans = 0;
    for (int i = 0; i < n; i += 2) {
        int j;
        for (j = i + 1; abs(s[j]) != abs(s[i]) || s[i] * s[j] > 0; ++j) {
            if (s[j] != 0) {
                ++ans;
            }
        }
        for (int q = j; q > i + 1; --q) {
            swap(s[q], s[q - 1]);
        }
        if (s[i] > 0) {
            ++ans;
        }
    }
    return ans;
}
#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...