oj.uz

Submission #467387

# Submission time Handle Problem Language Result Execution time Memory
467387 2021-08-22T21:33:24 Z ChrisGe123 Arranging Shoes (IOI19_shoes) C++14
100 / 100
 90 ms 16380 KB 
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
// #include <ext/pb_ds/tree_policy.hpp>
// #include <ext/pb_ds/assoc_container.hpp>
// using namespace __gnu_pbds;
// template <class T> using Tree = tree<T, null_type, less<T>,
//     rb_tree_tag, tree_order_statistics_node_update>;

const int maxn = 100002;
#define mp make_pair
#define pb push_back
#define f first
#define s second

const int mod = 1e9+7;

typedef pair<int, int> pii;
int n;

// for each shoe, we need the closest shoe to the right that is the opposite pair to it
int r[2*maxn];
vector<int> eachsize[2*maxn]; //eachsize[i] contains the positions of the shoes of size i-n in order
int sizepos[2*maxn]; //sizepos[i] tells us how many shoes of size i-n we've seen 
int fentree[2*maxn];

/*
We need to figure out using some PURS thing how to get the number of elements between i and r[i] that have already been taken care of
we can do this by just making a BIT where initially everything is 1, and then if the element i has been used, we make BIT[i] = 0


*/
int lsb(int a)
{
	return a & -a;
}
void change(int a, int c)
{
	while (a <= 2*n)
	{
		fentree[a] += c;
		a += lsb(a);
	}
}
ll sum(int a)
{
	ll s = 0;
	while (a > 0)
	{
		s += fentree[a];
		a -= lsb(a);
	}
	return s;
}

