oj.uz

답안 #231662

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
231662 2020-05-14T09:56:31 Z crimsonred Solar Storm (NOI20_solarstorm) C++17
100 / 100
 516 ms 193160 KB 
#include <bits/stdc++.h>
using namespace std;

#define mod 1'000'000'007
typedef long long ll;

template<typename T>
void deb(initializer_list<T> l)
{
	for (auto &e : l)
		cout << e << ' ';
	cout << endl;
}

ll n, s, k;
vector<ll> coord, a, parents, leftx, rightx, pref;
vector<vector<ll>> adj;
ll mx = 0;
pair<ll, ll> ans;

void dfs(ll u, ll parent, vector<ll>& stk)
{
	stk.push_back(u);
	for (auto &v : adj[u])
		if (v != parent)
			dfs(v, u, stk);

	ll ancestor = stk.size() >= s ? stk[stk.size() - s] : stk[0];
	// [u, ancestor]
	ll sum = pref[rightx[ancestor]] - (leftx[u] ? pref[leftx[u] - 1] : 0);
	if (sum > mx)
	{
		mx = sum;
		ans = {u, ancestor};
	}

	stk.pop_back();
}

void solve()
{
	cin >> n >> s >> k;
	coord.resize(n);
	a.resize(n);
	leftx.resize(n);
	rightx.resize(n);
	parents.reserve(n);
	adj.resize(n);
	pref.resize(n);

	coord[0] = 0;
	for (ll i = 1; i < n; ++i)
	{
		ll diff;
		cin >> diff;
		coord[i] = coord[i - 1] + diff;
	}

	for (auto &e : a)
		cin >> e;

	leftx[0] = 0;
	rightx[0] = 0;
	// shield range: [leftx[i], rightx[i]]
	ll leftptr = 0;
	ll rightptr = 0;
	for (ll i = 0; i < n; ++i)
	{
		while (rightptr < n && coord[rightptr] - coord[i] <= k)
			++rightptr;
		--rightptr;

		while (coord[i] - coord[leftptr] > k)
			++leftptr;

		leftx[i] = leftptr;
		rightx[i] = rightptr;
	}

	pref[0] = a[0];
	for (ll i = 1; i < n; ++i)
		pref[i] = a[i] + pref[i - 1];

	for (ll i = 0; i < n; ++i)
	{
		ll nextnode = rightx[i];
		if (nextnode + 1 < n)
			++nextnode;
		nextnode = rightx[nextnode];
		if (coord[nextnode] - coord[i] > k)
		{
			adj[i].push_back(nextnode);
			adj[nextnode].push_back(i);
		}
		else
			parents.push_back(i);
	}

	vector<ll> stk;
	stk.reserve(n);
	for (auto &e : parents)
		dfs(e, -1, stk);

	auto [first, last] = ans;
	vector<ll> shields;
	shields.reserve(n);
	shields.push_back(first + 1);
	while (first != last)
	{
		for (auto &v : adj[first])
		{
			if (v > first)
			{
				shields.push_back(v + 1);
				first = v;
				break;
			}
		}
	}

	cout << shields.size() << '\n';
	for (auto &e : shields)
		cout << e << ' ';
	cout << '\n';
}

int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(nullptr);

	int t = 1;
	// cin >> t;
	while (t--)
		solve();

	return 0;
}

Compilation message

SolarStorm.cpp: In function 'void dfs(ll, ll, std::vector<long long int>&)':
SolarStorm.cpp:28:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  ll ancestor = stk.size() >= s ? stk[stk.size() - s] : stk[0];
                ~~~~~~~~~~~^~~~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 512 KB Output is correct
