제출 #465358

#제출 시각아이디문제언어결과실행 시간메모리
465358aris12345678Arranging Shoes (IOI19_shoes)C++14
0 / 100
1 ms204 KiB
#include "shoes.h"
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;

const int mxN = 100005;

ll count_swaps(vector<int> s) {
    int n = int(s.size());
    if(n == 1) {
        if(s[0] > 0)
            return 1;
        return 0;
    } else {
        vector<int> neg, pos;
        for(int i = 0; i < 2*n; i++) {
            if(s[i] < 0)
                neg.push_back(i);
            else
                pos.push_back(i);
        }
        ll ans = 0;
        for(int i = 0; i < n; i++)
            ans += abs(neg[i]-pos[i]-1);
        return ans;
    }
    assert(true);
}
#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...