제출 #590919

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
590919		someone	Arranging Shoes (IOI19_shoes)	C++14	100 / 100	305 ms	358600 KiB

shoes

#include "shoes.h"
#include <bits/stdc++.h>
using namespace std;
 
const int M = 1 << 18, N = M << 1;
 
bool b[N];
int val[N];
deque<int> pos[N];
 
int update(int i, int add) {
    i += M;
    int ans = 0;
    while(i > 0) {
        val[i] += add;
        if(i % 2 == 0)
            ans += val[i+1];
        i >>= 1;
    }
    return ans;
}
 
long long count_swaps(std::vector<int> s) {
    long long sum = 0;
    int n = (int)s.size();
    for(int i = 0; i < n; i++)
        pos[s[i] + M].push_back(i);
    for(int i = 0; i < n; i++) {
        if(!b[i]) {
            while(b[pos[M-s[i]][0]]) {
                cout << pos[M-s[i]][0] << '\n';
                pos[M-s[i]].pop_front();
            }
            int position1 = i + update(i, 0),
                position2 = pos[M-s[i]][0] + update(pos[M-s[i]][0], 1);
            sum += position2 - position1;
            if(s[i] < 0)
                sum--;
 
            b[pos[M-s[i]][0]] = true;
            pos[M+s[i]].pop_front();
            pos[M-s[i]].pop_front();
        }
    }
    return sum;
}

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