2 Correct 8 ms 1920 KB Output is correct
3 Correct 9 ms 2048 KB Output is correct
4 Correct 7 ms 1152 KB Output is correct
5 Correct 4 ms 384 KB Output is correct
6 Correct 7 ms 1024 KB Output is correct
7 Correct 7 ms 1024 KB Output is correct
8 Correct 7 ms 1152 KB Output is correct
9 Correct 7 ms 1152 KB Output is correct
10 Correct 9 ms 1536 KB Output is correct
11 Correct 9 ms 1536 KB Output is correct
12 Correct 6 ms 1024 KB Output is correct

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 187 ms 68192 KB Output is correct
2 Correct 150 ms 55780 KB Output is correct
3 Correct 172 ms 61680 KB Output is correct
4 Correct 258 ms 65784 KB Output is correct
5 Correct 321 ms 77176 KB Output is correct
6 Correct 364 ms 103288 KB Output is correct
7 Correct 249 ms 83580 KB Output is correct

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 512 KB Output is correct
2 Correct 8 ms 1920 KB Output is correct
3 Correct 9 ms 2048 KB Output is correct
4 Correct 7 ms 1152 KB Output is correct
5 Correct 4 ms 384 KB Output is correct
6 Correct 7 ms 1024 KB Output is correct
7 Correct 7 ms 1024 KB Output is correct
8 Correct 7 ms 1152 KB Output is correct
9 Correct 7 ms 1152 KB Output is correct
10 Correct 9 ms 1536 KB Output is correct
11 Correct 9 ms 1536 KB Output is correct
12 Correct 6 ms 1024 KB Output is correct
13 Correct 187 ms 68192 KB Output is correct
14 Correct 150 ms 55780 KB Output is correct
15 Correct 172 ms 61680 KB Output is correct
16 Correct 258 ms 65784 KB Output is correct
17 Correct 321 ms 77176 KB Output is correct
18 Correct 364 ms 103288 KB Output is correct
19 Correct 249 ms 83580 KB Output is correct
20 Correct 158 ms 50920 KB Output is correct
21 Correct 293 ms 119064 KB Output is correct
22 Correct 338 ms 141288 KB Output is correct
23 Correct 189 ms 66552 KB Output is correct
24 Correct 209 ms 62344 KB Output is correct
25 Correct 296 ms 82668 KB Output is correct
26 Correct 196 ms 60520 KB Output is correct
27 Correct 322 ms 79472 KB Output is correct
28 Correct 294 ms 79096 KB Output is correct
29 Correct 412 ms 102904 KB Output is correct
30 Correct 340 ms 99396 KB Output is correct
31 Correct 282 ms 103016 KB Output is correct

Subtask #4
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 362 ms 147468 KB Output is correct
2 Correct 195 ms 87928 KB Output is correct
3 Correct 219 ms 94456 KB Output is correct
4 Correct 290 ms 136632 KB Output is correct
5 Correct 284 ms 132472 KB Output is correct
6 Correct 303 ms 140352 KB Output is correct
7 Correct 430 ms 181324 KB Output is correct

Subtask #5
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 512 KB Output is correct
2 Correct 8 ms 1920 KB Output is correct
3 Correct 9 ms 2048 KB Output is correct
4 Correct 7 ms 1152 KB Output is correct
5 Correct 4 ms 384 KB Output is correct
6 Correct 7 ms 1024 KB Output is correct
7 Correct 7 ms 1024 KB Output is correct
8 Correct 7 ms 1152 KB Output is correct
9 Correct 7 ms 1152 KB Output is correct
10 Correct 9 ms 1536 KB Output is correct
11 Correct 9 ms 1536 KB Output is correct
12 Correct 6 ms 1024 KB Output is correct
13 Correct 7 ms 1408 KB Output is correct
14 Correct 8 ms 1280 KB Output is correct
15 Correct 8 ms 1280 KB Output is correct
16 Correct 7 ms 1024 KB Output is correct
17 Correct 8 ms 1664 KB Output is correct
18 Correct 11 ms 2048 KB Output is correct
19 Correct 8 ms 1792 KB Output is correct
20 Correct 8 ms 1536 KB Output is correct
21 Correct 10 ms 2304 KB Output is correct
22 Correct 10 ms 2176 KB Output is correct
23 Correct 9 ms 1408 KB Output is correct
24 Correct 8 ms 1408 KB Output is correct
25 Correct 9 ms 1664 KB Output is correct
26 Correct 9 ms 1968 KB Output is correct
27 Correct 7 ms 1664 KB Output is correct
28 Correct 8 ms 1664 KB Output is correct
29 Correct 8 ms 1664 KB Output is correct
30 Correct 8 ms 1280 KB Output is correct

