比赛 |
集训 |
评测结果 |
TTTTTTTTTTA |
题目名称 |
兔子集团军 |
最终得分 |
9 |
用户昵称 |
LikableP |
运行时间 |
19.994 s |
代码语言 |
C++ |
内存使用 |
12.80 MiB |
提交时间 |
2025-07-03 11:39:25 |
显示代码纯文本
#include <cstdio>
#include <unordered_map>
template <typename T> T read();
template <typename T> void write(T, char);
template <typename T> T max(T, T);
template <typename T> T min(T, T);
bool check(int, int);
const int MAXN = 1e6 + 10;
int n;
int c[MAXN], v[MAXN], f[MAXN];
int maxx = -1;
long long minn = 0x7fffffffffffffff;
int main() {
freopen("RRR.in", "r", stdin);
freopen("RRR.out", "w", stdout);
n = read<int>();
for (int i = 1; i <= n; ++i) c[i] = read<int>(), maxx = max(maxx, c[i]);
for (int i = 1; i <= n; ++i) v[i] = read<int>();
for (int i = 1; i <= n; ++i) f[i] = read<int>();
for (int i = 1; i <= n; ++i) {
for (int j = i; j <= n; ++j) {
if (check(i, j)) {
long long ans = 0;
for (int k = i; k <= j; ++k) {
ans += 1ll * v[k] * f[k - i + 1] * f[k - i + 1];
}
minn = min(minn, ans);
}
}
}
write(minn, '\n');
return 0;
}
bool check(int l, int r) {
::std::unordered_map<int, bool> vis;
for (int i = l; i <= r; ++i) vis[c[i]] = 1;
for (int i = 1; i <= l - 1; ++i)
if (vis[c[i]]) return false;
for (int i = r + 1; i <= n; ++i)
if (vis[c[i]]) return false;
return true;
}
template <typename T> T min(T x, T y) {
return x < y ? x : y;
}
template <typename T> T max(T x, T y) {
return x > y ? x : y;
}
#define isdigit(ch) (ch >= '0' && ch <= '9')
template <typename T> T read() {
T res = 0, f = 1;
char ch = getchar();
for (; !isdigit(ch); ch = getchar())
if (ch == '-') f = -1;
for (; isdigit(ch); ch = getchar()) res = (res << 3) + (res << 1) + (ch ^ 48);
return res * f;
}
template <typename T> void write(T x, char ed) {
if (x < 0) x = -x, putchar('-');
static int sta[sizeof(T) << 2], top = 0;
do {
sta[++top] = x % 10;
x /= 10;
} while (x);
while (top) {
putchar(sta[top--] ^ 48);
}
putchar(ed);
}