Submission #575406

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
575406	2022-06-10 10:22:19	web	Arranging Shoes (IOI19_shoes)	C++17	50 / 100	1079 ms	4660 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 <iostream>
#include <vector>
#include <tuple>
#include <algorithm>
using namespace std;
long long count_swaps(std::vector<int> s) {
   int n  = s.size()/2;
    vector<pair<int, bool>>shoes(2*n);
    for(int i  =0 ; i<2*n; ++i)
    {
      
        shoes[i] = {abs(s[i]), s[i] < 0};
    }
    long long numSwaps = 0;
    //sort(shoes.begin(), shoes.end());
    int currShoe = 0;
    while(currShoe < 2*n)
    {
        int findShoe = shoes[currShoe].first;
        int findShoeSign = !(shoes[currShoe].second);
        pair<int, bool> lastEl = {findShoe, findShoeSign};
        for(int i = 1; i<(2*n-currShoe); ++i)
        {
            
            swap(lastEl, shoes[currShoe+ i]);
            
            if(lastEl.first == findShoe && lastEl.second == findShoeSign)
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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