oj.uz

Submission #878025

# Submission time Handle Problem Language Result Execution time Memory
878025 2023-11-24T02:46:12 Z fanwen Safety (NOI18_safety) C++17
35 / 100
 146 ms 196696 KB 
#include <bits/stdc++.h>

using namespace std;

#define fi first
#define se second
#define ll long long
#define file(name)                  \
    if(fopen(name".inp", "r"))      \
        freopen(name".inp", "r", stdin), freopen(name".out", "w", stdout); \

const int MAX = 2e5 + 5;

int N, H, A[MAX];

namespace sub3 {
	bool check() {
		return N <= 10 && H <= 2;
	}

	int get_id(int val) {
		static int cnt = 0;
		static map <int, int> comp;
		if(comp.count(val)) return comp[val];
		return comp[val] = ++cnt;
	}

	int dp[11][1005];

}

namespace sub7 {
	bool check() {
		return N <= 5000 && *max_element(A + 1, A + N + 1) <= 5000;
	}

	long long dp[5005][5005];

	void solve() {
		int MaxA = *max_element(A + 1, A + N + 1);
		memset(dp, 0x3f, sizeof dp);
		memset(dp[0], 0, sizeof dp[0]);
		for (int i = 1; i <= N; ++i) {
			deque <int> q;
			int j = 0;
			for (int h = 0; h <= MaxA; ++h) {
				int l = max(0, h - H), r = min(MaxA, h + H);
				while(j <= r) {
					while(!q.empty() && dp[i - 1][q.back()] >= dp[i - 1][j]) q.pop_back();
					q.push_back(j);
					j++;
				}
				while(!q.empty() && h - q.front() > H) q.pop_front();
				if(!q.empty()) dp[i][h] = dp[i - 1][q.front()] + abs(h - A[i]);
			}
		}
		cout << *min_element(dp[N], dp[N] + MaxA + 1); 
		exit(0);
	}
}

void you_make_it(void) {
    cin >> N >> H;
    for (int i = 1; i <= N; ++i) cin >> A[i];
    if(sub7::check()) sub7::solve();
}

signed main() {

#ifdef LOCAL
    freopen("TASK.inp", "r", stdin);
    freopen("TASK.out", "w", stdout);
#endif
    file("SAFETY");
    auto start_time = chrono::steady_clock::now();

    cin.tie(0), cout.tie(0) -> sync_with_stdio(0);

    you_make_it();

    auto end_time = chrono::steady_clock::now();

    cerr << "\nExecution time : " << chrono::duration_cast <chrono::milliseconds> (end_time - start_time).count() << "[ms]" << endl;

    return (0 ^ 0);
}

// Dream it. Wish it. Do it.

Compilation message

safety.cpp: In function 'void sub7::solve()':
safety.cpp:47:9: warning: unused variable 'l' [-Wunused-variable]
   47 |     int l = max(0, h - H), r = min(MaxA, h + H);
      |         ^
safety.cpp: In function 'int main()':
safety.cpp:10:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   10 |         freopen(name".inp", "r", stdin), freopen(name".out", "w", stdout); \
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
safety.cpp:74:5: note: in expansion of macro 'file'
   74 |     file("SAFETY");
      |     ^~~~
safety.cpp:10:49: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   10 |         freopen(name".inp", "r", stdin), freopen(name".out", "w", stdout); \
      |                                          ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
safety.cpp:74:5: note: in expansion of macro 'file'
   74 |     file("SAFETY");
      |     ^~~~

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 196432 KB Output is correct
2 Correct 22 ms 196440 KB Output is correct
3 Correct 23 ms 196436 KB Output is correct
4 Correct 22 ms 196444 KB Output is correct
5 Correct 23 ms 196432 KB Output is correct
6 Correct 22 ms 196380 KB Output is correct
7 Correct 22 ms 196440 KB Output is correct

Subtask #2
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 196444 KB Output is correct
2 Correct 22 ms 196536 KB Output is correct
3 Correct 24 ms 196436 KB Output is correct
4 Correct 23 ms 196444 KB Output is correct
5 Correct 23 ms 196444 KB Output is correct

Subtask #3
0 / 9.0

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

Subtask #4
0 / 5.0

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

Subtask #5
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 196432 KB Output is correct
2 Correct 22 ms 196440 KB Output is correct
3 Correct 23 ms 196436 KB Output is correct
4 Correct 22 ms 196444 KB Output is correct
5 Correct 23 ms 196432 KB Output is correct
6 Correct 22 ms 196380 KB Output is correct
7 Correct 22 ms 196440 KB Output is correct
8 Correct 23 ms 196444 KB Output is correct
9 Correct 22 ms 196536 KB Output is correct
10 Correct 24 ms 196436 KB Output is correct
11 Correct 23 ms 196444 KB Output is correct
12 Correct 23 ms 196444 KB Output is correct
13 Correct 23 ms 196312 KB Output is correct
14 Correct 23 ms 196696 KB Output is correct
15 Correct 23 ms 196444 KB Output is correct
16 Correct 25 ms 196476 KB Output is correct
17 Correct 24 ms 196376 KB Output is correct
18 Correct 23 ms 196444 KB Output is correct
19 Correct 24 ms 196432 KB Output is correct

