oj.uz

답안 #213257

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
213257 2020-03-25T11:36:20 Z dorijanlendvaj Cultivation (JOI17_cultivation) C++14
15 / 100
 2000 ms 2688 KB 
//DUEL
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define x first
#define y second
#define pii pair<int,int>
#define pb push_back
#define eb emplace_back
#pragma GCC optimize("unroll-loops")
#define shandom_ruffle(a, b) shuffle(a, b, rng)
#define vi vector<int>
#define vl vector<ll>
#define popcnt __builtin_popcount
#define popcntll __builtin_popcountll
#define all(a) begin(a),end(a)

using namespace std;
using namespace __gnu_pbds;

using ll=long long;
using ull=unsigned long long;
using ld=long double;
int MOD=1000000007;
int MOD2=998244353;
vector<int> bases;
const ll LLINF=1ll<<60;
const char en='\n';

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
void yes() {cout<<"YES"<<en; exit(0);}
void no() {cout<<"NO"<<en; exit(0);}
inline int rund() {int x576363482791fuweh=rng();return abs(x576363482791fuweh)%RAND_MAX;}
template<class T>
void prVec(vector<T> w,bool fl=false)
{
	cout<<w.size()<<en;
	for (int i=0;i<int(w.size())-1;++i) cout<<w[i]<<' ';
	if (w.size()) cout<<w[w.size()-1]<<en;
	if (fl) cout<<flush;
}

void M998()
{
	swap(MOD,MOD2);
}

ll raand()
{
	ll a=rund();
	a*=RAND_MAX;
	a+=rund();
    return a;
}

#define rand raand

ll raaand()
{
	return raand()*(MOD-7)+raand();
}

string to_upper(string a)
{
	for (int i=0;i<(int)a.size();++i) if (a[i]>='a' && a[i]<='z') a[i]-='a'-'A';
	return a;
}

string to_lower(string a)
{
	for (int i=0;i<(int)a.size();++i) if (a[i]>='A' && a[i]<='Z') a[i]+='a'-'A';
	return a;
}

ll sti(string a,int base=10)
{
	ll k=0;
	for (int i=0;i<(int)a.size();++i)
	{
		k*=base;
		k+=a[i]-'0';
	}
	return k;
}

template<class T>
void eras(vector<T>& a,T b)
{
	a.erase(find(a.begin(),a.end(),b));
}

string its(ll k,int base=10)
{
	if (k==0) return "0";
	string a;
	while (k)
	{
		a.push_back((k%base)+'0');
		k/=base;
	}
	reverse(a.begin(),a.end());
	return a;
}

ll min(ll a,int b)
{
	if (a<b) return a;
	return b;
}

ll min(int a,ll b)
{
	if (a<b) return a;
	return b;
}

ll max(ll a,int b)
{
	if (a>b) return a;
	return b;
}

ll max(int a,ll b)
{
	if (a>b) return a;
	return b;
}

ll gcd(ll a,ll b)
{
	if (b==0) return a;
	return gcd(b,a%b);
}

ll lcm(ll a,ll b)
{
	return a/gcd(a,b)*b;
}

template<class T,class K>
pair<T,K> mp(T a,K b)
{
	return make_pair(a,b);
}

inline int mult(ll a,ll b)
{
	return (a*b)%MOD;
}

inline int pot(int n,int k)
{
	if (k==0) return 1;
	ll a=pot(n,k/2);
	a=mult(a,a);
	if (k%2) return mult(a,n);
	else return a;
}

int divide(int a,int b)
{
	return mult(a,pot(b,MOD-2));
}

inline int sub(int a,int b)
{
	if (a-b>=0) return a-b;
	return a-b+MOD;
}

inline int add(int a,int b)
{
	if (a+b>=MOD) return a+b-MOD;
	return a+b;
}

bool prime(ll a)
{
	if (a==1) return 0;
	for (int i=2;i<=round(sqrt(a));++i)
	{
		if (a%i==0) return 0;
	}
	return 1;
}

const int N=300010;
int n,m,k;
int x[N],y[N];
vi a,b;

