hiho week 176 register

Ended

Participants:281

Verdict:Accepted
Score:100 / 100
Submitted:2017-11-17 13:54:12

Lang:G++

Edit
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
#include<iostream>
#include <string.h>
using namespace std;
long a[21][1001];
int is[21][1001];
long b[100];
int check(long i)
{
    long fir,sec;
    int j;
    for(j=2;j<=a[i][0];j=j+2)
    {
        if(is[i][j-1]==1)fir=b[a[i][j-1]];else fir=a[i][j-1];
        if(is[i][j+1]==1)sec=b[a[i][j+1]];else sec=a[i][j+1];
        if(a[i][j]==2)
        if(fir>sec)
        {
            return 1;
            break;
        }
        if(a[i][j]==1)
        if(fir>=sec)
        {
            return 1;
            break;
        }
    }
    return 0;
}
int main(void)
{
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX