Submission #40942240

---

Source Code Expand

#include<bits/stdc++.h>
#define ld long double 
#define ull unsigned long long
#define int long long
#define eb emplace_back
#define mp make_pair
using namespace std;
 
inline int read()
{
	int s=0,w=1; char c=getchar();
	while(!isdigit(c)) {if(c=='-') w=-1; c=getchar();}
	while(isdigit(c)) s=(s<<1)+(s<<3)+(c^48),c=getchar();
	return s*w;
}
inline void write(int x,char ch)
{
	if(x<0) x=-x,putchar('-');
	static char stk[25]; int top=0;
	do {stk[top++]=x%10+'0',x/=10;} while(x);
	while(top) putchar(stk[--top]);
	putchar(ch);
	return;
}
 
namespace MyTool
{
	static const int Mod=1e9+7;
	template<typename T> inline void Swp(T &a,T &b) {T t=a;a=b;b=t;}
	inline int  Max(int a,int b)   {return (b&((a-b)>>63))|(a&(~(a-b)>>63));}
	inline int  Min(int a,int b)   {return (a&((a-b)>>63))|(a&(~(a-b)>>63));}
	template<typename T> inline void cmax(T &a,T b) {a=a>b?a:b;}
	template<typename T> inline void cmin(T &a,T b) {a=a<b?a:b;}
	inline int  Abs(int a) {return (a^(a>>63))-(a>>63);}
	inline void Madd(int &a,int b) {a=a+b>Mod?a+b-Mod:a+b;}
	inline void Mdel(int &a,int b) {a=a-b<0?a-b+Mod:a-b;}
	inline void Mmul(int &a,int b) {a=1ll*a*b%Mod;}
	inline void Mmod(int &a) {a=(a%Mod+Mod)%Mod;}
	inline int  Cadd(int a,int b)  {return a+b>=Mod?a+b-Mod:a+b;}
	inline int  Cdel(int a,int b)  {return a-b<0?a-b+Mod:a-b;}
	inline int  Cmul(int a,int b)  {return a*b%Mod;}
	inline int  Cmod(int a)  {return (a%Mod+Mod)%Mod;}
	inline int  gcd(int a,int b)   {return b?gcd(b,a%b):a;}
	inline int  qpow(int a,int b)  {int res=1; while(b) {if(b&1) Mmul(res,a); Mmul(a,a); b>>=1;} return res;}
	inline int  qmul(int a,int b)  {int res=0; while(b) {if(b&1) Madd(res,a); Madd(a,a); b>>=1;} return res;}
	template<typename T> inline T pow(T x)    {return x*x;}
}
using namespace MyTool;
 
inline void file()
{
	freopen(".in","r",stdin);
	freopen(".out","w",stdout);
	return;
}
 
bool Mbe;
 
namespace LgxTpre
{
	static const int MAX=3010;
	static const int inf=2147483647;
	static const int INF=4557430888798830399;
	static const int mod=998244353;
	static const int bas=131;
	
	int n,m;
	struct node{int val,typ;}a[MAX],b[MAX],c[MAX];
	int L[2],R[2],top,ans;
	int suma,sumb;
	
	inline void mian()
	{
		n=read(),m=read();
		for(int i=1;i<=n;++i) a[i].typ=0,a[i].val=read(),suma+=a[i].val; 
		sort(a+1,a+n+1,[](node a,node b){return a.val<b.val;});
		for(int i=1;i<=m;++i) b[i].typ=1,b[i].val=read(),sumb+=b[i].val; 
		sort(b+1,b+m+1,[](node a,node b){return a.val<b.val;});
		if(n&1) ans+=sumb,--n; if(m&1) ans+=suma,--m;
		for(int i=1;i<=n;++i) c[i]=a[i]; for(int i=1;i<=m;++i) c[i+n]=b[i]; 
		top=n+m; sort(c+1,c+top+1,[](node a,node b){return a.val>b.val;});
		for(int i=1;i<=top;++i)
		{
			c[i].val*=2;
			if(!c[i].typ)
			{
				if(R[c[i].typ]<n/2) ans+=R[c[i].typ^1]*c[i].val,++R[c[i].typ];
				else ans+=L[c[i].typ^1]*c[i].val,++L[c[i].typ];
			}
			else
			{
				if(L[c[i].typ]<m/2) ans+=L[c[i].typ^1]*c[i].val,++L[c[i].typ];
				else ans+=R[c[i].typ^1]*c[i].val,++R[c[i].typ];
			}
		}
		write(ans,'\n');
		return;
	}
}

bool Med;
 
signed main()
{
//	file();
	fprintf(stderr,"%.3lf MB\n",(&Mbe-&Med)/1048576.0);
	LgxTpre::mian();  
	cerr<<1e3*clock()/CLOCKS_PER_SEC<<" ms\n";
	return (0-0);
}

Submission Info

Compile Error

./Main.cpp: In function ‘void LgxTpre::mian()’:
./Main.cpp:79:3: warning: this ‘if’ clause does not guard... [-Wmisleading-indentation]
   79 |   if(n&1) ans+=sumb,--n; if(m&1) ans+=suma,--m;
      |   ^~
./Main.cpp:79:26: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the ‘if’
   79 |   if(n&1) ans+=sumb,--n; if(m&1) ans+=suma,--m;
      |                          ^~
./Main.cpp:80:3: warning: this ‘for’ clause does not guard... [-Wmisleading-indentation]
   80 |   for(int i=1;i<=n;++i) c[i]=a[i]; for(int i=1;i<=m;++i) c[i+n]=b[i];
      |   ^~~
./Main.cpp:80:36: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the ‘for’
   80 |   for(int i=1;i<=n;++i) c[i]=a[i]; for(int i=1;i<=m;++i) c[i+n]=b[i];
      |                                    ^~~

Judge Result