QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#717626 | #6438. Crystalfly | Chihiro# | WA | 69ms | 9448kb | C++17 | 1.7kb | 2024-11-06 18:32:42 | 2024-11-06 18:32:42 |
Judging History
answer
#include<bits/stdc++.h>
#define IOS ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define endl '\n'
#define fixed(s) fixed<<setprecision(12)<<s
//#define int long long
using namespace std;
typedef pair<int, int> PII;
typedef long long ll;
typedef pair<ll, PII> PLII;
const int N = 100010;
int n;
ll dp[N][2], son[N];
ll a[N], tim[N];
vector<int> g[N];
void dfs(int u, int fa)
{
for(auto j : g[u])
{
if(j == fa)continue;
son[u] += a[j];
dfs(j, u);
}
dp[u][0] = 0, dp[u][1] = a[u];
ll sum = 0;
for(auto j : g[u])
{
if(j == fa)continue;
sum += dp[j][0];
}
for(auto j : g[u])//先不考虑三
{
if(j == fa)continue;
dp[u][0] = max(dp[u][0], sum + a[j]);
}
ll max1 = 0, max2 = 0;
for(auto j : g[u])
{
if(j == fa)continue;
ll ret = a[j] - son[j];
if(ret > max1)max2 = max1, max1 = ret;
else if(ret > max2)max2 = ret;
}
// if(u == 1)
// {
// cout << "===" << max1 << endl;
// cout << "---" << a[3] << ' ' << son[3] << endl;
// }
for(auto j : g[u])
{
if(j == fa)continue;
if(tim[j] == 3)
{
ll ret = a[j] - son[j], t;
if(ret == max1)t = max2;
else t = max1;
dp[u][0] = max(dp[u][0], sum + t + a[j]);
}
}
dp[u][1] = dp[u][0] + a[u];
}
void solve()
{
cin >> n;
for(int i = 1; i <= n; i ++)
{
cin >> a[i];
g[i].clear();
son[i] = 0;
}
for(int i = 1; i <= n; i ++)cin >> tim[i];
for(int i = 1; i < n; i ++)
{
int u, v;
cin >> u >> v;
g[u].push_back(v);
g[v].push_back(u);
}
dfs(1, -1);
cout << dp[1][1] << endl;
}
int main()
{
IOS
int _;
cin >> _;
while(_ --)
{
solve();
}
return 0;
}
詳細信息
Test #1:
score: 100
Accepted
time: 1ms
memory: 7884kb
input:
2 5 1 10 100 1000 10000 1 2 1 1 1 1 2 1 3 2 4 2 5 5 1 10 100 1000 10000 1 3 1 1 1 1 2 1 3 2 4 2 5
output:
10101 10111
result:
ok 2 number(s): "10101 10111"
Test #2:
score: 0
Accepted
time: 1ms
memory: 8156kb
input:
10 6 8 1 1 5 8 9 2 1 2 2 2 2 1 2 2 3 2 4 1 5 2 6 6 6 4 4 1 3 6 2 1 3 3 3 3 1 2 1 3 3 4 4 5 5 6 6 10 5 1 8 5 1 1 3 1 2 2 2 1 2 2 3 2 4 2 5 3 6 10 6 8 8 9 6 9 5 6 6 4 2 1 3 3 2 2 2 2 3 1 1 2 1 3 3 4 4 5 5 6 4 7 2 8 7 9 9 10 7 10 9 1 5 7 5 4 1 1 1 2 1 3 2 1 2 1 3 3 4 3 5 5 6 1 7 5 7 1 1 4 2 3 1 3 2 2 1...
output:
25 24 24 56 31 14 16 28 19 19
result:
ok 10 numbers
Test #3:
score: -100
Wrong Answer
time: 69ms
memory: 9448kb
input:
100000 10 9 1 7 9 5 1 10 5 3 8 2 1 1 3 1 2 2 3 3 1 1 2 2 3 3 4 1 5 2 6 2 7 6 8 7 9 7 10 3 6 6 1 2 1 2 1 2 1 3 10 6 5 3 7 1 5 1 9 7 3 3 1 3 3 1 3 2 2 2 3 1 2 1 3 3 4 4 5 2 6 6 7 4 8 7 9 1 10 7 2 8 9 7 7 9 10 2 3 2 2 3 2 1 1 2 2 3 1 4 3 5 4 6 3 7 1 8 1 1 4 2 7 9 9 9 8 4 2 7 3 1 2 1 1 1 1 1 2 2 3 2 4 3...
output:
49 12 41 45 8 4 38 22 20 21 5 19 23 44 26 5 21 28 28 32 36 15 5 26 38 36 20 35 27 36 20 9 32 32 22 11 41 15 20 54 38 20 45 36 20 29 24 4 37 44 30 45 17 17 36 29 3 6 24 44 25 28 50 13 5 1 44 27 17 21 15 17 17 24 29 39 10 39 38 26 22 24 9 17 41 7 28 33 51 18 14 14 7 35 23 13 11 43 30 24 35 2 43 33 17 ...
result:
wrong answer 679th numbers differ - expected: '47', found: '46'