ll count_swaps(vector<int> shoes)
{
	n = shoes.size()/2;
	shoes.insert(shoes.begin(), 0);
	for (int i=1; i<=2*n; i++)
	{
		eachsize[shoes[i]+n].pb(i);
	}
	for (int i=1; i<=2*n; i++)
	{
		if (sizepos[shoes[i]+n] < (int) eachsize[-shoes[i]+n].size())
		{
			int temp = eachsize[-shoes[i]+n][sizepos[shoes[i]+n]];
			if (temp > i)
			{
				r[i] = temp;
			}
		}
		sizepos[shoes[i]+n]++;
	}

	ll ans = 0;
	for (int i=1; i<=2*n; i++)
	{
		change(i, 1);
	}
	for (int i=1; i<=2*n; i++)
	{
		if (r[i] != 0)
		{
			if (r[i] != i+1)
			{
				ans += sum(r[i]-1) - sum(i);
				//cerr << sum(r[i]-1) << " " << sum(i) << endl;
			}
			if (shoes[i] > 0)
			{
				ans++;
			}
			change(r[i], -1);
		}
	}
	return ans;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
20.0 / 20.0

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

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4940 KB Output is correct
2 Correct 3 ms 4940 KB Output is correct
3 Correct 3 ms 4940 KB Output is correct
4 Correct 3 ms 4940 KB Output is correct
5 Correct 3 ms 4940 KB Output is correct
6 Correct 3 ms 4940 KB Output is correct
7 Correct 3 ms 4940 KB Output is correct
8 Correct 4 ms 4940 KB Output is correct
9 Correct 3 ms 4996 KB Output is correct
10 Correct 3 ms 4940 KB Output is correct
11 Correct 3 ms 5004 KB Output is correct
12 Correct 3 ms 4940 KB Output is correct
13 Correct 3 ms 4940 KB Output is correct
14 Correct 3 ms 4940 KB Output is correct
15 Correct 3 ms 4940 KB Output is correct
16 Correct 3 ms 4940 KB Output is correct
17 Correct 3 ms 4940 KB Output is correct
18 Correct 4 ms 4940 KB Output is correct
19 Correct 4 ms 5008 KB Output is correct
20 Correct 7 ms 5580 KB Output is correct
21 Correct 7 ms 5520 KB Output is correct
22 Correct 42 ms 11000 KB Output is correct
23 Correct 36 ms 10540 KB Output is correct
24 Correct 42 ms 10864 KB Output is correct
25 Correct 37 ms 10112 KB Output is correct
26 Correct 42 ms 10548 KB Output is correct
27 Correct 35 ms 10360 KB Output is correct
28 Correct 37 ms 10240 KB Output is correct
29 Correct 39 ms 10236 KB Output is correct
30 Correct 37 ms 10240 KB Output is correct
31 Correct 42 ms 10612 KB Output is correct
32 Correct 38 ms 10292 KB Output is correct
33 Correct 36 ms 10108 KB Output is correct
34 Correct 41 ms 10292 KB Output is correct
35 Correct 3 ms 5000 KB Output is correct
36 Correct 3 ms 4940 KB Output is correct
37 Correct 37 ms 10284 KB Output is correct
38 Correct 39 ms 10232 KB Output is correct
39 Correct 37 ms 10228 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4940 KB Output is correct
2 Correct 3 ms 4940 KB Output is correct
3 Correct 3 ms 4996 KB Output is correct
4 Correct 3 ms 5000 KB Output is correct
5 Correct 59 ms 15988 KB Output is correct
6 Correct 54 ms 11316 KB Output is correct
7 Correct 75 ms 15988 KB Output is correct
8 Correct 38 ms 10228 KB Output is correct
9 Correct 58 ms 15976 KB Output is correct
10 Correct 56 ms 12856 KB Output is correct

Subtask #5
20.0 / 20.0

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

Subtask #6
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4940 KB Output is correct
2 Correct 3 ms 4940 KB Output is correct
3 Correct 3 ms 4940 KB Output is correct
4 Correct 3 ms 4940 KB Output is correct
5 Correct 3 ms 4940 KB Output is correct
6 Correct 3 ms 4940 KB Output is correct
7 Correct 3 ms 4940 KB Output is correct
8 Correct 3 ms 4996 KB Output is correct
9 Correct 3 ms 4940 KB Output is correct
10 Correct 3 ms 4940 KB Output is correct
11 Correct 3 ms 4996 KB Output is correct
12 Correct 3 ms 4940 KB Output is correct
13 Correct 3 ms 4940 KB Output is correct
14 Correct 3 ms 4940 KB Output is correct
15 Correct 3 ms 4940 KB Output is correct
16 Correct 3 ms 4996 KB Output is correct
17 Correct 3 ms 4940 KB Output is correct
18 Correct 3 ms 5004 KB Output is correct
19 Correct 3 ms 4940 KB Output is correct
20 Correct 3 ms 4940 KB Output is correct
21 Correct 3 ms 4940 KB Output is correct
22 Correct 4 ms 4996 KB Output is correct
23 Correct 3 ms 4940 KB Output is correct
24 Correct 3 ms 4996 KB Output is correct
25 Correct 3 ms 4940 KB Output is correct
26 Correct 3 ms 4940 KB Output is correct
27 Correct 3 ms 4940 KB Output is correct
28 Correct 3 ms 4940 KB Output is correct
29 Correct 3 ms 4940 KB Output is correct
30 Correct 3 ms 4940 KB Output is correct
31 Correct 3 ms 4940 KB Output is correct
32 Correct 3 ms 4940 KB Output is correct
33 Correct 3 ms 4940 KB Output is correct
34 Correct 3 ms 4940 KB Output is correct
35 Correct 3 ms 4996 KB Output is correct
36 Correct 3 ms 4996 KB Output is correct
37 Correct 3 ms 4940 KB Output is correct
38 Correct 3 ms 4940 KB Output is correct
39 Correct 3 ms 4940 KB Output is correct
40 Correct 3 ms 4940 KB Output is correct
41 Correct 3 ms 4940 KB Output is correct
42 Correct 4 ms 4940 KB Output is correct
43 Correct 3 ms 4996 KB Output is correct
44 Correct 3 ms 4940 KB Output is correct
45 Correct 3 ms 5004 KB Output is correct
46 Correct 3 ms 4940 KB Output is correct
47 Correct 3 ms 4940 KB Output is correct
48 Correct 3 ms 4940 KB Output is correct
49 Correct 3 ms 4940 KB Output is correct
50 Correct 3 ms 4940 KB Output is correct
51 Correct 3 ms 4940 KB Output is correct
52 Correct 4 ms 4940 KB Output is correct
53 Correct 4 ms 5008 KB Output is correct
54 Correct 7 ms 5580 KB Output is correct
55 Correct 7 ms 5520 KB Output is correct
56 Correct 42 ms 11000 KB Output is correct
57 Correct 36 ms 10540 KB Output is correct
58 Correct 42 ms 10864 KB Output is correct
59 Correct 37 ms 10112 KB Output is correct
60 Correct 42 ms 10548 KB Output is correct
61 Correct 35 ms 10360 KB Output is correct
62 Correct 37 ms 10240 KB Output is correct
63 Correct 39 ms 10236 KB Output is correct
64 Correct 37 ms 10240 KB Output is correct
65 Correct 42 ms 10612 KB Output is correct
66 Correct 38 ms 10292 KB Output is correct
67 Correct 36 ms 10108 KB Output is correct
68 Correct 41 ms 10292 KB Output is correct
69 Correct 3 ms 5000 KB Output is correct
70 Correct 3 ms 4940 KB Output is correct
71 Correct 37 ms 10284 KB Output is correct
72 Correct 39 ms 10232 KB Output is correct
73 Correct 37 ms 10228 KB Output is correct
74 Correct 3 ms 4940 KB Output is correct
75 Correct 3 ms 4940 KB Output is correct
76 Correct 3 ms 4996 KB Output is correct
77 Correct 3 ms 5000 KB Output is correct
78 Correct 59 ms 15988 KB Output is correct
79 Correct 54 ms 11316 KB Output is correct
80 Correct 75 ms 15988 KB Output is correct
81 Correct 38 ms 10228 KB Output is correct
82 Correct 58 ms 15976 KB Output is correct
83 Correct 56 ms 12856 KB Output is correct
84 Correct 4 ms 5000 KB Output is correct
85 Correct 3 ms 4940 KB Output is correct
86 Correct 3 ms 4940 KB Output is correct
87 Correct 3 ms 4992 KB Output is correct
88 Correct 4 ms 5068 KB Output is correct
89 Correct 5 ms 5004 KB Output is correct
90 Correct 4 ms 5000 KB Output is correct
91 Correct 4 ms 5068 KB Output is correct
92 Correct 4 ms 5068 KB Output is correct
93 Correct 4 ms 5068 KB Output is correct
94 Correct 4 ms 5068 KB Output is correct
95 Correct 4 ms 5068 KB Output is correct
96 Correct 4 ms 5068 KB Output is correct
97 Correct 4 ms 4940 KB Output is correct
98 Correct 4 ms 5008 KB Output is correct
99 Correct 4 ms 5068 KB Output is correct
100 Correct 3 ms 5068 KB Output is correct
101 Correct 10 ms 5964 KB Output is correct
102 Correct 8 ms 5628 KB Output is correct
103 Correct 90 ms 16380 KB Output is correct
104 Correct 87 ms 16380 KB Output is correct
105 Correct 69 ms 13620 KB Output is correct
106 Correct 61 ms 15924 KB Output is correct
107 Correct 56 ms 11628 KB Output is correct
108 Correct 58 ms 12024 KB Output is correct
109 Correct 38 ms 10356 KB Output is correct
110 Correct 38 ms 10220 KB Output is correct
111 Correct 60 ms 15248 KB Output is correct
112 Correct 67 ms 14904 KB Output is correct
113 Correct 51 ms 11248 KB Output is correct
114 Correct 61 ms 15984 KB Output is correct
115 Correct 58 ms 15976 KB Output is correct