oj.uz

Submission #259763

# Submission time Handle Problem Language Result Execution time Memory
259763 2020-08-08T13:08:14 Z dandrozavr Arranging Shoes (IOI19_shoes) C++14
100 / 100
 314 ms 274556 KB 
/*
Uruchamiamy samolot zwiadowczy ( + 500% do wzlamaniej )

/▄/  /█/  /◐/  /▐/   /▌/ /▀/ /░/ /  / choose your own style!

***IT'S OUR LONG WAY TO THE OIILLLL***


░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░████████░░░░░░░░░░░░░░░░░░░░
░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░█████████░░░░░░░░░░░░░░░░░▌░░░
░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░◐◐◐█████████▀▀▀▀▀▀  ░░░░░░░░███░░
░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░█████████░░░░░░░░░░░░░░░░░░░░▌░░░
░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░█████████░░░░░░░░░░░░░░░░░░░░█▌░░░
░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░▄▄▀██████████████████████████████████████████████████
░░░░░░░░░░░░░░░░░░░░░░░░░░▄▄▄████▄████████ ██ ██ ██ ██ ██ ██ ██ ██ ██ ██ ██ ██ █████
░░░░░░░░░░░░░░░░░░░░░░░░░░░▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀█████████▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀
░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░█████████░░░░░░░░░░░░░░░░░░░░░░
░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░◐◐◐█████████▀▀▀▀▀▀  ░░░░░░░░░░░░
░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░█████████░░░░░░░░░░░░░░░░░░░░
░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░█████████░░░░░░░░░░░░░░░░░░░
░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░████████░░░░░░░░░░░░░░░░░░
░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░███████░░░░░░░░░░░░░░░░░
░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░██████░░░░░░░░░░░░░░░░
░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░█████░░░░░░░░░░░░░░░
*/


//#pragma GCC target("avx2")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4")

#include <bits/stdc++.h>
using namespace std ;
#include <ext/pb_ds/detail/standard_policies.hpp>
//#include <boost/multiprecision/cpp_int.hpp>
//using namespace boost::multiprecision;
#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>;
namespace fastio {template <class T> ostream &operator<<(ostream &os, const vector<T> &container) {for (auto &u : container)os << u << " ";return os;} template<class T1, class T2> ostream& operator << (ostream& os, const pair<T1, T2>& p) {return os << p.first << " " << p.second;}template <class T> ostream &operator<<(ostream &os, set<T> const& con) {    for (auto &u : con)        os << u << " ";return os;} void pr() {} template <typename T, typename... args> void pr(T x, args... tail) {cout << x << " ";pr(tail...);}} using namespace fastio;

#define pb push_back
#define ll long long
#define ld long double
#define fi first
#define se second
#define F first
#define S second
#define pii pair < int , int >
#define __ <<" "<<
#define TIME 1.0 * clock() / CLOCKS_PER_SEC
mt19937_64 gen(chrono::high_resolution_clock::now().time_since_epoch().count());

const int N = 2e5 + 5;
int cnt[N];
int t[N];

void add(int pos, int val){
    for (int i = pos; i < N; i += (i & (-i)))
        t[i] += val;
}

int get(int pos){
    int ans = 0;
    for (int i = pos; i > 0; i -= (i & (-i)))
        ans += t[i];
    return ans;
}

ll count_swaps(vector < int > a){
    int n = a.size();
    queue < int > pos[n + 1], neg[n + 1];
    ll ans = 0;
    vector < int > b = a;
    a = {};
    a.pb(0);
    for (int i : b) a.pb(i);

    for (int i = 1; i <= n; ++i){
        if (a[i] > 0){
            if (neg[a[i]].size()){
                int last = neg[a[i]].front();
                ans += i + get(i) - last - get(last) - 1;
                add(last, 1);
                add(i, -1);
                neg[a[i]].pop();
            } else
                pos[a[i]].push(i);
        } else {
            a[i] = -a[i];
            if (pos[a[i]].size()){
                int last = pos[a[i]].front();
                ans += i + get(i) - last - get(last);
                add(last, 1);
                add(i, -1);
                pos[a[i]].pop();
            } else
                neg[a[i]].push(i);
        }
    }
    return ans;
}

