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
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
| #include<bits/stdc++.h>
using namespace std;
struct node{
mutable long long value;
long long l,r;
bool operator <(const node &a) const
{
return l<a.l;
}
};
set<node>s;
long long n,m,seed,vmax;
pair<long long,long long> a[100001];
inline bool cmp(pair<long long,long long> a,pair<long long,long long> b)
{
return a.first<b.first;
}
inline void ins(long long num,long long x)
{
s.insert((node){x,num,num});
}
inline set<node>::iterator split(long long pos)
{
set<node>::iterator it=s.lower_bound((node){0,pos,0});
if(it!=s.end()&&it->l==pos)
{
return it;
}
it--;
long long l=it->l,r=it->r,value=it->value;
s.erase(it);
s.insert((node){value,l,pos-1});
return s.insert((node){value,pos,r}).first;
}
inline void add(long long l,long long r,long long x)
{
set<node>::iterator right=split(r+1);
set<node>::iterator left=split(l);
for(set<node>::iterator i=left;i!=right;i++)
{
i->value+=x;
}
return ;
}
inline void flat(long long l,long long r,long long x)
{
set<node>::iterator right=split(r+1);
set<node>::iterator left=split(l);
s.erase(left,right);
s.insert((node){x,l,r});
return ;
}
inline void find(long long l,long long r,long long x)
{
set<node>::iterator right=split(r+1);
set<node>::iterator left=split(l);
long long tot=0;
for(set<node>::iterator i=left;i!=right;i++)
{
a[++tot].first=i->value;
a[tot].second=i->r-i->l+1;
}
sort(a+1,a+tot+1,cmp);
for(int i=1;i<=tot;i++)
{
x-=a[i].second;
if(x<=0)
{
printf("%lld\n",a[i].first);
return ;
}
}
}
inline long long kasumi(long long a,long long k,long long y)
{
long long ans=1;
a%=y;
while(k)
{
if(k%2)
{
ans*=a;
ans%=y;
}
k/=2;
a*=a;
a%=y;
}
return ans;
}
inline void powersum(long long l,long long r,long long x,long long y)
{
set<node>::iterator right=split(r+1);
set<node>::iterator left=split(l);
long long ans=0;
for(set<node>::iterator i=left;i!=right;i++)
{
ans+=kasumi(i->value,x,y)*(i->r-i->l+1)%y;
ans%=y;
}
printf("%lld\n",ans);
}
inline long long rrand()
{
long long ans=seed;
seed=(seed*7+13)%1000000007;
return ans;
}
int main()
{
cin>>n>>m>>seed>>vmax;
for(int i=1;i<=n;i++)
{
ins(i,rrand()%vmax+1);
}
long long op,l,r,x,y;
for(int i=1;i<=m;i++)
{
op=rrand()%4+1;
l=rrand()%n+1;
r=rrand()%n+1;
if(l>r)
{
swap(l,r);
}
if(op==3)
{
x=(rrand()%(r-l+1))+1;
}
else
{
x=(rrand()%vmax)+1;
}
if(op==4)
{
y=(rrand()%vmax)+1;
}
switch(op)
{
case 1:
{
add(l,r,x);
break;
}
case 2:
{
flat(l,r,x);
break;
}
case 3:
{
find(l,r,x);
break;
}
case 4:
{
powersum(l,r,x,y);
break;
}
}
}
return 0;
}
|