Submission #1000595

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
1000595	2024-06-17T22:51:25 Z	Tob	Cultivation (JOI17_cultivation)	C++14	30 / 100	22 ms	2496 KB

cultivation

#include <bits/stdc++.h>

#define F first
#define S second
#define all(x) x.begin(), x.end()
#define pb push_back
#define FIO ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)

using namespace std;

typedef long long ll;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;

const int N = 307, inf = 2e9;

int n, m, k;
int a[N], b[N];
int mem[2*N][N];
pii gr[2*N][N];
vector <int> add[2*N], rem[2*N];

struct MQ {
	queue <int> q; deque <int> dq;
	inline void push(int x) {q.push(x); while (!dq.empty() && dq.back() < x) dq.pop_back(); dq.pb(x);}
	inline void pop() {int x = q.front(); q.pop(); if (dq[0] == x) dq.pop_front();}
	inline int get() {return dq[0];}
};

int main () {
	FIO;
	cin >> n >> m >> k;
	
	vector <pii> so;
	for (int i = 0; i < k; i++) {
		cin >> a[i] >> b[i];
		a[i]--; b[i]--;
		so.pb({a[i], b[i]});
	}
	sort(all(so));
	for (int i = 0; i < k; i++) a[i] = so[i].F, b[i] = so[i].S;
	
	int d = a[0]; for (int i = 0; i < k; i++) a[i] -= d;
	d = n-a[k-1]-1; for (int i = 1; i < k; i++) d = max(d, a[i]-a[i-1]-1);
	a[k] = n-1;
	vector <int> v; v.pb(d);
	for (int i = 0; i <= k; i++) {
		for (int j = i; j <= k; j++) {
			if (a[j]-a[i] >= d) v.pb(a[j]-a[i]);
			if (a[j]-a[i]-1 >= d) v.pb(a[j]-a[i]-1);
			if (a[i]+n-a[j]-1 >= d) v.pb(a[i]+n-a[j]-1);
			if (a[j]+n-a[i]-1 >= d) v.pb(a[j]+n-a[i]-1);
		}
		if (n-a[i]-1 >= d) v.pb(n-a[i]-1);
	}
	sort(all(v)); v.erase(unique(all(v)), v.end());
	
	//PRECOMPUTE -> O(N^2 log N)
	for (int i = 0; i < k; i++) {
		set <int> s;
		multiset <int> rj;
		rj.insert(0);
		for (int j = i; j >= 0; j--) {
			mem[i][j] = mem[i][j+1];
			gr[i][j].F = gr[i][j+1].F;
			gr[i][j].S = gr[i][j+1].S;
			if (s.find(b[j]) != s.end()) continue;
			auto p1 = s.lower_bound(b[j]);
			if (p1 == s.end()) {
				if (!s.empty()) rj.insert(b[j]-*(--p1)-1);
				s.insert(b[j]);
				gr[i][j] = {*s.begin(), m-*s.rbegin()-1};
			}
			else if (p1 == s.begin()) {
				rj.insert(*p1-b[j]-1);
				s.insert(b[j]);
				gr[i][j] = {*s.begin(), m-*s.rbegin()-1};
			}
			else {
				int x = *p1; --p1; int y = *p1;
				rj.erase(rj.find(x-y-1));
				rj.insert(x-b[j]-1);
				rj.insert(b[j]-y-1);
				s.insert(b[j]);
			}
			mem[i][j] = *rj.rbegin();
		}
	}
	
	//SOLVE O(N^3)
	int mn = inf;
	for (auto x : v) {
		MQ m1, m2, m3;
		vector <pair <pii, ll> > vv;
		int z = 0;
		
		for (int i = 0; i < k; i++) {
			while (a[z]+x < a[i]) {
				if (vv.back().S != (ll)a[z]+x+1) vv.pb({{0, 1}, (ll)a[z]+x+1});
				else vv[vv.size()-1].F.S++;
				z++;
			}
			if (vv.empty() || vv.back().S != a[i]) vv.pb({{1, 0}, a[i]});
			else vv[vv.size()-1].F.F++;
		}
		while (z < k) {
			if (vv.back().S != (ll)a[z]+x+1) vv.pb({{0, 1}, (ll)a[z]+x+1});
			else vv[vv.size()-1].F.S++;
			z++;
		}
		
		int l = 0, r = -1; z = 0;
		const ll oo = 1e18;
		#define C (x+max(m1.get(), m2.get()+m3.get()))
		
		for (int i = 0; i+1 < vv.size(); i++) {
			l += vv[i].F.S;
			r += vv[i].F.F;
			m1.push(mem[r][l]); m2.push(gr[r][l].F); m3.push(gr[r][l].S);
			while (vv[z].S+n-1 < vv[i+1].S) {
				mn = min(mn, C);
				m1.pop(); m2.pop(); m3.pop();
				z++;
			}
		}
	}
	
	cout << mn << "\n";

	return 0;
}

Compilation message

