Submission #37020221

---

Source Code Expand

// what is matter? never mind.
#include<bits/stdc++.h>
#define For(i,a,b) for(int i=(a);i<=(b);++i)
#define Rep(i,a,b) for(int i=(a);i>=(b);--i)
//#define int long long
using namespace std;
inline int read()
{
    char c=getchar();int x=0;bool f=0;
    for(;!isdigit(c);c=getchar())f^=!(c^45);
    for(;isdigit(c);c=getchar())x=(x<<1)+(x<<3)+(c^48);
    if(f)x=-x;return x;
}

int mod;
typedef unsigned long long ull;
namespace FM{
	typedef __uint128_t L;
	struct FastMod{
		ull b,m;
		FastMod(ull b):b(b),m(ull((L(1)<<64)/b)){}
		ull reduce(ull a){ull q=(ull)((L(m)*a)>>64),r=a-q*b;return r>=b?r-b:r;}
	};
	FastMod F(2);
}

struct modint{
	int x;
	modint(int o=0){x=o;}
	modint &operator = (int o){return x=o,*this;}
	modint &operator +=(modint o){return x=x+o.x>=mod?x+o.x-mod:x+o.x,*this;}
	modint &operator -=(modint o){return x=x-o.x<0?x-o.x+mod:x-o.x,*this;}
	modint &operator *=(modint o){return x=FM::F.reduce(1ull*x*o.x),*this;}
	modint &operator ^=(int b){
		modint a=*this,c=1;
		for(;b;b>>=1,a*=a)if(b&1)c*=a;
		return x=c.x,*this;
	}
	modint &operator /=(modint o){return *this *=o^=mod-2;}
	friend modint operator +(modint a,modint b){return a+=b;}
	friend modint operator -(modint a,modint b){return a-=b;}
	friend modint operator *(modint a,modint b){return a*=b;}
	friend modint operator /(modint a,modint b){return a/=b;}
	friend modint operator ^(modint a,int b){return a^=b;}
	friend bool operator ==(modint a,int b){return a.x==b;}
	friend bool operator !=(modint a,int b){return a.x!=b;}
	bool operator ! () {return !x;}
	modint operator - () {return x?mod-x:0;}
	bool operator <(const modint&b)const{return x<b.x;}
};
inline modint qpow(modint x,int y){return x^y;}
void initmod(){mod=read(),FM::F=FM::FastMod(mod);}

vector<modint> fac,ifac,iv;
inline void initC(int n)
{
	if(iv.empty())fac=ifac=iv=vector<modint>(2,1);
	int m=iv.size(); ++n;
	if(m>=n)return;
	iv.resize(n),fac.resize(n),ifac.resize(n);
	For(i,m,n-1){
		iv[i]=iv[mod%i]*(mod-mod/i);
		fac[i]=fac[i-1]*i,ifac[i]=ifac[i-1]*iv[i];
	}
}
inline modint C(int n,int m){
	if(m<0||n<m)return 0;
	return initC(n),fac[n]*ifac[m]*ifac[n-m];
}
inline modint sign(int n){return (n&1)?(mod-1):(1);}

#define fi first
#define se second
#define pb push_back
#define mkp make_pair
typedef pair<int,int>pii;
typedef vector<int>vi;

#define maxn 200005
#define inf 0x3f3f3f3f

int n,a[maxn],m,c[maxn],tot;
int L[maxn],R[maxn],val[maxn];
pii t[maxn];

void ins(int u,int v){
	R[v]=R[u],L[R[v]]=v;
	R[u]=v,L[v]=u;
}

void work()
{
	n=read();m=0;
	For(i,0,n)c[i]=0;
	For(i,1,n)a[i]=read(),++c[a[i]];
	For(i,1,n)if(c[i])t[++m]=mkp(c[i],i);
	sort(t+1,t+m+1,greater<pii>());
	For(i,0,n)L[i]=R[i]=0;
	int c1=t[1].fi;
	For(i,1,c1)val[i]=t[1].se;
	For(i,2,c1)L[i]=i-1; L[1]=c1;
	For(i,1,c1-1)R[i]=i+1; R[c1]=1;
	vi o; For(i,1,c1) o.pb(i); tot=c1;
	For(i,2,m){
		int cnt=t[i].fi,col=t[i].se;
		if(!o.size()){
			assert(cnt==1);
			val[++tot]=col;
			ins(tot-1,tot);
			continue;
		}
		int u=o.back(); o.pop_back();
		For(_,1,cnt){
			val[++tot]=col;
			ins(u,tot);
			if(_>1)o.pb(tot);
		}
	}
	int u=1;
	For(i,1,tot)cout<<val[u]<<" ",u=R[u];cout<<endl;
}

signed main()
{
	int T=read();
	while(T--)work(); 
	return 0;
}

Submission Info

Compile Error

./Main.cpp: In function ‘int read()’:
./Main.cpp:12:5: warning: this ‘if’ clause does not guard... [-Wmisleading-indentation]
   12 |     if(f)x=-x;return x;
      |     ^~
./Main.cpp:12:15: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the ‘if’
   12 |     if(f)x=-x;return x;
      |               ^~~~~~
./Main.cpp: In function ‘void work()’:
./Main.cpp:3:20: warning: this ‘for’ clause does not guard... [-Wmisleading-indentation]
    3 | #define For(i,a,b) for(int i=(a);i<=(b);++i)
      |                    ^~~
./Main.cpp:101:2: note: in expansion of macro ‘For’
  101 |  For(i,2,c1)L[i]=i-1; L[1]=c1;
      |  ^~~
./Main.cpp:101:23: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the ‘for’
  101 |  For(i,2,c1)L[i]=i-1; L[1]=c1;
      |                       ^
./Main.cpp:3:20: warning: this ‘for’ clause does not guard... [-Wmisleading-indentation]
    3 | #define For(i,a,b) for(int i=(a);i<=(b);++i)
      |                    ^~~
./Main.cpp:102:2: note: in expansion of macro ‘For’
  102 |  For(i,1,c1-1)R[i]=i+1; R[c1]=1;
      |  ^~~
./Main.cpp:102:25: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the ‘for’
  102 |  For(i,1,c1-1)R[i]=i+1; R[c1]=1;
      |                         ^
./Main.cpp:3:20: warning: this ‘for’ clause does not guard... [-Wmisleading-indentation]
    3 | #define For(i,a,b) for(int i=(a);i<=(b);++i)
      |                    ^~~
./Main.cpp:120:2: note: in expansion of macro ‘For’
  120 |  For(i,1,tot)cout<<val[u]<<" ",u=R[u];cout<<endl;
      |  ^~~
./Main.cpp:120:39: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the ‘for’
  120 |  For(i,1,tot)cout<<val[u]<<" ",u=R[u];cout<<endl;
      |                                       ^~~~

Judge Result