제출 #154035

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
154035		losmi247	Arranging Shoes (IOI19_shoes)	C++14	50 / 100	1073 ms	3960 KiB

shoes

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 2e5+45;

int n,a[N];

ll count_swaps(vector <int> S){
    n = S.size();
    for(int i = 1; i <= n; i++){
        a[i] = S[i-1];
    }
    ll sol = 0;
    for(int i = 1; i <= n; i += 2){
        int poz = 0;
        for(int j = i+1; j <= n; j++){
            if(a[j] == -a[i]){
                poz = j;
                break;
            }
        }
        for(int j = poz; j > i+1; j--){
            sol++;
            swap(a[j],a[j-1]);
        }
        if(a[i] > 0 && a[i+1] < 0){
            swap(a[i],a[i+1]);
            sol++;
        }
    }
    return sol;
}

/*int main(){
    vector <int> s;
    int x;
    cin >> x;
    while(x--){
        int y;
        cin >> y;
        s.push_back(y);
    }
    cout << count_swaps(s) << endl;
}*/

• Subtask 1: 10 / 10
• Subtask 2: 20 / 20
• Subtask 3: 0 / 20
• Subtask 4: 0 / 15
• Subtask 5: 20 / 20
• Subtask 6: 0 / 15