Submission #1070009

#	Time	Username	Problem	Language	Result	Execution time	Memory
1070009		j_vdd16	Arranging Shoes (IOI19_shoes)	C++17	50 / 100	1100 ms	2016 KiB

shoes

#include "shoes.h"

#include <algorithm>
#include <bitset>
#include <cstdint>
#include <cstring>
#include <iostream>
#include <limits.h>
#include <math.h>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>

//#define int long long
#define loop(X, N) for(int X = 0; X < (N); X++)
#define all(V) V.begin(), V.end()
#define rall(V) V.rbegin(), V.rend()

using namespace std;

typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef vector<vector<ii>> vvii;
typedef vector<bool> vb;
typedef vector<vector<bool>> vvb;

long long count_swaps(std::vector<int> s) {
    int n = s.size();

    int result = 0;
    vb isUsed(n, false);
    for (int i = 0; i < n; i++) {
        if (isUsed[i]) continue;

        int v = s[i];
        int count = 0;
        for (int j = i + 1; j < n; j++) {
            if (s[j] == -v && !isUsed[j]) {
                isUsed[j] = true;
                break;
            }

            count += !isUsed[j];
        }

        if (v < 0) {
            result += count;
        }
        else {
            result += count + 1;
        }
        isUsed[i] = true;
    }

	return result;
}

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