oj.uz

Submission #288253

# Submission time Handle Problem Language Result Execution time Memory
288253 2020-09-01T10:55:46 Z Mercenary Arranging Shoes (IOI19_shoes) C++14
100 / 100
 121 ms 24568 KB 
#include "shoes.h"
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/trie_policy.hpp>

#define pb push_back
#define mp make_pair
#define taskname "A"

using namespace std;
using namespace __gnu_pbds;

typedef long long ll;
typedef long double ld;
typedef pair<int,int> ii;
typedef tree <int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;

const int maxn = 2e5 + 5;
const int mod = 1e9 + 7;

int bit[maxn];
vector<int> val[maxn];

int n;
void update(int x , int val){
    for( ; x <= n ; x += x & -x)bit[x] += val;
}
int query(int x){
    int res = 0;
    for( ; x > 0 ; x &= x - 1)res += bit[x];
    return res;
}
int cnt[maxn];
bool used[maxn];
vector<int> pos[maxn] , neg[maxn];

long long count_swaps(std::vector<int> a) {
    n = a.size();
    for(int i = 0 ; i < n ; ++i){
        if(a[i] > 0)pos[a[i]].pb(i);
        else neg[-a[i]].pb(i);
    }
    for(int i = 1 ; i <= n ; ++i)reverse(pos[i].begin(),pos[i].end()) , reverse(neg[i].begin(),neg[i].end());
    ll res = 0;
    for(int i = 0 ; i < n ; ++i){
        if(used[i])continue;
        int val = abs(a[i]);
        int j = 0;
        if(a[i] > 0)res++ , j = neg[val].back();
        else j = pos[val].back();
        used[j] = 1;
        pos[val].pop_back();
        neg[val].pop_back();
        res += query(j + 1) + j - (query(i + 1) + i) - 1;
        update(i + 1 , 1);
        update(j + 2 , -1);
    }
    return res;
}

#ifdef LOCAL
#include "shoes.h"
#include <cstdio>
#include <cassert>

using namespace std;

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    if(fopen(taskname".INP","r")){
		freopen(taskname".INP", "r",stdin);
		freopen(taskname".OUT", "w",stdout);
    }
	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;
}
#endif // LOCAL

Subtask #1
10.0 / 10.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 14464 KB Output is correct
2 Correct 10 ms 14464 KB Output is correct
3 Correct 10 ms 14464 KB Output is correct
4 Correct 10 ms 14464 KB Output is correct
5 Correct 10 ms 14464 KB Output is correct
6 Correct 10 ms 14464 KB Output is correct
7 Correct 10 ms 14464 KB Output is correct
8 Correct 11 ms 14464 KB Output is correct
9 Correct 10 ms 14464 KB Output is correct
10 Correct 11 ms 14464 KB Output is correct
11 Correct 10 ms 14592 KB Output is correct
12 Correct 10 ms 14464 KB Output is correct
13 Correct 10 ms 14464 KB Output is correct
14 Correct 10 ms 14464 KB Output is correct
15 Correct 10 ms 14464 KB Output is correct
16 Correct 10 ms 14464 KB Output is correct
17 Correct 10 ms 14464 KB Output is correct
18 Correct 10 ms 14592 KB Output is correct
19 Correct 10 ms 14464 KB Output is correct
20 Correct 15 ms 14976 KB Output is correct
21 Correct 14 ms 14976 KB Output is correct
22 Correct 55 ms 19096 KB Output is correct
23 Correct 51 ms 19180 KB Output is correct
24 Correct 53 ms 19180 KB Output is correct
25 Correct 50 ms 18816 KB Output is correct
26 Correct 53 ms 19180 KB Output is correct
27 Correct 49 ms 19180 KB Output is correct
28 Correct 49 ms 19056 KB Output is correct
29 Correct 57 ms 19080 KB Output is correct
30 Correct 50 ms 19056 KB Output is correct
31 Correct 53 ms 19076 KB Output is correct
32 Correct 49 ms 19056 KB Output is correct
33 Correct 50 ms 18892 KB Output is correct
34 Correct 52 ms 19056 KB Output is correct
35 Correct 10 ms 14464 KB Output is correct
36 Correct 10 ms 14464 KB Output is correct
37 Correct 53 ms 19056 KB Output is correct
38 Correct 50 ms 19060 KB Output is correct
39 Correct 54 ms 19176 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 14464 KB Output is correct
2 Correct 10 ms 14464 KB Output is correct
3 Correct 10 ms 14464 KB Output is correct
4 Correct 10 ms 14464 KB Output is correct
5 Correct 96 ms 24472 KB Output is correct
6 Correct 71 ms 19576 KB Output is correct
7 Correct 88 ms 24312 KB Output is correct
8 Correct 51 ms 19052 KB Output is correct
9 Correct 86 ms 24312 KB Output is correct
10 Correct 96 ms 21240 KB Output is correct

Subtask #5
20.0 / 20.0

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

