제출 #1069959

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1069959		kiethm07	Arranging Shoes (IOI19_shoes)	C++14	10 / 100	1090 ms	3264 KiB

shoes

#include <bits/stdc++.h>

#define pii pair<int,int>
#define iii pair<int,pii>
#define fi first
#define se second

#define vi vector<int>
#define vii vector<pii>
#define pb(i) push_back(i)
#define all(x) x.begin(),x.end()

#define TEXT "a"

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;

const int inf = 1e9 + 7;
const ld eps = 1e-8;
const double pi = acos(-1);

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

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