제출 #886954

#제출 시각아이디문제언어결과실행 시간메모리
886954artixkrishnaArranging Shoes (IOI19_shoes)C++14
0 / 100
1070 ms348 KiB
#include "shoes.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
#define REP(i,a,b) for(int i=a; i<b; i++)

ll count_swaps(vector<int> a){
        ll swaps=0;
        bool correct=false;
        while(!correct){
                ll d=0; ll  e=1;
                for(ll i=1; i<(int)a.size()/2; i++){
                        if(a[d]== -a[e]){
                                correct=true; d+=1; e+=1;continue;
                        }else{
                        correct=false;
                        ll b=a[e];
                        ll c=a[d];
                        a[e]=c;
                        a[d]=b;d+=2;e+=2;
                        swaps+=1;
                        }
                }
        }
        return swaps;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...