#include<cstdio>
#include<cstdlib>
#include<iostream>
#include<vector>
#include<queue>
#include<bitset>
#include<string>
#include<stack>
#include<set>
#include<unordered_set>
#include<map>
#include<unordered_map>
#include<cstring>
#include<complex>
#include<cmath>
#include<iomanip>
#include<numeric>
#include<algorithm>
#include<list>
#include<functional>
#include<cassert>
#define mp make_pair
#define pb push_back
#define X first
#define Y second
#define y0 y12
#define y1 y22
#define INF 987654321987654321
#define PI 3.141592653589793238462643383279502884
#define fup(i,a,b,c) for(int (i)=(a);(i)<=(b);(i)+=(c))
#define fdn(i,a,b,c) for(int (i)=(a);(i)>=(b);(i)-=(c))
#define MEM0(a) memset((a),0,sizeof(a));
#define MEM_1(a) memset((a),-1,sizeof(a));
#define ALL(a) a.begin(),a.end()
#define SYNC ios_base::sync_with_stdio(false);cin.tie(0)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef double db;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair<int, int> Pi;
typedef pair<ll, ll> Pll;
typedef pair<ld, ld> Pd;
typedef vector<int> Vi;
typedef vector<ll> Vll;
typedef vector<double> Vd;
typedef vector<Pi> VPi;
typedef vector<Pll> VPll;
typedef vector<Pd> VPd;
typedef tuple<int, int, int> iii;
typedef tuple<int,int,int,int> iiii;
typedef tuple<ll, ll, ll> LLL;
typedef vector<iii> Viii;
typedef vector<LLL> VLLL;
typedef complex<double> base;
const ll MOD = 1000000007;
ll POW(ll a, ll b, ll MMM = MOD) {ll ret=1; for(;b;b>>=1,a=(a*a)%MMM)if(b&1)ret=(ret*a)% MMM; return ret; }
ll gcd(ll a, ll b) { return b ? gcd(b, a%b) : a; }
ll lcm(ll a, ll b) { if (a == 0 || b == 0)return a + b; return a*(b / gcd(a, b)); }
int dx[] = { 0,1,0,-1,1,1,-1,-1 }, dy[] = { 1,0,-1,0,1,-1,1,-1 };
int a[200005];
int o[200005],x[200005],y[200005];
int init[400001];
Vi v[400001];
int n,m,N;
Vi vv;
int tree[400002];
void upd(int i, int k)
{
while (i <= N)
{
tree[i] += k;
i += (i&-i);
}
}
int sum(int i)
{
int c = 0;
while (i > 0)
{
c += tree[i];
i -= (i&-i);
}
return c;
}
void upd(int L,int R,int k)
{
upd(L,k);
upd(R+1,-k);
}
int main() {
scanf("%d%d",&n,&m);
fup(i,1,n,1)
{
scanf("%d",a+i);
vv.pb(a[i]);
}
fup(i,1,m,1)
{
scanf("%d%d",o+i,x+i);
if(o[i]==2)
{
scanf("%d",y+i);
vv.pb(y[i]);
}
}
sort(ALL(vv));
vv.resize(unique(ALL(vv))-vv.begin());
N=vv.size();
fup(i,1,n,1)
{
a[i]=lower_bound(ALL(vv),a[i])-vv.begin()+1;
v[a[i]].pb(i);
}
fup(i,1,m,1)if(o[i]==2)y[i]=lower_bound(ALL(vv),y[i])-vv.begin()+1;
int t=0;
fdn(i,N,1,1)
{
for(int j:v[i])
{
if(a[j-1]<i && a[j+1]<i)t++;
if(a[j-1]>=i && a[j+1]>i)t--;
}
init[i]=t;
}
fup(i,1,m,1)
{
if(o[i]==1)
{
int tt=lower_bound(ALL(vv),x[i])-vv.begin()+1;
printf("%d\n",init[tt]+sum(tt));
}
else
{
int A=a[x[i]-1],B=a[x[i]],C=a[x[i]+1];
if(A>C)swap(A,C);
if(B>C)upd(C+1,B,-1);
if(A<=B)upd(1,A,1);
else upd(1,B,1);
if(A<=y[i])upd(1,A,-1);
else upd(1,y[i],-1);
if(y[i]>C)upd(C+1,y[i],1);
a[x[i]]=y[i];
}
}
}
Compilation message
employment.cpp: In function 'int main()':
employment.cpp:94:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d",&n,&m);
~~~~~^~~~~~~~~~~~~~
employment.cpp:97:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%d",a+i);
~~~~~^~~~~~~~~~
employment.cpp:102:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d",o+i,x+i);
~~~~~^~~~~~~~~~~~~~~~
employment.cpp:105:9: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%d",y+i);
~~~~~^~~~~~~~~~
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
10 ms |
9720 KB |
Output is correct |
| 2 |
Incorrect |
10 ms |
9720 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
11 ms |
9848 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
10 ms |
9720 KB |
Output is correct |
| 2 |
Incorrect |
10 ms |
9720 KB |
Output isn't correct |
| 3 |
Halted |
0 ms |
0 KB |
- |
