oj.uz

Submission #146762

# Submission time Handle Problem Language Result Execution time Memory
146762 2019-08-26T01:58:02 Z thecodingwizard Arranging Shoes (IOI19_shoes) C++17
100 / 100
 110 ms 15992 KB 
//#pragma GCC optimize ("O3")
//#pragma GCC target ("sse4")

#include <bits/stdc++.h>

#include <utility>

using namespace std;

template<class T> using min_heap = priority_queue<T, vector<T>, greater<T>>;

#define FOR(i, a, b) for (int i=a; i<(b); i++)
#define F0R(i, a) for (int i=0; i<(a); i++)
#define F0R1(i, a) for (int i=1; 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 MIN(a, b) a = min(a, b)
#define MAX(a, b) a = max(a, b)

#define INF 1000000010
#define LL_INF 4500000000000000000LL
#define LSOne(S) (S & (-S))
#define EPS 1e-9
#define pA first
#define pB second
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define PI acos(-1.0)
// #define MOD (int)(2e+9+11)
#define MOD (int)(1e+9+7)
#define SET(vec, val, size) for (int i = 0; i < size; i++) vec[i] = val;
#define SET2D(arr, val, dim1, dim2) F0R(i, dim1) F0R(j, dim2) arr[i][j] = val;
#define SET3D(arr, val, dim1, dim2, dim3) F0R(i, dim1) F0R(j, dim2) F0R(k, dim3) arr[i][j][k] = val;
#define SET4D(arr, val, dim1, dim2, dim3, dim4) F0R(i, dim1) F0R(j, dim2) F0R(k, dim3) F0R(l, dim4) arr[i][j][k][l] = val;

#define lb lower_bound
#define ub upper_bound
#define sz(x) (int)x.size()
#define beg(x) x.begin()
#define en(x) x.end()
#define all(x) beg(x), en(x)
#define resz resize
#define SORT(vec) sort(all(vec))
#define RSORT(vec) sort(vec.rbegin(),vec.rend())

typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef pair<int, int> ii;
typedef pair<int, ii> iii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<iii> viii;
typedef vector<ll> vl;

// @formatter:off
// Source: Benq (https://github.com/bqi343/USACO) [Modified]
namespace input {
    template<class T> void re(complex<T>& x);
    template<class T1, class T2> void re(pair<T1,T2>& p);
    template<class T> void re(vector<T>& a);
    template<class T, size_t SZ> void re(array<T,SZ>& a);
    template<class T> void reA(T A[], int sz);

    template<class T> void re(T& x) { cin >> x; }
    void re(double& x) { string t; re(t); x = stod(t); }
    void re(ld& x) { string t; re(t); x = stold(t); }
    template<class Arg, class... Args> void re(Arg& first, Args&... rest) {
        re(first); re(rest...);
    }

    template<class T1, class T2> void re(pair<T1,T2>& p) { re(p.pA,p.pB); }
    template<class T> void re(vector<T>& a) { F0R(i,sz(a)) re(a[i]); }
    template<class T, size_t SZ> void re(array<T,SZ>& a) { F0R(i,SZ) re(a[i]); }
    template<class T> void reA(T A[], int sz) { F0R(i, sz) re(A[i]); }

    void setupIO(const string &PROB = "") {
        ios::sync_with_stdio(false);
        cin.tie(nullptr);
        if (PROB.length() != 0) {
            ifstream infile(PROB + ".in");
            if (infile.good()) {
                freopen((PROB + ".in").c_str(), "r", stdin);
                freopen((PROB + ".out").c_str(), "w", stdout);
            }
        }
    }
}
using namespace input;

namespace output {
    template<class T1, class T2> void prD(const pair<T1,T2>& x);
    template<class T, size_t SZ> void prD(const array<T,SZ>& x);
    template<class T> void prD(const vector<T>& x);
    template<class T> void prD(const set<T>& x);
    template<class T1, class T2> void prD(const map<T1,T2>& x);

    template<class T1, class T2> void pr(const pair<T1,T2>& x);
    template<class T, size_t SZ> void pr(const array<T,SZ>& x);
    template<class T> void pr(const vector<T>& x);
    template<class T> void pr(const set<T>& x);
    template<class T1, class T2> void pr(const map<T1,T2>& x);

    template<class T> void prD(const T& x) { cout << x; }
    template<class Arg, class... Args> void prD(const Arg& first, const Args&... rest) {
        prD(first); prD(rest...);
    }

