답안 #1000769

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1000769	2024-06-18T08:31:40 Z	Tob	Cultivation (JOI17_cultivation)	C++14	80 / 100	2000 ms	2772 KB

cultivation

#include <bits/stdc++.h>
 
#pragma optimize("O3, unroll-loops")
 
#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 <ll> q; deque <ll> dq;
	inline void push(ll x) {q.push(x); while (!dq.empty() && dq.back() < x) dq.pop_back(); dq.pb(x);}
	inline void pop() {ll x = q.front(); q.pop(); if (dq[0] == x) dq.pop_front();}
	inline ll 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 <ll> v; v.pb(d);
	for (int i = 0; i <= k; i++) {
		for (int j = i; j <= k; j++) {
			if (a[j]-a[i]-1 >= d) v.pb(a[j]-a[i]-1);
			if (a[j]+n-a[i]-1 >= d) v.pb(a[j]+n-a[i]-1);
			if (a[i]+n-a[j]-1 >= d) v.pb(a[i]+n-a[j]-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)
	ll mn = inf;
	for (auto x : v) {
		MQ m1, m2, m3;
		vector <pair <pii, ll> > vv;
		int l = 0, r = -1, 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({{l+1, r}, (ll)a[z]+x+1}); l++;}
				else vv[vv.size()-1].F.F++, l++;
				z++;
			}
			if (vv.empty() || vv.back().S != a[i]) {vv.pb({{l, r+1}, a[i]}); r++;}
			else vv[vv.size()-1].F.S++, r++;
		}
		while (z < k) {
			if (vv.back().S != (ll)a[z]+x+1) {vv.pb({{l+1, r}, (ll)a[z]+x+1}); l++;}
			else vv[vv.size()-1].F.F++, l++;
			z++;
		}
		z = 0;
		const ll oo = 1e18;
		#define C (x+max(m1.get(), m2.get()+m3.get()))
		
		for (int i = 0; i+1 < vv.size() && vv[i].S < 2*n; i++) {
			l = vv[i].F.F;
			r = vv[i].F.S;
			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:3: warning: ignoring '#pragma optimize ' [-Wunknown-pragmas]
    3 | #pragma optimize("O3, unroll-loops")
      | 
cultivation.cpp: In function 'int main()':
cultivation.cpp:115: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]
  115 |   for (int i = 0; i+1 < vv.size() && vv[i].S < 2*n; i++) {
      |                   ~~~~^~~~~~~~~~~
cultivation.cpp:112:12: warning: unused variable 'oo' [-Wunused-variable]
  112 |   const ll oo = 1e18;
      |            ^~

Subtask #1
5.0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 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	1 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	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	344 KB	Output is correct
15	Correct	1 ms	348 KB	Output is correct
16	Correct	0 ms	344 KB	Output is correct

Subtask #2
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 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	1 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	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	344 KB	Output is correct
15	Correct	1 ms	348 KB	Output is correct
16	Correct	0 ms	344 KB	Output is correct
17	Correct	1 ms	348 KB	Output is correct
18	Correct	1 ms	856 KB	Output is correct
19	Correct	0 ms	604 KB	Output is correct
20	Correct	1 ms	600 KB	Output is correct
21	Correct	1 ms	604 KB	Output is correct
22	Correct	3 ms	1132 KB	Output is correct
23	Correct	1 ms	604 KB	Output is correct
24	Correct	4 ms	1752 KB	Output is correct
25	Correct	3 ms	1424 KB	Output is correct
26	Correct	8 ms	2748 KB	Output is correct
27	Correct	8 ms	2608 KB	Output is correct
28	Correct	6 ms	1584 KB	Output is correct
29	Correct	8 ms	2772 KB	Output is correct
30	Correct	8 ms	2588 KB	Output is correct
31	Correct	8 ms	2772 KB	Output is correct
32	Correct	8 ms	2768 KB	Output is correct

Subtask #3
15.0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 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	1 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	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	344 KB	Output is correct
15	Correct	1 ms	348 KB	Output is correct
16	Correct	0 ms	344 KB	Output is correct
17	Correct	1 ms	348 KB	Output is correct
18	Correct	1 ms	856 KB	Output is correct
19	Correct	0 ms	604 KB	Output is correct
20	Correct	1 ms	600 KB	Output is correct
21	Correct	1 ms	604 KB	Output is correct
22	Correct	3 ms	1132 KB	Output is correct
23	Correct	1 ms	604 KB	Output is correct
24	Correct	4 ms	1752 KB	Output is correct
25	Correct	3 ms	1424 KB	Output is correct
26	Correct	8 ms	2748 KB	Output is correct
27	Correct	8 ms	2608 KB	Output is correct
28	Correct	6 ms	1584 KB	Output is correct
29	Correct	8 ms	2772 KB	Output is correct
30	Correct	8 ms	2588 KB	Output is correct
31	Correct	8 ms	2772 KB	Output is correct
32	Correct	8 ms	2768 KB	Output is correct
33	Correct	12 ms	2520 KB	Output is correct
34	Correct	11 ms	2772 KB	Output is correct
35	Correct	16 ms	2772 KB	Output is correct
36	Correct	17 ms	2772 KB	Output is correct
37	Correct	16 ms	2772 KB	Output is correct
38	Correct	17 ms	2764 KB	Output is correct
39	Correct	18 ms	2772 KB	Output is correct
40	Correct	17 ms	2768 KB	Output is correct
41	Correct	12 ms	2308 KB	Output is correct
42	Correct	12 ms	2560 KB	Output is correct
43	Correct	16 ms	2516 KB	Output is correct
44	Correct	14 ms	2772 KB	Output is correct

Subtask #4
30.0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Correct	1 ms	348 KB	Output is correct
3	Correct	2 ms	604 KB	Output is correct
4	Correct	2 ms	604 KB	Output is correct
5	Correct	2 ms	604 KB	Output is correct
6	Correct	1 ms	604 KB	Output is correct
7	Correct	1 ms	600 KB	Output is correct
8	Correct	2 ms	604 KB	Output is correct
9	Correct	1 ms	856 KB	Output is correct
10	Correct	2 ms	604 KB	Output is correct
11	Correct	2 ms	604 KB	Output is correct
12	Correct	2 ms	600 KB	Output is correct
13	Correct	1 ms	604 KB	Output is correct
14	Correct	1 ms	604 KB	Output is correct
15	Correct	1 ms	488 KB	Output is correct
16	Correct	1 ms	604 KB	Output is correct
17	Correct	2 ms	604 KB	Output is correct
18	Correct	1 ms	604 KB	Output is correct
19	Correct	2 ms	604 KB	Output is correct
20	Correct	2 ms	604 KB	Output is correct

Subtask #5
20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	348 KB	Output is correct
2	Correct	1 ms	348 KB	Output is correct
3	Correct	2 ms	604 KB	Output is correct
4	Correct	2 ms	604 KB	Output is correct
5	Correct	2 ms	604 KB	Output is correct
6	Correct	1 ms	604 KB	Output is correct
7	Correct	1 ms	600 KB	Output is correct
8	Correct	2 ms	604 KB	Output is correct
9	Correct	1 ms	856 KB	Output is correct
10	Correct	2 ms	604 KB	Output is correct
11	Correct	2 ms	604 KB	Output is correct
12	Correct	2 ms	600 KB	Output is correct
13	Correct	1 ms	604 KB	Output is correct
14	Correct	1 ms	604 KB	Output is correct
15	Correct	1 ms	488 KB	Output is correct
16	Correct	1 ms	604 KB	Output is correct
17	Correct	2 ms	604 KB	Output is correct
18	Correct	1 ms	604 KB	Output is correct
19	Correct	2 ms	604 KB	Output is correct
20	Correct	2 ms	604 KB	Output is correct
21	Correct	48 ms	860 KB	Output is correct
22	Correct	83 ms	860 KB	Output is correct
23	Correct	61 ms	860 KB	Output is correct
24	Correct	70 ms	860 KB	Output is correct
25	Correct	84 ms	856 KB	Output is correct
26	Correct	26 ms	856 KB	Output is correct
27	Correct	79 ms	860 KB	Output is correct
28	Correct	81 ms	860 KB	Output is correct
29	Correct	72 ms	856 KB	Output is correct
30	Correct	92 ms	1088 KB	Output is correct
31	Correct	104 ms	860 KB	Output is correct
32	Correct	76 ms	1088 KB	Output is correct
33	Correct	55 ms	1052 KB	Output is correct
34	Correct	80 ms	856 KB	Output is correct
35	Correct	80 ms	860 KB	Output is correct
36	Correct	60 ms	1052 KB	Output is correct

Subtask #6
0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	0 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	1 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	0 ms	348 KB	Output is correct
11	Correct	0 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct
13	Correct	0 ms	348 KB	Output is correct
14	Correct	0 ms	344 KB	Output is correct
15	Correct	1 ms	348 KB	Output is correct
16	Correct	0 ms	344 KB	Output is correct
17	Correct	1 ms	348 KB	Output is correct
18	Correct	1 ms	856 KB	Output is correct
19	Correct	0 ms	604 KB	Output is correct
20	Correct	1 ms	600 KB	Output is correct
21	Correct	1 ms	604 KB	Output is correct
22	Correct	3 ms	1132 KB	Output is correct
23	Correct	1 ms	604 KB	Output is correct
24	Correct	4 ms	1752 KB	Output is correct
25	Correct	3 ms	1424 KB	Output is correct
26	Correct	8 ms	2748 KB	Output is correct
27	Correct	8 ms	2608 KB	Output is correct
28	Correct	6 ms	1584 KB	Output is correct
29	Correct	8 ms	2772 KB	Output is correct
30	Correct	8 ms	2588 KB	Output is correct
31	Correct	8 ms	2772 KB	Output is correct
32	Correct	8 ms	2768 KB	Output is correct
33	Correct	12 ms	2520 KB	Output is correct
34	Correct	11 ms	2772 KB	Output is correct
35	Correct	16 ms	2772 KB	Output is correct
36	Correct	17 ms	2772 KB	Output is correct
37	Correct	16 ms	2772 KB	Output is correct
38	Correct	17 ms	2764 KB	Output is correct
39	Correct	18 ms	2772 KB	Output is correct
40	Correct	17 ms	2768 KB	Output is correct
41	Correct	12 ms	2308 KB	Output is correct
42	Correct	12 ms	2560 KB	Output is correct
43	Correct	16 ms	2516 KB	Output is correct
44	Correct	14 ms	2772 KB	Output is correct
45	Correct	1 ms	348 KB	Output is correct
46	Correct	1 ms	348 KB	Output is correct
47	Correct	2 ms	604 KB	Output is correct
48	Correct	2 ms	604 KB	Output is correct
49	Correct	2 ms	604 KB	Output is correct
50	Correct	1 ms	604 KB	Output is correct
51	Correct	1 ms	600 KB	Output is correct
52	Correct	2 ms	604 KB	Output is correct
53	Correct	1 ms	856 KB	Output is correct
54	Correct	2 ms	604 KB	Output is correct
55	Correct	2 ms	604 KB	Output is correct
56	Correct	2 ms	600 KB	Output is correct
57	Correct	1 ms	604 KB	Output is correct
58	Correct	1 ms	604 KB	Output is correct
59	Correct	1 ms	488 KB	Output is correct
60	Correct	1 ms	604 KB	Output is correct
61	Correct	2 ms	604 KB	Output is correct
62	Correct	1 ms	604 KB	Output is correct
63	Correct	2 ms	604 KB	Output is correct
64	Correct	2 ms	604 KB	Output is correct
65	Correct	48 ms	860 KB	Output is correct
66	Correct	83 ms	860 KB	Output is correct
67	Correct	61 ms	860 KB	Output is correct
68	Correct	70 ms	860 KB	Output is correct
69	Correct	84 ms	856 KB	Output is correct
70	Correct	26 ms	856 KB	Output is correct
71	Correct	79 ms	860 KB	Output is correct
72	Correct	81 ms	860 KB	Output is correct
73	Correct	72 ms	856 KB	Output is correct
74	Correct	92 ms	1088 KB	Output is correct
75	Correct	104 ms	860 KB	Output is correct
76	Correct	76 ms	1088 KB	Output is correct
77	Correct	55 ms	1052 KB	Output is correct
78	Correct	80 ms	856 KB	Output is correct
79	Correct	80 ms	860 KB	Output is correct
80	Correct	60 ms	1052 KB	Output is correct
81	Correct	928 ms	2004 KB	Output is correct
82	Correct	899 ms	2000 KB	Output is correct
83	Correct	1032 ms	2260 KB	Output is correct
84	Correct	1211 ms	2256 KB	Output is correct
85	Execution timed out	2028 ms	2760 KB	Time limit exceeded
86	Halted	0 ms	0 KB	-

답안 #1000769

Compilation message

Subtask #1 5.0 / 5.0

Subtask #2 10.0 / 10.0

Subtask #3 15.0 / 15.0

Subtask #4 30.0 / 30.0

Subtask #5 20.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
30.0 / 30.0

Subtask #5
20.0 / 20.0

Subtask #6
0 / 20.0