제출 #960508

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

shoes

#include "shoes.h"
#include <bits/stdc++.h>
#define ll long long

using namespace std;

#define all(v) v.begin(),v.end()
#define pb push_back

struct FWT{
	vector<int> bit;

	FWT(int n){
		bit.resize(n + 69);
	}

	int lsb(int i){
		return (-i) & i;
	}

	void modify(int i,int v){
		for(i++;i<bit.size();i += lsb(i))bit[i] += v;
	}

	int query(int i){
		int ans = 0;
		for(i++;i;i -= lsb(i))ans += bit[i];
		return ans;
	}
};

ll count_swaps(vector<int> A) {
	int n = A.size();

	map<int,vector<int> > ind;

	for(int i = 0;i<n;i++)ind[A[i]].pb(i);
	for(auto &u : ind)reverse(u.second.begin(), u.second.end());
	int o[n];
	memset(o, -1, sizeof o);
	for(int i = 0;i<n;i++){
		if(o[i] != -1)continue;
		if(A[i] < 0){
			o[i] = 2 * i + 1;
			o[ind[-A[i]].back()] = 2 * i + 2;
		}else{
			o[i] = 2 * i + 2;
			o[ind[-A[i]].back()] = 2 * i + 1;
		}
		ind[A[i]].pop_back();
		ind[-A[i]].pop_back();
	} 
	int ans = 0;

	FWT fwt(2 * n);

	for(int i = n-1;i>=0;i--){
		ans += fwt.query(o[i] - 1);
		fwt.modify(o[i], 1);
	}

	return ans;
}
  

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

shoes.cpp: In member function 'void FWT::modify(int, int)':
shoes.cpp:22:12: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   22 |   for(i++;i<bit.size();i += lsb(i))bit[i] += v;
      |           ~^~~~~~~~~~~

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