# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
484465 | 2021-11-03T14:57:24 Z | hoanghq2004 | Building Bridges (CEOI17_building) | C++14 | 3000 ms | 2536 KB |
#include <bits/stdc++.h> #pragma GCC target ("avx2") #pragma GCC optimization ("O3") #pragma GCC optimization ("unroll-loops") using namespace std; const int Nmax = 1e5 + 10; int n, h[Nmax], s[Nmax]; long long f[Nmax]; int main() { ios :: sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> n; for (int i = 1; i <= n; ++i) cin >> h[i]; for (int i = 1; i <= n; ++i) cin >> s[i]; for (int i = 1; i <= n; ++i) s[i] += s[i - 1]; for (int i = 2; i <= n; ++i) { f[i] = 1e18; for (int j = 1; j < i; ++j) { f[i] = min(f[i], f[j] + s[i - 1] - s[j] + 1LL * (h[i] - h[j]) * (h[i] - h[j])); } } cout << f[n]; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 204 KB | Output is correct |
2 | Correct | 0 ms | 204 KB | Output is correct |
3 | Correct | 1 ms | 204 KB | Output is correct |
4 | Correct | 2 ms | 332 KB | Output is correct |
5 | Correct | 1 ms | 332 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Execution timed out | 3096 ms | 2536 KB | Time limit exceeded |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 204 KB | Output is correct |
2 | Correct | 0 ms | 204 KB | Output is correct |
3 | Correct | 1 ms | 204 KB | Output is correct |
4 | Correct | 2 ms | 332 KB | Output is correct |
5 | Correct | 1 ms | 332 KB | Output is correct |
6 | Execution timed out | 3096 ms | 2536 KB | Time limit exceeded |
7 | Halted | 0 ms | 0 KB | - |