int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	for (int i=0;i<10;++i) bases.push_back(rand()%(MOD-13893829*2)+13893829);
	cin>>n>>m>>k;
	for (int i=0;i<k;++i)
	{
		cin>>x[i]>>y[i];
		a.pb(x[i]);
		b.pb(y[i]);
	}
	a.pb(0);
	a.pb(n+1);
	b.pb(0);
	b.pb(m+1);
	sort(all(a));
	sort(all(b));
	int mu=a[1]-1,md=n-a[a.size()-2],mud=0;
	for (int i=1;i<a.size();++i) mud=max(mud,a[i]-a[i-1]-1);
	int ml=b[1]-1,mr=m-b[b.size()-2],mlr=0;
	for (int i=1;i<b.size();++i) mlr=max(mlr,b[i]-b[i-1]-1);
	set<int> d1,d2;
	for (int i=0;i<a.size();++i) for (int j=i;j<a.size();++j) d1.insert(max(0,a[j]-a[i]-1));
	for (int i=0;i<b.size();++i) for (int j=i;j<b.size();++j) d2.insert(max(0,b[j]-b[i]-1));
	vi r1(all(d1)),r2(all(d2));
	set<int> a1,b1;
	a1.insert(1);
	a1.insert(n);
	b1.insert(1);
	b1.insert(m);
	for (auto u: a) if (u!=0 && u!=n+1) a1.insert(u);
	for (auto u: b) if (u!=0 && u!=m+1) b1.insert(u);
	ll ans=MOD*4ll;
	for (auto u: r1) for (auto d: r1) if (u>=mu && d>=md && u+d>=mud && u+d<=ans)
	{
		vi mil,mir;
		int mlr1=mlr;
		set<int> sy;
		for (int y1: b1)
		{
			int rr=MOD,rl=MOD;
			for (int i=0;i<k;++i) if (x[i]-1<=u)
			{
				if (y[i]<=y1) rr=min(rr,y1-y[i]);
				if (y[i]>=y1) rl=min(rl,y[i]-y1);
			}
			mil.pb(rl);
			mir.pb(rr);
		}
		for (int y1: b1)
		{
			int rr=MOD,rl=MOD;
			for (int i=0;i<k;++i) if (n-x[i]<=d)
			{
				if (y[i]<=y1) rr=min(rr,y1-y[i]);
				if (y[i]>=y1) rl=min(rl,y[i]-y1);
			}
			mil.pb(rl);
			mir.pb(rr);
		}
		for (int x1: a1)
		{
			int rr=MOD,rl=MOD;
			for (int i=0;i<k;++i)
			{
				bool ok=0;
				if (x[i]<=x1 && x1-x[i]<=d) ok=1;
				if (x[i]>=x1 && x[i]-x1<=u) ok=1;
				if (ok) rl=min(rl,y[i]-1);
			}
			mil.pb(rl);
			mir.pb(rr);
		}
		for (int x1: a1)
		{
			int rr=MOD,rl=MOD;
			for (int i=0;i<k;++i)
			{
				bool ok=0;
				if (x[i]<=x1 && x1-x[i]<=d) ok=1;
				if (x[i]>=x1 && x[i]-x1<=u) ok=1;
				if (ok) rr=min(rr,m-y[i]),sy.insert(y[i]);
			}
			int la=0;
			for (int y1: sy)
			{
				mlr1=max(mlr1,y1-la-1);
				la=y1;
			}
			sy.clear();
			mil.pb(rl);
			mir.pb(rr);
		}
		for (int x2: a1)
		{
			int x1=x2-u-1;
			if (x1<=1) continue;
			int rr=MOD,rl=MOD;
			for (int i=0;i<k;++i)
			{
				bool ok=0;
				if (x[i]<=x1 && x1-x[i]<=d) ok=1;
				if (x[i]>=x1 && x[i]-x1<=u) ok=1;
				if (ok) rl=min(rl,y[i]-1);
			}
			mil.pb(rl);
			mir.pb(rr);
		}
		for (int x2: a1)
		{
			int x1=x2-u-1;
			if (x1<=1) continue;
			int rr=MOD,rl=MOD;
			for (int i=0;i<k;++i)
			{
				bool ok=0;
				if (x[i]<=x1 && x1-x[i]<=d) ok=1;
				if (x[i]>=x1 && x[i]-x1<=u) ok=1;
				if (ok) rr=min(rr,m-y[i]),sy.insert(y[i]);
			}
			int la=0;
			for (int y1: sy)
			{
				mlr1=max(mlr1,y1-la-1);
				la=y1;
			}
			sy.clear();
			mil.pb(rl);
			mir.pb(rr);
		}
		for (int x2: a1)
		{
			int x1=x2+d+1;
			if (x1>=n) continue;
			int rr=MOD,rl=MOD;
			for (int i=0;i<k;++i)
			{
				bool ok=0;
				if (x[i]<=x1 && x1-x[i]<=d) ok=1;
				if (x[i]>=x1 && x[i]-x1<=u) ok=1;
				if (ok) rl=min(rl,y[i]-1),sy.insert(y[i]);
			}
			int la=0;
			for (int y1: sy)
			{
				mlr1=max(mlr1,y1-la-1);
				la=y1;
			}
			sy.clear();
			mil.pb(rl);
			mir.pb(rr);
		}
		for (int x2: a1)
		{
			int x1=x2+d+1;
			if (x1>=n) continue;
			int rr=MOD,rl=MOD;
			for (int i=0;i<k;++i)
			{
				bool ok=0;
				if (x[i]<=x1 && x1-x[i]<=d) ok=1;
				if (x[i]>=x1 && x[i]-x1<=u) ok=1;
				if (ok) rr=min(rr,m-y[i]);
			}
			mil.pb(rl);
			mir.pb(rr);
		}
		/*cout<<u<<' '<<d<<en;
		for (int i=0;i<mil.size();++i) cout<<mil[i]<<' '<<mir[i]<<en;*/
		for (ll l: mil) if (l>=ml)
		{
			ll r=0;
			for (int i=0;i<mir.size();++i) if (mil[i]>l) r=max(r,mir[i]);
			ans=min(ans,max(mlr1,l+max(r,mr))+u+d);
		}
		//cout<<ans<<en<<en<<en;
	}
	for (auto u: r1) for (auto ud: r1) if (u>=mu && ud-u>=md && ud>=mud && ud<=ans)
	{
		int d=ud-u;
		vi mil,mir;
		int mlr1=mlr;
		set<int> sy;
		for (int y1: b1)
		{
			int rr=MOD,rl=MOD;
			for (int i=0;i<k;++i) if (x[i]-1<=u)
			{
				if (y[i]<=y1) rr=min(rr,y1-y[i]);
				if (y[i]>=y1) rl=min(rl,y[i]-y1);
			}
			mil.pb(rl);
			mir.pb(rr);
		}
		for (int y1: b1)
		{
			int rr=MOD,rl=MOD;
			for (int i=0;i<k;++i) if (n-x[i]<=d)
			{
				if (y[i]<=y1) rr=min(rr,y1-y[i]);
				if (y[i]>=y1) rl=min(rl,y[i]-y1);
			}
			mil.pb(rl);
			mir.pb(rr);
		}
		for (int x1: a1)
		{
			int rr=MOD,rl=MOD;
			for (int i=0;i<k;++i)
			{
				bool ok=0;
				if (x[i]<=x1 && x1-x[i]<=d) ok=1;
				if (x[i]>=x1 && x[i]-x1<=u) ok=1;
				if (ok) rl=min(rl,y[i]-1);
			}
			mil.pb(rl);
			mir.pb(rr);
		}
		for (int x1: a1)
		{
			int rr=MOD,rl=MOD;
			for (int i=0;i<k;++i)
			{
				bool ok=0;
				if (x[i]<=x1 && x1-x[i]<=d) ok=1;
				if (x[i]>=x1 && x[i]-x1<=u) ok=1;
				if (ok) rr=min(rr,m-y[i]),sy.insert(y[i]);
			}
			int la=0;
			for (int y1: sy)
			{
				mlr1=max(mlr1,y1-la-1);
				la=y1;
			}
			sy.clear();
			mil.pb(rl);
			mir.pb(rr);
		}
		for (int x2: a1)
		{
			int x1=x2-u-1;
			if (x1<=1) continue;
			int rr=MOD,rl=MOD;
			for (int i=0;i<k;++i)
			{
				bool ok=0;
				if (x[i]<=x1 && x1-x[i]<=d) ok=1;
				if (x[i]>=x1 && x[i]-x1<=u) ok=1;
				if (ok) rl=min(rl,y[i]-1);
			}
			mil.pb(rl);
			mir.pb(rr);
		}
		for (int x2: a1)
		{
			int x1=x2-u-1;
			if (x1<=1) continue;
			int rr=MOD,rl=MOD;
			for (int i=0;i<k;++i)
			{
				bool ok=0;
				if (x[i]<=x1 && x1-x[i]<=d) ok=1;
				if (x[i]>=x1 && x[i]-x1<=u) ok=1;
				if (ok) rr=min(rr,m-y[i]),sy.insert(y[i]);
			}
			int la=0;
			for (int y1: sy)
			{
				mlr1=max(mlr1,y1-la-1);
				la=y1;
			}
			sy.clear();
			mil.pb(rl);
			mir.pb(rr);
		}
		for (int x2: a1)
		{
			int x1=x2+d+1;
			if (x1>=n) continue;
			int rr=MOD,rl=MOD;
			for (int i=0;i<k;++i)
			{
				bool ok=0;
				if (x[i]<=x1 && x1-x[i]<=d) ok=1;
				if (x[i]>=x1 && x[i]-x1<=u) ok=1;
				if (ok) rl=min(rl,y[i]-1),sy.insert(y[i]);
			}
			int la=0;
			for (int y1: sy)
			{
				mlr1=max(mlr1,y1-la-1);
				la=y1;
			}
			sy.clear();
			mil.pb(rl);
			mir.pb(rr);
		}
		for (int x2: a1)
		{
			int x1=x2+d+1;
			if (x1>=n) continue;
			int rr=MOD,rl=MOD;
			for (int i=0;i<k;++i)
			{
				bool ok=0;
				if (x[i]<=x1 && x1-x[i]<=d) ok=1;
				if (x[i]>=x1 && x[i]-x1<=u) ok=1;
				if (ok) rr=min(rr,m-y[i]);
			}
			mil.pb(rl);
			mir.pb(rr);
		}
		/*cout<<u<<' '<<d<<en;
		for (int i=0;i<mil.size();++i) cout<<mil[i]<<' '<<mir[i]<<en;*/
		for (ll l: mil) if (l>=ml)
		{
			ll r=0;
			for (int i=0;i<mir.size();++i) if (mil[i]>l) r=max(r,mir[i]);
			ans=min(ans,max(mlr1,l+max(r,mr))+u+d);
		}
		//cout<<ans<<en<<en<<en;
	}
	cout<<ans<<en;
}

