Submission #970992

#	Time	Username	Problem	Language	Result	Execution time	Memory
970992		lbm364dl	Arranging Shoes (IOI19_shoes)	C++14	45 / 100	96 ms	14492 KiB

shoes

#include "shoes.h"
//#include <bits/stdc++.h>
#include <iostream>
#include <vector>
#include <set>
#include <map>
#include <algorithm>
#include <functional>
#include <queue>
//#include <ext/pb_ds/assoc_container.hpp>
//using namespace __gnu_pbds;
using namespace std;

#ifdef LOCAL
#define show(x) cerr << #x" = " << (x) << "\n"
#else
#define show(x) 0
#endif

#define pb push_back
#define pp pop_back
#define mp make_pair
#define fst first
#define snd second
#define FOR(var, from, to) for(int var = from; var < int(to); ++var)
#define all(x) x.begin(), x.end()
#define rev(x) x.rbegin(), x.rend()
#define sz(x) int(x.size())
#define vec(x) vector<x>
#define INF 2000000000

typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
//typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
// use unique second element of pair to work as multiset
//typedef tree<pii,null_type,less<pii>,rb_tree_tag,tree_order_statistics_node_update> ordered_multiset;
const ll mod = 1000000007, mod2 = 998244353;

template<typename T, typename U> ostream &operator<<(ostream &os, pair<T,U> p){os << "(" << p.fst << "," << p.snd << ")"; return os;}
template<typename T, typename U> istream &operator>>(istream &is, pair<T,U> &p){is >> p.fst >> p.snd; return is;}
template<typename T> istream &operator>>(istream &is, vector<T> &v){FOR(i, 0, v.size()) is >> v[i]; return is;}
template<typename T> ostream &operator<<(ostream &os, vector<T> v){for(T x : v) os << x << " "; return os;}
template<typename T> ostream &operator<<(ostream &os, set<T> s){for(T x : s) os << x << " "; return os;} 
template<typename T> ostream &operator<<(ostream &os, multiset<T> s){for(T x : s) os << x << " "; return os;} 
template<typename T, typename U> ostream &operator<<(ostream &os, map<T,U> m){for(auto x : m) os << x << " "; return os;} 
//ostream &operator<<(ostream &os, ordered_set s){for(int x : s) os << x << " "; return os;} 
//ostream &operator<<(ostream &os, ordered_multiset s){for(pii x : s) os << x.fst << " "; return os;} 
ll mod_pow(ll a, ll b, ll m){ ll sol = 1; while(b){ if(b&1){ sol = (sol*a)%m; b--; }else{ a = (a*a)%m; b/=2; } } return sol;}
ll rem(ll a, ll b){ ll res = a%b; return res < 0 ? res+b : res; }

long long count_swaps(std::vector<int> s) {
  int n = sz(s);
  vec(int) p(n);
  int pos = n/2-1;
  map<int, vec(int)> which;
  for(int i = n-1; i >= 0; --i){
    if(s[i] > 0){
      p[i] = 2*pos+1;
      which[-s[i]].pb(2*pos);
      pos--;
    }
  }
  FOR(i, 0, n){
    if(s[i] < 0){
      int x = s[i];
      p[i] = which[x].back();
      which[x].pp();
    }
  }
  show(s);
  show(p);
  vec(int) ft(n+1);
  auto add = [&](int i){
    for(; i <= n; i += i&-i) ft[i]++;
  };
  auto ask = [&](int i){
    int cnt = 0;
    for(; i > 0; i -= i&-i) cnt += ft[i];
    return cnt;
  };
  long long ans = 0;
  for(int i = n; i >= 1; --i){
    ans += ask(p[i-1]+1-1);
    add(p[i-1]+1);
  }
	return ans;
}

Compilation message (stderr)

shoes.cpp: In function 'long long int count_swaps(std::vector<int>)':
shoes.cpp:17:17: warning: statement has no effect [-Wunused-value]
   17 | #define show(x) 0
      |                 ^
shoes.cpp:71:3: note: in expansion of macro 'show'
   71 |   show(s);
      |   ^~~~
shoes.cpp:17:17: warning: statement has no effect [-Wunused-value]
   17 | #define show(x) 0
      |                 ^
shoes.cpp:72:3: note: in expansion of macro 'show'
   72 |   show(p);
      |   ^~~~

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