QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#555811#9238. Treezhouhuanyi#0 46ms25976kbC++14678b2024-09-10 10:14:192024-09-10 10:14:20

Judging History

你现在查看的是最新测评结果

  • [2024-09-10 10:14:20]
  • 评测
  • 测评结果:0
  • 用时:46ms
  • 内存:25976kb
  • [2024-09-10 10:14:19]
  • 提交

answer

#include "tree.h"
#include<iostream>
#include<cstdio>
#define N 200000
using namespace std;
int n,L,R,fa[N+1];
long long res,A[N+1],B[N+1];
std::vector<int> p, w;
vector<int>E[N+1];
void dfs(int x)
{
	A[x]=B[x]=0;
	for (int i=0;i<E[x].size();++i) dfs(E[x][i]),A[x]+=A[E[x][i]],B[x]+=B[E[x][i]];
	if (B[x]<L) res+=L-B[x],A[x]=B[x]=L;
	else if (A[x]>R) res+=A[x]-R,A[x]=B[x]=R;
	else A[x]=max(A[x],(long long)(L)),B[x]=min(B[x],(long long)(R));
	return;
}
void init(std::vector<int> P, std::vector<int> W)
{
	n=P.size();
	for (int i=1;i<n;++i) E[P[i]].push_back(i);
	return;
}
long long query(int sl, int sr)
{
	L=sl,R=sr,res=0,dfs(0);
	return res;
}

详细

Subtask #1:

score: 0
Wrong Answer

Test #1:

score: 0
Wrong Answer
time: 46ms
memory: 25976kb

input:

ZYKrr4gCMcKeyfk6kbZU5k4ZyW3sAGT0
200000
0 0 2 2 4 5 4 5 8 9 10 9 8 10 14 15 14 15 18 19 20 21 18 22 21 24 24 27 22 27 30 31 31 33 30 19 20 33 38 38 40 41 41 43 44 43 44 47 48 49 50 49 50 53 54 53 48 54 58 58 60 60 62 62 64 64 66 66 67 67 70 71 72 71 72 75 70 75 78 78 80 81 80 81 84 85 86 86 88 89 90...

output:

11XNDQnkdGXK8y3iaqfMvWKu4vqrBbz1
OK
1568474
1922767
240159
1443075
1327910
2880636
3007962
962395
842232
3002826

result:

wrong answer 3rd lines differ - on the 1st token, expected: '682654248246', found: '1568474'

Subtask #2:

score: 0
Wrong Answer

Test #11:

score: 0
Wrong Answer
time: 3ms
memory: 10880kb

input:

ZYKrr4gCMcKeyfk6kbZU5k4ZyW3sAGT0
2000
0 0 1 1 4 4 6 7 6 7 10 10 12 12 14 15 14 15 18 19 19 21 18 21 24 24 26 27 26 27 30 30 32 32 34 34 36 37 38 39 39 41 37 38 36 41 46 47 48 47 48 51 51 53 54 54 56 56 58 58 60 61 61 63 64 64 66 67 66 67 70 71 72 72 74 75 76 76 75 74 70 77 63 60 77 85 85 87 87 89 89...

output:

11XNDQnkdGXK8y3iaqfMvWKu4vqrBbz1
OK
490592
1764528
2277313
110025
2890322
1693629
455972
89690
355920
744170

result:

wrong answer 3rd lines differ - on the 1st token, expected: '175909322571', found: '490592'

Subtask #3:

score: 0
Skipped

Dependency #2:

0%

Subtask #4:

score: 0
Time Limit Exceeded

Test #33:

score: 0
Time Limit Exceeded

input:

ZYKrr4gCMcKeyfk6kbZU5k4ZyW3sAGT0
200000
0 1 0 1 2 2 6 6 7 7 10 11 11 13 14 13 14 17 10 17 20 21 22 22 23 21 20 23 28 29 28 29 32 33 34 32 33 34 38 39 39 40 42 42 44 45 46 47 48 45 46 48 52 53 53 54 56 56 58 58 60 61 62 63 63 65 61 66 62 66 70 71 71 72 72 75 60 65 75 79 52 44 70 47 40 54 79 87 87 89 ...

output:


result:


Subtask #5:

score: 0
Skipped

Dependency #4:

0%

Subtask #6:

score: 0
Time Limit Exceeded

Test #47:

score: 0
Time Limit Exceeded

input:

ZYKrr4gCMcKeyfk6kbZU5k4ZyW3sAGT0
200000
0 1 0 1 4 5 5 7 7 9 9 11 12 13 13 11 14 12 14 19 20 19 20 23 24 25 26 26 28 28 30 31 32 33 33 35 35 30 32 31 37 41 42 43 24 44 46 46 48 49 50 51 51 53 54 55 55 56 56 48 50 54 44 59 49 25 59 67 68 67 68 71 71 72 72 75 76 76 78 79 80 37 80 83 83 85 86 85 79 41 8...

output:


result:


Subtask #7:

score: 0
Skipped

Dependency #1:

0%