Subtask #6
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 512 KB Output is correct
2 Correct 8 ms 1920 KB Output is correct
3 Correct 9 ms 2048 KB Output is correct
4 Correct 7 ms 1152 KB Output is correct
5 Correct 4 ms 384 KB Output is correct
6 Correct 7 ms 1024 KB Output is correct
7 Correct 7 ms 1024 KB Output is correct
8 Correct 7 ms 1152 KB Output is correct
9 Correct 7 ms 1152 KB Output is correct
10 Correct 9 ms 1536 KB Output is correct
11 Correct 9 ms 1536 KB Output is correct
12 Correct 6 ms 1024 KB Output is correct
13 Correct 187 ms 68192 KB Output is correct
14 Correct 150 ms 55780 KB Output is correct
15 Correct 172 ms 61680 KB Output is correct
16 Correct 258 ms 65784 KB Output is correct
17 Correct 321 ms 77176 KB Output is correct
18 Correct 364 ms 103288 KB Output is correct
19 Correct 249 ms 83580 KB Output is correct
20 Correct 158 ms 50920 KB Output is correct
21 Correct 293 ms 119064 KB Output is correct
22 Correct 338 ms 141288 KB Output is correct
23 Correct 189 ms 66552 KB Output is correct
24 Correct 209 ms 62344 KB Output is correct
25 Correct 296 ms 82668 KB Output is correct
26 Correct 196 ms 60520 KB Output is correct
27 Correct 322 ms 79472 KB Output is correct
28 Correct 294 ms 79096 KB Output is correct
29 Correct 412 ms 102904 KB Output is correct
30 Correct 340 ms 99396 KB Output is correct
31 Correct 282 ms 103016 KB Output is correct
32 Correct 253 ms 73592 KB Output is correct
33 Correct 254 ms 73960 KB Output is correct
34 Correct 430 ms 103928 KB Output is correct
35 Correct 276 ms 62688 KB Output is correct
36 Correct 291 ms 67352 KB Output is correct
37 Correct 300 ms 75896 KB Output is correct
38 Correct 440 ms 143636 KB Output is correct
39 Correct 312 ms 131960 KB Output is correct
40 Correct 431 ms 178184 KB Output is correct

