제출 #895667

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
895667		ozner77	Arranging Shoes (IOI19_shoes)	C++17	10 / 100	16 ms	4792 KiB

shoes

#include "shoes.h"
#include <bits/stdc++.h>
#include <vector>
#include <iostream>
#include <string>
using namespace std;
long long count_swaps(std::vector<int> s) {
	int a,b,c,d,e=s.size(),xd=-1;
	bool fua=true;
	long long swaps=0;
	a=s[0];
	b=s[0];
	for(int k=0;k<e;k+=2){
        a=s[k];
        b=s[k];
	for(int i=k;i<e;i++){
        if(s[i]<0){
            while(true){
                xd++;
                if(s[i+xd]+s[i]==0){
                    fua=false;
                    break;
                }else if(i-xd==k){
                    break;
                }else if(s[i-xd]+s[i]==0 && i-xd>=k){
                    swaps++;
                    break;
            }
            }
        if(fua){
            swaps++;
            if(s[i]==s[k]){
                swaps-=1;
            }
            s[k]=s[i];
            s[i]=a;
            c=s[k+1];
            d=s[k+1];
            for(int j=k+1;j<e;j++){
                if(s[j]+s[k]==0){
                    s[k+1]=s[j];
                    s[j]=c;
                    break;
                }else if(i>=k+2){
                    d=s[j];
                    s[j]=c;
                    c=d;
                }
            }
        break;
        }
        }else if(i>=k+1){
            swaps++;
            b=s[i];
            s[i]=a;
            a=b;
        }
}
	}
    return swaps;
}

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