제출 #1292363

#제출 시각아이디문제언어결과실행 시간메모리
1292363MMihalevArranging Shoes (IOI19_shoes)C++20
0 / 100
1 ms336 KiB
#include<iostream>
#include<vector>
#include<queue>
#include<set>
#include "shoes.h"
using namespace std;
const int MAX_N=1e5+5;
deque<int>pos[2];
long long count_swaps(std::vector<int> s)
{
    for(int i=0;i<s.size();i++)
    {
        if(s[i]<0)pos[0].push_back(i);
        else pos[1].push_back(i);
    }

    long long ans=0;
    for(int i=0;i<s.size();i++)
    {
        int wh=i%2;
        ans+=pos[wh].front();
        pos[wh].pop_front();
    }
    return ans;
}
#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...