Subtask #7
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 512 KB Output is correct
2 Correct 8 ms 1920 KB Output is correct
3 Correct 9 ms 2048 KB Output is correct
4 Correct 7 ms 1152 KB Output is correct
5 Correct 4 ms 384 KB Output is correct
6 Correct 7 ms 1024 KB Output is correct
7 Correct 7 ms 1024 KB Output is correct
8 Correct 7 ms 1152 KB Output is correct
9 Correct 7 ms 1152 KB Output is correct
10 Correct 9 ms 1536 KB Output is correct
11 Correct 9 ms 1536 KB Output is correct
12 Correct 6 ms 1024 KB Output is correct
13 Correct 187 ms 68192 KB Output is correct
14 Correct 150 ms 55780 KB Output is correct
15 Correct 172 ms 61680 KB Output is correct
16 Correct 258 ms 65784 KB Output is correct
17 Correct 321 ms 77176 KB Output is correct
18 Correct 364 ms 103288 KB Output is correct
19 Correct 249 ms 83580 KB Output is correct
20 Correct 158 ms 50920 KB Output is correct
21 Correct 293 ms 119064 KB Output is correct
22 Correct 338 ms 141288 KB Output is correct
23 Correct 189 ms 66552 KB Output is correct
24 Correct 209 ms 62344 KB Output is correct
25 Correct 296 ms 82668 KB Output is correct
26 Correct 196 ms 60520 KB Output is correct
27 Correct 322 ms 79472 KB Output is correct
28 Correct 294 ms 79096 KB Output is correct
29 Correct 412 ms 102904 KB Output is correct
30 Correct 340 ms 99396 KB Output is correct
31 Correct 282 ms 103016 KB Output is correct
32 Correct 362 ms 147468 KB Output is correct
33 Correct 195 ms 87928 KB Output is correct
34 Correct 219 ms 94456 KB Output is correct
35 Correct 290 ms 136632 KB Output is correct
36 Correct 284 ms 132472 KB Output is correct
37 Correct 303 ms 140352 KB Output is correct
38 Correct 430 ms 181324 KB Output is correct
39 Correct 7 ms 1408 KB Output is correct
40 Correct 8 ms 1280 KB Output is correct
41 Correct 8 ms 1280 KB Output is correct
42 Correct 7 ms 1024 KB Output is correct
43 Correct 8 ms 1664 KB Output is correct
44 Correct 11 ms 2048 KB Output is correct
45 Correct 8 ms 1792 KB Output is correct
46 Correct 8 ms 1536 KB Output is correct
47 Correct 10 ms 2304 KB Output is correct
48 Correct 10 ms 2176 KB Output is correct
49 Correct 9 ms 1408 KB Output is correct
50 Correct 8 ms 1408 KB Output is correct
51 Correct 9 ms 1664 KB Output is correct
52 Correct 9 ms 1968 KB Output is correct
53 Correct 7 ms 1664 KB Output is correct
54 Correct 8 ms 1664 KB Output is correct
55 Correct 8 ms 1664 KB Output is correct
56 Correct 8 ms 1280 KB Output is correct
57 Correct 253 ms 73592 KB Output is correct
58 Correct 254 ms 73960 KB Output is correct
59 Correct 430 ms 103928 KB Output is correct
60 Correct 276 ms 62688 KB Output is correct
61 Correct 291 ms 67352 KB Output is correct
62 Correct 300 ms 75896 KB Output is correct
63 Correct 440 ms 143636 KB Output is correct
64 Correct 312 ms 131960 KB Output is correct
65 Correct 431 ms 178184 KB Output is correct
66 Correct 162 ms 50552 KB Output is correct
67 Correct 376 ms 152056 KB Output is correct
68 Correct 272 ms 105464 KB Output is correct
69 Correct 348 ms 139532 KB Output is correct
70 Correct 174 ms 52472 KB Output is correct
71 Correct 431 ms 112632 KB Output is correct
72 Correct 304 ms 71248 KB Output is correct
73 Correct 365 ms 94968 KB Output is correct
74 Correct 227 ms 79612 KB Output is correct
75 Correct 364 ms 148136 KB Output is correct
76 Correct 251 ms 104440 KB Output is correct
77 Correct 330 ms 88544 KB Output is correct
78 Correct 233 ms 99708 KB Output is correct
79 Correct 310 ms 129332 KB Output is correct
80 Correct 392 ms 161628 KB Output is correct
81 Correct 166 ms 50680 KB Output is correct
82 Correct 281 ms 83960 KB Output is correct
83 Correct 239 ms 56952 KB Output is correct
84 Correct 252 ms 61944 KB Output is correct
85 Correct 251 ms 58104 KB Output is correct
86 Correct 442 ms 105144 KB Output is correct
87 Correct 219 ms 76536 KB Output is correct
88 Correct 401 ms 102532 KB Output is correct
89 Correct 310 ms 130056 KB Output is correct
90 Correct 273 ms 117880 KB Output is correct
91 Correct 516 ms 193160 KB Output is correct
92 Correct 432 ms 179192 KB Output is correct
93 Correct 466 ms 186068 KB Output is correct
94 Correct 484 ms 186024 KB Output is correct
95 Correct 412 ms 100984 KB Output is correct
96 Correct 323 ms 79736 KB Output is correct
97 Correct 438 ms 114936 KB Output is correct
98 Correct 292 ms 89080 KB Output is correct
99 Correct 340 ms 128120 KB Output is correct
100 Correct 344 ms 125096 KB Output is correct