CF 109D

好坑爹的模拟题。。

#pragma comment(linker, "/STACK:102400000,102400000")
#include<iostream>
#include<vector>
#include<algorithm>
#include<cstdio>
#include<queue>
#include<stack>
#include<string>
#include<map>
#include<set>
#include<cmath>
#include<cassert>
#include<cstring>
#include<iomanip>
using namespace std;
#ifdef _WIN32
#define i64 __int64
#define out64 "%I64d\n"
#define in64 "%I64d"
#else
#define i64 long long
#define out64 "%lld\n"
#define in64 "%lld"
#endif
/************ for topcoder by zz1215 *******************/
#define FOR(i,a,b)      for( int i = (a) ; i <= (b) ; i ++)
#define FF(i,a)         for( int i = 0 ; i < (a) ; i ++)
#define FFD(i,a,b)      for( int i = (a) ; i >= (b) ; i --)
#define S64(a)          scanf(in64,&a)
#define SS(a)           scanf("%d",&a)
#define LL(a)           ((a)<<1)
#define RR(a)           (((a)<<1)+1)
#define pb              push_back
#define pf              push_front
#define X               first
#define Y               second
#define CL(Q)           while(!Q.empty())Q.pop()
#define MM(name,what)   memset(name,what,sizeof(name))
#define MC(a,b)         memcpy(a,b,sizeof(b))
#define MAX(a,b)        ((a)>(b)?(a):(b))
#define MIN(a,b)        ((a)<(b)?(a):(b))
#define read            freopen("in.txt","r",stdin)
#define write           freopen("out.txt","w",stdout)

const int inf = 0x3f3f3f3f;
const i64 inf64 = 0x3f3f3f3f3f3f3f3fLL;
const double oo = 10e9;
const double eps = 10e-9;
const double pi = acos(-1.0);
const int maxn = 100011;

struct zz
{
	int x;
	int id;
	bool operator < (const zz & cmp) const
	{
		if(x!=cmp.x)
		{
			return x<cmp.x;
		}
		else
		{
			return id<cmp.id;
		}
	}
}zx;

int n;
zz a[maxn];
zz b[maxn];
map<zz,int >mp;
int pos;
int ans;
int pp[maxn*2];
int ps[maxn*2];

bool yes(int x)
{
	while(x)
	{
		int temp = x%10;
		if(temp != 7 && temp != 4) return false;
		x/=10;
	}
	return true;
}

void sp(int x)
{
	if(pos == x) return ;
	ans++;
	pp[ans] = pos;
	ps[ans] = x;
//	cout<<pos<<" "<<x<<endl;
	swap(mp[a[pos]],mp[a[x]]);
	swap(a[pos],a[x]);
	pos=x;
	return ;
}

void start()
{
	ans=0;
	int temp;
	for(int i=1;i<=n;i++)
	{
		sp(i);
		temp = mp[b[i]];
		sp(temp);
	}
	cout<<ans<<endl;
	for(int i=1;i<=ans;i++)
	{
		cout<<pp[i]<<" "<<ps[i]<<endl;
	}
	return ;
}

int main()
{
	int idx=0;
	while(cin>>n)
	{
		if(n==1)
		{
			cout<<"0"<<endl;
			return 0;
		}
		int temp;
		bool ok = true;
		mp.clear();
		pos=-1;
		temp = -inf;
		for(int i=1;i<=n;i++)
		{
			cin>>a[i].x;
			a[i].id = idx++;
			b[i]=a[i];
			if(a[i].x >= temp )
			{
				temp = a[i].x;
			}
			else
			{
				ok = false;
			}
			if(yes(a[i].x))
			{
				pos=i;
			}
		}
		if(ok  )
		{
			cout<<"0"<<endl;
			return 0;
		}
		if(pos == -1)
		{
			cout<<"-1"<<endl;
			return 0;
		}
		for(int i=1;i<=n;i++)
		{
			mp[a[i]]=i;
		}
		sort(b+1,b+n+1);
		start();
	}
	return 0;
}