#include <algorithm>
struct F{int a,b;};
F D[3000];
void addFile(int i, int* B)
{
D[i].a++;
if(i==0)
return;
addFile(B[i],B);
}
void UpDelete(int i,int r,int M,int* B)
{
int k,t;
for(k=0;D[k].b!=i;k++);
D[k].a-=r;
if(B[i]==-1)
return;
for(t=0;D[t].b!=B[i];t++);
UpDelete(t,r,M,B);
}
void deleteDir(int i,int M,int* B)
{
int j,k;
for(k=0;D[k].b!=i;k++);
for(j=0;j<M;j++)
{
if(B[j]==D[k].b)
{
deleteDir(j,M,B);
}
}
}
int Compare(const void* a,const void* b)
{
return ((F*)b)->a-((F*)a)->a;
}
int DeletePlan(int N,int M, int K, int* A,int* B)
{
int i,s=0;
for(i=0;i<N;i++)
{
addFile(A[i],B);
}
for(i=0;i<M;i++)
{
D[i].b=i;
}
qsort(D,M,sizeof(F),Compare);
for(i=0;i<M;i++)
{
if(D[i].a<=K&&D[i].a!=0)
{
K-=D[i].a;
deleteDir(D[i].b,M,B);
UpDelete(D[i].b,D[i].a,M,B);
qsort(D,M,sizeof(F),Compare);
s++;
}
}
s+=K;
return s;
}
Compilation message
grader.cpp:26:2: warning: no newline at end of file
/tmp/ccAgCtZd.o: In function `main':
grader.cpp:(.text+0x87): undefined reference to `CountPair(int, int*)'
collect2: ld returned 1 exit status
