oj.uz

Submission #347861

# Submission time Handle Problem Language Result Execution time Memory
347861 2021-01-13T16:26:51 Z ACmachine Arranging Shoes (IOI19_shoes) C++17
100 / 100
 307 ms 150124 KB 
#include "shoes.h"
#include <bits/stdc++.h>
using namespace std;

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;

template<typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T, typename U> using ordered_map = tree<T, U, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

typedef long long ll;
typedef long double ld;
typedef double db;
typedef string str;

typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
typedef vector<str> vstr;

#define FOR(i,j,k,in) for(int i=(j); i < (k);i+=in)
#define FORD(i,j,k,in) for(int i=(j); i >=(k);i-=in)
#define REP(i,b) FOR(i,0,b,1)
#define REPD(i,b) FORD(i,b,0,1)
#define pb push_back 
#define mp make_pair
#define ff first
#define ss second
#define all(x) begin(x), end(x)
#define rsz resize 
#define MANY_TESTS int tcase; cin >> tcase; while(tcase--)
	
const double EPS = 1e-9;
const int MOD = 1e9+7; // 998244353;
const ll INFF = 1e18;
const int INF = 1e9;
const ld PI = acos((ld)-1);
const vi dy = {1, 0, -1, 0, -1, 1, 1, -1};
const vi dx = {0, 1, 0, -1, -1, 1, -1, 1};

#ifdef DEBUG
#define DBG if(1)
#else
#define DBG if(0)
#endif

#define dbg(x) cout << "(" << #x << " : " << x << ")" << endl;
// ostreams
template <class T, class U>
ostream& operator<<(ostream& out, const pair<T, U> &par) {out << "[" << par.first << ";" << par.second << "]"; return out;}
template <class T>
ostream& operator<<(ostream& out, const set<T> &cont) { out << "{"; for( const auto &x:cont) out << x << ", "; out << "}"; return out; }
template <class T, class U>
ostream& operator<<(ostream& out, const map<T, U> &cont) {out << "{"; for( const auto &x:cont) out << x << ", "; out << "}"; return out; }
template<class T>
ostream& operator<<(ostream& out, const vector<T> &v){ out << "[";  REP(i, v.size()) out << v[i] << ", ";  out << "]"; return out;}
// istreams
template<class T>
istream& operator>>(istream& in, vector<T> &v){ for(auto &x : v) in >> x; return in; }
template<class T, class U>
istream& operator>>(istream& in, pair<T, U> &p){ in >> p.ff >> p.ss; return in; }
//searches
template<typename T, typename U>
T bsl(T lo, T hi, U f){ hi++; T mid; while(lo < hi){ mid = (lo + hi)/2; f(mid) ? hi = mid : lo = mid+1; } return lo; }
template<typename U>
double bsld(double lo, double hi, U f, double p = 1e-9){ int r = 3 + (int)log2((hi - lo)/p); double mid; while(r--){ mid = (lo + hi)/2; f(mid) ? hi = mid : lo = mid; } return (lo + hi)/2; }
template<typename T, typename U>
T bsh(T lo, T hi, U f){ lo--; T mid; while(lo < hi){ mid = (lo + hi + 1)/2; f(mid) ? lo = mid : hi = mid-1; } return lo; }
template<typename U>
double bshd(double lo, double hi, U f, double p = 1e-9){ int r = 3+(int)log2((hi - lo)/p); double mid; while(r--){ mid = (lo + hi)/2; f(mid) ? lo = mid : hi = mid; } return (lo + hi)/2; }
// some more utility functions
template<typename T>
pair<T, int> get_min(vector<T> &v){ typename vector<T> :: iterator it = min_element(v.begin(), v.end()); return mp(*it, it - v.begin());}
template<typename T>
pair<T, int> get_max(vector<T> &v){ typename vector<T> :: iterator it = max_element(v.begin(), v.end()); return mp(*it, it - v.begin());}        
template<typename T> bool ckmin(T& a, const T& b){return b < a ? a = b , true : false;}
template<typename T> bool ckmax(T& a, const T& b){return b > a ? a = b, true : false;}

    
struct node{
    ll ans = 0, lazy = 0;
    void apply(int l, int r, ll val){
        ans += (r - l) * val;
        lazy += val;
    }
};
struct segtree{
    node comb(node const &a, node const &b){
        node res;
        res.ans = a.ans + b.ans;
        return res;
    } 
    void push(int l, int r, int v){
        tree[v<<1].lazy += tree[v].lazy;
        tree[v<<1|1].lazy += tree[v].lazy;
        int mid = (l + r) >> 1;
        tree[v<<1].ans += (mid - l) * tree[v].lazy;
        tree[v<<1|1].ans += (r - mid)* tree[v].lazy;
        tree[v].lazy = 0;
    }
    int sz;
    vector<node> tree; 
    segtree(int _sz){ // tree is resized to default values set in node
        sz = 1; while(sz < _sz) sz<<=1;
        tree.resize(2*sz); 
    } 
    void build(vector<node> &init){
        for(int i = 0; i < sz; ++i) 
            if(i < init.size())
                tree[i+sz] = init[i];
        for(int i = sz-1; i > 0; --i)
            tree[i] = comb(tree[i<<1], tree[i<<1|1]);
    } 
    node query(int l, int r){return query0(l, r, 0, sz, 1);} 
    node query0(int l, int r, int beg, int end, int v){ 
        if(beg >= l && end <= r)
            return tree[v];
        push(beg, end, v);
        int mid = (beg + end) >> 1;
        node res;
        if(beg >= r || mid <= l) res = query0(l, r, mid, end, v<<1|1); //[beg, mid]
        else if(mid >= r || end <= l) res = query0(l, r, beg, mid, v<<1);
        else res = comb(query0(l, r, beg, mid, v<<1), query0(l, r, mid, end, v<<1|1));
        return res;
    } 
    template<typename... T>
    void upd(int l, int r, T ...args){upd0(l, r, 0, sz, 1, args...);}
    template<typename... T>
    void upd0(int l, int r, int beg, int end, int v, T ...args){
        if(beg >= r || end <= l)
            return;
        if(beg >= l && end <= r){
            tree[v].apply(beg, end, args...);
            return;
        }
        push(beg, end, v);
        int mid = (beg + end) >> 1;
        upd0(l, r, beg, mid, v<<1, args...);
        upd0(l, r, mid, end, v<<1|1, args...);
        tree[v] = comb(tree[v<<1], tree[v<<1|1]);
    } 
};