#ifdef Estb_probitie
main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

        freopen("input.txt", "r", stdin);
        freopen("output.txt", "w", stdout);

    int n;
    cin >> n;
    vector < int > v;
    n *= 2;
    for (int i = 0; i < n; ++i){
        int x;
        cin >> x;
        v.pb(x);
    }
    cout << count_swaps(v);



}
#endif // Estb_probitie

Subtask #1
10.0 / 10.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 0 ms 384 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 0 ms 384 KB Output is correct
12 Correct 0 ms 384 KB Output is correct
13 Correct 0 ms 384 KB Output is correct
14 Correct 0 ms 384 KB Output is correct
15 Correct 1 ms 512 KB Output is correct
16 Correct 1 ms 640 KB Output is correct
17 Correct 1 ms 1152 KB Output is correct
18 Correct 3 ms 3072 KB Output is correct
19 Correct 3 ms 3072 KB Output is correct
20 Correct 25 ms 27776 KB Output is correct
21 Correct 26 ms 27776 KB Output is correct
22 Correct 245 ms 272888 KB Output is correct
23 Correct 250 ms 274040 KB Output is correct
24 Correct 249 ms 274168 KB Output is correct
25 Correct 248 ms 274280 KB Output is correct
26 Correct 247 ms 274040 KB Output is correct
27 Correct 243 ms 273912 KB Output is correct
28 Correct 248 ms 274408 KB Output is correct
29 Correct 244 ms 274408 KB Output is correct
30 Correct 246 ms 274408 KB Output is correct
31 Correct 279 ms 274040 KB Output is correct
32 Correct 244 ms 274408 KB Output is correct
33 Correct 250 ms 274408 KB Output is correct
34 Correct 246 ms 274408 KB Output is correct
35 Correct 1 ms 384 KB Output is correct
36 Correct 0 ms 384 KB Output is correct
37 Correct 245 ms 274536 KB Output is correct
38 Correct 251 ms 274556 KB Output is correct
39 Correct 249 ms 274408 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 296 ms 273052 KB Output is correct
6 Correct 268 ms 273992 KB Output is correct
7 Correct 284 ms 274040 KB Output is correct
8 Correct 251 ms 274408 KB Output is correct
9 Correct 287 ms 274168 KB Output is correct
10 Correct 287 ms 274060 KB Output is correct

Subtask #5
20.0 / 20.0

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

