oj.uz

Submission #414404

# Submission time Handle Problem Language Result Execution time Memory
414404 2021-05-30T11:58:33 Z amoo_safar Cultivation (JOI17_cultivation) C++17
80 / 100
 2000 ms 48888 KB 
// vaziat meshki-ghermeze !
#include <bits/stdc++.h>

#define pb push_back
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define debug(x) cerr << #x << " : " << x << '\n'
#define int ll
using namespace std;

typedef long long ll;
typedef long double ld;
typedef string str;
typedef pair<int, int> pii;

const ll Mod = 1000000007LL;
const int N = 3e2 + 10;
const int Inf = 2'000'000'001;
const ll Log = 30;

int n, R, C;
pii A[N];

// 0, x, y -> C + R < x -> y
// 1, x, y -> C < x -> y
// 2, x, y -> R < x -> y
typedef pii con;
typedef pair<con, int> Query;
vector<Query> Q, TQ, V0, V1;
typedef pair<con, con> iff;
vector< pair<iff, int> > cons;

bool Better(con A, con B){
	if(A.F != B.F)
		return false;
	return A.S >= B.S;
}
bool Better(iff A, iff B){
	return Better(A.F, B.F) && Better(A.S, B.S);
}
bool Sat(con A, int i, int j){
	if(A.F == 0)
		return i + j < A.S;
	if(A.F == 1)
		return i < A.S;
	return j < A.S;
}
void Check(int l, int r){
	int ln = r - l - 1;
	vector<int> V;
	for(int k = 1; k <= n; k++){
		if(l < A[k].F && A[k].F < r)
			V.pb(A[k].S);
	}
	sort(all(V));

	int sz = Q.size();
	vector< pair<con, int> > tmp;
	if(!V.empty() && V[0] > 1)
		tmp.pb({{1, V[0] - 1}, ln});
	if(!V.empty() && V.back() < C)
		tmp.pb({{2, C - V.back()}, ln});
	for(int i = 0; i + 1 < (int) V.size(); i++){
		if(0 < V[i + 1] - V[i] - 1)
			tmp.pb({{0, V[i + 1] - V[i] - 1}, ln});
	}
	if(V.empty())
		tmp.pb({{1, C}, ln});
	sort(all(tmp));
	int cnt = 0;
	for(int i = 0; i < (int) tmp.size(); i++)
		if((i + 1 == (int) tmp.size()) || (!Better(tmp[i + 1].F, tmp[i].F)) )
			Q.pb(tmp[i]), cnt ++;
	// cerr << "!! " << ' ' << cnt << '\n';
	for(int i = sz; i < (int) Q.size(); i++)
		TQ.pb(Q[i]);
	// Q.resize(sz);
}

int ans[N][N]; // C R

pii Inter(pii A, pii B){ return pii(max(A.F, B.F), min(A.S, B.S)); }
pii Inter(con c, int v){
	if(c.F == 0){
		if(v < c.S)
			return pii(0, v + 1);
		return pii(v + 1, 0);
	} else if(c.F == 1){
		return pii(0, c.S);
	}
	return pii((v - c.S) + 1, v + 1);
}
pii Inter(iff c, int v){ return Inter(Inter(c.F, v), Inter(c.S, v)); }

vector<iff> act;

void Uni(){
	vector<iff> tmp = act;
	act.clear();
	sort(all(tmp),[&](auto e1, auto e2){
		if(e1.F.F != e2.F.F)
			return e1.F.F < e2.F.F;
		if(e1.S.F != e2.S.F)
			return e1.S.F < e2.S.F;
		return pii(e1.F.S, e1.S.S) < pii(e2.F.S, e2.S.S);
	});

	for(int i = 0; i < (int) tmp.size(); i++)
		if((i + 1 == (int) tmp.size()) || (!Better(tmp[i + 1], tmp[i])) )
			act.pb(tmp[i]);

}
bool Valid(int v){
	// return false;
	// vector<int> mk(v + 1, 0);
	// v = min(C - 1 + C - 1, v);
	// for(int i = 0, j = v; i < C; i++, j--)
	// 	if(0 <= j && j < C && ans[i][j] == 0)
	// 		return true;
	// return false;
	
	pii seg = pii(0, C);
	if(v < C)
		seg = pii(0, v + 1);
	else
		seg = pii(v - (C - 1), C);
	// cerr << "!! " << v << ' ' << seg.F << ' ' << seg.S << '\n';

	vector<pii> Al;
	for(auto fi : act){
		pii X = Inter(fi, v);
		X = Inter(X, seg);
		// X.S = min(X.S, v + 1);
		// X.F = max(X.F, 0);
		if(X.F >= X.S) continue;
		Al.pb(X);
		// for(int i = X.F; i < X.S; i++) mk[i] = 1;
	}
	sort(all(Al));
	int nw = seg.F;
	for(auto [l, r] : Al){
		if(nw < l)
			return true;
		nw = max(nw, r);
	}
	if(nw != seg.S)
		return true;
	return false;
	// for(int i = 0; i <= v; i++){
	// 	if(i < C && v - i < C && mk[i] == 0)
	// 		return true;
	// }
	// return false;
}

