1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <cstring>
#include <vector>
#include <set>
#include <map>
#include <cmath>
#include <list>
#include <ctime>
#include <sstream>
#include <queue>
#include <stack>
#include <bitset>
#include <unordered_set>
#include <unordered_map>
using namespace std;
typedef vector<int> vi;
typedef pair<int,int> pii;
typedef long long ll;
typedef short int sint;
#define FOR(x, b, e) for(int x=(b); x<=(e); ++x)
#define FORD(x, b, e) for(int x=((int)(b))-1; x>=(e); --x)
#define REP(x, n) for(int x=0; x<(n); ++x)
#define VAR(v,n) typeof(n) v=(n)
#define ALL(c) c.begin(),c.end()
#define SIZE(x) ((int)((x).size()))
#define FOREACH(i,c) for(VAR(i,(c).begin());i!=(c).end();++i)
#define PB push_back
#define ST first
#define ND second
#define mp(x,y) make_pair(x,y)
#define DEBUG 1
#define debug(x) {if (DEBUG)cerr <<#x <<" = " <<x <<endl; }
#define debugv(x) {if (DEBUG) {cerr <<#x <<" = "; FOREACH(it, (x)) cerr <<*it <<", "; cout <<endl; }}
#define REMAX(a,b) (a)=max((a),(b));
#define REMIN(a,b) (a)=min((a),(b));
#define wez(n) int (n); scanf("%d",&(n));
#define wez2(n,m) int (n),(m); scanf("%d %d",&(n),&(m));

const int N = 1001010;
const int MOD = 1000000007;
int c[N], d[N];
int maks[N], spos[N];
int n;

int main() {
	scanf("%d", &n);
	maks[0] = 0;
	spos[0] = 1;
	FOR(i, 1, n) {
		scanf("%d %d", &c[i], &d[i]);
		maks[i] = -1;
		spos[i] = 0;
		int currC = c[i], currD = d[i];
		FOR(dl, 1, currD) {
			if (maks[i - dl] != -1) {
				if (dl >= currC) {
					if (maks[i - dl] + 1 > maks[i]) {
						maks[i] = maks[i - dl] + 1;
						spos[i] = spos[i - dl];
					} else if (maks[i - dl] + 1 == maks[i]) {
						spos[i] = (spos[i] + spos[i - dl]) % MOD;
					}
				}
			}
			REMAX(currC, c[i - dl])
			REMIN(currD, d[i - dl])
			if (currC > currD) break;
		}
		//printf("%d: maks: %d, spos: %d\n", i, maks[i], spos[i]);
	}
	if (maks[n] != -1) {
		printf("%d %d\n", maks[n], spos[n]);
	} else {
		printf("NIE\n");
	}
	return 0;
}