제출 #431655

#제출 시각아이디문제언어결과실행 시간메모리
431655LouayFarahArranging Shoes (IOI19_shoes)C++14
10 / 100
26 ms2240 KiB
#include "bits/stdc++.h"
#include "shoes.h"
using namespace std;
 
#define ll long long
 
ll count_swaps(vector<int> s)
{
    int n = (int)s.size()/2;

    int i = 0;
    ll res = 0;
    queue<int> q;
    while(i<2*n)
    {
        if(s[i]>0&&s[i+1]<0)
        {
            res++;
            swap(s[i], s[i+1]);
        }
        else if(s[i]<0&&s[i+1]<0)
        {
            q.push(-1);
        }
        else if(s[i]>0&&s[i+1]>0)
        {
            q.push(1);
        }
        i+=2;
    }

    int cnt = 0;
    while(!q.empty())
    {
        int x = q.front();
        q.pop();
        if(x==1)
        {
            cnt++;
            if(cnt>0)
                res+=2;
        }
        else
        {
            cnt--;
            if(cnt<0)
                res+=1;
        }
    }

    return res;
}
#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...