long long count_swaps(vector<int> s) {
    int n = s.size();
    int mx = 1e5 + 5;
    segtree st(n);
    vector<node> init(n);
    REP(i, n) init[i].ans = i;    
    st.build(init);
    vector<queue<int>> pos(mx);
    vector<queue<int>> neg(mx);
    REP(i, n){
        if(s[i] < 0) neg[-s[i]].push(i);
        else pos[s[i]].push(i);
    }
    vector<bool> used(n, false);
    ll ans = 0;
    REP(i, n){
        if(used[i]) continue;
        if(s[i] < 0){
            int nxt = pos[-s[i]].front();
            pos[-s[i]].pop();
            neg[-s[i]].pop();
            used[nxt] = true;
            int fid = st.query(i, i+1).ans;
            int sid = st.query(nxt, nxt+1).ans;
            st.upd(i, nxt, 1);
            ans += sid - fid - 1;
        }
        else{
            int nxt = neg[s[i]].front();
            neg[s[i]].pop();
            pos[s[i]].pop();
            used[nxt] = true;
            int fid = st.query(i, i + 1).ans;
            int sid = st.query(nxt, nxt + 1).ans;
            st.upd(i, nxt, 1);
            ans += sid - fid; 
        }
    }
    return ans;
}

Compilation message

shoes.cpp: In member function 'void segtree::build(std::vector<node>&)':
shoes.cpp:114:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<node>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  114 |             if(i < init.size())
      |                ~~^~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 90 ms 134892 KB Output is correct