Compilation message

cultivation.cpp: In function 'int main()':
cultivation.cpp:210:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i=1;i<a.size();++i) mud=max(mud,a[i]-a[i-1]-1);
               ~^~~~~~~~~
cultivation.cpp:212:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i=1;i<b.size();++i) mlr=max(mlr,b[i]-b[i-1]-1);
               ~^~~~~~~~~
cultivation.cpp:214:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i=0;i<a.size();++i) for (int j=i;j<a.size();++j) d1.insert(max(0,a[j]-a[i]-1));
               ~^~~~~~~~~
cultivation.cpp:214:45: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i=0;i<a.size();++i) for (int j=i;j<a.size();++j) d1.insert(max(0,a[j]-a[i]-1));
                                            ~^~~~~~~~~
cultivation.cpp:215:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i=0;i<b.size();++i) for (int j=i;j<b.size();++j) d2.insert(max(0,b[j]-b[i]-1));
               ~^~~~~~~~~
cultivation.cpp:215:45: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i=0;i<b.size();++i) for (int j=i;j<b.size();++j) d2.insert(max(0,b[j]-b[i]-1));
                                            ~^~~~~~~~~
cultivation.cpp:364:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    for (int i=0;i<mir.size();++i) if (mil[i]>l) r=max(r,mir[i]);
                 ~^~~~~~~~~~~
