Submission #57323879

Source Code Expand

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
#include<bits/stdc++.h>
#define file(NAME)\
  freopen(NAME".in","r",stdin);\
  freopen(NAME".out","w",stdout);
#define ll long long
#define pii pair<ll,ll>
#define rep(i,l,r) for(ll i=l;i<=r;i++)
#define per(i,l,r) for(ll i=r;i>=l;i--)
using namespace std;
mt19937 rnd(random_device{}());
const int N=2e5+5,M=1e6;
ll h,w,n,d[M],g;
pii a[N];
map<ll,ll> ls;
#define X 1,w,1
#define Y int x,int y,int p
#define D int mid=(x+y)/2
#define L x,mid,p*2
#define R mid+1,y,p*2+1
pii t[N*5];
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

#include<bits/stdc++.h>
#define file(NAME)\
	freopen(NAME".in","r",stdin);\
	freopen(NAME".out","w",stdout);
#define ll long long
#define pii pair<ll,ll>
#define rep(i,l,r) for(ll i=l;i<=r;i++)
#define per(i,l,r) for(ll i=r;i>=l;i--)
using namespace std;
mt19937 rnd(random_device{}());
const int N=2e5+5,M=1e6;
ll h,w,n,d[M],g;
pii a[N];
map<ll,ll> ls;

#define X 1,w,1
#define Y int x,int y,int p
#define D int mid=(x+y)/2
#define L x,mid,p*2
#define R mid+1,y,p*2+1
pii t[N*5];
pii fnd(Y,int l,int r)
{
	if(x>r||y<l) return make_pair(0,0);
	if(l<=x&&y<=r) return t[p];
	D;return max(fnd(L,l,r),fnd(R,l,r));
}
void cng(Y,int w,pii v)
{
	if(x==y) {t[p]=max(t[p],v);return;}
	D;
	if(mid>=w) cng(L,w,v);
	else cng(R,w,v);
	t[p]=max(t[p*2],t[p*2+1]);
}

int main()
{
	scanf("%lld%lld%lld",&h,&w,&n);
	rep(i,1,n) scanf("%lld%lld",&a[i].first,&a[i].second);
	a[++n].first=1,a[n].second=1;
	a[++n].first=h,a[n].second=w;
	sort(a+1,a+n+1);
	rep(i,1,n)
	{
		pii j=fnd(X,1,a[i].second);
		ll p=(a[i].first-1)*w+a[i].second;
		ls[p]=j.second,j.second=p;
		if(p==1||p==h*w) j.first+=1e9;
		else j.first++;
		cng(X,a[i].second,j);
	}
	printf("%lld\n",fnd(X,1,w).first-(ll)2e9);
	for(ll i=fnd(X,1,w).second;i!=1;i=ls[i])
	{
		ll ii=ls[i];
		while((ii-1)/w!=(i-1)/w) d[++g]=1,ii+=w;
		while(ii!=i) d[++g]=0,ii++;
	}
	per(i,1,g) printf(d[i]?"D":"R");
	return 0;
}

Submission Info

Compile Error

Main.cpp: In function ‘int main()’:
Main.cpp:39:14: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
   39 |         scanf("%lld%lld%lld",&h,&w,&n);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:40:25: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
   40 |         rep(i,1,n) scanf("%lld%lld",&a[i].first,&a[i].second);
      |                    ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Judge Result