oj.uz

답안 #885099

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
885099 2023-12-09T02:18:04 Z Kutan Chase (CEOI17_chase) C++14
100 / 100
 211 ms 175992 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);
    }
    FOR(i, adj[u].size()) {
        int v = adj[u][i]; if (v == p) continue;

        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) {  
            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:94:28: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   94 | #define FOR(i, n) for (int (i) = 0; (i) < (n); ++(i))
      |                            ^
chase.cpp:168:5: note: in expansion of macro 'FOR'
  168 |     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:168:5: note: in expansion of macro 'FOR'
  168 |     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:171:9: note: in expansion of macro 'REP'
  171 |         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:177:9: note: in expansion of macro 'REP'
  177 |         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:183:5: note: in expansion of macro 'REP'
  183 |     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:190:5: note: in expansion of macro 'REPD'
  190 |     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:194:9: note: in expansion of macro 'REP'
  194 |         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:201:9: note: in expansion of macro 'REP'
  201 |         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

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6748 KB Output is correct
2 Correct 1 ms 6748 KB Output is correct
3 Correct 1 ms 6748 KB Output is correct
4 Correct 1 ms 6748 KB Output is correct
5 Correct 1 ms 6748 KB Output is correct
6 Correct 1 ms 6748 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6748 KB Output is correct
2 Correct 1 ms 6748 KB Output is correct
3 Correct 1 ms 6748 KB Output is correct
4 Correct 1 ms 6748 KB Output is correct
5 Correct 1 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 Correct 1 ms 6748 KB Output is correct
9 Correct 1 ms 6748 KB Output is correct
10 Correct 3 ms 6760 KB Output is correct
11 Correct 3 ms 6748 KB Output is correct
12 Correct 1 ms 6748 KB Output is correct

Subtask #3
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 179 ms 173632 KB Output is correct
2 Correct 150 ms 173700 KB Output is correct
3 Correct 135 ms 167112 KB Output is correct
4 Correct 58 ms 166992 KB Output is correct
5 Correct 190 ms 166896 KB Output is correct
6 Correct 192 ms 166740 KB Output is correct
7 Correct 211 ms 166740 KB Output is correct

Subtask #4
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6748 KB Output is correct
2 Correct 1 ms 6748 KB Output is correct
3 Correct 1 ms 6748 KB Output is correct
4 Correct 1 ms 6748 KB Output is correct
5 Correct 1 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 Correct 1 ms 6748 KB Output is correct
9 Correct 1 ms 6748 KB Output is correct
10 Correct 3 ms 6760 KB Output is correct
11 Correct 3 ms 6748 KB Output is correct
12 Correct 1 ms 6748 KB Output is correct
13 Correct 179 ms 173632 KB Output is correct
14 Correct 150 ms 173700 KB Output is correct
15 Correct 135 ms 167112 KB Output is correct
16 Correct 58 ms 166992 KB Output is correct
17 Correct 190 ms 166896 KB Output is correct
18 Correct 192 ms 166740 KB Output is correct
19 Correct 211 ms 166740 KB Output is correct
20 Correct 192 ms 168788 KB Output is correct
21 Correct 58 ms 168788 KB Output is correct
22 Correct 199 ms 168788 KB Output is correct
23 Correct 60 ms 168788 KB Output is correct
24 Correct 197 ms 169040 KB Output is correct
25 Correct 133 ms 168904 KB Output is correct
26 Correct 171 ms 175988 KB Output is correct
27 Correct 189 ms 175992 KB Output is correct