Subtask #6
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 196432 KB Output is correct
2 Correct 22 ms 196440 KB Output is correct
3 Correct 23 ms 196436 KB Output is correct
4 Correct 22 ms 196444 KB Output is correct
5 Correct 23 ms 196432 KB Output is correct
6 Correct 22 ms 196380 KB Output is correct
7 Correct 22 ms 196440 KB Output is correct
8 Correct 23 ms 196444 KB Output is correct
9 Correct 22 ms 196536 KB Output is correct
10 Correct 24 ms 196436 KB Output is correct
11 Correct 23 ms 196444 KB Output is correct
12 Correct 23 ms 196444 KB Output is correct
13 Correct 23 ms 196312 KB Output is correct
14 Correct 23 ms 196696 KB Output is correct
15 Correct 23 ms 196444 KB Output is correct
16 Correct 25 ms 196476 KB Output is correct
17 Correct 24 ms 196376 KB Output is correct
18 Correct 23 ms 196444 KB Output is correct
19 Correct 24 ms 196432 KB Output is correct
20 Correct 36 ms 196444 KB Output is correct
21 Correct 35 ms 196444 KB Output is correct
22 Correct 33 ms 196300 KB Output is correct
23 Correct 34 ms 196552 KB Output is correct
24 Correct 35 ms 196432 KB Output is correct
25 Correct 34 ms 196432 KB Output is correct
26 Correct 34 ms 196436 KB Output is correct
27 Correct 33 ms 196444 KB Output is correct

Subtask #7
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 196432 KB Output is correct
2 Correct 22 ms 196440 KB Output is correct
3 Correct 23 ms 196436 KB Output is correct
4 Correct 22 ms 196444 KB Output is correct
5 Correct 23 ms 196432 KB Output is correct
6 Correct 22 ms 196380 KB Output is correct
7 Correct 22 ms 196440 KB Output is correct
8 Correct 23 ms 196444 KB Output is correct
9 Correct 22 ms 196536 KB Output is correct
10 Correct 24 ms 196436 KB Output is correct
11 Correct 23 ms 196444 KB Output is correct
12 Correct 23 ms 196444 KB Output is correct
13 Correct 23 ms 196312 KB Output is correct
14 Correct 23 ms 196696 KB Output is correct
15 Correct 23 ms 196444 KB Output is correct
16 Correct 25 ms 196476 KB Output is correct
17 Correct 24 ms 196376 KB Output is correct
18 Correct 23 ms 196444 KB Output is correct
19 Correct 24 ms 196432 KB Output is correct
20 Correct 36 ms 196444 KB Output is correct
21 Correct 35 ms 196444 KB Output is correct
22 Correct 33 ms 196300 KB Output is correct
23 Correct 34 ms 196552 KB Output is correct
24 Correct 35 ms 196432 KB Output is correct
25 Correct 34 ms 196432 KB Output is correct
26 Correct 34 ms 196436 KB Output is correct
27 Correct 33 ms 196444 KB Output is correct
28 Correct 145 ms 196444 KB Output is correct
29 Correct 130 ms 196552 KB Output is correct
30 Correct 146 ms 196572 KB Output is correct
31 Correct 62 ms 196564 KB Output is correct
32 Correct 126 ms 196444 KB Output is correct
33 Correct 137 ms 196436 KB Output is correct
34 Correct 144 ms 196572 KB Output is correct

Subtask #8
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 196432 KB Output is correct
2 Correct 22 ms 196440 KB Output is correct
3 Correct 23 ms 196436 KB Output is correct
4 Correct 22 ms 196444 KB Output is correct
5 Correct 23 ms 196432 KB Output is correct
6 Correct 22 ms 196380 KB Output is correct
7 Correct 22 ms 196440 KB Output is correct
8 Correct 23 ms 196444 KB Output is correct
9 Correct 22 ms 196536 KB Output is correct
10 Correct 24 ms 196436 KB Output is correct
11 Correct 23 ms 196444 KB Output is correct
12 Correct 23 ms 196444 KB Output is correct
13 Incorrect 1 ms 500 KB Output isn't correct
14 Halted 0 ms 0 KB -

Subtask #9
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 38 ms 196432 KB Output is correct
2 Correct 22 ms 196440 KB Output is correct
3 Correct 23 ms 196436 KB Output is correct
4 Correct 22 ms 196444 KB Output is correct
5 Correct 23 ms 196432 KB Output is correct
6 Correct 22 ms 196380 KB Output is correct
7 Correct 22 ms 196440 KB Output is correct
8 Correct 23 ms 196444 KB Output is correct
9 Correct 22 ms 196536 KB Output is correct
10 Correct 24 ms 196436 KB Output is correct
11 Correct 23 ms 196444 KB Output is correct
12 Correct 23 ms 196444 KB Output is correct
13 Incorrect 1 ms 500 KB Output isn't correct
14 Halted 0 ms 0 KB -