Cod sursa(job #2973615)

Utilizator Luca529Taschina Luca Luca529 Data 1 februarie 2023 14:12:10
Problema Lowest Common Ancestor Scor 90
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 3.26 kb
#include <iostream>
#include <fstream>
#include <vector>

using namespace std;

class InParser {
private:
	FILE *fin;
	char *buff;
	int sp;

	char read_ch() {
		++sp;
		if (sp == 4096) {
			sp = 0;
			fread(buff, 1, 4096, fin);
		}
		return buff[sp];
	}

public:
	InParser(const char* nume) {
		fin = fopen(nume, "r");
		buff = new char[4096]();
		sp = 4095;
	}

	InParser& operator >> (int &n) {
		char c;
		while (!isdigit(c = read_ch()) && c != '-');
		int sgn = 1;
		if (c == '-') {
			n = 0;
			sgn = -1;
		} else {
			n = c - '0';
		}
		while (isdigit(c = read_ch())) {
			n = 10 * n + c - '0';
		}
		n *= sgn;
		return *this;
	}

	InParser& operator >> (long long &n) {
		char c;
		n = 0;
		while (!isdigit(c = read_ch()) && c != '-');
		long long sgn = 1;
		if (c == '-') {
			n = 0;
			sgn = -1;
		} else {
			n = c - '0';
		}
		while (isdigit(c = read_ch())) {
			n = 10 * n + c - '0';
		}
		n *= sgn;
		return *this;
	}
};

class OutParser {
private:
    FILE *fout;
    char *buff;
    int sp;

    void write_ch(char ch) {
        if (sp == 50000) {
            fwrite(buff, 1, 50000, fout);
            sp = 0;
            buff[sp++] = ch;
        } else {
            buff[sp++] = ch;
        }
    }


public:
    OutParser(const char* name) {
        fout = fopen(name, "w");
        buff = new char[50000]();
        sp = 0;
    }
    ~OutParser() {
        fwrite(buff, 1, sp, fout);
        fclose(fout);
    }

    OutParser& operator << (int vu32) {
        if (vu32 <= 9) {
            write_ch(vu32 + '0');
        } else {
            (*this) << (vu32 / 10);
            write_ch(vu32 % 10 + '0');
        }
        return *this;
    }

    OutParser& operator << (long long vu64) {
        if (vu64 <= 9) {
            write_ch(vu64 + '0');
        } else {
            (*this) << (vu64 / 10);
            write_ch(vu64 % 10 + '0');
        }
        return *this;
    }

    OutParser& operator << (char ch) {
        write_ch(ch);
        return *this;
    }
    OutParser& operator << (const char *ch) {
        while (*ch) {
            write_ch(*ch);
            ++ch;
        }
        return *this;
    }
};

InParser fin("lca.in");
OutParser fout("lca.out");
vector<int> x[100001];
int niv[100001];

void DFS(int nod)
{vector<int>:: iterator I;
 for(I=x[nod].begin();I<x[nod].end();I++)
 if(*I>0 && niv[*I]==0)
 {niv[*I]=niv[nod]+1;
  DFS(*I);
 }
}

int F(int nod, int v)
{if(niv[nod]==v)return nod;
 else
 {vector<int>:: iterator I;
  for(I=x[nod].begin();I<x[nod].end();I++)
  if(*I<0)return F(-(*I), v);
 }
}

int F1(int a, int b)
{int a1=0, b1=0;
 vector<int>:: iterator I;
 for(I=x[a].begin();I<x[a].end() && a1==0;I++)
 if(*I<0)a1=-(*I);

 for(I=x[b].begin();I<x[b].end() && b1==0;I++)
 if(*I<0)b1=-(*I);

 if(a1!=b1)return F1(a1, b1);
 else return a1;
}

int main()
{   int n, m, a, b;
    fin>>n>>m;
    for(int i=2;i<=n;i++)
    {fin>>a;
     x[a].push_back(i);
     x[i].push_back(-a);
    }
    niv[1]=1;
    DFS(1);

    for(int i=1;i<=m;i++)
    {fin>>a>>b;
     if(niv[a]>niv[b])a=F(a, niv[b]);
     else b=F(b, niv[a]);

     if(a==b)fout<<a<<"\n";
     else fout<<F1(a, b)<<"\n";
    }

    return 0;
}