cultivation.cpp: In function 'int main()':
cultivation.cpp:116:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<std::pair<int, int>, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  116 |   for (int i = 0; i+1 < vv.size(); i++) {
      |                   ~~~~^~~~~~~~~~~
cultivation.cpp:113:12: warning: unused variable 'oo' [-Wunused-variable]
  113 |   const ll oo = 1e18;
      |            ^~

Subtask #1
5.0 / 5.0

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

Subtask #2
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	1 ms	344 KB	Output is correct
11	Correct	1 ms	348 KB	Output is correct
12	Correct	0 ms	488 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	1 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	1 ms	348 KB	Output is correct
18	Correct	1 ms	604 KB	Output is correct
19	Correct	1 ms	604 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	1 ms	604 KB	Output is correct
22	Correct	2 ms	1116 KB	Output is correct
23	Correct	1 ms	604 KB	Output is correct
24	Correct	5 ms	1496 KB	Output is correct
25	Correct	3 ms	1320 KB	Output is correct
26	Correct	8 ms	2264 KB	Output is correct
27	Correct	8 ms	2496 KB	Output is correct
28	Correct	5 ms	1460 KB	Output is correct
29	Correct	9 ms	2292 KB	Output is correct
30	Correct	8 ms	2264 KB	Output is correct
31	Correct	9 ms	2260 KB	Output is correct
32	Correct	8 ms	2260 KB	Output is correct

Subtask #3
15.0 / 15.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	1 ms	344 KB	Output is correct
11	Correct	1 ms	348 KB	Output is correct
12	Correct	0 ms	488 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	1 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	1 ms	348 KB	Output is correct
18	Correct	1 ms	604 KB	Output is correct
19	Correct	1 ms	604 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	1 ms	604 KB	Output is correct
22	Correct	2 ms	1116 KB	Output is correct
23	Correct	1 ms	604 KB	Output is correct
24	Correct	5 ms	1496 KB	Output is correct
25	Correct	3 ms	1320 KB	Output is correct
26	Correct	8 ms	2264 KB	Output is correct
27	Correct	8 ms	2496 KB	Output is correct
28	Correct	5 ms	1460 KB	Output is correct
29	Correct	9 ms	2292 KB	Output is correct
30	Correct	8 ms	2264 KB	Output is correct
31	Correct	9 ms	2260 KB	Output is correct
32	Correct	8 ms	2260 KB	Output is correct
33	Correct	15 ms	2264 KB	Output is correct
34	Correct	14 ms	2264 KB	Output is correct
35	Correct	19 ms	2264 KB	Output is correct
36	Correct	17 ms	2264 KB	Output is correct
37	Correct	17 ms	2396 KB	Output is correct
38	Correct	22 ms	2260 KB	Output is correct
39	Correct	17 ms	2200 KB	Output is correct
40	Correct	17 ms	2264 KB	Output is correct
41	Correct	11 ms	2012 KB	Output is correct
42	Correct	12 ms	2264 KB	Output is correct
43	Correct	16 ms	2264 KB	Output is correct
44	Correct	14 ms	2264 KB	Output is correct

Subtask #4
0 / 30.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	1 ms	344 KB	Output isn't correct
2	Halted	0 ms	0 KB	-

Subtask #5
0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	1 ms	344 KB	Output isn't correct
2	Halted	0 ms	0 KB	-

Subtask #6
0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	348 KB	Output is correct
4	Correct	0 ms	348 KB	Output is correct
5	Correct	0 ms	348 KB	Output is correct
6	Correct	0 ms	348 KB	Output is correct
7	Correct	0 ms	348 KB	Output is correct
8	Correct	0 ms	348 KB	Output is correct
9	Correct	0 ms	348 KB	Output is correct
10	Correct	1 ms	344 KB	Output is correct
11	Correct	1 ms	348 KB	Output is correct
12	Correct	0 ms	488 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	348 KB	Output is correct
15	Correct	1 ms	348 KB	Output is correct
16	Correct	0 ms	348 KB	Output is correct
17	Correct	1 ms	348 KB	Output is correct
18	Correct	1 ms	604 KB	Output is correct
19	Correct	1 ms	604 KB	Output is correct
20	Correct	0 ms	348 KB	Output is correct
21	Correct	1 ms	604 KB	Output is correct
22	Correct	2 ms	1116 KB	Output is correct
23	Correct	1 ms	604 KB	Output is correct
24	Correct	5 ms	1496 KB	Output is correct
25	Correct	3 ms	1320 KB	Output is correct
26	Correct	8 ms	2264 KB	Output is correct
27	Correct	8 ms	2496 KB	Output is correct
28	Correct	5 ms	1460 KB	Output is correct
29	Correct	9 ms	2292 KB	Output is correct
30	Correct	8 ms	2264 KB	Output is correct
31	Correct	9 ms	2260 KB	Output is correct
32	Correct	8 ms	2260 KB	Output is correct
33	Correct	15 ms	2264 KB	Output is correct
34	Correct	14 ms	2264 KB	Output is correct
35	Correct	19 ms	2264 KB	Output is correct
36	Correct	17 ms	2264 KB	Output is correct
37	Correct	17 ms	2396 KB	Output is correct
38	Correct	22 ms	2260 KB	Output is correct
39	Correct	17 ms	2200 KB	Output is correct
40	Correct	17 ms	2264 KB	Output is correct
41	Correct	11 ms	2012 KB	Output is correct
42	Correct	12 ms	2264 KB	Output is correct
43	Correct	16 ms	2264 KB	Output is correct
44	Correct	14 ms	2264 KB	Output is correct
45	Incorrect	1 ms	344 KB	Output isn't correct
46	Halted	0 ms	0 KB	-

Submission #1000595

Compilation message

Subtask #1 5.0 / 5.0

Subtask #2 10.0 / 10.0

Subtask #3 15.0 / 15.0

Subtask #4 0 / 30.0

Subtask #5 0 / 20.0

Subtask #6 0 / 20.0

Subtask #1
5.0 / 5.0

Subtask #2
10.0 / 10.0

Subtask #3
15.0 / 15.0

Subtask #4
0 / 30.0

Subtask #5
0 / 20.0

Subtask #6
0 / 20.0