Submission #1033539

#	Time	Username	Problem	Language	Result	Execution time	Memory
1033539		trMatherz	Nafta (COI15_nafta)	C++17	0 / 100	1 ms	344 KiB

nafta

#include <iostream>
 
 
// #include <fstream>
// std::ifstream cin ("cbarn.in");
// std::ofstream cout ("cbarn.out");
 
 
// includes
#include <cmath>
#include <set>
#include <map>
#include <queue>
#include <string>
#include <vector>
#include <array>
#include <algorithm>
#include <numeric>
#include <iomanip>
#include <unordered_set>
#include <stack>
#include <ext/pb_ds/assoc_container.hpp>
#include <random>
#include <chrono>
#include <bitset>
#include <complex>
 
// usings
using namespace std;
using namespace __gnu_pbds;
 
// misc
#define ll long long
#define ld long double
#define pb push_back
#define pq priority_queue
#define ub upper_bound
#define lb lower_bound
template <typename T, typename U>
bool emin(T &a, const U &b) { return b < a ? a = b, true : false; }
template <typename T, typename U>
bool emax(T &a, const U &b) { return b > a ? a = b, true : false; }
typedef uint64_t hash_t;
 
// vectors
#define vi vector<int>
#define vvi vector<vi>
#define vvvi vector<vvi>
#define vpii vector<pair<int, int>>
#define vvpii vector<vector<pair<int, int>>>
#define vppipi vector<pair<int, pair<int, int>>>
#define vl vector<ll>
#define vvl vector<vl>
#define vvvl vector<vvl>
#define vpll vector<pair<ll, ll>>
#define vvpll vector<vpll>
#define vb vector<bool>
#define vvb vector<vb>
#define vs vector<string>
#define sz(x) (int)x.size()
#define rz resize
#define all(x) x.begin(), x.end()
#define vc vector<char>
#define vvc vector<vc>
 
// pairs
#define pii pair<int, int>
#define pll pair<ll, ll>
#define mp make_pair
#define f first
#define s second
 
// sets
#define si set<int>
#define sl set<ll>
#define ss set<string>
#define in insert
template <class T>
using iset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
 
// maps
#define mii map<int, int>
#define mll map<ll, ll>
 
// loops
#define FR(x, z, y) for (int x = z; x < y; x++)
#define FRE(x, z, y) FR(x, z, y + 1)
#define F(x, y) FR(x, 0, y)
#define FE(x, y) F(x, y + 1)
#define A(x, y) for (auto &x : y)



int n, m; 
vs a;
vvl dp; 
vvl b; vvb v;
ll ct, lef, rig; 
void dfs(int x, int y){
    if(x < 0 || y < 0 || x >= n || y >= m || v[x][y] || a[x][y] == '.') return; 
    v[x][y] = true;
    ct += a[x][y] - '0'; emax(rig, y); emin(lef, y); 
    dfs(x + 1, y); 
    dfs(x - 1, y);
    dfs(x, y + 1);
    dfs(x, y - 1);   
}
void go(int l, int r, int rl, int rr, int k){
    int w = (l + r) / 2;
    ll bes = -1, p = -1; 
    for(int i = rl; i <= min(w, rr); i++){
        ll pop = dp[i][k - 1] + b[i + 1][w + 1]; 
        if(pop > bes) bes = pop, p = i; 
    }
    dp[w][k] = bes; 
    if(l != r) go(l, w, rl, p, k), go(w + 1, r, p, rr, k); 
}
int main(){
    cin >> n >> m; a = vs(n); A(u, a) cin >> u; 
    dp = vvl(m, vl(m)); b = vvl(m + 1, vl(m + 1, 0)); v = vvb(n, vb(m, false)); 
    F(i, n) F(j, m) 
        if(!v[i][j]) {
            ct = 0, lef = m + 5, rig = -5, dfs(i, j);
            for(int o = lef; o <= rig; o++) for(int q = 0; q <= lef; q++) b[q][o + 1] += ct;
        }
    F(i, m) dp[i][0] = b[0][i + 1]; 
    cout << *max_element(all(b[0])) << endl;
    F(i, m - 1) go(i + 1, m - 1, 0, m - 1, i + 1);
    F(i, m - 1) cout << dp[m - 1][i + 1] << endl;
}

• Subtask 1: 0 / 11
• Subtask 2: 0 / 23
• Subtask 3: 0 / 66