Submission #142803

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
142803	2019-08-11T06:31:51 Z	cheetose	Employment (JOI16_employment)	C++11	100 / 100	441 ms	29796 KB

employment

#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[400005];
Vi v[400003];
int n,m,N;
Vi vv;
int tree[400005];
void upd(int i, int k)
{
	while (i <= N+1)
	{
		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 L[200005],R[200005];
void del(int x)
{
	int l=L[x],r=R[x];
	R[l]=r,L[r]=l;
}
int main() {
	scanf("%d%d",&n,&m);
	fup(i,1,n,1)
	{
		scanf("%d",a+i);
		vv.pb(a[i]);
	}
	if(n==1)
	{
		int o,x,y;
		fup(i,1,m,1)
		{
			scanf("%d%d",&o,&x);
			if(o==1)
			{
				if(a[1]>=x)puts("1");
				else puts("0");
			}
			else 
			{
				scanf("%d",&y);
				a[1]=y;
			}
		}
		return 0;
	}
	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;
	fup(i,1,n,1)
	{
		L[i]=i-1,R[i]=i+1;
	}
	fdn(i,N,1,1)
	{
		for(int j:v[i])
		{
			if(L[j]==j-1 && R[j]==j+1)t++;
			if(L[j]!=j-1 && R[j]!=j+1)t--;
			del(j);
		}
		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(B==y[i])continue;
			if(A>C)swap(A,C);
			if(B>C)upd(C+1,B,-1);
			if(A>0)
			{
				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:100: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:103:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d",a+i);
   ~~~~~^~~~~~~~~~
employment.cpp:111:9: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    scanf("%d%d",&o,&x);
    ~~~~~^~~~~~~~~~~~~~
employment.cpp:119:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d",&y);
     ~~~~~^~~~~~~~~
employment.cpp:127: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:130:9: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
    scanf("%d",y+i);
    ~~~~~^~~~~~~~~~

Subtask #1

10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	10 ms	9720 KB	Output is correct
2	Correct	10 ms	9720 KB	Output is correct
3	Correct	10 ms	9720 KB	Output is correct
4	Correct	12 ms	9976 KB	Output is correct
5	Correct	11 ms	9852 KB	Output is correct
6	Correct	11 ms	9848 KB	Output is correct
7	Correct	12 ms	9848 KB	Output is correct
8	Correct	11 ms	9848 KB	Output is correct
9	Correct	12 ms	9848 KB	Output is correct
10	Correct	13 ms	9976 KB	Output is correct
11	Correct	13 ms	9980 KB	Output is correct
12	Correct	13 ms	9976 KB	Output is correct
13	Correct	12 ms	9976 KB	Output is correct
14	Correct	13 ms	9976 KB	Output is correct
15	Correct	13 ms	9976 KB	Output is correct

Subtask #2

30.0 / 30.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	12 ms	9848 KB	Output is correct
2	Correct	13 ms	9976 KB	Output is correct
3	Correct	13 ms	9976 KB	Output is correct
4	Correct	27 ms	11000 KB	Output is correct
5	Correct	46 ms	12660 KB	Output is correct
6	Correct	66 ms	13556 KB	Output is correct
7	Correct	106 ms	16240 KB	Output is correct
8	Correct	132 ms	17648 KB	Output is correct
9	Correct	203 ms	21492 KB	Output is correct
10	Correct	235 ms	23788 KB	Output is correct
11	Correct	247 ms	21768 KB	Output is correct
12	Correct	285 ms	23272 KB	Output is correct
13	Correct	292 ms	23696 KB	Output is correct
14	Correct	282 ms	23276 KB	Output is correct
15	Correct	278 ms	23412 KB	Output is correct
16	Correct	293 ms	23624 KB	Output is correct
17	Correct	290 ms	23660 KB	Output is correct
18	Correct	296 ms	23916 KB	Output is correct
19	Correct	292 ms	23660 KB	Output is correct
20	Correct	298 ms	23660 KB	Output is correct

Subtask #3

60.0 / 60.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	10 ms	9720 KB	Output is correct
2	Correct	10 ms	9720 KB	Output is correct
3	Correct	10 ms	9720 KB	Output is correct
4	Correct	12 ms	9976 KB	Output is correct
5	Correct	11 ms	9852 KB	Output is correct
6	Correct	11 ms	9848 KB	Output is correct
7	Correct	12 ms	9848 KB	Output is correct
8	Correct	11 ms	9848 KB	Output is correct
9	Correct	12 ms	9848 KB	Output is correct
10	Correct	13 ms	9976 KB	Output is correct
11	Correct	13 ms	9980 KB	Output is correct
12	Correct	13 ms	9976 KB	Output is correct
13	Correct	12 ms	9976 KB	Output is correct
14	Correct	13 ms	9976 KB	Output is correct
15	Correct	13 ms	9976 KB	Output is correct
16	Correct	12 ms	9848 KB	Output is correct
17	Correct	13 ms	9976 KB	Output is correct
18	Correct	13 ms	9976 KB	Output is correct
19	Correct	27 ms	11000 KB	Output is correct
20	Correct	46 ms	12660 KB	Output is correct
21	Correct	66 ms	13556 KB	Output is correct
22	Correct	106 ms	16240 KB	Output is correct
23	Correct	132 ms	17648 KB	Output is correct
24	Correct	203 ms	21492 KB	Output is correct
25	Correct	235 ms	23788 KB	Output is correct
26	Correct	247 ms	21768 KB	Output is correct
27	Correct	285 ms	23272 KB	Output is correct
28	Correct	292 ms	23696 KB	Output is correct
29	Correct	282 ms	23276 KB	Output is correct
30	Correct	278 ms	23412 KB	Output is correct
31	Correct	293 ms	23624 KB	Output is correct
32	Correct	290 ms	23660 KB	Output is correct
33	Correct	296 ms	23916 KB	Output is correct
34	Correct	292 ms	23660 KB	Output is correct
35	Correct	298 ms	23660 KB	Output is correct
36	Correct	12 ms	9848 KB	Output is correct
37	Correct	13 ms	9976 KB	Output is correct
38	Correct	13 ms	9976 KB	Output is correct
39	Correct	32 ms	11384 KB	Output is correct
40	Correct	47 ms	12404 KB	Output is correct
41	Correct	77 ms	14064 KB	Output is correct
42	Correct	115 ms	16112 KB	Output is correct
43	Correct	148 ms	17512 KB	Output is correct
44	Correct	295 ms	24168 KB	Output is correct
45	Correct	237 ms	21396 KB	Output is correct
46	Correct	265 ms	22636 KB	Output is correct
47	Correct	349 ms	25444 KB	Output is correct
48	Correct	365 ms	25572 KB	Output is correct
49	Correct	362 ms	25548 KB	Output is correct
50	Correct	353 ms	25444 KB	Output is correct
51	Correct	441 ms	29668 KB	Output is correct
52	Correct	389 ms	29680 KB	Output is correct
53	Correct	348 ms	29676 KB	Output is correct
54	Correct	359 ms	29720 KB	Output is correct
55	Correct	356 ms	29796 KB	Output is correct