oj.uz

Submission #306033

# Submission time Handle Problem Language Result Execution time Memory
306033 2020-09-24T10:05:39 Z talant117408 Arranging Shoes (IOI19_shoes) C++17
100 / 100
 259 ms 18928 KB 
#include "shoes.h"
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

const int N = 2e5+7;
ll tree[N*4], lz[N*4];

void push(int v, int l, int r){
    if(l > r) return;
    if(lz[v]){
        tree[v] += ll(r-l+1)*lz[v];
        if(l != r){
            lz[v<<1] += lz[v];
            lz[(v<<1)+1] += lz[v];
        }
        lz[v] = 0;
    }
}

ll get(int v, int l, int r, int ql, int qr){
    push(v, l, r);
    if(l > qr || r < ql) return 0;
    
    if(ql <= l && r <= qr) return tree[v];
    
    int mid = (l+r)>>1;
    return get(v<<1, l, mid, ql, qr)+get((v<<1)+1, mid+1, r, ql, qr);
}

void update(int v, int l, int r, int ql, int qr){
    push(v, l, r);
    if(l > qr || r < ql) return;
    
    if(ql <= l && r <= qr){
        tree[v] += ll(r-l+1);
        if(l != r){
            lz[v<<1]++;
            lz[(v<<1)+1]++;
        }
        return;
    }
    
    int mid = (l+r)>>1;
    update(v<<1, l, mid, ql, qr);
    update((v<<1)+1, mid+1, r, ql, qr);
    tree[v] = tree[v<<1]+tree[(v<<1)+1];
}
/*
ll count_swaps(vector <int> s);
int main() {
	int n;
	assert(1 == scanf("%d", &n));
	vector<int> S(2 * n);
	for (int i = 0; i < 2 * n; i++)
		assert(1 == scanf("%d", &S[i]));
	fclose(stdin);

	long long result = count_swaps(S);

	printf("%lld\n", result);
	fclose(stdout);
	return 0;
}
*/
ll count_swaps(vector<int> s){
    int n = s.size(), i;
    
    vector <pair <int, int>> order[N];
    for(i = 0; i < n; i++){
        order[abs(s[i])].emplace_back(make_pair(s[i], i+1));
    }
    
    ll ans = 0;
    vector <pair<int, int>> qu;
    
    for(i = 1; i <= n/2; i++){
        sort(order[abs(i)].begin(), order[abs(i)].end());
        for(int j = 0; j < (int)order[i].size()/2; j++){
            int l = order[i][j].second;
            int r = order[i][j+(int)order[i].size()/2].second;
            if(l > r){
                swap(l, r);
            }
            else{
                ans--;
            }
            qu.push_back(make_pair(l, r));
        }
    }
    
    sort(qu.begin(), qu.end());
    
    for(auto to : qu){
        int l = to.first, r = to.second;
        ans += (r+get(1, 1, n, r, r))-(l+get(1, 1, n, l, l));
        if(l+1 != r){
            update(1, 1, n, l+1, r-1);
        }
    }
    
    return ans;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 4992 KB Output is correct
2 Correct 4 ms 4992 KB Output is correct
3 Correct 4 ms 5024 KB Output is correct
4 Correct 4 ms 4992 KB Output is correct
5 Correct 4 ms 4992 KB Output is correct
6 Correct 4 ms 4992 KB Output is correct
7 Correct 4 ms 4992 KB Output is correct
8 Correct 4 ms 4992 KB Output is correct
9 Correct 3 ms 4992 KB Output is correct
10 Correct 4 ms 5120 KB Output is correct
11 Correct 4 ms 4992 KB Output is correct
12 Correct 4 ms 4992 KB Output is correct
13 Correct 4 ms 4992 KB Output is correct
14 Correct 4 ms 4992 KB Output is correct
15 Correct 5 ms 4992 KB Output is correct
16 Correct 4 ms 4992 KB Output is correct
17 Correct 4 ms 5120 KB Output is correct
18 Correct 5 ms 5120 KB Output is correct
19 Correct 5 ms 5120 KB Output is correct
20 Correct 16 ms 6524 KB Output is correct
21 Correct 17 ms 6524 KB Output is correct
22 Correct 146 ms 18152 KB Output is correct
23 Correct 99 ms 9960 KB Output is correct
24 Correct 153 ms 18152 KB Output is correct
25 Correct 155 ms 18152 KB Output is correct
26 Correct 148 ms 18152 KB Output is correct
27 Correct 92 ms 9960 KB Output is correct
28 Correct 156 ms 18252 KB Output is correct
29 Correct 153 ms 18156 KB Output is correct
30 Correct 157 ms 18408 KB Output is correct
31 Correct 157 ms 18280 KB Output is correct
32 Correct 153 ms 18172 KB Output is correct
33 Correct 150 ms 18152 KB Output is correct
34 Correct 159 ms 18152 KB Output is correct
35 Correct 4 ms 4992 KB Output is correct
36 Correct 4 ms 4992 KB Output is correct
37 Correct 156 ms 18152 KB Output is correct
38 Correct 155 ms 18152 KB Output is correct
39 Correct 156 ms 18152 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 4992 KB Output is correct
2 Correct 3 ms 4992 KB Output is correct
3 Correct 5 ms 4992 KB Output is correct
4 Correct 5 ms 4992 KB Output is correct
5 Correct 196 ms 18796 KB Output is correct
6 Correct 170 ms 18164 KB Output is correct
7 Correct 185 ms 18796 KB Output is correct
8 Correct 163 ms 18344 KB Output is correct
9 Correct 190 ms 18800 KB Output is correct
10 Correct 192 ms 18668 KB Output is correct

Subtask #5
20.0 / 20.0

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

Subtask #6
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 4992 KB Output is correct
2 Correct 4 ms 4992 KB Output is correct
3 Correct 4 ms 4992 KB Output is correct
4 Correct 4 ms 4992 KB Output is correct
5 Correct 4 ms 4992 KB Output is correct
6 Correct 4 ms 4992 KB Output is correct
7 Correct 4 ms 4992 KB Output is correct
8 Correct 4 ms 4992 KB Output is correct
9 Correct 4 ms 4992 KB Output is correct
10 Correct 4 ms 4992 KB Output is correct
11 Correct 4 ms 4992 KB Output is correct
12 Correct 4 ms 4992 KB Output is correct
13 Correct 4 ms 4992 KB Output is correct
14 Correct 4 ms 4992 KB Output is correct
15 Correct 4 ms 4992 KB Output is correct
16 Correct 4 ms 4992 KB Output is correct
17 Correct 4 ms 4992 KB Output is correct
18 Correct 4 ms 4992 KB Output is correct
19 Correct 4 ms 4992 KB Output is correct
20 Correct 4 ms 4992 KB Output is correct
21 Correct 3 ms 4992 KB Output is correct
22 Correct 3 ms 4992 KB Output is correct
23 Correct 4 ms 4992 KB Output is correct
24 Correct 3 ms 4992 KB Output is correct
25 Correct 5 ms 4992 KB Output is correct
26 Correct 4 ms 4992 KB Output is correct
27 Correct 4 ms 4992 KB Output is correct
28 Correct 4 ms 4992 KB Output is correct
29 Correct 4 ms 4992 KB Output is correct
30 Correct 4 ms 4992 KB Output is correct
31 Correct 4 ms 4992 KB Output is correct
32 Correct 4 ms 4992 KB Output is correct
33 Correct 4 ms 4992 KB Output is correct
34 Correct 4 ms 4992 KB Output is correct
35 Correct 4 ms 4992 KB Output is correct
36 Correct 4 ms 4992 KB Output is correct
37 Correct 4 ms 5024 KB Output is correct
38 Correct 4 ms 4992 KB Output is correct
39 Correct 4 ms 4992 KB Output is correct
40 Correct 4 ms 4992 KB Output is correct
41 Correct 4 ms 4992 KB Output is correct
42 Correct 4 ms 4992 KB Output is correct
43 Correct 3 ms 4992 KB Output is correct
44 Correct 4 ms 5120 KB Output is correct
45 Correct 4 ms 4992 KB Output is correct
46 Correct 4 ms 4992 KB Output is correct
47 Correct 4 ms 4992 KB Output is correct
48 Correct 4 ms 4992 KB Output is correct
49 Correct 5 ms 4992 KB Output is correct
50 Correct 4 ms 4992 KB Output is correct
51 Correct 4 ms 5120 KB Output is correct
52 Correct 5 ms 5120 KB Output is correct
53 Correct 5 ms 5120 KB Output is correct
54 Correct 16 ms 6524 KB Output is correct
55 Correct 17 ms 6524 KB Output is correct
56 Correct 146 ms 18152 KB Output is correct
57 Correct 99 ms 9960 KB Output is correct
58 Correct 153 ms 18152 KB Output is correct
59 Correct 155 ms 18152 KB Output is correct
60 Correct 148 ms 18152 KB Output is correct
61 Correct 92 ms 9960 KB Output is correct
62 Correct 156 ms 18252 KB Output is correct
63 Correct 153 ms 18156 KB Output is correct
64 Correct 157 ms 18408 KB Output is correct
65 Correct 157 ms 18280 KB Output is correct
66 Correct 153 ms 18172 KB Output is correct
67 Correct 150 ms 18152 KB Output is correct
68 Correct 159 ms 18152 KB Output is correct
69 Correct 4 ms 4992 KB Output is correct
70 Correct 4 ms 4992 KB Output is correct
71 Correct 156 ms 18152 KB Output is correct
72 Correct 155 ms 18152 KB Output is correct
73 Correct 156 ms 18152 KB Output is correct
74 Correct 4 ms 4992 KB Output is correct
75 Correct 3 ms 4992 KB Output is correct
76 Correct 5 ms 4992 KB Output is correct
77 Correct 5 ms 4992 KB Output is correct
78 Correct 196 ms 18796 KB Output is correct
79 Correct 170 ms 18164 KB Output is correct
80 Correct 185 ms 18796 KB Output is correct
81 Correct 163 ms 18344 KB Output is correct
82 Correct 190 ms 18800 KB Output is correct
83 Correct 192 ms 18668 KB Output is correct
84 Correct 4 ms 4992 KB Output is correct
85 Correct 4 ms 4992 KB Output is correct
86 Correct 5 ms 4992 KB Output is correct
87 Correct 4 ms 5120 KB Output is correct
88 Correct 5 ms 5120 KB Output is correct
89 Correct 5 ms 5120 KB Output is correct
90 Correct 5 ms 5120 KB Output is correct
91 Correct 7 ms 5120 KB Output is correct
92 Correct 5 ms 5120 KB Output is correct
93 Correct 5 ms 5120 KB Output is correct
94 Correct 5 ms 5120 KB Output is correct
95 Correct 5 ms 5120 KB Output is correct
96 Correct 6 ms 5120 KB Output is correct
97 Correct 6 ms 5120 KB Output is correct
98 Correct 5 ms 5120 KB Output is correct
99 Correct 5 ms 5120 KB Output is correct
100 Correct 5 ms 5120 KB Output is correct
101 Correct 23 ms 6656 KB Output is correct
102 Correct 20 ms 6656 KB Output is correct
103 Correct 259 ms 18800 KB Output is correct
104 Correct 127 ms 10868 KB Output is correct
105 Correct 197 ms 18412 KB Output is correct
106 Correct 204 ms 18796 KB Output is correct
107 Correct 151 ms 18160 KB Output is correct
108 Correct 125 ms 10432 KB Output is correct
109 Correct 168 ms 18280 KB Output is correct
110 Correct 153 ms 18152 KB Output is correct
111 Correct 203 ms 18928 KB Output is correct
112 Correct 215 ms 18924 KB Output is correct
113 Correct 205 ms 18400 KB Output is correct
114 Correct 186 ms 18928 KB Output is correct
115 Correct 186 ms 18800 KB Output is correct