oj.uz

Submission #321763

# Submission time Handle Problem Language Result Execution time Memory
321763 2020-11-13T09:51:11 Z anakib1 Arranging Shoes (IOI19_shoes) C++17
100 / 100
 175 ms 140396 KB 
//나는 가상 소녀들에게 큰 호감이 있습니다.

#include <iostream>
#include <cmath>
#include <algorithm>
#include <stdio.h>
#include <cstring>
#include <string>
#include <cstdlib>
#include <vector>
#include <bitset>
#include <map>
#include <chrono>
#include <functional>
#include <unordered_set>
#include <unordered_map>
#include <numeric>
#include <queue>
#include <ctime>
#include <stack>
#include <set>
#include <list>
#include <deque>
#include <iomanip>
#include <sstream>
#include <fstream>
#include <stdarg.h>
#include <utility>

using namespace std;

#define pb push_back
#define mp make_pair
#define ll long long
#define ull unisgned long long
#define ld long double
#define all(a) a.begin(), a.end()
#define SORT(a) sort(all(a))
#define pii pair<int, int>
#define tii triple<int, int, int>
#define e 1e-7
#define PI acos(-1)
#define sz(a) (int)(a.size())
#define inf 1e17
#define vi vector<int>
#define F first
#define S second
#define rng(x) for(int _ = 0; _ < (x); _++)
#define rngi(i, x) for(int i = 0; i < (x); i++)
#define rngsi(s, i, x) for(int i = (s); i <(x); i++)
#define problem "a"

template<typename A, typename B, typename C>
struct triple {
    A X;
    B Y;
    C Z;
    triple(A a = 0, B b = 0, C c = 0) :X(a), Y(b), Z(c) {}
};
template<typename A, typename B, typename C>
triple<A, B, C> make_triple(A a = 0, B b = 0, C c = 0) {
    return triple<A, B, C>(a, b, c);
}
template<typename A, typename B, typename C>
bool operator<(const triple<A, B, C>& a, const triple<A, B, C>& b) {
    if (a.X != b.X)
        return a.X < b.X;
    if (a.Y != b.Y)
        return a.Y < b.Y;
    return a.Z < b.Z;
}
template<typename T, typename SS>
ostream& operator<<(ostream& ofs, const pair<T, SS>& p) {
    ofs << "( " << p.F << " , " << p.S << " )";
    return ofs;
}
template<typename T>
void print(T a) {
    for (auto i : a)
        cout << i << ' ';
    cout << '\n';
}
template<typename T>
T max(T a, T b, T c) {
    return max(a, max(b, c));
}
template<typename T>
T min(T a, T b, T c) {
    return min(a, min(b, c));
}
template<typename T, typename D>
D min(T a) {
    return *min_element(all(a));
}
template<typename T, typename D>
D max(T a) {
    return *max_element(all(a));
}
struct custom_hash {
    static uint64_t splitmix64(uint64_t x) {
        x += 0x9e3779b97f4a7c15;
        x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
        x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
        return x ^ (x >> 31);
    }

    size_t operator()(uint64_t x) const {
        static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
        return splitmix64(x + FIXED_RANDOM);
    }
};
#include "shoes.h"
struct fw {
    vi tree;
    int n;
    fw(int m) { n = m; tree.resize(n); }
    void add(int v, int x) {
        for (int r = v; r < n; r = r|(r + 1))tree[r] += x;
    };
    int get(int l) {
        int r = 0; for (int v = l; v >= 0; v = (v & (v + 1)) - 1)r += tree[v]; return r;
    }
    int sum(int l, int r) {
        if (l > r)return 0;
        return get(r) - get(l - 1);
    }
};
long long count_swaps(std::vector<int> s) {
    int n = sz(s) / 2;
    vector<deque<int> > pl(n+1), pr(n+1);
    rngi(i, 2 * n) if (s[i] < 0) pl[-s[i]].push_back(i); else pr[s[i]].push_back(i);
    vi used(2 * n);
    ll ans = 0;
    fw t(2*n);
    int z = 0;
    for(int i = 2 * n - 1; i >=0; i--)if(!used[i]){
        int x = s[i];
        if (x < 0) {
            int v = pr[-x].back();
            pr[-x].pop_back();
            pl[-x].pop_back();
            used[v] = 1;
            t.add(v, 1);
            ans += i - v - t.sum(v+1,i-1);
        }
        else {
            int v = pl[x].back();
            used[v] = 1;
            pl[x].pop_back();
            pr[x].pop_back();
            t.add(v, 1);
            ans += i - v - 1 - t.sum(v+1,i-1);
        }

    }
    return ans;
}

Compilation message

shoes.cpp: In function 'long long int count_swaps(std::vector<int>)':
shoes.cpp:135:9: warning: unused variable 'z' [-Wunused-variable]
  135 |     int z = 0;
      |         ^

Subtask #1
10.0 / 10.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 620 KB Output is correct
17 Correct 1 ms 748 KB Output is correct
18 Correct 2 ms 1644 KB Output is correct
19 Correct 2 ms 1644 KB Output is correct
20 Correct 14 ms 14316 KB Output is correct
21 Correct 17 ms 14316 KB Output is correct
22 Correct 123 ms 140268 KB Output is correct
23 Correct 122 ms 140268 KB Output is correct
24 Correct 125 ms 140268 KB Output is correct
25 Correct 130 ms 140140 KB Output is correct
26 Correct 124 ms 140268 KB Output is correct
27 Correct 119 ms 140140 KB Output is correct
28 Correct 125 ms 140268 KB Output is correct
29 Correct 127 ms 140268 KB Output is correct
30 Correct 120 ms 140268 KB Output is correct
31 Correct 126 ms 140396 KB Output is correct
32 Correct 119 ms 140268 KB Output is correct
33 Correct 120 ms 140012 KB Output is correct
34 Correct 123 ms 140268 KB Output is correct
35 Correct 1 ms 364 KB Output is correct
36 Correct 1 ms 364 KB Output is correct
37 Correct 120 ms 140140 KB Output is correct
38 Correct 120 ms 140268 KB Output is correct
39 Correct 121 ms 140268 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 0 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 168 ms 139372 KB Output is correct
6 Correct 140 ms 139372 KB Output is correct
7 Correct 161 ms 139372 KB Output is correct
8 Correct 121 ms 140268 KB Output is correct
9 Correct 163 ms 139296 KB Output is correct
10 Correct 159 ms 139628 KB Output is correct

