提出 #52455408

---

ソースコード 拡げる

// LUOGU_RID: 156108271
#include<bits/stdc++.h>
#define Gc() getchar()
#define Me(x,y) memset(x,y,sizeof(x))
#define Mc(x,y) memcpy(x,y,sizeof(x))
#define d(x,y) ((m)*(x-1)+(y))
#define R(n) (rnd()%(n)+1)
#define Pc(x) putchar(x)
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
#define eb emplace_back
#define all(x) x.begin(),x.end()
using namespace std;using ll=long long;using db=double;using lb=long db;using ui=unsigned;using ull=unsigned long long;using pii=pair<int,int>;
const int N=4e5+5,M=2000+5,K=1000+5,mod=1e9+7,Mod=mod-1;const db eps=1e-8;const int INF=1e9+7;mt19937 rnd(181766);
#define Tp template<typename T>
#define Ts template<typename T,typename... Ar>
namespace Debug{
	Tp void _debug(char* f,T t){cerr<<f<<'='<<t<<endl;}
	Ts void _debug(char* f,T x,Ar... y){while(*f!=',') cerr<<*f++;cerr<<'='<<x<<",";_debug(f+1,y...);}
	#ifdef LOCAL
	#define gdb(...) _debug((char*)#__VA_ARGS__,__VA_ARGS__)
	#else 
	#define gdb(...) void()
	#endif
}using namespace Debug;
int n,f[N];
pii A[N];
ll inv[N],q1[N],q2[N],qv[N],q3[N],sum[N];
namespace bit{
	int f[N];void add(int x){while(x<=2*n) f[x]++,x+=x&-x;}
	int qry(int x){int ans=0;while(x) ans+=f[x],x-=x&-x;return ans;}
}
void Solve(){
	int i,j,h;scanf("%d",&n);
	for(i=1;i<=n;i++){
		scanf("%d%d",&A[i].fi,&A[i].se);
		if(A[i].fi<A[i].se) swap(A[i].fi,A[i].se);
	}
	sort(A+1,A+n+1);
	for(i=n;i;i--){
		f[i]=bit::qry(A[i].fi);
		bit::add(A[i].se);
	}
	inv[1]=1;for(i=2;i<=n;i++) inv[i]=(mod-inv[mod%i])*(mod/i)%mod;
	q3[n+1]=1;for(i=n;i;i--) q3[i]=q3[i+1]*(f[i]+2)%mod;
	q2[0]=1;for(i=1;i<=n;i++) q2[i]=q2[i-1]*(f[i]+1)%mod;
	qv[0]=1;for(i=1;i<=n;i++) qv[i]=qv[i-1]*inv[f[i]+1]%mod;
	q1[0]=1;for(i=1;i<=n;i++) q1[i]=q1[i-1]*f[i]%mod;
	ll tot=1;for(i=1;i<=n;i++) tot=tot*(f[i]+1)%mod;
	for(i=1;i<=n;i++) sum[A[i].se]+=q3[i+1]*q2[i-1]%mod;
	for(i=2*n;i;i--) sum[i]=(sum[i]+sum[i+1])%mod;
	for(i=1;i<=n;i++) tot+=sum[A[i].fi]*qv[i]%mod*q1[i-1]%mod;
	/*for(i=1;i<=n;i++)for(j=i+1;j<=n;j++)if(A[i].fi<A[j].se){
		ll mul=1;
		for(h=1;h<i;h++) mul=mul*f[h]%mod;
		for(h=i+1;h<j;h++) mul=mul*(f[h]+1)%mod;
		for(h=j+1;h<=n;h++) mul=mul*(f[h]+2)%mod;
		tot+=mul;
	}*/
	printf("%lld\n",tot%mod);
}
int main(){
	int t=1;
	// scanf("%d",&t);
	while(t--) Solve();
	cerr<<clock()*1.0/CLOCKS_PER_SEC<<'\n';
}

提出情報

コンパイルエラー

Main.cpp: In function ‘void Solve()’:
Main.cpp:36:15: warning: unused variable ‘j’ [-Wunused-variable]
   36 |         int i,j,h;scanf("%d",&n);
      |               ^
Main.cpp:36:17: warning: unused variable ‘h’ [-Wunused-variable]
   36 |         int i,j,h;scanf("%d",&n);
      |                 ^
Main.cpp:36:24: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
   36 |         int i,j,h;scanf("%d",&n);
      |                   ~~~~~^~~~~~~~~
Main.cpp:38:22: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
   38 |                 scanf("%d%d",&A[i].fi,&A[i].se);
      |                 ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~

ジャッジ結果