Submission #1253743

#	Time	Username	Problem	Language	Result	Execution time	Memory
1253743		andrewtheodore	Arranging Shoes (IOI19_shoes)	C++20	10 / 100	3 ms	4936 KiB

shoes

#include "shoes.h"

#ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>

#if __cplusplus >= 201103L
#include <ccomplex>
#include <cfenv>
#include <cinttypes>
#include <cstdbool>
#include <cstdint>
#include <ctgmath>
#include <cwchar>
#include <cwctype>
#endif

// C++
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>

#if __cplusplus >= 201103L
#include <array>
#include <atomic>
#include <chrono>
#include <condition_variable>
#include <forward_list>
#include <future>
#include <initializer_list>
#include <mutex>
#include <random>
#include <ratio>
#include <regex>
#include <scoped_allocator>
#include <system_error>
#include <thread>
#include <tuple>
#include <typeindex>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#endif
using namespace std;

long long count_swaps(std::vector<int> s) {

    int n = s.size();

    vector<int>nyak[200000 + 5];

    for(int i = 0; i < n; i++){
        nyak[s[i] + n / 2].push_back(i);
    }

    long long ans = 0;

    for(int i = 0; i < n / 2; i++){
        for(int j = 0; j < nyak[i].size(); j++){
            int cur = nyak[i][j];

            int nex = -(i - n / 2) + n / 2;
            int pos_nex = nyak[nex][j];


            if(cur < pos_nex){
                ans += (long long)pos_nex - cur - 1;
            }else{
                ans += (long long)cur - pos_nex;
            }
        }
    }

    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