oj.uz

Submission #46467

# Submission time Handle Problem Language Result Execution time Memory
46467 2018-04-21T02:26:34 Z RockyB Building Bridges (CEOI17_building) C++17
30 / 100
 3000 ms 3128 KB 
/// In The Name Of God

#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")

#include <bits/stdc++.h>

#define f first
#define s second

#define pb push_back
#define pp pop_back
#define mp make_pair

#define sz(x) (int)x.size()
#define sqr(x) ((x) * 1ll * (x))
#define all(x) x.begin(), x.end()

#define Kazakhstan ios_base :: sync_with_stdio(0), cin.tie(0), cout.tie(0);

#define nl '\n'
#define ioi exit(0);

typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;

const int N = (int)1e5 + 7;
const int inf = (int)1e9 + 7;
const int mod = (int)1e9 + 7;
const ll linf = (ll)1e18 + 7;

const int dx[] = {-1, 0, 1, 0, 1, -1, -1, 1};
const int dy[] = {0, 1, 0, -1, 1, -1, 1, -1};

using namespace std;

int n;
int h[N], w[N];
ll dp[N];
int main() {
	#ifdef IOI2018
		freopen ("in.txt", "r", stdin);
	#endif
	Kazakhstan
	cin >> n;
	for (int i = 1; i <= n; i++) {
		cin >> h[i];
	}
	for (int i = 1; i <= n; i++) {
		cin >> w[i];
	}
	memset(dp, 0x3f, sizeof(dp));
	dp[1] = 0;
	for (int i = 2; i <= n; i++) {
		ll add = 0;
		for (int j = i - 1; j >= 1; j--) {
			dp[i] = min(dp[i], sqr(h[i] - h[j]) + add + dp[j]);
			add += w[j];
		}
	}
	cout << dp[n];
	ioi
}

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1144 KB Output is correct
2 Correct 2 ms 1144 KB Output is correct
3 Correct 2 ms 1312 KB Output is correct
4 Correct 4 ms 1312 KB Output is correct
5 Correct 4 ms 1312 KB Output is correct

Subtask #2
0 / 30.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3054 ms 3128 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1144 KB Output is correct
2 Correct 2 ms 1144 KB Output is correct
3 Correct 2 ms 1312 KB Output is correct
4 Correct 4 ms 1312 KB Output is correct
5 Correct 4 ms 1312 KB Output is correct
6 Execution timed out 3054 ms 3128 KB Time limit exceeded
7 Halted 0 ms 0 KB -