2 Correct 108 ms 134892 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 90 ms 134892 KB Output is correct
2 Correct 108 ms 134892 KB Output is correct
3 Correct 92 ms 135020 KB Output is correct
4 Correct 93 ms 134892 KB Output is correct
5 Correct 97 ms 135020 KB Output is correct
6 Correct 93 ms 134892 KB Output is correct
7 Correct 91 ms 134892 KB Output is correct
8 Correct 91 ms 135020 KB Output is correct
9 Correct 93 ms 134892 KB Output is correct
10 Correct 91 ms 134892 KB Output is correct
11 Correct 94 ms 134892 KB Output is correct
12 Correct 110 ms 134892 KB Output is correct
13 Correct 92 ms 134932 KB Output is correct
14 Correct 93 ms 134912 KB Output is correct
15 Correct 91 ms 134892 KB Output is correct
16 Correct 92 ms 134912 KB Output is correct
17 Correct 94 ms 134892 KB Output is correct
18 Correct 94 ms 135020 KB Output is correct
19 Correct 95 ms 135020 KB Output is correct
20 Correct 92 ms 134892 KB Output is correct
21 Correct 92 ms 134892 KB Output is correct
22 Correct 90 ms 134892 KB Output is correct
23 Correct 92 ms 134892 KB Output is correct
24 Correct 91 ms 134892 KB Output is correct
25 Correct 93 ms 135020 KB Output is correct
26 Correct 102 ms 134892 KB Output is correct
27 Correct 106 ms 134892 KB Output is correct
28 Correct 93 ms 135020 KB Output is correct
29 Correct 93 ms 135012 KB Output is correct
30 Correct 93 ms 134892 KB Output is correct
31 Correct 93 ms 134892 KB Output is correct
32 Correct 93 ms 134892 KB Output is correct
33 Correct 93 ms 135020 KB Output is correct
34 Correct 94 ms 135020 KB Output is correct
35 Correct 93 ms 134900 KB Output is correct
36 Correct 95 ms 134892 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 90 ms 134892 KB Output is correct
2 Correct 108 ms 134892 KB Output is correct
3 Correct 94 ms 134892 KB Output is correct
4 Correct 98 ms 134944 KB Output is correct
5 Correct 92 ms 134892 KB Output is correct
6 Correct 92 ms 134892 KB Output is correct
7 Correct 92 ms 134912 KB Output is correct
8 Correct 93 ms 134892 KB Output is correct
9 Correct 93 ms 134892 KB Output is correct
10 Correct 92 ms 134892 KB Output is correct
11 Correct 92 ms 134892 KB Output is correct
12 Correct 92 ms 134892 KB Output is correct
13 Correct 92 ms 134892 KB Output is correct
14 Correct 92 ms 134892 KB Output is correct
15 Correct 96 ms 135020 KB Output is correct
16 Correct 94 ms 135020 KB Output is correct
17 Correct 93 ms 135020 KB Output is correct
18 Correct 95 ms 135172 KB Output is correct
19 Correct 94 ms 135020 KB Output is correct
20 Correct 102 ms 136684 KB Output is correct
21 Correct 106 ms 136684 KB Output is correct
22 Correct 207 ms 149996 KB Output is correct
23 Correct 192 ms 149996 KB Output is correct
24 Correct 205 ms 150124 KB Output is correct
25 Correct 219 ms 149740 KB Output is correct
26 Correct 212 ms 149996 KB Output is correct
27 Correct 200 ms 149740 KB Output is correct
28 Correct 218 ms 150124 KB Output is correct
29 Correct 221 ms 149996 KB Output is correct
30 Correct 220 ms 150124 KB Output is correct
31 Correct 209 ms 150096 KB Output is correct
32 Correct 215 ms 149996 KB Output is correct
33 Correct 221 ms 149760 KB Output is correct
34 Correct 223 ms 149996 KB Output is correct
35 Correct 95 ms 134892 KB Output is correct
36 Correct 96 ms 135020 KB Output is correct
37 Correct 216 ms 150124 KB Output is correct
38 Correct 218 ms 149996 KB Output is correct
39 Correct 215 ms 150044 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 98 ms 134892 KB Output is correct
2 Correct 96 ms 135020 KB Output is correct
3 Correct 94 ms 134892 KB Output is correct
4 Correct 94 ms 134892 KB Output is correct
5 Correct 258 ms 148076 KB Output is correct
6 Correct 243 ms 147948 KB Output is correct
7 Correct 263 ms 147948 KB Output is correct
8 Correct 220 ms 148716 KB Output is correct
9 Correct 256 ms 147972 KB Output is correct
10 Correct 257 ms 147948 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 90 ms 134892 KB Output is correct
2 Correct 108 ms 134892 KB Output is correct
3 Correct 92 ms 135020 KB Output is correct
4 Correct 93 ms 134892 KB Output is correct
5 Correct 97 ms 135020 KB Output is correct
6 Correct 93 ms 134892 KB Output is correct
7 Correct 91 ms 134892 KB Output is correct
8 Correct 91 ms 135020 KB Output is correct
9 Correct 93 ms 134892 KB Output is correct
10 Correct 91 ms 134892 KB Output is correct
11 Correct 94 ms 134892 KB Output is correct
12 Correct 110 ms 134892 KB Output is correct
13 Correct 92 ms 134932 KB Output is correct
14 Correct 93 ms 134912 KB Output is correct
15 Correct 91 ms 134892 KB Output is correct
16 Correct 92 ms 134912 KB Output is correct
17 Correct 94 ms 134892 KB Output is correct
18 Correct 94 ms 135020 KB Output is correct
19 Correct 95 ms 135020 KB Output is correct
20 Correct 92 ms 134892 KB Output is correct
21 Correct 92 ms 134892 KB Output is correct
22 Correct 90 ms 134892 KB Output is correct
23 Correct 92 ms 134892 KB Output is correct
24 Correct 91 ms 134892 KB Output is correct
25 Correct 93 ms 135020 KB Output is correct
26 Correct 102 ms 134892 KB Output is correct
27 Correct 106 ms 134892 KB Output is correct
28 Correct 93 ms 135020 KB Output is correct
29 Correct 93 ms 135012 KB Output is correct
30 Correct 93 ms 134892 KB Output is correct
31 Correct 93 ms 134892 KB Output is correct
32 Correct 93 ms 134892 KB Output is correct
33 Correct 93 ms 135020 KB Output is correct
34 Correct 94 ms 135020 KB Output is correct
35 Correct 93 ms 134900 KB Output is correct
36 Correct 95 ms 134892 KB Output is correct
37 Correct 95 ms 134892 KB Output is correct
38 Correct 95 ms 134892 KB Output is correct
39 Correct 95 ms 135020 KB Output is correct
40 Correct 97 ms 135148 KB Output is correct
41 Correct 95 ms 135020 KB Output is correct
42 Correct 96 ms 135020 KB Output is correct
43 Correct 96 ms 135020 KB Output is correct
44 Correct 100 ms 135020 KB Output is correct
45 Correct 97 ms 135024 KB Output is correct
46 Correct 97 ms 135020 KB Output is correct
47 Correct 98 ms 135148 KB Output is correct
48 Correct 96 ms 135020 KB Output is correct
49 Correct 98 ms 135148 KB Output is correct
50 Correct 98 ms 135020 KB Output is correct
51 Correct 98 ms 135076 KB Output is correct
52 Correct 97 ms 135020 KB Output is correct

