Submission #1843271

---

Source Code Expand

#include <iostream>
#include <string>
#include <algorithm>
#include <map>
#include <set>
#include <vector>
#include <queue>
#include <cmath>

#define	MOD 1000000007;
#define PI 3.14159265358979323846;
using namespace std;
typedef long long ll;
ll mod = 1000000007;

int main()
{
	int N, D, K;
	cin >> N >> D >> K;

	int L[10000];
	int R[10000];
	int S[100];
	int T[100];

	for (int i = 0; i < D; i++)
	{
		cin >> L[i] >> R[i];
	}
	for (int i = 0; i < K; i++)
	{
		cin >> S[i] >> T[i];
	}

	for (int i = 0; i < K; i++)
	{
		if (S[i] <= T[i])
		{
			int current = S[i];
			for (int j = 0; j < D; j++)
			{
				if (L[j] <= current && current <= R[j])
				{
					if (R[j] >= T[i])
					{
						current = T[i];
					}
					else if (R[j] < T[i])
					{
						current = R[j];
					}
				}

				if (current == T[i])
				{
					cout << j + 1 << endl;
					break;;
				}
			}
		}
		else {
			int current = S[i];
			for (int j = 0; j < D; j++)
			{
				if (L[j] <= current && current <= R[j])
				{
					if (L[j] <= T[i])
					{
						current = T[i];
					}
					else if (L[j] > T[i])
					{
						current = L[j];
					}
				}

				if (current == T[i])
				{
					cout << j + 1 << endl;
					break;;
				}
			}
		}
	}

	return 0;
}

Submission Info

Judge Result