CF - 807A. Is it rated? - 模拟

1.题目描述：

A. Is it rated?

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Is it rated?

Here it is. The Ultimate Question of Competitive Programming, Codeforces, and Everything. And you are here to answer it.

Another Codeforces round has been conducted. No two participants have the same number of points. For each participant, from the top to the bottom of the standings, their rating before and after the round is known.

It's known that if at least one participant's rating has changed, then the round was rated for sure.

It's also known that if the round was rated and a participant with lower rating took a better place in the standings than a participant with higher rating, then at least one round participant's rating has changed.

In this problem, you should not make any other assumptions about the rating system.

Determine if the current round is rated, unrated, or it's impossible to determine whether it is rated of not.

Input

The first line contains a single integer n (2 ≤ n ≤ 1000) — the number of round participants.

Each of the next n lines contains two integers ai and bi (1 ≤ ai, bi ≤ 4126) — the rating of the i-th participant before and after the round, respectively. The participants are listed in order from the top to the bottom of the standings.

Output

If the round is rated for sure, print "rated". If the round is unrated for sure, print "unrated". If it's impossible to determine whether the round is rated or not, print "maybe".

Examples

input

6
3060 3060
2194 2194
2876 2903
2624 2624
3007 2991
2884 2884

output

rated

input

4
1500 1500
1300 1300
1200 1200
1400 1400

output

unrated

input

5
3123 3123
2777 2777
2246 2246
2246 2246
1699 1699

output

maybe

Note

In the first example, the ratings of the participants in the third and fifth places have changed, therefore, the round was rated.

In the second example, no one's rating has changed, but the participant in the second place has lower rating than the participant in the fourth place. Therefore, if the round was rated, someone's rating would've changed for sure.

In the third example, no one's rating has changed, and the participants took places in non-increasing order of their rating. Therefore, it's impossible to determine whether the round is rated or not.

2.题意概述：

按排名从高到低给出一次 Codeforces Round 参加者的原 rating ( ai ) 和 新 rating ( bi ) ，问这场比赛是否 rated 或无法判断 (maybe) 。

已知：

• rated Round 至少有一个参加者的 rating 发生了改变 ( bi−ai≠0 )
• 如果这是 rated Round 且存在 ai<aj (i<j) ，则至少有一个参加的 rating 发生了改变

3.解题思路：

根据上述条件判断 Round 是否 rated。

• 若存在 bi≠ai ，则一定是 rated
• 若存在 ai<aj (i<j) 且 所有 ai=bi ，则一定为 unrated
• 其余都为 maybe。

4.AC代码：

#include <bits/stdc++.h>
#define INF 0x3f3f3f3f
#define maxn 100100
#define lson root << 1
#define rson root << 1 | 1
#define lent (t[root].r - t[root].l + 1)
#define lenl (t[lson].r - t[lson].l + 1)
#define lenr (t[rson].r - t[rson].l + 1)
#define N 1111
#define eps 1e-6
#define pi acos(-1.0)
#define e exp(1.0)
using namespace std;
const int mod = 1e9 + 7;
typedef long long ll;
typedef unsigned long long ull;
struct node
{
	int a, b;
} p[N];
int main()
{
#ifndef ONLINE_JUDGE
	freopen("in.txt", "r", stdin);
	freopen("out.txt", "w", stdout);
	long _begin_time = clock();
#endif
	int n;
	while (~scanf("%d", &n))
	{
		bool rate = 0;
		for (int i = 0; i < n; i++)
		{
			scanf("%d%d", &p[i].a, &p[i].b);
			if (p[i].a != p[i].b)
				rate = 1;
		}
		if (rate)
		{
			puts("rated");
			continue;
		}
		for (int i = 1; i < n; i++)
			if (p[i].b > p[i - 1].b)
			{
				rate = 1;
				break;
			}
		puts(rate ? "unrated" : "maybe");
	}
#ifndef ONLINE_JUDGE
	long _end_time = clock();
	printf("time = %ld ms.", _end_time - _begin_time);
#endif
	return 0;
}