oj.uz

Submission #911070

# Submission time Handle Problem Language Result Execution time Memory
911070 2024-01-18T12:20:12 Z 8pete8 Nafta (COI15_nafta) C++17
100 / 100
 297 ms 120148 KB 
#include<iostream>
#include<stack>
#include<map>
#include<vector>
#include<string>
#include<unordered_map>
#include <queue>
#include<cstring>
#include<float.h>
#include<limits.h>
#include <cassert>
#include<cmath>
#include<set>
#include<algorithm>
#include <iomanip>
#include<numeric> //gcd(a,b)
#include<bitset>
using namespace std;
#define ll long long
#define f first
#define endl "\n"
#define s second
#define pii pair<int,ll>
#define ppii pair<int,pii>
#define vi vector<int>
#define pb push_back
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define F(n) for(int i=0;i<n;i++)
#define lb lower_bound
#define ub upper_bound
using namespace std;
#define int long long
#define double long double
#define fastio ios::sync_with_stdio(false);cin.tie(NULL);
#pragma GCC optimize ("03,unroll-loops")
const int mod=1e9+7,mxn=3e5,lg=30,inf=1e18,minf=-1e9,Mxn=100000;
int n,m;
char grid[2002][2002];
int dp[2002][2002],val[2002],cost[2002][2002],on[2002];
bool vis[2002][2002];
int u[4]={0,0,1,-1},r[4]={1,-1,0,0};
int ans=0,sum=0;
int mn,mx;
void dfs(int cx,int cy){
    on[cy]=1;
    sum+=(grid[cx][cy]-'0');
    mn=min(mn,cy);
    mx=max(mx,cy);
    vis[cx][cy]=true;
    for(int i=0;i<4;i++){
        int nx=cx+u[i],ny=cy+r[i];
        if(nx<0||ny<0||nx>=n||ny>=m)continue;
        if(vis[nx][ny]||grid[nx][ny]=='.')continue;
        dfs(nx,ny);
    }
}
void solve(int l,int r,int opl,int opr,int k){
    if(l>r)return;
    int mid=l+(r-l)/2;
    int opt=mid;
    pii best={val[mid],mid};
    for(int j=min(opr,mid-1);j>=max(opl,0ll);j--)best=max(best,{dp[j][k-1]-cost[j][mid]+val[mid],j});
    dp[mid][k]=best.f;
    solve(l,mid-1,opl,best.s,k);
    solve(mid+1,r,best.s,opr,k);
}
int32_t main(){
    fastio
    int sub=0;
    cin>>n>>m;
    for(int i=0;i<n;i++)for(int j=0;j<m;j++)cin>>grid[i][j];
    for(int i=0;i<n;i++)for(int j=0;j<m;j++){
        if(vis[i][j]||grid[i][j]=='.')continue;
        sum=0;
        mn=inf,mx=minf;
        dfs(i,j);
        for(int j=mn;j<=mx;j++)val[j]+=sum;
        cost[mn][mx]+=sum;
    }
    for(int i=0;i<m;i++)for(int j=0;j<m;j++)if(i)cost[i][j]+=cost[i-1][j];
    for(int i=0;i<m;i++)for(int j=m-1;j>=0;j--)cost[i][j]+=cost[i][j+1];/*
    for(int i=1;i<=m;i++){
        for(int j=0;j<m;j++){
            dp[j][i]=val[j];
            if(j)dp[j][i]=max(dp[j][i],dp[j-1][i]);
            for(int l=0;l<j;l++)dp[j][i]=max(dp[j][i],dp[l][i-1]-cost[l][j]+val[j]);
        }
    }
    for(int i=1;i<=m;i++)cout<<dp[m-1][i]<<'\n';
    */
    for(int i=1;i<=m;i++)solve(0,m-1,0,m-1,i);
    for(int i=1;i<=m;i++){
        int ans=0;
        for(int j=0;j<m;j++)ans=max(ans,dp[j][i]);
        cout<<ans<<'\n';
    }
}

Compilation message

nafta.cpp: In function 'void solve(long long int, long long int, long long int, long long int, long long int)':
nafta.cpp:61:9: warning: unused variable 'opt' [-Wunused-variable]
   61 |     int opt=mid;
      |         ^~~
nafta.cpp: In function 'int32_t main()':
nafta.cpp:70:9: warning: unused variable 'sub' [-Wunused-variable]
   70 |     int sub=0;
      |         ^~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8536 KB Output is correct
2 Correct 2 ms 8540 KB Output is correct
3 Correct 1 ms 6748 KB Output is correct
4 Correct 2 ms 6744 KB Output is correct
5 Correct 2 ms 6744 KB Output is correct
6 Correct 1 ms 6744 KB Output is correct

Subtask #2
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8536 KB Output is correct
2 Correct 2 ms 8540 KB Output is correct
3 Correct 1 ms 6748 KB Output is correct
4 Correct 2 ms 6744 KB Output is correct
5 Correct 2 ms 6744 KB Output is correct
6 Correct 1 ms 6744 KB Output is correct
7 Correct 6 ms 13148 KB Output is correct
8 Correct 7 ms 13148 KB Output is correct
9 Correct 8 ms 15452 KB Output is correct
10 Correct 7 ms 13148 KB Output is correct
11 Correct 6 ms 13148 KB Output is correct
12 Correct 6 ms 11100 KB Output is correct

Subtask #3
66.0 / 66.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8536 KB Output is correct
2 Correct 2 ms 8540 KB Output is correct
3 Correct 1 ms 6748 KB Output is correct
4 Correct 2 ms 6744 KB Output is correct
5 Correct 2 ms 6744 KB Output is correct
6 Correct 1 ms 6744 KB Output is correct
7 Correct 6 ms 13148 KB Output is correct
8 Correct 7 ms 13148 KB Output is correct
9 Correct 8 ms 15452 KB Output is correct
10 Correct 7 ms 13148 KB Output is correct
11 Correct 6 ms 13148 KB Output is correct
12 Correct 6 ms 11100 KB Output is correct
13 Correct 204 ms 71076 KB Output is correct
14 Correct 254 ms 74748 KB Output is correct
15 Correct 297 ms 120148 KB Output is correct
16 Correct 196 ms 74740 KB Output is correct
17 Correct 185 ms 74976 KB Output is correct
18 Correct 187 ms 74796 KB Output is correct