    template<class T1, class T2> void prD(const pair<T1,T2>& x) {
        prD("{",x.pA,", ",x.pB,"}");
    }
    template<class T> void prDContain(const T& x) {
        prD("{");
        bool fst = 1; for (const auto& a: x) prD(!fst?", ":"",a), fst = 0; // const needed for vector<bool>
        prD("}");
    }
    template<class T, size_t SZ> void prD(const array<T,SZ>& x) { prDContain(x); }
    template<class T> void prD(const vector<T>& x) { prDContain(x); }
    template<class T> void prD(const set<T>& x) { prDContain(x); }
    template<class T1, class T2> void prD(const map<T1,T2>& x) { prDContain(x); }

    void psD() { prD("\n"); }
    template<class Arg> void psD(const Arg& first) {
        prD(first); psD(); // no space at end of line
    }
    template<class Arg, class... Args> void psD(const Arg& first, const Args&... rest) {
        prD(first," "); psD(rest...); // print w/ spaces
    }


    template<class T> void pr(const T& x) { cout << x; }
    template<class Arg, class... Args> void pr(const Arg& first, const Args&... rest) {
        pr(first); pr(rest...);
    }

    template<class T1, class T2> void pr(const pair<T1,T2>& x) {
        pr(x.pA, " ", x.pB);
    }
    template<class T> void prContain(const T& x) {
        bool fst = 1; for (const auto& a: x) pr(!fst?" ":"",a), fst = 0; // const needed for vector<bool>
    }
    template<class T, size_t SZ> void pr(const array<T,SZ>& x) { prContain(x); }
    template<class T> void pr(const vector<T>& x) { prContain(x); }
    template<class T> void pr(const set<T>& x) { prContain(x); }
    template<class T1, class T2> void pr(const map<T1,T2>& x) { prContain(x); }

    void ps() { pr("\n"); }
    template<class Arg> void ps(const Arg& first) {
        pr(first); ps(); // no space at end of line
    }
    template<class Arg, class... Args> void ps(const Arg& first, const Args&... rest) {
        pr(first," "); ps(rest...); // print w/ spaces
    }
}
using namespace output;
// @formatter:on

/* ============================ */

#include "shoes.h"

vi indexes[200010];
bool done[200010];
int idx[200010];

int ft[200010];

int qry(int k) {
    int ans = 0;
    for (; k > 0; k -= LSOne(k)) ans += ft[k];
    return ans;
}

void upd(int k, int v) {
    for (; k <= 200010; k += LSOne(k)) ft[k] += v;
}

ll count_swaps(vi s) {
    ll ans = 0;

    int n = sz(s);

    F0R(i, n) {
        indexes[s[i]+100001].pb(i);
        idx[s[i]+100001] = 0;
        upd(i + 1, 1);
        done[i] = false;
    }

    F0R(i, n) {
        if (done[i]) continue; done[i] = true;

        idx[s[i]+100001]++;

        int tgtIdx = indexes[-s[i]+100001][idx[-s[i]+100001]++];
        upd(tgtIdx + 1, -1);
        done[tgtIdx] = true;
        int steps = qry(tgtIdx + 1) - qry(i + 1);

        if (s[i] > 0) steps++;
        ans += steps;
    }

    return ans;
}

Compilation message

shoes.cpp: In function 'll count_swaps(vi)':
shoes.cpp:194:9: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
         if (done[i]) continue; done[i] = true;
         ^~
shoes.cpp:194:32: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
         if (done[i]) continue; done[i] = true;
                                ^~~~
shoes.cpp: In function 'void input::setupIO(const string&)':
shoes.cpp:86:24: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
                 freopen((PROB + ".in").c_str(), "r", stdin);
                 ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
shoes.cpp:87:24: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
                 freopen((PROB + ".out").c_str(), "w", stdout);
                 ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 5112 KB Output is correct
