oj.uz

Submission #783796

# Submission time Handle Problem Language Result Execution time Memory
783796 2023-07-15T10:25:25 Z GrindMachine Arranging Shoes (IOI19_shoes) C++17
100 / 100
 103 ms 139696 KB 
// Om Namah Shivaya

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x, y) ((x + y - 1) / (y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i, n) for(int i = 0; i < n; ++i)
#define rep1(i, n) for(int i = 1; i <= n; ++i)
#define rev(i, s, e) for(int i = s; i >= e; --i)
#define trav(i, a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a, b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a, b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif

/*



*/

const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

#include "shoes.h"

template<typename T>
struct fenwick {
    int siz;
    vector<T> tree;

    fenwick(int n) {
        siz = n;
        tree = vector<T>(n + 1);
    }

    int lsb(int x) {
        return x & -x;
    }

    void build(vector<T> &a, int n) {
        for (int i = 1; i <= n; ++i) {
            int par = i + lsb(i);
            tree[i] += a[i];

            if (par <= siz) {
                tree[par] += tree[i];
            }
        }
    }

    void pupd(int i, T v) {
    	i++;

        while (i <= siz) {
            tree[i] += v;
            i += lsb(i);
        }
    }

    T sum(int i) {
    	i++;

        T res = 0;

        while (i) {
            res += tree[i];
            i -= lsb(i);
        }

        return res;
    }

    T query(int l, int r) {
        if (l > r) return 0;
        T res = sum(r) - sum(l - 1);
        return res;
    }
};

long long count_swaps(vector<int> a) {
	int n = sz(a);
	vector<int> b(n,-1);
	deque<int> here[n];
	int ptr = 0;

	rep(i,n){
		int x = abs(a[i]);
		bool ok = false;

		if(!here[x].empty()){
			if(a[i] < 0){
				if(a[here[x].front()] > 0){
					b[ptr] = i;
					b[ptr+1] = here[x].front();
					ptr += 2;
					here[x].pop_front();
					ok = true;
				}
			}
			else{
				if(a[here[x].front()] < 0){
					b[ptr] = here[x].front();
					b[ptr+1] = i;
					ptr += 2;
					here[x].pop_front();
					ok = true;
				}
			}
		}

		if(!ok){
			here[x].pb(i);
		}
	}

	rep(i,n) assert(b[i] != -1);

	fenwick<int> fenw(n);
	ll ans = 0;

	rep(i,n){
		ans += fenw.query(b[i]+1,n-1);
		fenw.pupd(b[i],1);
	}

	return ans;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 0 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 596 KB Output is correct
18 Correct 1 ms 1620 KB Output is correct
19 Correct 1 ms 1620 KB Output is correct
20 Correct 9 ms 14024 KB Output is correct
21 Correct 9 ms 14036 KB Output is correct
22 Correct 89 ms 138048 KB Output is correct
23 Correct 89 ms 138060 KB Output is correct
24 Correct 87 ms 138060 KB Output is correct
25 Correct 92 ms 138392 KB Output is correct
26 Correct 90 ms 138060 KB Output is correct
27 Correct 86 ms 137936 KB Output is correct
28 Correct 85 ms 138356 KB Output is correct
29 Correct 86 ms 138444 KB Output is correct
30 Correct 86 ms 138460 KB Output is correct
31 Correct 87 ms 138040 KB Output is correct
32 Correct 86 ms 138476 KB Output is correct
33 Correct 87 ms 138432 KB Output is correct
34 Correct 88 ms 138356 KB Output is correct
35 Correct 0 ms 212 KB Output is correct
36 Correct 0 ms 212 KB Output is correct
37 Correct 86 ms 138344 KB Output is correct
38 Correct 86 ms 138432 KB Output is correct
39 Correct 86 ms 138428 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 103 ms 137980 KB Output is correct
6 Correct 92 ms 137992 KB Output is correct
7 Correct 96 ms 137932 KB Output is correct
8 Correct 86 ms 138476 KB Output is correct
9 Correct 96 ms 137944 KB Output is correct
10 Correct 98 ms 138008 KB Output is correct

Subtask #5
20.0 / 20.0

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

Subtask #6
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 224 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 296 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 1 ms 224 KB Output is correct
19 Correct 0 ms 300 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 0 ms 212 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 1 ms 300 KB Output is correct
26 Correct 1 ms 212 KB Output is correct
27 Correct 0 ms 212 KB Output is correct
28 Correct 0 ms 304 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Correct 0 ms 212 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 0 ms 212 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 0 ms 212 KB Output is correct
37 Correct 0 ms 212 KB Output is correct
38 Correct 0 ms 212 KB Output is correct
39 Correct 0 ms 212 KB Output is correct
40 Correct 0 ms 212 KB Output is correct
41 Correct 0 ms 212 KB Output is correct
42 Correct 1 ms 212 KB Output is correct
43 Correct 0 ms 212 KB Output is correct
44 Correct 0 ms 212 KB Output is correct
45 Correct 0 ms 212 KB Output is correct
46 Correct 0 ms 212 KB Output is correct
47 Correct 1 ms 212 KB Output is correct
48 Correct 0 ms 212 KB Output is correct
49 Correct 0 ms 340 KB Output is correct
50 Correct 1 ms 340 KB Output is correct
51 Correct 1 ms 596 KB Output is correct
52 Correct 1 ms 1620 KB Output is correct
53 Correct 1 ms 1620 KB Output is correct
54 Correct 9 ms 14024 KB Output is correct
55 Correct 9 ms 14036 KB Output is correct
56 Correct 89 ms 138048 KB Output is correct
57 Correct 89 ms 138060 KB Output is correct
58 Correct 87 ms 138060 KB Output is correct
59 Correct 92 ms 138392 KB Output is correct
60 Correct 90 ms 138060 KB Output is correct
61 Correct 86 ms 137936 KB Output is correct
62 Correct 85 ms 138356 KB Output is correct
63 Correct 86 ms 138444 KB Output is correct
64 Correct 86 ms 138460 KB Output is correct
65 Correct 87 ms 138040 KB Output is correct
66 Correct 86 ms 138476 KB Output is correct
67 Correct 87 ms 138432 KB Output is correct
68 Correct 88 ms 138356 KB Output is correct
69 Correct 0 ms 212 KB Output is correct
70 Correct 0 ms 212 KB Output is correct
71 Correct 86 ms 138344 KB Output is correct
72 Correct 86 ms 138432 KB Output is correct
73 Correct 86 ms 138428 KB Output is correct
74 Correct 0 ms 212 KB Output is correct
75 Correct 0 ms 212 KB Output is correct
76 Correct 0 ms 212 KB Output is correct
77 Correct 0 ms 212 KB Output is correct
78 Correct 103 ms 137980 KB Output is correct
79 Correct 92 ms 137992 KB Output is correct
80 Correct 96 ms 137932 KB Output is correct
81 Correct 86 ms 138476 KB Output is correct
82 Correct 96 ms 137944 KB Output is correct
83 Correct 98 ms 138008 KB Output is correct
84 Correct 1 ms 212 KB Output is correct
85 Correct 1 ms 340 KB Output is correct
86 Correct 1 ms 340 KB Output is correct
87 Correct 1 ms 596 KB Output is correct
88 Correct 1 ms 1620 KB Output is correct
89 Correct 1 ms 1600 KB Output is correct
90 Correct 1 ms 1620 KB Output is correct
91 Correct 1 ms 1620 KB Output is correct
92 Correct 1 ms 1620 KB Output is correct
93 Correct 1 ms 1584 KB Output is correct
94 Correct 1 ms 1620 KB Output is correct
95 Correct 1 ms 1620 KB Output is correct
96 Correct 1 ms 1620 KB Output is correct
97 Correct 1 ms 1620 KB Output is correct
98 Correct 1 ms 1620 KB Output is correct
99 Correct 1 ms 1620 KB Output is correct
100 Correct 1 ms 1620 KB Output is correct
101 Correct 9 ms 14164 KB Output is correct
102 Correct 10 ms 14164 KB Output is correct
103 Correct 97 ms 139300 KB Output is correct
104 Correct 97 ms 139208 KB Output is correct
105 Correct 94 ms 139272 KB Output is correct
106 Correct 96 ms 139256 KB Output is correct
107 Correct 95 ms 139244 KB Output is correct
108 Correct 96 ms 139212 KB Output is correct
109 Correct 87 ms 139696 KB Output is correct
110 Correct 86 ms 139628 KB Output is correct
111 Correct 96 ms 139212 KB Output is correct
112 Correct 96 ms 139220 KB Output is correct
113 Correct 93 ms 139244 KB Output is correct
114 Correct 98 ms 139308 KB Output is correct
115 Correct 94 ms 139272 KB Output is correct