제출 #201415

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
201415		khulegub	Arranging Shoes (IOI19_shoes)	C++14	0 / 100	14 ms	9976 KiB

shoes

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

#define mp make_pair
#define pb push_back
#define xx first
#define yy second
#define ll(x) (x*2) + 1
#define rr(x) (x*2) + 2

using namespace std;

typedef long long i64;

vector<int> ft;

int query(int x){
	int sm = 0;
	while (x){
		sm += ft[x];
		x -= x & (-x);
	}
	return sm;
}
int query(int l, int r){
	int ll = 0;
	if (l != 0) ll = query(l - 1);
	return query(r) - ll;
}
int update(int x, int v){
	while (x){
		ft[x] += v;
		x += x & (-x);
	}
}

i64 count_swaps(std::vector<int> s) {

	i64 ans = 0LL;
	int n = s.size();

	ft.resize(n);

	vector<int> maap_l[100005], maap_r[100005];


	for (int i = n - 1; i >= 0; i--){
		if (s[i] < 0) maap_l[s[i] * -1].pb(i);
		else maap_r[s[i]].pb(i);
	}

	vector<bool> taken(n, 0);

	for (int i = 0; i < n; i++){
		int tmp;
		if (!taken[i]){
			if (s[i] < 0){
				maap_r[s[i]].pop_back();
				tmp = maap_r[s[i]].back();
			}
			else{
				maap_l[s[i]].pop_back();
				tmp = maap_l[s[i]].back();
			}

			taken[tmp] = 1;

			if (s[i] < 0){
				ans += tmp - i - 1;
			}
			else{
				ans += tmp - i;
			}

			ans -= query(i, tmp);
			update(tmp, 1);
		}
	}

	return ans;
}

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

shoes.cpp: In function 'int update(int, int)':
shoes.cpp:35:1: warning: no return statement in function returning non-void [-Wreturn-type]
 }
 ^
shoes.cpp: In function 'i64 count_swaps(std::vector<int>)':
shoes.cpp:58:26: warning: array subscript is below array bounds [-Warray-bounds]
     maap_r[s[i]].pop_back();
     ~~~~~~~~~~~~~~~~~~~~~^~

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