Submission #1304513

---

Source Code Expand

#include <iostream>
#include <utility>
#include <algorithm>
#include <cstdio>

using namespace std;

typedef pair<int,int> p;

p ans_fun(p p1, p p2, int flag){
  p ans;
  if(p2.first <= p1.second){
    if(p2.second > p1.second){
      ans.first = p1.first;
      ans.second = p2.second;
      return ans;
    }
    else return p1;
  }
  else if(flag==1) return p1;
  else return p2;
}

int main(){
  long long n;
  int d, k;
  cin >> n >> d >> k;
  int ans[100];
  int bol[100];
  for(int i=0;i<100;i++){
    ans[i]=bol[i]=-1;
  }
  p p_ans[100];
  p lr[10000];
  for(int i=0; i<d; i++){
    int l,r;
    cin >> l >> r;
    lr[i].first = l;
    lr[i].second = r;
  }
  int s[100], t[100];
  for(int i=0; i<k; i++){
    cin >> s[i] >> t[i];
    p_ans[i].first = p_ans[i].second = s[i];
    //printf("p_ans[%d] = %d %d\n", i, p_ans[i].first, p_ans[i].second);
  }
  for(int i=0; i<d; i++){
    for(int j=0; j<k; j++){
      if(bol[j]){
	if(lr[i].first<=p_ans[j].first) p_ans[j]=ans_fun(lr[i],p_ans[j],2);
	else p_ans[j]=ans_fun(p_ans[j],lr[i],1);
	//printf("p_ans[%d] = %d %d\n", j, p_ans[j].first, p_ans[j].second);
	if(p_ans[j].first <= t[j] && t[j] <= p_ans[j].second){
	  ans[j]=i+1;
	  bol[j]=0;
	}
      }
    }
  }

  for(int i=0; i<k; i++)
    cout << ans[i] << endl;
}

Submission Info

Judge Result