-
Notifications
You must be signed in to change notification settings - Fork 0
/
movieCollection.cpp
95 lines (69 loc) · 1.78 KB
/
movieCollection.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
#include <bits/stdc++.h>
using namespace std;
int sum(int BIT[], int idx)
{
int sum = 0;
for(int i = idx ; i > 0; i -= i&-i)
{
sum += BIT[i];
}
return sum;
}
void update(int BIT[], int val,int idx)
{
//find parent to be inserted and add val to it (1 or -1)
for(int i = idx ; i < 200002; i += i&-i)
{
BIT[i] += val;
}
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int cases;
cin>>cases;
while(cases != 0)
{
int pos[100001];
int BIT[200002];
int m, r;
cin>>m>>r;
//initialize BIT to 0's
for(int i = 0; i < 200002; i++)
BIT[i] = 0;
for(int i = 1; i <= m; i++)
{
update(BIT,1,i);
//so 5,4,3,2,1 for 1 2 3 4 5
pos[i] = m - i + 1;
}
int q;
int loc;
vector<int> ans;
for(int i = m + 1 ; i <= m + r; i++)
{
//movie number
cin>>q;
//location of movie
loc = pos[q];
//sum returns the sum of all elements after loc hence subtracting
// gives elements before
ans.push_back(m - sum(BIT,loc));
//simulate removing from a stack
update(BIT,-1,loc);
//simulate putting back on top
update(BIT,1,i);
//change spot for next itr
pos[q] = i;
}
for(int i = 0 ; i < ans.size(); i++)
{
cout<<ans[i]<<" ";
}
cout<<endl;
cases--;
}
return 0;
}