Submission #1564974

---

Source Code Expand

#include "iostream"
#include "climits"
#include "list"
#include "queue"
#include "stack"
#include "set"
#include "functional"
#include "algorithm"
#include "string"
#include "map"
#include "iomanip"
#include "random"

using namespace std;

const long long int MOD = 1000000007;
const long double EPS = 0.00000001;
const long double PI = 3.1415926535897932384626433;

long long int N, M, K, L, R, H, W;



int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);

	cin >> N >> M;
	vector < pair<int, int>>place(M);
	for (int i = 0; i < M; i++) {
		cin >> place[i].first >> place[i].second;
	}
	int l[101] = {};
	for (int i = 0; i < M; i++) {
		l[place[i].first] = max(l[place[i].first], place[i].second);
	}
	for (int i = 1; i < N; i++) {
		l[i] = max(l[i], l[i - 1]);
	}
	int box = 0;
	int ans = 0;
	while (box < N) {
		if (l[box + 1] <= box + 1) {
			cout << "Impossible\n";
			return 0;
		}
		box = l[box + 1];
		ans++;
	}
	cout << ans << endl;
	return 0;
}

Submission Info

Judge Result