Submission #2548143

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

#define LL long long
#define LD long double
#define SC(t,x) static_cast<t>(x)
#define AR(t) vector < t >
#define PII pair < int, int >
#define PLL pair < LL, LL >
#define PIL pair < int, LL >
#define PLI pair < LL, int >
#define MP make_pair
#define PB push_back
#define PF push_front
#define POB pop_back
#define POF pop_front
#define PRF first
#define PRS second
#define INIT(ar,val) memset ( ar, val, sizeof ( ar ) )
#define lp(loop,start,end) for ( int loop = start; loop < end; ++loop )
#define lpd(loop,start,end) for ( int loop = start; loop > end; --loop )
#define lpi(loop,start,end) for ( int loop = start; loop <= end; ++loop )
#define lpdi(loop,start,end) for ( int loop = start; loop >= end; --loop )
#define qmax(a,b) (((a)>(b))?(a):(b))
#define qmin(a,b) (((a)<(b))?(a):(b))
#define qabs(a) (((a)>=0)?(a):(-(a)))

const int INF = 0x3fffffff;
const int SINF = 0x7fffffff;
const long long LINF = 0x3fffffffffffffff;
const long long SLINF = 0x7fffffffffffffff;
const int MAXN = 100007;

class ftT
{
public:
	void clear ()
	{
		INIT ( data, 0 );
	}
	
	void upd ( int p, int x )
	{
		for ( ; p < MAXN; p += p&-p ) data[p] += x;
	}
	
	int sum ( int p )
	{
		int ans = 0;
		for ( ; p; p ^= p&-p ) ans += data[p];
		return ans;
	}
	
private:
	int data[MAXN];
}ft;

int n;
int ia[MAXN][3];
int a[MAXN];
int od[MAXN], ev[MAXN], ko, ke;

void init ();
void input ();
void work ();

int getrev ( int a[], int n );



int main()
{
	init();
	input();
	work();
}



void init ()
{
	// Init Everything Here
	
	ios::sync_with_stdio ( false );
}

void input ()
{
	// input method
	
	scanf ( "%d", &n );
	lp ( i, 0, 3 ) lpi ( j, 1, n ) scanf ( "%d", &ia[j][i] );
}

void work ()
{
	// main work
	
	int maxi, mini;
	lpi ( i, 1, n ){
		maxi = *max_element ( ia[i], ia[i]+3 ), mini = *min_element ( ia[i], ia[i]+3 );
		if ( maxi % 3 == 0 ){
			if ( mini == maxi - 2 && ia[i][0] + ia[i][1] + ia[i][2] == maxi * 3 - 3 ){
				if ( ia[i][0] < ia[i][1] && ia[i][1] < ia[i][2] ) a[i] = maxi / 3;
				else if ( ia[i][0] > ia[i][1] && ia[i][1] > ia[i][2] ) a[i] = -maxi / 3;
				else{
					printf ( "No\n" );
					return;
				}
			}else{
				printf ( "No\n" );
				return;
			}
		}else{
			printf ( "No\n" );
			return;
		}
	}
	
//	lpi ( i, 1, n ) cerr << a[i] << " "; cerr << endl;
	
	lpi ( i, 1, n ) if ( i & 1 ) od[++ko] = a[i]; else ev[++ke] = a[i];
	
	int no = 0, ne = 0, ro, re;
	
	lpi ( i, 1, ko ) if ( od[i] < 0 ) ++no;
	lpi ( i, 1, ke ) if ( ev[i] < 0 ) ++ne;
	
	ro = getrev ( od, ko );
	re = getrev ( ev, ke );
	
	printf ( ( ( no & 1 ) == ( re & 1 ) && ( ne & 1 ) == ( ro & 1 ) ) ? "Yes\n" : "No\n" );
}



int getrev ( int a[], int n )
{
	ft.clear ();
	int ans = 0;
	lpd ( i, n, 0 ){
		ans += ft.sum ( qabs ( a[i] ) );
		ft.upd ( qabs ( a[i] ), 1 );
	}
	return ans;
}

Submission Info

Compile Error

./Main.cpp: In function ‘void input()’:
./Main.cpp:91:20: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf ( "%d", &n );
                    ^
./Main.cpp:92:58: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  lp ( i, 0, 3 ) lpi ( j, 1, n ) scanf ( "%d", &ia[j][i] );
                                                          ^

Judge Result