Subtask #5
20.0 / 20.0

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

Subtask #6
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 492 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 1 ms 364 KB Output is correct
26 Correct 1 ms 364 KB Output is correct
27 Correct 1 ms 364 KB Output is correct
28 Correct 1 ms 364 KB Output is correct
29 Correct 1 ms 364 KB Output is correct
30 Correct 1 ms 364 KB Output is correct
31 Correct 1 ms 364 KB Output is correct
32 Correct 1 ms 364 KB Output is correct
33 Correct 1 ms 364 KB Output is correct
34 Correct 1 ms 364 KB Output is correct
35 Correct 1 ms 364 KB Output is correct
36 Correct 1 ms 364 KB Output is correct
37 Correct 1 ms 364 KB Output is correct
38 Correct 1 ms 364 KB Output is correct
39 Correct 1 ms 364 KB Output is correct
40 Correct 1 ms 364 KB Output is correct
41 Correct 1 ms 364 KB Output is correct
42 Correct 1 ms 364 KB Output is correct
43 Correct 1 ms 364 KB Output is correct
44 Correct 1 ms 364 KB Output is correct
45 Correct 1 ms 364 KB Output is correct
46 Correct 1 ms 384 KB Output is correct
47 Correct 1 ms 364 KB Output is correct
48 Correct 1 ms 364 KB Output is correct
49 Correct 1 ms 364 KB Output is correct
50 Correct 1 ms 620 KB Output is correct
51 Correct 1 ms 748 KB Output is correct
52 Correct 2 ms 1644 KB Output is correct
53 Correct 2 ms 1644 KB Output is correct
54 Correct 14 ms 14316 KB Output is correct
55 Correct 17 ms 14316 KB Output is correct
56 Correct 123 ms 140268 KB Output is correct
57 Correct 122 ms 140268 KB Output is correct
58 Correct 125 ms 140268 KB Output is correct
59 Correct 130 ms 140140 KB Output is correct
60 Correct 124 ms 140268 KB Output is correct
61 Correct 119 ms 140140 KB Output is correct
62 Correct 125 ms 140268 KB Output is correct
63 Correct 127 ms 140268 KB Output is correct
64 Correct 120 ms 140268 KB Output is correct
65 Correct 126 ms 140396 KB Output is correct
66 Correct 119 ms 140268 KB Output is correct
67 Correct 120 ms 140012 KB Output is correct
68 Correct 123 ms 140268 KB Output is correct
69 Correct 1 ms 364 KB Output is correct
70 Correct 1 ms 364 KB Output is correct
71 Correct 120 ms 140140 KB Output is correct
72 Correct 120 ms 140268 KB Output is correct
73 Correct 121 ms 140268 KB Output is correct
74 Correct 1 ms 364 KB Output is correct
75 Correct 0 ms 364 KB Output is correct
76 Correct 1 ms 364 KB Output is correct
77 Correct 1 ms 364 KB Output is correct
78 Correct 168 ms 139372 KB Output is correct
79 Correct 140 ms 139372 KB Output is correct
80 Correct 161 ms 139372 KB Output is correct
81 Correct 121 ms 140268 KB Output is correct
82 Correct 163 ms 139296 KB Output is correct
83 Correct 159 ms 139628 KB Output is correct
84 Correct 1 ms 364 KB Output is correct
85 Correct 1 ms 364 KB Output is correct
86 Correct 1 ms 492 KB Output is correct
87 Correct 1 ms 748 KB Output is correct
88 Correct 2 ms 1644 KB Output is correct
89 Correct 2 ms 1644 KB Output is correct
90 Correct 2 ms 1644 KB Output is correct
91 Correct 2 ms 1644 KB Output is correct
92 Correct 2 ms 1644 KB Output is correct
93 Correct 2 ms 1644 KB Output is correct
94 Correct 2 ms 1644 KB Output is correct
95 Correct 2 ms 1644 KB Output is correct
96 Correct 2 ms 1644 KB Output is correct
97 Correct 2 ms 1644 KB Output is correct
98 Correct 2 ms 1644 KB Output is correct
99 Correct 2 ms 1644 KB Output is correct
100 Correct 2 ms 1644 KB Output is correct
101 Correct 14 ms 14188 KB Output is correct
102 Correct 13 ms 14188 KB Output is correct
103 Correct 175 ms 139372 KB Output is correct
104 Correct 164 ms 139372 KB Output is correct
105 Correct 168 ms 139372 KB Output is correct
106 Correct 168 ms 139372 KB Output is correct
107 Correct 146 ms 139372 KB Output is correct
108 Correct 151 ms 139372 KB Output is correct
109 Correct 120 ms 140268 KB Output is correct
110 Correct 120 ms 140268 KB Output is correct
111 Correct 161 ms 139372 KB Output is correct
112 Correct 173 ms 139372 KB Output is correct
113 Correct 145 ms 139372 KB Output is correct
114 Correct 164 ms 139372 KB Output is correct
115 Correct 161 ms 139372 KB Output is correct