int32_t main(){
	ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
	cin >> R >> C >> n;
	for(int i = 1; i <= n; i++){
		cin >> A[i].F >> A[i].S;
	}
	sort(A + 1, A + n + 1);
	// vector<int> V;
	// sort(all(V));
	// for(int i = 1; i <= n; i++) V.pb(A[i].S);
	// int mn_S = 0;
	// for(int i = 0; i < n; i++)
	// 	mn_S = max(mn_S, V[i + 1] - V[i] - 1);
	// Check(0, R + 1);
	// int mx = (A[1].F - 1) + (R - A[n].F);
	Check(0, R + 1);
	for(auto &[cn, sm] : Q)
		sm = Inf;

	// debug(Q.size());

	TQ.clear();
	int sz = Q.size();
	for(int i = 1; i <= n; i++)
		Check(0, A[i].F);
	Q.resize(sz);
	V0 = TQ; TQ.clear();
	for(int i = 1; i <= n; i++)
		Check(A[i].F, R + 1);
	Q.resize(sz);
	V1 = TQ; TQ.clear();
	for(auto [c1, v1] : V0)
		for(auto [c2, v2] : V1)
			cons.pb({{min(c1, c2), max(c1, c2)}, v1 + v2});
	// debug(Q.size());
	Q.resize(sz);
	// debug(Q.size());

	for(int i = 1; i <= n; i++)
		for(int j = i + 1; j <= n; j++)
			if(A[j].F - 1 > A[i].F)
				Check(A[i].F, A[j].F);
	// debug(Q.size());
	for(auto [c1, v1] : Q)
		cons.pb({{c1, c1}, v1});
	
	sort(all(cons), [&](auto e1, auto e2){
		return e1.S > e2.S;
	});
	
	// debug("X");
	// debug(cons.size());
	ll ANS = R + C;
	cons.pb({{{0, 0}, {0, 0}}, 0});
	int la = -1;
	for(auto [fi, v] : cons){
		// debug(v);
		// int CC = C + C;
		// for(int i = 0; i < C; i++){
		// 	for(int j = 0; j < C; j++)
		// 		if(!ans[i][j])
		// 			// CC = min(CC, i + j);
		// 			ANS = min(ANS, i + j + v);
		// }
		if(la == v){
			act.pb(fi);
			continue;
		}
		la = v;
		if(v == Inf){
			act.pb(fi);
			continue;
		}
		Uni();
		int L = -1, Rb = C + C - 1;
		int mid;
		while(L + 1 < Rb){
			mid = (L + Rb) >> 1;
			if(Valid(mid)) Rb = mid;
			else L = mid;
		}
		if(Rb != C + C - 1)
			ANS = min(ANS, 0ll + Rb + v);
		// la = v;
		act.pb(fi);
	}
	// debug(ANS);
	cout << ANS << '\n';
	return 0;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 460 KB Output is correct
18 Correct 5 ms 1348 KB Output is correct
19 Correct 2 ms 560 KB Output is correct
20 Correct 2 ms 560 KB Output is correct
21 Correct 4 ms 1160 KB Output is correct
22 Correct 22 ms 3844 KB Output is correct
23 Correct 2 ms 684 KB Output is correct
24 Correct 49 ms 4528 KB Output is correct
25 Correct 29 ms 3788 KB Output is correct
26 Correct 178 ms 27900 KB Output is correct
27 Correct 145 ms 9868 KB Output is correct
28 Correct 67 ms 7296 KB Output is correct
29 Correct 143 ms 8732 KB Output is correct
30 Correct 137 ms 9144 KB Output is correct
31 Correct 193 ms 9980 KB Output is correct
32 Correct 135 ms 8492 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 460 KB Output is correct
18 Correct 5 ms 1348 KB Output is correct
19 Correct 2 ms 560 KB Output is correct
20 Correct 2 ms 560 KB Output is correct
21 Correct 4 ms 1160 KB Output is correct
22 Correct 22 ms 3844 KB Output is correct
23 Correct 2 ms 684 KB Output is correct
24 Correct 49 ms 4528 KB Output is correct
25 Correct 29 ms 3788 KB Output is correct
26 Correct 178 ms 27900 KB Output is correct
27 Correct 145 ms 9868 KB Output is correct
28 Correct 67 ms 7296 KB Output is correct
29 Correct 143 ms 8732 KB Output is correct
30 Correct 137 ms 9144 KB Output is correct
31 Correct 193 ms 9980 KB Output is correct
32 Correct 135 ms 8492 KB Output is correct
33 Correct 85 ms 28984 KB Output is correct
34 Correct 508 ms 44112 KB Output is correct
35 Correct 467 ms 44056 KB Output is correct
36 Correct 530 ms 43568 KB Output is correct
37 Correct 524 ms 43608 KB Output is correct
38 Correct 597 ms 44428 KB Output is correct
39 Correct 529 ms 41596 KB Output is correct
40 Correct 595 ms 44224 KB Output is correct
41 Correct 138 ms 37096 KB Output is correct
42 Correct 266 ms 48888 KB Output is correct
43 Correct 371 ms 24844 KB Output is correct
44 Correct 434 ms 43504 KB Output is correct

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 556 KB Output is correct
2 Correct 11 ms 688 KB Output is correct
3 Correct 12 ms 688 KB Output is correct
4 Correct 13 ms 688 KB Output is correct
5 Correct 12 ms 688 KB Output is correct
6 Correct 5 ms 688 KB Output is correct
7 Correct 3 ms 688 KB Output is correct
8 Correct 11 ms 688 KB Output is correct
9 Correct 7 ms 688 KB Output is correct
10 Correct 10 ms 688 KB Output is correct
11 Correct 11 ms 688 KB Output is correct
12 Correct 11 ms 688 KB Output is correct
13 Correct 2 ms 460 KB Output is correct
14 Correct 5 ms 560 KB Output is correct
15 Correct 6 ms 688 KB Output is correct
16 Correct 16 ms 688 KB Output is correct
17 Correct 12 ms 688 KB Output is correct
18 Correct 8 ms 692 KB Output is correct
19 Correct 12 ms 688 KB Output is correct
20 Correct 17 ms 812 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 556 KB Output is correct
2 Correct 11 ms 688 KB Output is correct
3 Correct 12 ms 688 KB Output is correct
4 Correct 13 ms 688 KB Output is correct
5 Correct 12 ms 688 KB Output is correct
6 Correct 5 ms 688 KB Output is correct
7 Correct 3 ms 688 KB Output is correct
8 Correct 11 ms 688 KB Output is correct
9 Correct 7 ms 688 KB Output is correct
10 Correct 10 ms 688 KB Output is correct
11 Correct 11 ms 688 KB Output is correct
12 Correct 11 ms 688 KB Output is correct
13 Correct 2 ms 460 KB Output is correct
14 Correct 5 ms 560 KB Output is correct
15 Correct 6 ms 688 KB Output is correct
16 Correct 16 ms 688 KB Output is correct
17 Correct 12 ms 688 KB Output is correct
18 Correct 8 ms 692 KB Output is correct
19 Correct 12 ms 688 KB Output is correct
20 Correct 17 ms 812 KB Output is correct
21 Correct 160 ms 5572 KB Output is correct
22 Correct 224 ms 5584 KB Output is correct
23 Correct 211 ms 5572 KB Output is correct
24 Correct 152 ms 5572 KB Output is correct
25 Correct 207 ms 5536 KB Output is correct
26 Correct 25 ms 1344 KB Output is correct
27 Correct 459 ms 6656 KB Output is correct
28 Correct 236 ms 5572 KB Output is correct
29 Correct 233 ms 5572 KB Output is correct
30 Correct 258 ms 5564 KB Output is correct
31 Correct 218 ms 5572 KB Output is correct
32 Correct 158 ms 3776 KB Output is correct
33 Correct 458 ms 5572 KB Output is correct
34 Correct 220 ms 5608 KB Output is correct
35 Correct 216 ms 5664 KB Output is correct
36 Correct 184 ms 5572 KB Output is correct

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 460 KB Output is correct
18 Correct 5 ms 1348 KB Output is correct
19 Correct 2 ms 560 KB Output is correct
20 Correct 2 ms 560 KB Output is correct
21 Correct 4 ms 1160 KB Output is correct
22 Correct 22 ms 3844 KB Output is correct
23 Correct 2 ms 684 KB Output is correct
24 Correct 49 ms 4528 KB Output is correct
25 Correct 29 ms 3788 KB Output is correct
26 Correct 178 ms 27900 KB Output is correct
27 Correct 145 ms 9868 KB Output is correct
28 Correct 67 ms 7296 KB Output is correct
29 Correct 143 ms 8732 KB Output is correct
30 Correct 137 ms 9144 KB Output is correct
31 Correct 193 ms 9980 KB Output is correct
32 Correct 135 ms 8492 KB Output is correct
33 Correct 85 ms 28984 KB Output is correct
34 Correct 508 ms 44112 KB Output is correct
35 Correct 467 ms 44056 KB Output is correct
36 Correct 530 ms 43568 KB Output is correct
37 Correct 524 ms 43608 KB Output is correct
38 Correct 597 ms 44428 KB Output is correct
39 Correct 529 ms 41596 KB Output is correct
40 Correct 595 ms 44224 KB Output is correct
41 Correct 138 ms 37096 KB Output is correct
42 Correct 266 ms 48888 KB Output is correct
43 Correct 371 ms 24844 KB Output is correct
44 Correct 434 ms 43504 KB Output is correct
45 Correct 6 ms 556 KB Output is correct
46 Correct 11 ms 688 KB Output is correct
47 Correct 12 ms 688 KB Output is correct
48 Correct 13 ms 688 KB Output is correct
49 Correct 12 ms 688 KB Output is correct
50 Correct 5 ms 688 KB Output is correct
51 Correct 3 ms 688 KB Output is correct
52 Correct 11 ms 688 KB Output is correct
53 Correct 7 ms 688 KB Output is correct
54 Correct 10 ms 688 KB Output is correct
55 Correct 11 ms 688 KB Output is correct
56 Correct 11 ms 688 KB Output is correct
57 Correct 2 ms 460 KB Output is correct
58 Correct 5 ms 560 KB Output is correct
59 Correct 6 ms 688 KB Output is correct
60 Correct 16 ms 688 KB Output is correct
61 Correct 12 ms 688 KB Output is correct
62 Correct 8 ms 692 KB Output is correct
63 Correct 12 ms 688 KB Output is correct
64 Correct 17 ms 812 KB Output is correct
65 Correct 160 ms 5572 KB Output is correct
66 Correct 224 ms 5584 KB Output is correct
67 Correct 211 ms 5572 KB Output is correct
68 Correct 152 ms 5572 KB Output is correct
69 Correct 207 ms 5536 KB Output is correct
70 Correct 25 ms 1344 KB Output is correct
71 Correct 459 ms 6656 KB Output is correct
72 Correct 236 ms 5572 KB Output is correct
73 Correct 233 ms 5572 KB Output is correct
74 Correct 258 ms 5564 KB Output is correct
75 Correct 218 ms 5572 KB Output is correct
76 Correct 158 ms 3776 KB Output is correct
77 Correct 458 ms 5572 KB Output is correct
78 Correct 220 ms 5608 KB Output is correct
79 Correct 216 ms 5664 KB Output is correct
80 Correct 184 ms 5572 KB Output is correct
81 Correct 1324 ms 27520 KB Output is correct
82 Correct 1389 ms 27508 KB Output is correct
83 Correct 1622 ms 41504 KB Output is correct
84 Execution timed out 2070 ms 41524 KB Time limit exceeded
85 Halted 0 ms 0 KB -