oj.uz

Submission #885097

# Submission time Handle Problem Language Result Execution time Memory
885097 2023-12-09T02:15:49 Z Kutan Chase (CEOI17_chase) C++14
50 / 100
 209 ms 174360 KB 
// Cao Quang Hung
#include <cassert>
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <ccomplex>
#include <cfenv>
#include <cinttypes>
#include <cstdbool>
#include <cstdint>
#include <ctgmath>
#include <cwchar>
#include <cwctype>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#include <array>
#include <atomic>
#include <chrono>
#include <condition_variable>
#include <forward_list>
#include <future>
#include <initializer_list>
#include <mutex>
#include <random>
#include <ratio>
#include <regex>
#include <scoped_allocator>
#include <system_error>
#include <thread>
#include <tuple>
#include <typeindex>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>

using namespace std;
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define pii pair<int,int>
#define pll pair<long long , long long>
#define vi vector<int>
#define vpii vector<pii>
#define SZ(x) ((int)(x.size()))
#define fi first
#define se second
#define IN(x,y) ((y).find((x))!=(y).end())
#define ALL(t) t.begin(),t.end()
#define FOREACH(i,t) for (typeof(t.begin()) i=t.begin(); i!=t.end(); i++)
#define REP(i,a,b) for(int (i)=(a);(i)<=(b);++i)
#define REPD(i,a,b) for(int (i)=(a); (i)>=(b);--i)
#define FOR(i, n) for (int (i) = 0; (i) < (n); ++(i))
#define dem(x) __builtin_popcount(x)
#define Mask(x) (1LL << (x))
#define BIT(x, i) ((x) >> (i) & 1)
#define ln '\n'
#define io_faster ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
///mt19937 rnd(time(0));

const int INF = 1e9 , mod = 1e9 + 7;

template <class T1, class T2>
inline T1 mul(T1& x, const T2 &k){ return x = (1LL * x * k) % mod; }

template <class T1 , class T2>
inline T1 pw(T1 x, T2 k){T1 res = 1; for (; k ; k >>= 1){ if (k & 1) mul(res, x); mul(x, x); } return res;}

template <class T>
inline bool minimize(T &x, const T &y){ if (x > y){x = y; return 1;} return 0; }

template <class T>
inline bool maximize(T &x, const T &y){ if (x < y){x = y; return 1;} return 0; }

template <class T>
inline void add(T &x , const T &y){ if ((x += y) >= mod) x -= mod; }

template <class T>
inline T product (const T &x , const T &y) { return 1LL * x * y % mod; }

#define PROB "a"
void file(){
    if(fopen(PROB".inp", "r")){
        freopen(PROB".inp","r",stdin);
        freopen(PROB".out","w",stdout);
    }
}
void sinh_(){
//    srand(time(0));
//    freopen(PROB".inp" , "w" , stdout);
//    int n;
}

typedef long long ll;
typedef double db;
const int N = 1e5 + 5;

int n, V, a[N], par[N], root;
ll up[N][102], down[N][102], s[N], res(0);
vi adj[N];

void readip(){
    cin >> n >> V;
    REP(i, 1, n) cin >> a[i];
    REP(i, 2, n) {
        int u, v; cin >> u >> v;
        adj[u].pb(v);
        adj[v].pb(u);
        s[u] += a[v];
        s[v] += a[u];
    }
    a[0] = 0;
}

void initdfs(int u, int p) {
    up[u][0] = 0;
    up[u][1] = s[u];

    down[u][0] = 0;
    down[u][1] = s[u] - a[p];

    FOR(i, adj[u].size()) {
        int v = adj[u][i];
        if (v == p) continue;

        initdfs(v, u);
        REP(x, 0, V) {  
            maximize(res, up[u][x] + down[v][V - x]);
            maximize(up[u][x], up[v][x]);
            if (x > 0) maximize(up[u][x], max(up[u][x - 1], up[v][x - 1] + s[u] - a[v]));
        }


        REP(x, 0, V) {
            maximize(down[u][x], down[v][x]);
            if (x > 0) maximize(down[u][x], max(down[u][x - 1], down[v][x - 1] + s[u] - a[p]));
        }
    }

    REP(i, 0, V) up[u][i] = down[u][i] = 0;

    up[u][0] = 0;
    up[u][1] = s[u];

    down[u][0] = 0;
    down[u][1] = s[u] - a[p];

    REPD(i, adj[u].size() - 1, 0) {
        int v = adj[u][i];
        if (v == p) continue;

        REP(x, 0, V) {  
            if (maximize(res, up[u][x] + down[v][V - x])) 
            maximize(up[u][x], up[v][x]);
            if (x > 0) maximize(up[u][x], max(up[u][x - 1], up[v][x - 1] + s[u] - a[v]));
        }


        REP(x, 0, V) {
            maximize(down[u][x], down[v][x]);
            if (x > 0) maximize(down[u][x], max(down[u][x - 1], down[v][x - 1] + s[u] - a[p]));
        }
    }
}       

