제출 #297908

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
297908		erd1	Arranging Shoes (IOI19_shoes)	C++14	100 / 100	928 ms	26872 KiB

shoes

#include "shoes.h"
#include<bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define pb push_back
#define all(x) (x).begin(), (x).end()
typedef int64_t lld;
typedef pair<int, int> pii;

#include<bits/extc++.h>
using namespace __gnu_pbds;
template<typename T, typename comp = greater<T>>
using OST = tree<T, null_type, comp, rb_tree_tag, tree_order_statistics_node_update>;

template<typename T1, typename T2>
ostream& operator<<(ostream& out, pair<T1, T2> p){
	return out << "(" << p.ff << ", " << p.ss << ")";
}

map<int, int> cnt;
map<pii, int> mp;

vector<int> bit;
void add(int i){
	i = bit.size()-i;
	do bit[i]++;
	while((i += i&-i) < bit.size());
}
int query(int i){
	i = bit.size()-i;
	int ans = 0;
	do ans += bit[i];
	while(i -= i&-i);
	return ans;
}

OST<int> ost;

long long count_swaps(vector<int> s) {
	lld ans = 0; int id = 0;
	for(auto i: s)if(mp[{-i, cnt[i]}])mp[{i, cnt[i]}] = mp[{-i, cnt[i]}], cnt[i]++; else mp[{i, cnt[i]++}] = ++id;
	cnt.clear(), id = 0; bit.resize(2*s.size()+4);
	for(auto i: s)id = (i > 0?mp[{-i, cnt[i]++}]*2+1:mp[{i, cnt[i]++}]*2), ans += query(id), add(id);
	return ans;
}

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

shoes.cpp: In function 'void add(int)':
shoes.cpp:28:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   28 |  while((i += i&-i) < bit.size());
      |        ~~~~~~~~~~~~^~~~~~~~~~~~

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