Submission #417940

#	Time	Username	Problem	Language	Result	Execution time	Memory
417940		victoriad	Regions (IOI09_regions)	C++14	40 / 100	3791 ms	131076 KiB

regions

#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include <utility>
#include <queue>
#include <map>
#include <iomanip>
using namespace std;
 vector<int>region;
 void dfs(int nodo,vector<vector<int> >&g,vector<bool>&vi,vector<int>&b,int x,int a){
     vi[nodo]=true;
     b[region[nodo]]+=x;
	 if(region[nodo]==a)x++;
     for(int c:g[nodo]){
         if(!vi[c]){
             dfs(c,g,vi,b,x,a);
         }
     }
 }
 
int main(){
  int N,R,Q;
  cin>>N>>R>>Q;
  vector<vector<int> >g(N);
  g.clear();
  region.resize(N);
  int a,b;
  cin>>a;
  a--;
  region[0]=a;
  for(int i=1;i<N;i++){
    cin>>a>>b;
    a--;
    b--;
    region[i]=b;
    g[a].push_back(i);
  }
  vector<vector<int> >bus(R);
  vector<int>vacio(R,0);
  for(int i=0;i<R;i++)bus[i]=vacio;
 vector<bool>rv(N,false);
  for(int i=0;i<N;i++){
      int j=region[i];
	  if(!rv[j]){
		  rv[j]=true;
      vector<bool>vi(N,false);
      dfs(0,g,vi,bus[j],0,j);
	  }
  }
  for(int i=0;i<Q;i++){
      cin>>a>>b;
        a--;
        b--;
      cout<<bus[a][b]<<"\n";
  }
   
    
  return 0;
}

• Subtask 1: 15 / 15
• Subtask 2: 25 / 85