Submission #3883276

---

Source Code Expand

#include <stdio.h>  
#include <algorithm>  
#include <assert.h>
#include <bitset>
#include <cmath>  
#include <complex>  
#include <deque>  
#include <functional>  
#include <iostream>  
#include <limits.h>  
#include <map>  
#include <math.h>  
#include <queue>  
#include <set>  
#include <stdlib.h>  
#include <string.h>  
#include <string>  
#include <time.h>  
#include <unordered_map>  
#include <unordered_set>  
#include <vector>  

#pragma warning(disable:4996)  
#pragma comment(linker, "/STACK:336777216")  
using namespace std;

#define mp make_pair  
#define Fi first  
#define Se second  
#define pb(x) push_back(x)  
#define szz(x) ((int)(x).size())  
#define rep(i, n) for(int i=0;i<n;i++)  
#define all(x) (x).begin(), (x).end()  
#define ldb ldouble  

typedef unsigned int uint;
typedef tuple<int, int, int> t3;
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
typedef long double ldb;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;
typedef pair <ll, int> pli;
typedef pair <db, db> pdd;

int IT_MAX = 1 << 19;
const ll MOD = 1000000007;
const int INF = 0x3f3f3f3f;
const ll LL_INF = 0x3f3f3f3f3f3f3f3f;
const db PI = acos(-1);
const db ERR = 1e-10;

const int MX = 1<<19;
const int MM = 998244353;

bool check(vector<int> L){
	int odd = 0, even = 0;
	for(int i = 1; i+2 < L.size(); i += 2) if(L[i] > L[i+2]) odd = 1;
	if(odd) return false;

	vector<pii> X;
	for(int i = 0; i < L.size(); i++) X.emplace_back(L[i], i);
	sort(X.begin(), X.end());
	
	set<pii> P1;
	for(int i = 0; i < X.size(); i++){
		pii c = pii(X[i].second, X[i].first);
		auto it = P1.lower_bound(c);
		if(i%2 == 0 && it != P1.end() && it->first%2 == 0) return false;
		P1.insert(c);
	}

	reverse(X.begin(), X.end());
	P1.clear();

	for(int i = 0; i < X.size(); i++){
		pii c = pii(X[i].second, X[i].first);
		auto it = P1.lower_bound(c);
		if(i%2 == 0 && it != P1.begin() && prev(it)->first%2 == 0) return false;
		P1.insert(c);
	}
	return true;
}

int main()
{
	int N;
	scanf("%d", &N);
	vector<int> L;
	int mx = 0;
	for(int i = 1; i <= N; i++){
		int a;
		scanf("%d", &a);
		if(i%2 != a%2) return !printf("No\n");
		L.push_back(a);
		mx = max(mx, a);
		if(mx == i){
			if(!check(L)) return !printf("No\n");
			L.clear();
		}
	}
	printf("Yes\n");
}

Submission Info

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:89:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &N);
                 ^
./Main.cpp:94:18: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d", &a);
                  ^

Judge Result