Subtask #6
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 14464 KB Output is correct
2 Correct 10 ms 14464 KB Output is correct
3 Correct 10 ms 14464 KB Output is correct
4 Correct 10 ms 14464 KB Output is correct
5 Correct 10 ms 14464 KB Output is correct
6 Correct 10 ms 14464 KB Output is correct
7 Correct 10 ms 14464 KB Output is correct
8 Correct 10 ms 14464 KB Output is correct
9 Correct 10 ms 14464 KB Output is correct
10 Correct 10 ms 14464 KB Output is correct
11 Correct 10 ms 14464 KB Output is correct
12 Correct 10 ms 14464 KB Output is correct
13 Correct 10 ms 14464 KB Output is correct
14 Correct 10 ms 14464 KB Output is correct
15 Correct 11 ms 14464 KB Output is correct
16 Correct 10 ms 14464 KB Output is correct
17 Correct 10 ms 14464 KB Output is correct
18 Correct 10 ms 14464 KB Output is correct
19 Correct 10 ms 14464 KB Output is correct
20 Correct 10 ms 14464 KB Output is correct
21 Correct 10 ms 14464 KB Output is correct
22 Correct 10 ms 14464 KB Output is correct
23 Correct 10 ms 14464 KB Output is correct
24 Correct 10 ms 14464 KB Output is correct
25 Correct 10 ms 14464 KB Output is correct
26 Correct 10 ms 14464 KB Output is correct
27 Correct 10 ms 14464 KB Output is correct
28 Correct 10 ms 14464 KB Output is correct
29 Correct 10 ms 14428 KB Output is correct
30 Correct 10 ms 14464 KB Output is correct
31 Correct 11 ms 14592 KB Output is correct
32 Correct 11 ms 14592 KB Output is correct
33 Correct 10 ms 14464 KB Output is correct
34 Correct 11 ms 14464 KB Output is correct
35 Correct 10 ms 14464 KB Output is correct
36 Correct 10 ms 14464 KB Output is correct
37 Correct 10 ms 14464 KB Output is correct
38 Correct 10 ms 14464 KB Output is correct
39 Correct 10 ms 14464 KB Output is correct
40 Correct 10 ms 14464 KB Output is correct
41 Correct 10 ms 14464 KB Output is correct
42 Correct 11 ms 14464 KB Output is correct
43 Correct 10 ms 14464 KB Output is correct
44 Correct 11 ms 14464 KB Output is correct
45 Correct 10 ms 14592 KB Output is correct
46 Correct 10 ms 14464 KB Output is correct
47 Correct 10 ms 14464 KB Output is correct
48 Correct 10 ms 14464 KB Output is correct
49 Correct 10 ms 14464 KB Output is correct
50 Correct 10 ms 14464 KB Output is correct
51 Correct 10 ms 14464 KB Output is correct
52 Correct 10 ms 14592 KB Output is correct
53 Correct 10 ms 14464 KB Output is correct
54 Correct 15 ms 14976 KB Output is correct
55 Correct 14 ms 14976 KB Output is correct
56 Correct 55 ms 19096 KB Output is correct
57 Correct 51 ms 19180 KB Output is correct
58 Correct 53 ms 19180 KB Output is correct
59 Correct 50 ms 18816 KB Output is correct
60 Correct 53 ms 19180 KB Output is correct
61 Correct 49 ms 19180 KB Output is correct
62 Correct 49 ms 19056 KB Output is correct
63 Correct 57 ms 19080 KB Output is correct
64 Correct 50 ms 19056 KB Output is correct
65 Correct 53 ms 19076 KB Output is correct
66 Correct 49 ms 19056 KB Output is correct
67 Correct 50 ms 18892 KB Output is correct
68 Correct 52 ms 19056 KB Output is correct
69 Correct 10 ms 14464 KB Output is correct
70 Correct 10 ms 14464 KB Output is correct
71 Correct 53 ms 19056 KB Output is correct
72 Correct 50 ms 19060 KB Output is correct
73 Correct 54 ms 19176 KB Output is correct
74 Correct 10 ms 14464 KB Output is correct
75 Correct 10 ms 14464 KB Output is correct
76 Correct 10 ms 14464 KB Output is correct
77 Correct 10 ms 14464 KB Output is correct
78 Correct 96 ms 24472 KB Output is correct
79 Correct 71 ms 19576 KB Output is correct
80 Correct 88 ms 24312 KB Output is correct
81 Correct 51 ms 19052 KB Output is correct
82 Correct 86 ms 24312 KB Output is correct
83 Correct 96 ms 21240 KB Output is correct
84 Correct 10 ms 14468 KB Output is correct
85 Correct 10 ms 14464 KB Output is correct
86 Correct 10 ms 14464 KB Output is correct
87 Correct 10 ms 14464 KB Output is correct
88 Correct 11 ms 14464 KB Output is correct
89 Correct 11 ms 14464 KB Output is correct
90 Correct 11 ms 14464 KB Output is correct
91 Correct 10 ms 14464 KB Output is correct
92 Correct 11 ms 14464 KB Output is correct
93 Correct 10 ms 14464 KB Output is correct
94 Correct 11 ms 14464 KB Output is correct
95 Correct 11 ms 14464 KB Output is correct
96 Correct 11 ms 14464 KB Output is correct
97 Correct 10 ms 14464 KB Output is correct
98 Correct 10 ms 14464 KB Output is correct
99 Correct 11 ms 14464 KB Output is correct
100 Correct 11 ms 14464 KB Output is correct
101 Correct 16 ms 15360 KB Output is correct
102 Correct 16 ms 14976 KB Output is correct
103 Correct 121 ms 24568 KB Output is correct
104 Correct 100 ms 24440 KB Output is correct
105 Correct 111 ms 21880 KB Output is correct
106 Correct 89 ms 24568 KB Output is correct
107 Correct 87 ms 19832 KB Output is correct
108 Correct 93 ms 20216 KB Output is correct
109 Correct 52 ms 19440 KB Output is correct
110 Correct 50 ms 19056 KB Output is correct
111 Correct 83 ms 23672 KB Output is correct
112 Correct 114 ms 23160 KB Output is correct
113 Correct 76 ms 19652 KB Output is correct
114 Correct 85 ms 24440 KB Output is correct
115 Correct 86 ms 24440 KB Output is correct