oj.uz

Submission #741882

# Submission time Handle Problem Language Result Execution time Memory
741882 2023-05-15T03:27:37 Z jamezzz Modern Machine (JOI23_ho_t5) C++17
0 / 100
 9 ms 1364 KB 
#include <bits/stdc++.h>
using namespace std;

#define sf scanf
#define pf printf
#define fi first
#define se second
#define pb push_back
#define INF 2023456789
#define all(x) x.begin(),x.end()
typedef pair<int,int> ii;
typedef long long ll;

#define maxn 120005

int n,m,q,c[maxn],a[maxn];

struct node{
	int s,e,m,v,lz;
	node *l,*r;
	node(int _s,int _e){
		s=_s,e=_e,m=(s+e)>>1,lz=-1;
		if(s!=e){
			l=new node(s,m),r=new node(m+1,e);
			v=l->v+r->v;
		}
		else v=c[s];
	}
	void ppo(){
		if(lz!=-1){
			v=(e-s+1)*lz;
			if(s!=e){
				l->lz=lz;
				r->lz=lz;
			}
			lz=-1;
		}
	}
	void up(int x,int y,int nv){
		if(s==x&&e==y){lz=nv;return;}
		if(y<=m)l->up(x,y,nv);
		else if(x>m)r->up(x,y,nv);
		else l->up(x,m,nv),r->up(m+1,y,nv);
		l->ppo(),r->ppo();
		v=l->v+r->v;
	}
	int qry(int x,int y){
		if(x>y)return 0;
		ppo();
		if(s==x&&e==y)return v;
		if(y<=m)return l->qry(x,y);
		if(x>m)return r->qry(x,y);
		return l->qry(x,m)+r->qry(m+1,y);
	}
	int findR(int num){
		ppo();
		if(s==e){
			if(num==1&&v==0)return s;
			else return -1;
		}
		l->ppo(),r->ppo();
		int lnum=l->e-l->s+1-l->v;
		if(lnum>=num)return l->findR(num);
		else return r->findR(num-lnum);
	}
	int findB(int num){
		ppo();
		if(s==e){
			if(num==1&&v==1)return s;
			else return -1;
		}
		l->ppo(),r->ppo();
		if(l->v>=num)return l->findB(num);
		else return r->findB(num-l->v);
	}
}*rt;

int main(){
	sf("%d%d",&n,&m);
	for(int i=1;i<=n;++i){
		char ch;sf(" %c",&ch);
		c[i]=(ch=='B');
	}
	for(int i=1;i<=m;++i)sf("%d",&a[i]);
	sf("%d",&q);
	for(int _=0;_<q;++_){
		int l,r;sf("%d%d",&l,&r);
		rt=new node(1,n);
		for(int i=l;i<=r;++i){
			rt->up(a[i],a[i],0);
			int lv=a[i]-1-rt->qry(1,a[i]-1);//number of R
			int rv=rt->qry(a[i]+1,n);//number of B
			if(rv<=lv){//the rv-th R to n become B
				int x=lv-rv+1;
				int p=rt->findR(x);
				rt->up(p,n,1);
			}
			else{//1 to the lv+1-th B become R
				int x=rt->qry(1,a[i])+lv+1;
				int p=rt->findB(x);
				rt->up(1,p,0);
			}
		}
		pf("%d\n",n-rt->qry(1,n));
	}
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:79:4: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   79 |  sf("%d%d",&n,&m);
      |    ^
Main.cpp:81:13: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   81 |   char ch;sf(" %c",&ch);
      |             ^
Main.cpp:84:25: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   84 |  for(int i=1;i<=m;++i)sf("%d",&a[i]);
      |                         ^
Main.cpp:85:4: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   85 |  sf("%d",&q);
      |    ^
Main.cpp:87:13: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   87 |   int l,r;sf("%d%d",&l,&r);
      |             ^

Subtask #1
0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Runtime error 2 ms 468 KB Execution killed with signal 11
8 Halted 0 ms 0 KB -

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Runtime error 2 ms 468 KB Execution killed with signal 11
8 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Runtime error 2 ms 468 KB Execution killed with signal 11
8 Halted 0 ms 0 KB -

Subtask #4
0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Runtime error 9 ms 1364 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #5
0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Runtime error 9 ms 1364 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Runtime error 9 ms 1364 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #7
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Runtime error 2 ms 468 KB Execution killed with signal 11
8 Halted 0 ms 0 KB -