// luogu-judger-enable-o2
#include <bits/stdc++.h>
using namespace std;
int n,m;
long long ans;
int mmp[90][90];
int l[90],r[90];
int main()
{
scanf("%d%d",&n,&m);
for (int i=1;i<=n;i++)
for (int j=1;j<=m;j++)
scanf("%d",&mmp[i][j]);
for (int i=1;i<=n;i++) l[i]=1;
for (int i=1;i<=n;i++) r[i]=m;
int k=1;
for (int j=1;j<=m;j++) {
k*=2;
for (int i=1;i<=n;i++) {
if (mmp[i][l[i]]>mmp[i] [r[i]]) {
ans+=mmp[i][r[i]]*k;
r[i]--;
continue;
}
ans+=mmp[i][l[i]]*k;
l[i]++;
}
}
printf("%lld",ans);
return 0;
}#
by 飞翔的金鱼 @ 2018-02-06 21:15:21
```cpp
#include <bits/stdc++.h>
using namespace std;
int n,m;
long long ans;
int mmp[90][90];
int l[90],r[90];
int main()
{
scanf("%d%d",&n,&m);
for (int i=1;i<=n;i++)
for (int j=1;j<=m;j++)
scanf("%d",&mmp[i][j]);
for (int i=1;i<=n;i++) l[i]=1;
for (int i=1;i<=n;i++) r[i]=m;
int k=1;
for (int j=1;j<=m;j++) {
k*=2;
for (int i=1;i<=n;i++) {
if (mmp[i][l[i]]>mmp[i][r[i]]) {
ans+=mmp[i][r[i]]*k;
r[i]--;
continue;
}
ans+=mmp[i][l[i]]*k;
l[i]++;
}
}
printf("%lld",ans);
return 0;
}
```
by 飞翔的金鱼 @ 2018-02-06 21:20:14
# 啊啊啊，大佬来看啊
by 飞翔的金鱼 @ 2018-02-06 21:20:52
hhhh
by JCZhang @ 2018-03-17 11:17:23
要写高精度
by csyakuoi @ 2018-04-05 18:20:37