제출 #826733

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
826733		kevinsogo	Arranging Shoes (IOI19_shoes)	C++17	50 / 100	287 ms	32472 KiB

shoes

#include <bits/stdc++.h>
using namespace std;
#include "shoes.h"
using ll = long long;

struct Fen {
	vector<int> c;
	Fen(int n): c(n + 1) {}
	void inc(int i, int v = 1) {
		for (++i; i < c.size(); i += i & -i) c[i] += v;
	}
	int sum(int i, int v = 0) {
		for (; i; i -= i & -i) v += c[i];
		return v;
	}
};

ll count_swaps(vector<int> _seq) {
    unordered_map<ll,int> found;
    vector<ll> seq, aseq;
    for (int v : _seq) seq.push_back(ll(v) * _seq.size() + ((v > 0) - (v < 0)) * found[v]++);
    unordered_map<ll,int> pos;
    for (int i = 0; i < seq.size(); i++) pos[seq[i]] = i;
    for (ll v : seq) if (v > 0) aseq.push_back(v);
    sort(aseq.begin(), aseq.end(), [&](int i, int j) {
        int d = min(pos[i], pos[-i]) - min(pos[j], pos[-j]);
        return d ? d < 0 : i < j;
    });
    vector<int> targ;
    for (int v : aseq) for (int s : {-1, +1}) targ.push_back(_seq.size() - 1 - pos[s * v]);
    ll ans = 0;
	Fen f(targ.size());
    for (int j = 0; j < targ.size(); j++) {
    	ans += f.sum(targ[j]);
    	f.inc(targ[j]);
    }
    return ans;
}

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

shoes.cpp: In member function 'void Fen::inc(int, int)':
shoes.cpp:10:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   10 |   for (++i; i < c.size(); i += i & -i) c[i] += v;
      |             ~~^~~~~~~~~~
shoes.cpp: In function 'll count_swaps(std::vector<int>)':
shoes.cpp:23:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   23 |     for (int i = 0; i < seq.size(); i++) pos[seq[i]] = i;
      |                     ~~^~~~~~~~~~~~
shoes.cpp:33:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   33 |     for (int j = 0; j < targ.size(); j++) {
      |                     ~~^~~~~~~~~~~~~

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