Subtask #6
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 90 ms 134892 KB Output is correct
2 Correct 108 ms 134892 KB Output is correct
3 Correct 92 ms 135020 KB Output is correct
4 Correct 93 ms 134892 KB Output is correct
5 Correct 97 ms 135020 KB Output is correct
6 Correct 93 ms 134892 KB Output is correct
7 Correct 91 ms 134892 KB Output is correct
8 Correct 91 ms 135020 KB Output is correct
9 Correct 93 ms 134892 KB Output is correct
10 Correct 91 ms 134892 KB Output is correct
11 Correct 94 ms 134892 KB Output is correct
12 Correct 110 ms 134892 KB Output is correct
13 Correct 92 ms 134932 KB Output is correct
14 Correct 93 ms 134912 KB Output is correct
15 Correct 91 ms 134892 KB Output is correct
16 Correct 92 ms 134912 KB Output is correct
17 Correct 94 ms 134892 KB Output is correct
18 Correct 94 ms 135020 KB Output is correct
19 Correct 95 ms 135020 KB Output is correct
20 Correct 92 ms 134892 KB Output is correct
21 Correct 92 ms 134892 KB Output is correct
22 Correct 90 ms 134892 KB Output is correct
23 Correct 92 ms 134892 KB Output is correct
24 Correct 91 ms 134892 KB Output is correct
25 Correct 93 ms 135020 KB Output is correct
26 Correct 102 ms 134892 KB Output is correct
27 Correct 106 ms 134892 KB Output is correct
28 Correct 93 ms 135020 KB Output is correct
29 Correct 93 ms 135012 KB Output is correct
30 Correct 93 ms 134892 KB Output is correct
31 Correct 93 ms 134892 KB Output is correct
32 Correct 93 ms 134892 KB Output is correct
33 Correct 93 ms 135020 KB Output is correct
34 Correct 94 ms 135020 KB Output is correct
35 Correct 93 ms 134900 KB Output is correct
36 Correct 95 ms 134892 KB Output is correct
37 Correct 94 ms 134892 KB Output is correct
38 Correct 98 ms 134944 KB Output is correct
39 Correct 92 ms 134892 KB Output is correct
40 Correct 92 ms 134892 KB Output is correct
41 Correct 92 ms 134912 KB Output is correct
42 Correct 93 ms 134892 KB Output is correct
43 Correct 93 ms 134892 KB Output is correct
44 Correct 92 ms 134892 KB Output is correct
45 Correct 92 ms 134892 KB Output is correct
46 Correct 92 ms 134892 KB Output is correct
47 Correct 92 ms 134892 KB Output is correct
48 Correct 92 ms 134892 KB Output is correct
49 Correct 96 ms 135020 KB Output is correct
50 Correct 94 ms 135020 KB Output is correct
51 Correct 93 ms 135020 KB Output is correct
52 Correct 95 ms 135172 KB Output is correct
53 Correct 94 ms 135020 KB Output is correct
54 Correct 102 ms 136684 KB Output is correct
55 Correct 106 ms 136684 KB Output is correct
56 Correct 207 ms 149996 KB Output is correct
57 Correct 192 ms 149996 KB Output is correct
58 Correct 205 ms 150124 KB Output is correct
59 Correct 219 ms 149740 KB Output is correct
60 Correct 212 ms 149996 KB Output is correct
61 Correct 200 ms 149740 KB Output is correct
62 Correct 218 ms 150124 KB Output is correct
63 Correct 221 ms 149996 KB Output is correct
64 Correct 220 ms 150124 KB Output is correct
65 Correct 209 ms 150096 KB Output is correct
66 Correct 215 ms 149996 KB Output is correct
67 Correct 221 ms 149760 KB Output is correct
68 Correct 223 ms 149996 KB Output is correct
69 Correct 95 ms 134892 KB Output is correct
70 Correct 96 ms 135020 KB Output is correct
71 Correct 216 ms 150124 KB Output is correct
72 Correct 218 ms 149996 KB Output is correct
73 Correct 215 ms 150044 KB Output is correct
74 Correct 98 ms 134892 KB Output is correct
75 Correct 96 ms 135020 KB Output is correct
76 Correct 94 ms 134892 KB Output is correct
77 Correct 94 ms 134892 KB Output is correct
78 Correct 258 ms 148076 KB Output is correct
79 Correct 243 ms 147948 KB Output is correct
80 Correct 263 ms 147948 KB Output is correct
81 Correct 220 ms 148716 KB Output is correct
82 Correct 256 ms 147972 KB Output is correct
83 Correct 257 ms 147948 KB Output is correct
84 Correct 95 ms 134892 KB Output is correct
85 Correct 95 ms 134892 KB Output is correct
86 Correct 95 ms 135020 KB Output is correct
87 Correct 97 ms 135148 KB Output is correct
88 Correct 95 ms 135020 KB Output is correct
89 Correct 96 ms 135020 KB Output is correct
90 Correct 96 ms 135020 KB Output is correct
91 Correct 100 ms 135020 KB Output is correct
92 Correct 97 ms 135024 KB Output is correct
93 Correct 97 ms 135020 KB Output is correct
94 Correct 98 ms 135148 KB Output is correct
95 Correct 96 ms 135020 KB Output is correct
96 Correct 98 ms 135148 KB Output is correct
97 Correct 98 ms 135020 KB Output is correct
98 Correct 98 ms 135076 KB Output is correct
99 Correct 97 ms 135020 KB Output is correct
100 Correct 100 ms 135020 KB Output is correct
101 Correct 110 ms 136556 KB Output is correct
102 Correct 112 ms 136684 KB Output is correct
103 Correct 307 ms 149228 KB Output is correct
104 Correct 249 ms 149100 KB Output is correct
105 Correct 262 ms 149228 KB Output is correct
106 Correct 268 ms 149228 KB Output is correct
107 Correct 240 ms 149228 KB Output is correct
108 Correct 237 ms 149100 KB Output is correct
109 Correct 225 ms 149996 KB Output is correct
110 Correct 222 ms 149996 KB Output is correct
111 Correct 270 ms 149100 KB Output is correct
112 Correct 287 ms 149228 KB Output is correct
113 Correct 266 ms 149100 KB Output is correct
114 Correct 274 ms 149356 KB Output is correct
115 Correct 266 ms 149228 KB Output is correct