Submission #670531

#	Time	Username	Problem	Language	Result	Execution time	Memory
670531		birthdaycake	Arranging Shoes (IOI19_shoes)	C++17	10 / 100	40 ms	3544 KiB

shoes

#include<bits/stdc++.h>
#include "shoes.h"
using namespace std;

int vs[1001];
long long count_swaps(vector<int>s) {
    long long n = s.size(); long long ans = 0;
    for(int i = 0; i < n; i++){
        int f = 0;
        for(int j = 0; j < i; j++){
            if(!vs[j] && s[i] == -s[j]){
                f = j + 1;
                break;
            }
        }
        if(f && s[i] > 0){
            f--;
            vs[f] = 1;
            if(s[f] < 0) ans += (i - f - 1);
            else ans += (i - f);
            int y = s[i];
            for(int j = i - 1; j > f; j--){
                s[j + 1] = s[j];
            }
            vs[f + 1] = 1;
            s[f + 1] = y;
            if(s[f] > 0) swap(s[f], s[f + 1]);
        }
        
    }
    for(int i = 0; i < n; i++){
        int f = 0;
        for(int j = 0; j < i; j++){
            if(!vs[j] && s[i] == -s[j]){
                f = j + 1;
                break;
            }
        }
        if(f && s[i] < 0){
            f--;
            vs[f] = 1;
            if(s[f] < 0) ans += (i - f - 1);
            else ans += (i - f);
            int y = s[i];
            for(int j = i - 1; j > f; j--){
                s[j + 1] = s[j];
            }
            vs[f + 1] = 1;
            s[f + 1] = y;
            if(s[f] > 0) swap(s[f], s[f + 1]);
        }
        
    }
    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