Submission #394124

#	Time	Username	Problem	Language	Result	Execution time	Memory
394124		victoriad	Regions (IOI09_regions)	C++14	0 / 100	1424 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;
 

int main(){
  int N,R,Q;
  cin>>N>>R>>Q;
  vector<int>zero(R,0);
  vector<vector<int> >max;
  for(int i=0;i<N;i++){
    max.push_back(zero);
  }
  vector<int>padre(N,-1);
  vector<int>region(N);
  int a,b;
  cin>>a;
  region[0]=a-1;
  for(int i=1;i<N;i++){
    cin>>a>>b;
    padre[i]=a-1;
    region[i]=b-1;
    max[region[a-1]][b-1]++;
    if(padre[a-1]!=-1){
      max[region[padre[a-1]]][b-1]++;
    }
  }
  for(int i=0;i<Q;i++){
    cin>>a>>b;
    cout<<max[a-1][b-1]<<"\n";

  }
  return 0;
}

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