제출 #466347

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
466347		NintsiChkhaidze	Arranging Shoes (IOI19_shoes)	C++14	10 / 100	4 ms	5000 KiB

shoes

#include "shoes.h"
#include <iostream>
#include <vector>
#include <algorithm>
#include <math.h>
#define pb push_back
using namespace std;

const int N = 100005;
vector <int> lf[N],rg[N];
bool f[N];
pair<int,pair<int,int> > d[N];

long long count_swaps(vector <int> a) {
    for (int i = 0; i < a.size(); i++){
        if (a[i] < 0) lf[-a[i]].pb(i);
        else rg[a[i]].pb(i);
    }

    int cnt = 0;

    for (int i = 0; i < a.size(); i++){
        if (f[i]) continue;

        if (a[i] < 0){
            int ind = rg[-a[i]][0];
            f[ind] = 1;

            rg[-a[i]].erase(rg[-a[i]].begin());
            d[++cnt] = {abs(ind - i),{i,ind}};

            lf[-a[i]].erase(lf[-a[i]].begin());
        }
        else{
            int ind = lf[a[i]][0];
            f[ind] = 1;

            lf[a[i]].erase(lf[a[i]].begin());
            d[++cnt] = {abs(ind - i),{ind,i}};

            rg[a[i]].erase(rg[a[i]].begin());
        }
    }

    sort(d + 1,d + cnt + 1);

    int ans=0;
    for (int i = 1; i <= cnt; i++){
        int l = d[i].second.first,r = d[i].second.second;
        if (l > r) swap(l,r);
        ans += r - l - 1;
        if (a[l] > 0 && a[r] < 0) ans++;
    }
    return ans;
}

컴파일 시 표준 에러 (stderr) 메시지

shoes.cpp: In function 'long long int count_swaps(std::vector<int>)':
shoes.cpp:15:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   15 |     for (int i = 0; i < a.size(); i++){
      |                     ~~^~~~~~~~~~
shoes.cpp:22:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   22 |     for (int i = 0; i < a.size(); i++){
      |                     ~~^~~~~~~~~~

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