codeforces 719A:Vitya in the Countryside

Posted ljh2000

tags:

篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了codeforces 719A:Vitya in the Countryside相关的知识,希望对你有一定的参考价值。

Description

Every summer Vitya comes to visit his grandmother in the countryside. This summer, he got a huge wart. Every grandma knows that one should treat warts when the moon goes down. Thus, Vitya has to catch the moment when the moon is down.

Moon cycle lasts 30 days. The size of the visible part of the moon (in Vitya‘s units) for each day is 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 14, 13, 12, 11, 10, 9, 8, 7, 6, 5, 4, 3, 2, 1, and then cycle repeats, thus after the second 1 again goes 0.

As there is no internet in the countryside, Vitya has been watching the moon for n consecutive days and for each of these days he wrote down the size of the visible part of the moon. Help him find out whether the moon will be up or down next day, or this cannot be determined by the data he has.

Input

The first line of the input contains a single integer n (1 ≤ n ≤ 92) — the number of consecutive days Vitya was watching the size of the visible part of the moon.

The second line contains n integers ai (0 ≤ ai ≤ 15) — Vitya‘s records.

It‘s guaranteed that the input data is consistent.

Output

If Vitya can be sure that the size of visible part of the moon on day n + 1 will be less than the size of the visible part on day n, then print "DOWN" at the only line of the output. If he might be sure that the size of the visible part will increase, then print "UP". If it‘s impossible to determine what exactly will happen with the moon, print -1.

Examples
Input
5
3 4 5 6 7
Output
UP
Input
7
12 13 14 15 14 13 12
Output
DOWN
Input
1
8
Output
-1
Note

In the first sample, the size of the moon on the next day will be equal to 8, thus the answer is "UP".

In the second sample, the size of the moon on the next day will be 11, thus the answer is "DOWN".

In the third sample, there is no way to determine whether the size of the moon on the next day will be 7 or 9, thus the answer is -1.

 

正解:模拟

解题报告:

  直接按题意要求判断就可以了,注意一下n=1时的边界条件,听说很多人被hack了...

 

 1 //It is made by jump~
 2 #include <iostream>
 3 #include <cstdlib>
 4 #include <cstring>
 5 #include <cstdio>
 6 #include <cmath>
 7 #include <algorithm>
 8 #include <ctime>
 9 #include <vector>
10 #include <queue>
11 #include <map>
12 #include <set>
13 using namespace std;
14 typedef long long LL;
15 const int inf = (1<<30);
16 int n,a[100];
17 
18 inline int getint()
19 {
20     int w=0,q=0; char c=getchar();
21     while((c<0 || c>9) && c!=-) c=getchar(); if(c==-) q=1,c=getchar(); 
22     while (c>=0 && c<=9) w=w*10+c-0, c=getchar(); return q ? -w : w;
23 }
24 
25 inline void work(){
26     n=getint(); for(int i=1;i<=n;i++) a[i]=getint();
27     if(n==1 && a[1]==0) printf("UP");
28     else if(n==1 && a[1]==15) printf("DOWN");
29     else if(n==1) printf("-1");
30     else{
31     if(a[n]>a[n-1]) {
32         if(a[n]==15) printf("DOWN");
33         else printf("UP");
34     }
35     else{
36         if(a[n]==0) printf("UP");
37         else printf("DOWN");
38     }
39     }
40 }
41 
42 int main()
43 {
44     work();
45     return 0;
46 }

 

以上是关于codeforces 719A:Vitya in the Countryside的主要内容,如果未能解决你的问题,请参考以下文章

CodeForces 719A Vitya in the Countryside 思维题

CodeForces 719A. Vitya in the Countryside

Codeforce 719A

codeforces 842D Vitya and Strange Lesson

Codeforce842D Vitya and Strange Lesson

E/MediaPlayer: start called in state 4, mPlayer(0xcc719a40)解决