cultivation.cpp:509:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
    for (int i=0;i<mir.size();++i) if (mil[i]>l) r=max(r,mir[i]);
                 ~^~~~~~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
15 Correct 5 ms 384 KB Output is correct
16 Correct 5 ms 384 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
15 Correct 5 ms 384 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 12 ms 384 KB Output is correct
18 Correct 25 ms 384 KB Output is correct
19 Correct 67 ms 384 KB Output is correct
20 Correct 10 ms 384 KB Output is correct
21 Correct 369 ms 384 KB Output is correct
22 Correct 167 ms 384 KB Output is correct
23 Correct 18 ms 384 KB Output is correct
24 Correct 191 ms 384 KB Output is correct
25 Correct 217 ms 384 KB Output is correct
26 Correct 476 ms 504 KB Output is correct
27 Correct 278 ms 480 KB Output is correct
28 Correct 205 ms 384 KB Output is correct
29 Correct 121 ms 504 KB Output is correct
30 Correct 154 ms 432 KB Output is correct
31 Correct 112 ms 384 KB Output is correct
32 Correct 175 ms 428 KB Output is correct

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
15 Correct 5 ms 384 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 12 ms 384 KB Output is correct
18 Correct 25 ms 384 KB Output is correct
19 Correct 67 ms 384 KB Output is correct
20 Correct 10 ms 384 KB Output is correct
21 Correct 369 ms 384 KB Output is correct
22 Correct 167 ms 384 KB Output is correct
23 Correct 18 ms 384 KB Output is correct
24 Correct 191 ms 384 KB Output is correct
25 Correct 217 ms 384 KB Output is correct
26 Correct 476 ms 504 KB Output is correct
27 Correct 278 ms 480 KB Output is correct
28 Correct 205 ms 384 KB Output is correct
29 Correct 121 ms 504 KB Output is correct
30 Correct 154 ms 432 KB Output is correct
31 Correct 112 ms 384 KB Output is correct
32 Correct 175 ms 428 KB Output is correct
33 Correct 28 ms 2688 KB Output is correct
34 Execution timed out 2089 ms 2688 KB Time limit exceeded
35 Halted 0 ms 0 KB -

