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
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
| #include <algorithm>
#include <bits/stdc++.h>
using namespace std;
#define all(vec) vec.begin(),vec.end()
#define pb push_back
#define EB emplace_back
#define EM emplace
#define FI first
#define SE second
#define pct __builtin_popcountll
#define ctz __builtin_ctzll
#define SZ(a) ((int) a.size())
#define FOR(i, a, b) for (int i = (a); i <= (b); ++i)
#define ROF(i, a, b) for (int i = (a); i >= (b); --i)
#define debug(var) cout << #var <<":"<<var<<"\n";
#define cend cerr<<"\n-----------\n"
#define lson(var) (var<<1)
#define rson(var) ((var<<1)+1)
#define fsp(x) fixed<<setprecision(x)
using ll = long long;using ull = unsigned long long;
using DB=double;using LD=long double;
using pdd = pair<DB,DB>;using plb = pair<ll,bool>;
using pll = pair<ll,ll>;using vll=vector<ll>;using vb=vector<bool>;
using tll = tuple<ll,ll,ll>;
using vpll = vector<pll>;using vtll = vector<tll>;
using arr3 = array<ll,3> ;using arr2 = array<ll,2>;
static constexpr ll MAXN=(ll)2e5+10,INF=(ll)1e17+9;
static constexpr ll mod=998244353;
static constexpr double eps=1e-8;const double pi=acos(-1.0);
struct Que{
ll bid,l,r,w,i;
};
bool cmp(const Que &a,const Que &b){
if(a.bid!=b.bid) return a.bid<b.bid;
return a.r<b.r;
}
class Solution {
public:
vector<int> subarrayMajority(vector<int>& nums, vector<vector<int>>& queries) {
ll Q=SZ(queries);
ll n=max(1ll,SZ(nums)/(ll)sqrtl(Q));
vector<int> ans(Q);
vector<Que> que;
FOR(i,0,Q-1){
ll l=queries[i][0],r=queries[i][1],w=queries[i][2];
ll bid=l/n;
ll rbid=r/n;
if(bid==rbid){
unordered_map<ll,ll> cnt;
ll lans=INF,mxc=0;
FOR(i,l,r){
cnt[nums[i]]++;
if(cnt[nums[i]]==mxc){
lans=min<ll>(lans,nums[i]);
}else if(cnt[nums[i]]>mxc){
mxc=cnt[nums[i]];
lans=nums[i];
}
}
if(lans==INF || mxc<w) ans[i]=-1;
else ans[i]=lans;
}else{
que.EB(bid,l,r,w,i);
}
}
sort(all(que),cmp);
ll lans=INF,mxc=0;
unordered_map<ll,ll> freq;
auto add=[&](ll num,ll cc){
freq[num]+=cc;
if(freq[num]==mxc){
lans=min(lans,num);
}else if(freq[num]>mxc){
mxc=freq[num];
lans=num;
}
};
auto minus=[&](ll num,ll cc){
freq[num]-=cc;
};
ll up=-1,upr=-1;
ll tmplans=INF,tmpmxc=0;
FOR(i,0,SZ(que)-1){
auto &[bid,l,r,w,id]=que[i];
if(bid==up){
up=bid;
for(;upr<=r;++upr){
add(nums[upr],1);
}
tmplans=lans,tmpmxc=mxc;
FOR(j,l,min<ll>((bid+1)*n-1,SZ(nums)-1)){
add(nums[j],1);
}
if(lans==INF || mxc<w) ans[id]=-1;
else ans[id]=lans;
lans=tmplans,mxc=tmpmxc;
FOR(j,l,min<ll>((bid+1)*n-1,SZ(nums)-1)){
minus(nums[j],1);
}
}else{
lans=INF,mxc=0;freq.clear();
up=bid;upr=(bid+1)*n;
for(;upr<=r;++upr){
add(nums[upr],1);
}
tmplans=lans,tmpmxc=mxc;
FOR(j,l,min<ll>((bid+1)*n-1,SZ(nums)-1)){
add(nums[j],1);
}
if(lans==INF || mxc<w) ans[id]=-1;
else ans[id]=lans;
lans=tmplans,mxc=tmpmxc;
FOR(j,l,min<ll>((bid+1)*n-1,SZ(nums)-1)){
minus(nums[j],1);
}
}
}
return ans;
}
};
|