Subtask #6
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 0 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 0 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 0 ms 384 KB Output is correct
13 Correct 0 ms 384 KB Output is correct
14 Correct 0 ms 384 KB Output is correct
15 Correct 0 ms 384 KB Output is correct
16 Correct 0 ms 384 KB Output is correct
17 Correct 0 ms 384 KB Output is correct
18 Correct 0 ms 384 KB Output is correct
19 Correct 0 ms 384 KB Output is correct
20 Correct 0 ms 384 KB Output is correct
21 Correct 0 ms 384 KB Output is correct
22 Correct 0 ms 384 KB Output is correct
23 Correct 0 ms 384 KB Output is correct
24 Correct 0 ms 384 KB Output is correct
25 Correct 1 ms 384 KB Output is correct
26 Correct 0 ms 384 KB Output is correct
27 Correct 1 ms 384 KB Output is correct
28 Correct 0 ms 384 KB Output is correct
29 Correct 0 ms 384 KB Output is correct
30 Correct 0 ms 384 KB Output is correct
31 Correct 1 ms 384 KB Output is correct
32 Correct 0 ms 384 KB Output is correct
33 Correct 0 ms 384 KB Output is correct
34 Correct 0 ms 384 KB Output is correct
35 Correct 0 ms 384 KB Output is correct
36 Correct 0 ms 384 KB Output is correct
37 Correct 0 ms 384 KB Output is correct
38 Correct 0 ms 384 KB Output is correct
39 Correct 0 ms 384 KB Output is correct
40 Correct 0 ms 384 KB Output is correct
41 Correct 0 ms 384 KB Output is correct
42 Correct 1 ms 384 KB Output is correct
43 Correct 0 ms 384 KB Output is correct
44 Correct 0 ms 384 KB Output is correct
45 Correct 0 ms 384 KB Output is correct
46 Correct 0 ms 384 KB Output is correct
47 Correct 0 ms 384 KB Output is correct
48 Correct 0 ms 384 KB Output is correct
49 Correct 1 ms 512 KB Output is correct
50 Correct 1 ms 640 KB Output is correct
51 Correct 1 ms 1152 KB Output is correct
52 Correct 3 ms 3072 KB Output is correct
53 Correct 3 ms 3072 KB Output is correct
54 Correct 25 ms 27776 KB Output is correct
55 Correct 26 ms 27776 KB Output is correct
56 Correct 245 ms 272888 KB Output is correct
57 Correct 250 ms 274040 KB Output is correct
58 Correct 249 ms 274168 KB Output is correct
59 Correct 248 ms 274280 KB Output is correct
60 Correct 247 ms 274040 KB Output is correct
61 Correct 243 ms 273912 KB Output is correct
62 Correct 248 ms 274408 KB Output is correct
63 Correct 244 ms 274408 KB Output is correct
64 Correct 246 ms 274408 KB Output is correct
65 Correct 279 ms 274040 KB Output is correct
66 Correct 244 ms 274408 KB Output is correct
67 Correct 250 ms 274408 KB Output is correct
68 Correct 246 ms 274408 KB Output is correct
69 Correct 1 ms 384 KB Output is correct
70 Correct 0 ms 384 KB Output is correct
71 Correct 245 ms 274536 KB Output is correct
72 Correct 251 ms 274556 KB Output is correct
73 Correct 249 ms 274408 KB Output is correct
74 Correct 0 ms 384 KB Output is correct
75 Correct 1 ms 384 KB Output is correct
76 Correct 1 ms 384 KB Output is correct
77 Correct 0 ms 384 KB Output is correct
78 Correct 296 ms 273052 KB Output is correct
79 Correct 268 ms 273992 KB Output is correct
80 Correct 284 ms 274040 KB Output is correct
81 Correct 251 ms 274408 KB Output is correct
82 Correct 287 ms 274168 KB Output is correct
83 Correct 287 ms 274060 KB Output is correct
84 Correct 0 ms 384 KB Output is correct
85 Correct 1 ms 512 KB Output is correct
86 Correct 1 ms 640 KB Output is correct
87 Correct 1 ms 1152 KB Output is correct
88 Correct 4 ms 3072 KB Output is correct
89 Correct 3 ms 3072 KB Output is correct
90 Correct 3 ms 3072 KB Output is correct
91 Correct 3 ms 3072 KB Output is correct
92 Correct 3 ms 3072 KB Output is correct
93 Correct 3 ms 3072 KB Output is correct
94 Correct 3 ms 3072 KB Output is correct
95 Correct 3 ms 3072 KB Output is correct
96 Correct 3 ms 3072 KB Output is correct
97 Correct 3 ms 3072 KB Output is correct
98 Correct 3 ms 3072 KB Output is correct
99 Correct 3 ms 3072 KB Output is correct
100 Correct 3 ms 3072 KB Output is correct
101 Correct 27 ms 27808 KB Output is correct
102 Correct 31 ms 27904 KB Output is correct
103 Correct 296 ms 274040 KB Output is correct
104 Correct 280 ms 274040 KB Output is correct
105 Correct 280 ms 274168 KB Output is correct
106 Correct 288 ms 274040 KB Output is correct
107 Correct 267 ms 274168 KB Output is correct
108 Correct 268 ms 274040 KB Output is correct
109 Correct 254 ms 274408 KB Output is correct
110 Correct 250 ms 274536 KB Output is correct
111 Correct 296 ms 274044 KB Output is correct
112 Correct 293 ms 274168 KB Output is correct
113 Correct 274 ms 274040 KB Output is correct
114 Correct 314 ms 274040 KB Output is correct
115 Correct 300 ms 273976 KB Output is correct