Subtask #4
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 952 ms 424 KB Output is correct
2 Execution timed out 2086 ms 384 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #5
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 952 ms 424 KB Output is correct
2 Execution timed out 2086 ms 384 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #6
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 5 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 5 ms 384 KB Output is correct
10 Correct 5 ms 384 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 5 ms 384 KB Output is correct
15 Correct 5 ms 384 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 12 ms 384 KB Output is correct
18 Correct 25 ms 384 KB Output is correct
19 Correct 67 ms 384 KB Output is correct
20 Correct 10 ms 384 KB Output is correct
21 Correct 369 ms 384 KB Output is correct
22 Correct 167 ms 384 KB Output is correct
23 Correct 18 ms 384 KB Output is correct
24 Correct 191 ms 384 KB Output is correct
25 Correct 217 ms 384 KB Output is correct
26 Correct 476 ms 504 KB Output is correct
27 Correct 278 ms 480 KB Output is correct
28 Correct 205 ms 384 KB Output is correct
29 Correct 121 ms 504 KB Output is correct
30 Correct 154 ms 432 KB Output is correct
31 Correct 112 ms 384 KB Output is correct
32 Correct 175 ms 428 KB Output is correct
33 Correct 28 ms 2688 KB Output is correct
34 Execution timed out 2089 ms 2688 KB Time limit exceeded
35 Halted 0 ms 0 KB -