Pagini recente » Cod sursa (job #2168483) | Cod sursa (job #973062) | Cod sursa (job #1096216) | Cod sursa (job #1343586) | Cod sursa (job #1156028)
#include<iostream>
#include<fstream>
#include<math.h>
int v[10001][10001],n,m,a1,a2,a3,c[100001],x,y;
using namespace std;
int main()
{
ifstream fin("arbore.in");
ofstream fout("arbore.out");
fin>>n>>m;
for(a1=1;a1<n;a1++)
{
fin>>a2;
fin>>v[a2][v[a2][0]+1];
v[a2][0]++;
}
for(a3=1;a3<=m;a3++)
{
fin>>x;
if(x==1)
{
fin>>x;
fin>>y;
c[x]+=y;
for(a2=1;a2<=n;a2++)
{
if(v[x][a2]==0) break;
c[v[x][a2]]+=y;
}
}
else
{
fin>>y;
for(a1=1;a1<=n;a1++)
{
if(c[a1]==y)
{
fout<<a1<<endl;
break;
}
}
}
}
}