2 Correct 6 ms 5112 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 5112 KB Output is correct
2 Correct 6 ms 5112 KB Output is correct
3 Correct 6 ms 5112 KB Output is correct
4 Correct 6 ms 4988 KB Output is correct
5 Correct 6 ms 5112 KB Output is correct
6 Correct 6 ms 4984 KB Output is correct
7 Correct 6 ms 5112 KB Output is correct
8 Correct 6 ms 4984 KB Output is correct
9 Correct 6 ms 5112 KB Output is correct
10 Correct 6 ms 4984 KB Output is correct
11 Correct 6 ms 5096 KB Output is correct
12 Correct 6 ms 5112 KB Output is correct
13 Correct 6 ms 5112 KB Output is correct
14 Correct 6 ms 5112 KB Output is correct
15 Correct 6 ms 5112 KB Output is correct
16 Correct 7 ms 4984 KB Output is correct
17 Correct 6 ms 5112 KB Output is correct
18 Correct 7 ms 5112 KB Output is correct
19 Correct 7 ms 5084 KB Output is correct
20 Correct 6 ms 5112 KB Output is correct
21 Correct 7 ms 5084 KB Output is correct
22 Correct 6 ms 4984 KB Output is correct
23 Correct 6 ms 5112 KB Output is correct
24 Correct 7 ms 5112 KB Output is correct
25 Correct 7 ms 5112 KB Output is correct
26 Correct 6 ms 5112 KB Output is correct
27 Correct 6 ms 5116 KB Output is correct
28 Correct 6 ms 5084 KB Output is correct
29 Correct 6 ms 4984 KB Output is correct
30 Correct 6 ms 5112 KB Output is correct
31 Correct 6 ms 5112 KB Output is correct
32 Correct 6 ms 5112 KB Output is correct
33 Correct 6 ms 5112 KB Output is correct
34 Correct 6 ms 4984 KB Output is correct
35 Correct 6 ms 4984 KB Output is correct
36 Correct 7 ms 4984 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 5112 KB Output is correct
2 Correct 6 ms 5112 KB Output is correct
3 Correct 6 ms 5112 KB Output is correct
4 Correct 6 ms 5116 KB Output is correct
5 Correct 6 ms 4984 KB Output is correct
6 Correct 6 ms 5112 KB Output is correct
7 Correct 6 ms 5112 KB Output is correct
8 Correct 6 ms 5112 KB Output is correct
9 Correct 6 ms 4984 KB Output is correct
10 Correct 6 ms 4984 KB Output is correct
11 Correct 6 ms 4984 KB Output is correct
12 Correct 6 ms 5112 KB Output is correct
13 Correct 6 ms 4984 KB Output is correct
14 Correct 8 ms 5112 KB Output is correct
15 Correct 6 ms 5084 KB Output is correct
16 Correct 6 ms 4984 KB Output is correct
17 Correct 6 ms 4988 KB Output is correct
18 Correct 7 ms 5112 KB Output is correct
19 Correct 7 ms 5116 KB Output is correct
20 Correct 10 ms 5496 KB Output is correct
21 Correct 10 ms 5496 KB Output is correct
22 Correct 47 ms 9800 KB Output is correct
23 Correct 42 ms 9836 KB Output is correct
24 Correct 47 ms 9808 KB Output is correct
25 Correct 41 ms 9712 KB Output is correct
26 Correct 46 ms 9836 KB Output is correct
27 Correct 41 ms 9580 KB Output is correct
28 Correct 43 ms 9912 KB Output is correct
29 Correct 43 ms 9840 KB Output is correct
30 Correct 43 ms 9940 KB Output is correct
31 Correct 47 ms 9732 KB Output is correct
32 Correct 43 ms 9840 KB Output is correct
33 Correct 41 ms 9668 KB Output is correct
34 Correct 43 ms 9840 KB Output is correct
35 Correct 6 ms 4984 KB Output is correct
36 Correct 6 ms 5112 KB Output is correct
37 Correct 43 ms 9840 KB Output is correct
38 Correct 43 ms 9840 KB Output is correct
39 Correct 43 ms 9816 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 4984 KB Output is correct
2 Correct 6 ms 5096 KB Output is correct
3 Correct 6 ms 5112 KB Output is correct
4 Correct 6 ms 4984 KB Output is correct
5 Correct 83 ms 15864 KB Output is correct
6 Correct 67 ms 11000 KB Output is correct
7 Correct 85 ms 15956 KB Output is correct
8 Correct 47 ms 9852 KB Output is correct
9 Correct 85 ms 15864 KB Output is correct
10 Correct 85 ms 12792 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 5112 KB Output is correct
2 Correct 6 ms 5112 KB Output is correct
3 Correct 6 ms 5112 KB Output is correct
4 Correct 6 ms 4988 KB Output is correct
5 Correct 6 ms 5112 KB Output is correct
6 Correct 6 ms 4984 KB Output is correct
7 Correct 6 ms 5112 KB Output is correct
8 Correct 6 ms 4984 KB Output is correct
9 Correct 6 ms 5112 KB Output is correct
10 Correct 6 ms 4984 KB Output is correct
11 Correct 6 ms 5096 KB Output is correct
12 Correct 6 ms 5112 KB Output is correct
13 Correct 6 ms 5112 KB Output is correct
14 Correct 6 ms 5112 KB Output is correct
15 Correct 6 ms 5112 KB Output is correct
16 Correct 7 ms 4984 KB Output is correct
17 Correct 6 ms 5112 KB Output is correct
18 Correct 7 ms 5112 KB Output is correct
19 Correct 7 ms 5084 KB Output is correct
20 Correct 6 ms 5112 KB Output is correct
21 Correct 7 ms 5084 KB Output is correct
22 Correct 6 ms 4984 KB Output is correct
23 Correct 6 ms 5112 KB Output is correct
24 Correct 7 ms 5112 KB Output is correct
25 Correct 7 ms 5112 KB Output is correct
26 Correct 6 ms 5112 KB Output is correct
27 Correct 6 ms 5116 KB Output is correct
28 Correct 6 ms 5084 KB Output is correct
29 Correct 6 ms 4984 KB Output is correct
30 Correct 6 ms 5112 KB Output is correct
31 Correct 6 ms 5112 KB Output is correct
32 Correct 6 ms 5112 KB Output is correct
33 Correct 6 ms 5112 KB Output is correct
34 Correct 6 ms 4984 KB Output is correct
35 Correct 6 ms 4984 KB Output is correct
36 Correct 7 ms 4984 KB Output is correct
37 Correct 6 ms 5112 KB Output is correct
38 Correct 7 ms 5112 KB Output is correct
39 Correct 6 ms 4984 KB Output is correct
40 Correct 7 ms 5112 KB Output is correct
41 Correct 7 ms 5112 KB Output is correct
42 Correct 7 ms 5112 KB Output is correct
43 Correct 7 ms 5112 KB Output is correct
44 Correct 7 ms 5112 KB Output is correct
45 Correct 7 ms 5112 KB Output is correct
46 Correct 7 ms 5112 KB Output is correct
47 Correct 7 ms 5112 KB Output is correct
48 Correct 7 ms 5116 KB Output is correct
49 Correct 7 ms 5112 KB Output is correct
50 Correct 7 ms 5112 KB Output is correct
51 Correct 8 ms 5112 KB Output is correct
52 Correct 7 ms 5112 KB Output is correct

