1562: [NOI2009]变换序列
Time Limit: 5 Sec Memory Limit: 64 MBSubmit: 744 Solved: 415
[ Submit][ Status]
Description
Input
Output
Sample Input
5
1 1 2 2 1
1 1 2 2 1
Sample Output
1 2 4 0 3
HINT
30%的数据中N≤50;
60%的数据中N≤500;
100%的数据中N≤10000。
NOI 2009 Day1第一题。
匈牙利乱搞,我却Wa了2,3次(算法错,打错,各种错)
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<functional>
#include<cmath>
#include<cctype>
#include<cassert>
#include<climits>
using namespace std;
#define For(i,n) for(int i=1;i<=n;i++)
#define Rep(i,n) for(int i=0;i<n;i++)
#define ForD(i,n) for(int i=n;i;i--)
#define Forp(x) for(int p=pre[x];p;p=next[p])
#define RepD(i,n) for(int i=n;i>=0;i--)
#define MEM(a) memset(a,0,sizeof(a))
#define MEMI(a) memset(a,127,sizeof(a))
#define MEMi(a) memset(a,128,sizeof(a))
#define INF (2139062143)
#define F (1000000009)
#define MAXN (10000+10)
#define MAXM (20000+10)
typedef long long ll;
int n,d[MAXN],ch[MAXN][2]={0};
bool b[MAXN]={0},is_delA[MAXN]={0},is_delB[MAXN]={0};
int a[MAXN]={0},c[MAXN]={0};
bool dfs(int x)
{
if (b[x]||is_delA[x]) return 0;
b[x]=1;
Rep(i,2)
{
int v=ch[x][i];
if (is_delB[v]) continue;
if (a[v]==0) {a[v]=x;c[x]=v;return 1;}
if (dfs(a[v])) {a[v]=x;c[x]=v;return 1;}
}
return 0;
}
int main()
{
// freopen("bzoj1562.in","r",stdin);
scanf("%d",&n);
For(i,n)
{
scanf("%d",&d[i]);
ch[i][0]=i-d[i]+n,ch[i][1]=i+d[i]+n;
while (ch[i][0]>n) ch[i][0]-=n;
while (ch[i][1]>n) ch[i][1]-=n;
if (ch[i][0]>ch[i][1]) swap(ch[i][0],ch[i][1]);
}
int tot=0;
ForD(i,n)
{
memset(b,0,sizeof(b));
if (dfs(i)) tot++;
}
if (tot<n)
{
puts("No Answer");return 0;
}
For(i,n)
{
memset(b,0,sizeof(b));
if (c[i]^ch[i][0])
{
a[ch[i][1]]=c[i]=0;
dfs(i);
}
is_delA[i]=is_delB[c[i]]=1;
}
For(i,n-1) printf("%d ",c[i]-1);printf("%d\n",c[n]-1);
// while(1);
return 0;
}