Submission #2998438
Source Code Expand
#include <bits/stdc++.h>
#define ll long long
#define INF (1LL << 60)
#define MOD 1000000007
#define EPS 1e-10
#define rep(i,n) for(int i=0;i<(int)(n);++i)
#define rrep(i,n) for(int i=(int)(n)-1;i>=0;--i)
#define srep(i,s,t) for(int i=(int)(s);i<(int)(t);++i)
#define each(a,b) for(auto& (a): (b))
#define all(v) (v).begin(),(v).end()
#define len(v) (int)(v).size()
#define zip(v) sort(all(v)),v.erase(unique(all(v)),v.end())
#define cmx(x,y) x=max(x,y)
#define cmn(x,y) x=min(x,y)
#define fi first
#define se second
#define pb push_back
#define show(x) cout<<#x<<" = "<<(x)<<endl
#define spair(p) cout<<#p<<": "<<p.fi<<" "<<p.se<<endl
#define sar(a,n) cout<<#a<<":";rep(pachico,n)cout<<" "<<a[pachico];cout<<endl
#define svec(v) cout<<#v<<":";rep(pachico,v.size())cout<<" "<<v[pachico];cout<<endl
#define svecp(v) cout<<#v<<":";each(pachico,v)cout<<" {"<<pachico.first<<":"<<pachico.second<<"}";cout<<endl
#define sset(s) cout<<#s<<":";each(pachico,s)cout<<" "<<pachico;cout<<endl
#define smap(m) cout<<#m<<":";each(pachico,m)cout<<" {"<<pachico.first<<":"<<pachico.second<<"}";cout<<endl
using namespace std;
typedef pair<int,int> P;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<double> vd;
typedef vector<P> vp;
typedef vector<string> vs;
const int MAX_N = 5004;
template<typename T> class SparseTable {
private:
vector<T> Arr;
vector<int> LogTable;
vector<vector<int> > Table; //最小値のインデックスを保持
int sz;
public:
SparseTable(vvi& b, int kind){
sz = (int)b.size();
Arr.resize(sz);
rep(i,sz){
Arr[i] = b[i][kind];
}
LogTable.resize(sz+1);
for(int i = 2; i < sz + 1; i++){
LogTable[i] = LogTable[i >> 1] + 1;
}
Table.resize(sz,vector<T>(LogTable[sz]+1));
rep(i,sz){
Table[i][0] = i;
}
for(int k = 1; (1 << k) <= sz; k++){
for(int i = 0; i + (1 << k) <= sz; i++){
int s = Table[i][k-1];
int t = Table[i + (1 << (k-1))][k-1];
if(Arr[s] > Arr[t]){
Table[i][k] = s;
}else{
Table[i][k] = t;
}
}
}
}
pair<T,int> query(int l,int r){
int k = LogTable[r-l];
if(Arr[Table[l][k]] > Arr[Table[r-(1<<k)][k]]){
return make_pair(Arr[Table[l][k]],Table[l][k]);
}else{
return make_pair(Arr[Table[r-(1<<k)][k]],Table[r-(1<<k)][k]);
}
}
};
ll dp[MAX_N][MAX_N];
int trans[MAX_N];
int a[MAX_N];
ll sm[MAX_N];
int n,m;
inline void dfs(int l, int r, SparseTable<int>& sp)
{
if(r <= l) return;
P p = sp.query(l,r);
dp[l][r] += p.fi, dp[l][p.se] -= p.fi, dp[p.se+1][r] -= p.fi, dp[p.se+1][p.se] += p.fi;
dfs(l,p.se,sp), dfs(p.se+1,r,sp);
}
int main()
{
cin.tie(0);
ios::sync_with_stdio(false);
cin >> n >> m;
rep(i,n-1){
cin >> a[i];
sm[i+2] = sm[i+1] + a[i];
}
vvi b(n,vi(m));
rep(i,n){
rep(j,m){
cin >> b[i][j];
}
}
rep(i,m){
SparseTable<int> sp(b,i);
dfs(0,n,sp);
}
rep(i,n+1){
rrep(j,n+1){
dp[i][j] += dp[i][j+1];
}
}
rrep(j,n+1){
rep(i,n+1){
dp[i+1][j] += dp[i][j];
}
}
ll ans = -INF;
rep(i,n){
srep(j,i+1,n+1){
cmx(ans,dp[i][j]-(sm[j]-sm[i]));
}
}
cout << ans << "\n";
return 0;
}
Submission Info
Submission Time |
|
Task |
F - Yakiniku Restaurants |
User |
kopricky |
Language |
C++14 (GCC 5.4.1) |
Score |
0 |
Code Size |
3716 Byte |
Status |
WA |
Exec Time |
492 ms |
Memory |
200160 KB |
Judge Result
Set Name |
Sample |
All |
Score / Max Score |
0 / 0 |
0 / 1000 |
Status |
|
|
Set Name |
Test Cases |
Sample |
sample_01.txt, sample_02.txt |
All |
sample_01.txt, sample_02.txt, subtask_1_dense_max_01.txt, subtask_1_dense_max_02.txt, subtask_1_dense_max_03.txt, subtask_1_dense_max_04.txt, subtask_1_dense_rand_01.txt, subtask_1_dense_rand_02.txt, subtask_1_dense_rand_03.txt, subtask_1_dense_rand_04.txt, subtask_1_max_01.txt, subtask_1_max_02.txt, subtask_1_max_03.txt, subtask_1_max_04.txt, subtask_1_min_01.txt, subtask_1_min_02.txt, subtask_1_rand_01.txt, subtask_1_rand_02.txt, subtask_1_rand_03.txt, subtask_1_rand_04.txt, subtask_1_widemax_01.txt, subtask_1_widemax_02.txt, subtask_1_widemax_03.txt, subtask_1_widemax_04.txt, subtask_1_widemax_05.txt, subtask_1_widemax_06.txt, subtask_1_widemax_07.txt, subtask_1_widemax_08.txt, subtask_1_widemax_09.txt, subtask_1_widemax_10.txt |
Case Name |
Status |
Exec Time |
Memory |
sample_01.txt |
AC |
1 ms |
256 KB |
sample_02.txt |
AC |
1 ms |
256 KB |
subtask_1_dense_max_01.txt |
WA |
474 ms |
200160 KB |
subtask_1_dense_max_02.txt |
WA |
473 ms |
200160 KB |
subtask_1_dense_max_03.txt |
WA |
474 ms |
200160 KB |
subtask_1_dense_max_04.txt |
WA |
473 ms |
200160 KB |
subtask_1_dense_rand_01.txt |
WA |
266 ms |
139696 KB |
subtask_1_dense_rand_02.txt |
WA |
297 ms |
148300 KB |
subtask_1_dense_rand_03.txt |
WA |
17 ms |
29568 KB |
subtask_1_dense_rand_04.txt |
WA |
75 ms |
77824 KB |
subtask_1_max_01.txt |
WA |
475 ms |
200160 KB |
subtask_1_max_02.txt |
WA |
474 ms |
200160 KB |
subtask_1_max_03.txt |
WA |
477 ms |
200160 KB |
subtask_1_max_04.txt |
WA |
492 ms |
200160 KB |
subtask_1_min_01.txt |
WA |
1 ms |
256 KB |
subtask_1_min_02.txt |
WA |
1 ms |
256 KB |
subtask_1_rand_01.txt |
WA |
49 ms |
38528 KB |
subtask_1_rand_02.txt |
WA |
58 ms |
73472 KB |
subtask_1_rand_03.txt |
WA |
64 ms |
57216 KB |
subtask_1_rand_04.txt |
WA |
239 ms |
185488 KB |
subtask_1_widemax_01.txt |
AC |
474 ms |
200160 KB |
subtask_1_widemax_02.txt |
AC |
474 ms |
200160 KB |
subtask_1_widemax_03.txt |
WA |
474 ms |
200160 KB |
subtask_1_widemax_04.txt |
WA |
488 ms |
200160 KB |
subtask_1_widemax_05.txt |
WA |
476 ms |
200160 KB |
subtask_1_widemax_06.txt |
WA |
474 ms |
200160 KB |
subtask_1_widemax_07.txt |
WA |
476 ms |
200160 KB |
subtask_1_widemax_08.txt |
WA |
475 ms |
200160 KB |
subtask_1_widemax_09.txt |
WA |
474 ms |
200160 KB |
subtask_1_widemax_10.txt |
WA |
474 ms |
200160 KB |