Submission #1454508

---

Source Code Expand

#include "bits/stdc++.h"
#define MAXN 100009
#define INF 1000000007
#define mp(x,y) make_pair(x,y)
#define all(v) v.begin(),v.end()
#define pb(x) push_back(x)
#define wr cout<<"----------------"<<endl;
#define ppb() pop_back()
#define tr(ii,c) for(__typeof((c).begin()) ii=(c).begin();ii!=(c).end();ii++)
#define ff first
#define ss second
#define my_little_dodge 46
#define debug(x)  cerr<< #x <<" = "<< x<<endl;
using namespace std;

typedef long long ll;
typedef pair<int,int> PII;
template<class T>bool umin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool umax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
const int N=505;
PII l[N*N],r[N*N];
int ans[N*N];
int main(){
	//~ #ifndef ONLINE_JUDGE
    //~ freopen("file.in", "r", stdin);
	//~ #endif	
	int n;
	scanf("%d",&n);
	for(int i=1;i<=n;i++){
		int x;
		scanf("%d",&x);
		ans[x]=i;
		l[x]=mp(i-1,i);
		r[x]=mp(n-i,i);
	}int p=1;
	for(int i=1;i<=n*n;i++){
		if(ans[i])
			continue;
		while(p<=n*n and !l[p].ff)
			p++;
		if(p<=n*n and i<p)
			ans[i]=l[p].ss,l[p].ff--;
		else
			break;
	}
	while(p<=n*n and !l[p].ff)
		p++;
	if(p<=n*n)
		return 0*puts("No");
	p=n*n;	
	for(int i=n*n;i>=1;i--){
		if(ans[i])
			continue;
		while(p>0 and !r[p].ff)
			p--;
		if(p>0 and i>p)
			ans[i]=r[p].ss,r[p].ff--;
		else
			break;
	}
	while(p>0 and !r[p].ff)
		p--;
	if(p>0)	
		return 0*puts("No");
	puts("Yes");	
	for(int i=1;i<=n*n;i++)
		printf("%d ",ans[i]);
	puts("");	
	return 0;
}

Submission Info

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:28:16: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&n);
                ^
./Main.cpp:31:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d",&x);
                 ^

Judge Result