forked from ankit039/Competitive_Programming_Solutions
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathFrequency_Queries.cpp
More file actions
114 lines (84 loc) · 2.21 KB
/
Copy pathFrequency_Queries.cpp
File metadata and controls
114 lines (84 loc) · 2.21 KB
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
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
#include <bits/stdc++.h>
using namespace std;
string ltrim(const string &);
string rtrim(const string &);
vector<string> split(const string &);
// Complete the freqQuery function below.
vector<int> freqQuery(vector<vector<int>> queries) {
map<long, long> m, m1;
vector<int> result;
int size = queries.size();
for (int i = 0; i != size; i++) {
int q0 = queries[i][0], q1 = queries[i][1];
if (q0 == 1) {
m1[m[q1]] -= 1;
m1[m[q1] += 1] += 1;
} else if (q0 == 2) {
if (m[q1] != 0) {
m1[m[q1]] -= 1;
m1[m[q1] -= 1] += 1;
}
} else if (q0 == 3) {
if (m1[q1] > 0)
result.push_back(1);
else
result.push_back(0);
}
}
return result;
}
int main()
{
ofstream fout(getenv("OUTPUT_PATH"));
string q_temp;
getline(cin, q_temp);
int q = stoi(ltrim(rtrim(q_temp)));
vector<vector<int>> queries(q);
for (int i = 0; i < q; i++) {
queries[i].resize(2);
string queries_row_temp_temp;
getline(cin, queries_row_temp_temp);
vector<string> queries_row_temp = split(rtrim(queries_row_temp_temp));
for (int j = 0; j < 2; j++) {
int queries_row_item = stoi(queries_row_temp[j]);
queries[i][j] = queries_row_item;
}
}
vector<int> ans = freqQuery(queries);
for (int i = 0; i < ans.size(); i++) {
fout << ans[i];
if (i != ans.size() - 1) {
fout << "\n";
}
}
fout << "\n";
fout.close();
return 0;
}
string ltrim(const string &str) {
string s(str);
s.erase(
s.begin(),
find_if(s.begin(), s.end(), not1(ptr_fun<int, int>(isspace)))
);
return s;
}
string rtrim(const string &str) {
string s(str);
s.erase(
find_if(s.rbegin(), s.rend(), not1(ptr_fun<int, int>(isspace))).base(),
s.end()
);
return s;
}
vector<string> split(const string &str) {
vector<string> tokens;
string::size_type start = 0;
string::size_type end = 0;
while ((end = str.find(" ", start)) != string::npos) {
tokens.push_back(str.substr(start, end - start));
start = end + 1;
}
tokens.push_back(str.substr(start));
return tokens;
}