oj.uz

Submission #492600

# Submission time Handle Problem Language Result Execution time Memory
492600 2021-12-08T05:40:38 Z Biaz Orchard (NOI14_orchard) C++17
4 / 25
 36 ms 620 KB 
#include <bits/stdc++.h>
//#define int long long
//#define double long double
#define Nanase_Kurumi_aka_menhera_chan_is_mine ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define pb push_back
#define pi pair<int, int>
#define ALL(i) i.begin(),i.end()
#define gcd(i,j) __gcd(i,j)
#define fi first
#define se second
#define eps 0.00000001
#define ist insert
#define DNE nullptr
//#pragma GCC optimize("Ofast,unroll-loops,no-stack-protector,fast-math")
//#pragma GCC optimize("O2")
int max(int x,int y){return x>=y?x:y;}
int min(int x,int y){return x>=y?y:x;}
using namespace std;
typedef int ll;
const int N=100005;
const int M=1000005;
const int MOD=1000000007;//998244353;
//const int INF=1000000000000000000;//2147483647;

int n,m,tot;
int a[N];
inline void sol(){
    cin >>n>>m;
    for (int i=0;i<n;i++)
        for (int j=1;j<=m;j++)
            cin >>a[j],a[j]+=a[j-1];
    tot=a[m];
    for (int i=1;i<=m;i++)
        a[i]=2*a[i]-i;
    int ans=0,mn=2147483647;
    for (int i=1;i<=m;i++){
        ans=max(ans,a[i]-mn);
        mn=min(mn,a[i]);
    }
    cout <<tot-ans<<'\n';
}
signed main(){
    Nanase_Kurumi_aka_menhera_chan_is_mine
    int _=1;
    //cin >>_;
    while (_--) sol();
    return 0;
}

Subtask #1
0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 272 KB Output is correct
2 Incorrect 0 ms 204 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 1 ms 332 KB Output is correct

Subtask #3
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 6 ms 588 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 3.0

# Verdict Execution time Memory Grader output
1 Incorrect 12 ms 620 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 4.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 36 ms 332 KB Output isn't correct
2 Halted 0 ms 0 KB -