Submission #243091

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
243091	2020-06-30 09:53:43	idtj	Arranging Shoes (IOI19_shoes)	C++14	10 / 100	5 ms	384 KiB

shoes

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include "shoes.h"
#include <deque>
#include <cmath>
using namespace std; 
long long count_swaps(vector<int> S) {
    int n = S.size() / 2;
    vector<deque<pair<int, int>>> a(n + 1); // pos / is_left
    vector<pair<int, int>> in(n * 2); // size / is_left
 
    for (int i = 0; i < n * 2; ++i) {
        int now = S[i];
        if (now < 0) {
            in[i].second = 1;
            now = -now;
        }
        in[i].first = now;
    }
 
    long long ans = 0;
 
    for (int i = 0; i < n * 2; ++i) {
        auto &t = a[abs(in[i].first)];
        if (t.empty() || t.front().second == in[i].second) {
            t.push_back(make_pair(i, in[i].second));
        }
        else {
            if (t.front().second) {
                ans += i - t.front().first - 1;
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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