제출 #299678

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
299678		aZvezda	Arranging Shoes (IOI19_shoes)	C++14	컴파일 에러	0 ms	0 KiB

shoes

#include "shoes.h"
#include <bits/stdc++.h>
using namespace std;
//#pragma GCC optimize ("O3")
//#pragma GCC target ("sse4")
#define endl "\n"
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
template<class T, class T2> inline bool chkmax(T &x, const T2 &y) { return x < y ? x = y, 1 : 0; }
template<class T, class T2> inline bool chkmin(T &x, const T2 &y) { return x > y ? x = y, 1 : 0; }
const ll mod = 1e9 + 7;
template<class T> inline void fix(T &x) {if(x >= mod | x <= -mod) {x %= mod;} if(x < 0) {x += mod;}}
#define out(x) cout << __LINE__ << ": " << (#x) << " = " << (x) << endl
  
const int MAX_N = 5e5 + 10;
int tree[4 * MAX_N], lazy[4 * MAX_N];

void upd(int curr, int l, int r, int ind, int val) {
	if(ind < l || r < ind) {
		return;
	} else if(l <= ind && ind <= r) {
		tree[curr] += val;
		return;
	} 
	int m = (l + r) / 2ll;
	upd(curr * 2, l, m, ind, val);
	upd(curr * 2 + 1, m + 1, r, ind, val);
	tree[curr] = tree[curr * 2] + tree[curr * 2 + 1];
}

int sum(int curr, int l, int r, int ql, int qr) {
	if(ql <= l && r <= qr) {
		return tree[curr];
	} else if(l > qr || r < ql) {
		return 0;
	}
	int m = (l + r) / 2ll;
	return sum(curr * 2, l, m, ql, qr) + sum(curr * 2 + 1, m + 1, r, ql, qr);
}

map<int, vector<int> > mp;
bool got[MAX_N];

int count_swaps(vector<int> arr) {
	for(int i = 0; i < arr.size(); i ++) {
		mp[arr[i]].push_back(i);
	}
	for(auto &it : mp) {
		reverse(it.second.begin(), it.second.end());
	}
	int ret = 0;
	for(int i = 0; i < arr.size(); i ++) {
		if(got[i]) {continue;}
		if(arr[i] > 0) {ret ++;}
		got[i] = true;
		got[mp[-arr[i]].back()] = true;
		ret += (mp[-arr[i]].back() - i - 1) - sum(1, 0, MAX_N - 1, i, mp[-arr[i]].back());
		upd(1, 0, MAX_N - 1, mp[-arr[i]].back(), 1);
		mp[arr[i]].pop_back();
		mp[-arr[i]].pop_back();
	}
	return ret;
}
/*
signed main() {
    //ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
    int n;
    cin >> n;
    vector<int> arr;
    arr.resize(n);
    for(int i = 0; i < n; i ++) {
    	cin >> arr[i];
    }
    cout << shoes(arr);
    return 0;
}*/

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

shoes.cpp:45:5: error: ambiguating new declaration of 'int count_swaps(std::vector<int>)'
   45 | int count_swaps(vector<int> arr) {
      |     ^~~~~~~~~~~
In file included from shoes.cpp:1:
shoes.h:7:11: note: old declaration 'long long int count_swaps(std::vector<int>)'
    7 | long long count_swaps(std::vector<int> S);
      |           ^~~~~~~~~~~
shoes.cpp: In function 'int count_swaps(std::vector<int>)':
shoes.cpp:46:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   46 |  for(int i = 0; i < arr.size(); i ++) {
      |                 ~~^~~~~~~~~~~~
shoes.cpp:53:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   53 |  for(int i = 0; i < arr.size(); i ++) {
      |                 ~~^~~~~~~~~~~~