void solve(){   
    root = 1;
    initdfs(root, 0);
    cout << res << ln;
}

int main(){
    sinh_();
    io_faster
    file();
    int t = 1;
//    cin >> t;
    while (t--){
        readip();
        solve();
    }
}

Compilation message

chase.cpp: In function 'void readip()':
chase.cpp:92:28: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   92 | #define REP(i,a,b) for(int (i)=(a);(i)<=(b);++i)
      |                            ^
chase.cpp:145:5: note: in expansion of macro 'REP'
  145 |     REP(i, 1, n) cin >> a[i];
      |     ^~~
chase.cpp:92:28: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   92 | #define REP(i,a,b) for(int (i)=(a);(i)<=(b);++i)
      |                            ^
chase.cpp:146:5: note: in expansion of macro 'REP'
  146 |     REP(i, 2, n) {
      |     ^~~
chase.cpp: In function 'void initdfs(int, int)':
chase.cpp:94:28: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   94 | #define FOR(i, n) for (int (i) = 0; (i) < (n); ++(i))
      |                            ^
chase.cpp:163:5: note: in expansion of macro 'FOR'
  163 |     FOR(i, adj[u].size()) {
      |     ^~~
chase.cpp:94:41: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   94 | #define FOR(i, n) for (int (i) = 0; (i) < (n); ++(i))
      |                                     ~~~~^~~~~
chase.cpp:163:5: note: in expansion of macro 'FOR'
  163 |     FOR(i, adj[u].size()) {
      |     ^~~
chase.cpp:92:28: warning: unnecessary parentheses in declaration of 'x' [-Wparentheses]
   92 | #define REP(i,a,b) for(int (i)=(a);(i)<=(b);++i)
      |                            ^
chase.cpp:168:9: note: in expansion of macro 'REP'
  168 |         REP(x, 0, V) {
      |         ^~~
chase.cpp:92:28: warning: unnecessary parentheses in declaration of 'x' [-Wparentheses]
   92 | #define REP(i,a,b) for(int (i)=(a);(i)<=(b);++i)
      |                            ^
chase.cpp:175:9: note: in expansion of macro 'REP'
  175 |         REP(x, 0, V) {
      |         ^~~
chase.cpp:92:28: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   92 | #define REP(i,a,b) for(int (i)=(a);(i)<=(b);++i)
      |                            ^
chase.cpp:181:5: note: in expansion of macro 'REP'
  181 |     REP(i, 0, V) up[u][i] = down[u][i] = 0;
      |     ^~~
chase.cpp:93:29: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   93 | #define REPD(i,a,b) for(int (i)=(a); (i)>=(b);--i)
      |                             ^
chase.cpp:189:5: note: in expansion of macro 'REPD'
  189 |     REPD(i, adj[u].size() - 1, 0) {
      |     ^~~~
chase.cpp:92:28: warning: unnecessary parentheses in declaration of 'x' [-Wparentheses]
   92 | #define REP(i,a,b) for(int (i)=(a);(i)<=(b);++i)
      |                            ^
chase.cpp:193:9: note: in expansion of macro 'REP'
  193 |         REP(x, 0, V) {
      |         ^~~
chase.cpp:92:28: warning: unnecessary parentheses in declaration of 'x' [-Wparentheses]
   92 | #define REP(i,a,b) for(int (i)=(a);(i)<=(b);++i)
      |                            ^
chase.cpp:200:9: note: in expansion of macro 'REP'
  200 |         REP(x, 0, V) {
      |         ^~~
chase.cpp: In function 'void file()':
chase.cpp:125:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  125 |         freopen(PROB".inp","r",stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~
chase.cpp:126:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
  126 |         freopen(PROB".out","w",stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
20.0 / 20.0

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

Subtask #2
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6748 KB Output is correct
2 Correct 2 ms 6808 KB Output is correct
3 Correct 1 ms 6792 KB Output is correct
4 Correct 1 ms 6748 KB Output is correct
5 Correct 2 ms 6748 KB Output is correct
6 Correct 1 ms 6748 KB Output is correct
7 Correct 3 ms 6748 KB Output is correct
8 Incorrect 2 ms 6748 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 208 ms 173456 KB Output is correct
2 Correct 182 ms 174360 KB Output is correct
3 Correct 134 ms 169212 KB Output is correct
4 Correct 62 ms 168752 KB Output is correct
5 Correct 192 ms 168788 KB Output is correct
6 Correct 196 ms 168964 KB Output is correct
7 Correct 209 ms 168792 KB Output is correct

Subtask #4
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 6748 KB Output is correct
2 Correct 2 ms 6808 KB Output is correct
3 Correct 1 ms 6792 KB Output is correct
4 Correct 1 ms 6748 KB Output is correct
5 Correct 2 ms 6748 KB Output is correct
6 Correct 1 ms 6748 KB Output is correct
7 Correct 3 ms 6748 KB Output is correct
8 Incorrect 2 ms 6748 KB Output isn't correct
9 Halted 0 ms 0 KB -