Subtask #6
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 5112 KB Output is correct
2 Correct 6 ms 5112 KB Output is correct
3 Correct 6 ms 5112 KB Output is correct
4 Correct 6 ms 4988 KB Output is correct
5 Correct 6 ms 5112 KB Output is correct
6 Correct 6 ms 4984 KB Output is correct
7 Correct 6 ms 5112 KB Output is correct
8 Correct 6 ms 4984 KB Output is correct
9 Correct 6 ms 5112 KB Output is correct
10 Correct 6 ms 4984 KB Output is correct
11 Correct 6 ms 5096 KB Output is correct
12 Correct 6 ms 5112 KB Output is correct
13 Correct 6 ms 5112 KB Output is correct
14 Correct 6 ms 5112 KB Output is correct
15 Correct 6 ms 5112 KB Output is correct
16 Correct 7 ms 4984 KB Output is correct
17 Correct 6 ms 5112 KB Output is correct
18 Correct 7 ms 5112 KB Output is correct
19 Correct 7 ms 5084 KB Output is correct
20 Correct 6 ms 5112 KB Output is correct
21 Correct 7 ms 5084 KB Output is correct
22 Correct 6 ms 4984 KB Output is correct
23 Correct 6 ms 5112 KB Output is correct
24 Correct 7 ms 5112 KB Output is correct
25 Correct 7 ms 5112 KB Output is correct
26 Correct 6 ms 5112 KB Output is correct
27 Correct 6 ms 5116 KB Output is correct
28 Correct 6 ms 5084 KB Output is correct
29 Correct 6 ms 4984 KB Output is correct
30 Correct 6 ms 5112 KB Output is correct
31 Correct 6 ms 5112 KB Output is correct
32 Correct 6 ms 5112 KB Output is correct
33 Correct 6 ms 5112 KB Output is correct
34 Correct 6 ms 4984 KB Output is correct
35 Correct 6 ms 4984 KB Output is correct
36 Correct 7 ms 4984 KB Output is correct
37 Correct 6 ms 5112 KB Output is correct
38 Correct 6 ms 5116 KB Output is correct
39 Correct 6 ms 4984 KB Output is correct
40 Correct 6 ms 5112 KB Output is correct
41 Correct 6 ms 5112 KB Output is correct
42 Correct 6 ms 5112 KB Output is correct
43 Correct 6 ms 4984 KB Output is correct
44 Correct 6 ms 4984 KB Output is correct
45 Correct 6 ms 4984 KB Output is correct
46 Correct 6 ms 5112 KB Output is correct
47 Correct 6 ms 4984 KB Output is correct
48 Correct 8 ms 5112 KB Output is correct
49 Correct 6 ms 5084 KB Output is correct
50 Correct 6 ms 4984 KB Output is correct
51 Correct 6 ms 4988 KB Output is correct
52 Correct 7 ms 5112 KB Output is correct
53 Correct 7 ms 5116 KB Output is correct
54 Correct 10 ms 5496 KB Output is correct
55 Correct 10 ms 5496 KB Output is correct
56 Correct 47 ms 9800 KB Output is correct
57 Correct 42 ms 9836 KB Output is correct
58 Correct 47 ms 9808 KB Output is correct
59 Correct 41 ms 9712 KB Output is correct
60 Correct 46 ms 9836 KB Output is correct
61 Correct 41 ms 9580 KB Output is correct
62 Correct 43 ms 9912 KB Output is correct
63 Correct 43 ms 9840 KB Output is correct
64 Correct 43 ms 9940 KB Output is correct
65 Correct 47 ms 9732 KB Output is correct
66 Correct 43 ms 9840 KB Output is correct
67 Correct 41 ms 9668 KB Output is correct
68 Correct 43 ms 9840 KB Output is correct
69 Correct 6 ms 4984 KB Output is correct
70 Correct 6 ms 5112 KB Output is correct
71 Correct 43 ms 9840 KB Output is correct
72 Correct 43 ms 9840 KB Output is correct
73 Correct 43 ms 9816 KB Output is correct
74 Correct 6 ms 4984 KB Output is correct
75 Correct 6 ms 5096 KB Output is correct
76 Correct 6 ms 5112 KB Output is correct
77 Correct 6 ms 4984 KB Output is correct
78 Correct 83 ms 15864 KB Output is correct
79 Correct 67 ms 11000 KB Output is correct
80 Correct 85 ms 15956 KB Output is correct
81 Correct 47 ms 9852 KB Output is correct
82 Correct 85 ms 15864 KB Output is correct
83 Correct 85 ms 12792 KB Output is correct
84 Correct 6 ms 5112 KB Output is correct
85 Correct 7 ms 5112 KB Output is correct
86 Correct 6 ms 4984 KB Output is correct
87 Correct 7 ms 5112 KB Output is correct
88 Correct 7 ms 5112 KB Output is correct
89 Correct 7 ms 5112 KB Output is correct
90 Correct 7 ms 5112 KB Output is correct
91 Correct 7 ms 5112 KB Output is correct
92 Correct 7 ms 5112 KB Output is correct
93 Correct 7 ms 5112 KB Output is correct
94 Correct 7 ms 5112 KB Output is correct
95 Correct 7 ms 5116 KB Output is correct
96 Correct 7 ms 5112 KB Output is correct
97 Correct 7 ms 5112 KB Output is correct
98 Correct 8 ms 5112 KB Output is correct
99 Correct 7 ms 5112 KB Output is correct
100 Correct 7 ms 5112 KB Output is correct
101 Correct 13 ms 6008 KB Output is correct
102 Correct 13 ms 5624 KB Output is correct
103 Correct 110 ms 15836 KB Output is correct
104 Correct 85 ms 15832 KB Output is correct
105 Correct 105 ms 13344 KB Output is correct
106 Correct 82 ms 15992 KB Output is correct
107 Correct 73 ms 11256 KB Output is correct
108 Correct 76 ms 11484 KB Output is correct
109 Correct 45 ms 10096 KB Output is correct
110 Correct 43 ms 9832 KB Output is correct
111 Correct 82 ms 15224 KB Output is correct
112 Correct 101 ms 14428 KB Output is correct
113 Correct 71 ms 11256 KB Output is correct
114 Correct 80 ms 15864 KB Output is correct
115 Correct 82 ms 15864 KB Output is correct