제출 #295026

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
295026		SamAnd	Arranging Shoes (IOI19_shoes)	C++17	10 / 100	7 ms	9728 KiB

shoes

#include "shoes.h"
#include <bits/stdc++.h>
using namespace std;
#define m_p make_pair
#define fi first
#define se second
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
typedef long long ll;
const int N = 200005;

int n;
int a[N];
vector<int> l[N], r[N];

long long count_swaps(std::vector<int> s)
{
    n = sz(s) / 2;
    for (int i = 1; i <= n * 2; ++i)
        a[i] = s[i - 1];

    for (int i = 1; i <= n * 2; ++i)
    {
        if (a[i] < 0)
            l[-a[i]].push_back(i);
        else
            r[a[i]].push_back(i);
    }
	ll ans = 0;
	for (int i = 1; i <= n; ++i)
    {
        for (int j = 0; j < sz(l[i]); ++j)
        {
            if (l[i][j] < r[i][j])
                ans += r[i][j] - l[i][j] - 1;
            else
                ans += l[i][j] - r[i][j];
        }
    }
    return ans;
}

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