제출 #1021742

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1021742		mindiyak	Arranging Shoes (IOI19_shoes)	C++14	10 / 100	79 ms	138176 KiB

shoes

#include "shoes.h"

#include <bits/stdc++.h>
#include <string>
#include <iostream>
#include <cmath>
#include <numeric>
#include <queue>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pi;
typedef pair<int, int> pl;
typedef pair<ld, ld> pd;
typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<vector<int>> vvi;
typedef vector<ld> vd;
typedef vector<long> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
#define FOR(i, a, b) for (int i = a; i < (b); i++)
#define F0R(i, a) for (int i = 0; i < (a); i++)
#define FORd(i, a, b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i, a) for (int i = (a)-1; i >= 0; i--)
#define trav(a, x) for (auto &a : x)
#define uid(a, b) uniform_int_distribution<int>(a, b)(rng)
#define len(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define fst first
#define nl endl
#define sec second
#define lb lower_bound
#define ub upper_bound
#define aint(x) x.begin(), x.end()
#define raint(x) x.rbegin(), x.rend()
#define ins insert
const int MOD = 1000000007;
using namespace std;

vl num_swaps(4e5+8,0);

ll get_swaps(int pos,int l,int r,int index){
	if(index == l && l == r)
		return num_swaps[pos];
	int mid = (l+r)/2;
	if(index <= mid){
		return get_swaps(2*pos+1,l,mid,index);
	}else{
		return get_swaps(2*pos+2,mid+1,r,index);
	}
}

void update_swaps(int pos,int l,int r,int index){
	num_swaps[pos] += 1;
	if(index == l && l == r){
		return;
	}	
	int mid = (l+r)/2;
	if(index <= mid){
		update_swaps(2*pos+1,l,mid,index);
	}else{
		update_swaps(2*pos+2,mid+1,r,index);
	}
}


long long count_swaps(vector<int> s) {
	vector<deque<ll>> shoes(2e5+5);
	ll ans = 0;
	ll n = s.size();
	
	FOR(i,0,s.size()){
		if(shoes[s[i]+1e5+1].size() > 0){
			if(s[i]>0)ans--;
			// cout << (s[i]>0) << " " << i << " " << shoes[s[i]+1e5+1][0]  << " " << get_swaps(0,0,n-1,shoes[s[i]+1e5+1][0]) << " " << get_swaps(0,0,n-1,i) << endl;
			ans += i-shoes[s[i]+1e5+1][0]+get_swaps(0,0,n-1,shoes[s[i]+1e5+1][0])-get_swaps(0,0,n-1,i);
			update_swaps(0,0,n-1,i);
			update_swaps(0,0,n-1,shoes[s[i]+1e5+1][0]);
			shoes[s[i]+1e5+1].pop_front();

		}else{
			shoes[-s[i]+1e5+1].pb(i);
		}
	}
	return ans;
}

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

shoes.cpp: In function 'long long int count_swaps(std::vector<int>)':
shoes.cpp:23:40: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   23 | #define FOR(i, a, b) for (int i = a; i < (b); i++)
      |                                        ^
shoes.cpp:75:2: note: in expansion of macro 'FOR'
   75 |  FOR(i,0,s.size()){
      |  ^~~

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