oj.uz

Submission #885069

# Submission time Handle Problem Language Result Execution time Memory
885069 2023-12-09T00:59:58 Z Kutan Chase (CEOI17_chase) C++17
40 / 100
 329 ms 10320 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 "TOMJERRY"
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 dp[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];
    }
}

void initdfs(int u, int p) {
    dp[u][0] = 0;
    dp[u][1] = s[u];
    for (int v : adj[u]) if (v != p)  {
        initdfs(v, u);
        REP(x, 0, V) {
            maximize(dp[u][x], dp[v][x]);
            if (x > 0) maximize(dp[u][x], max(dp[u][x - 1], dp[v][x - 1] + s[u] - a[v])); 
        }
    }
    maximize(res , dp[u][V]);
}       

void solve(){   
    if (n <= 1000) {
        REP(i, 1, n) {
            root = i;
            REP(x, 1, n) REP(j, 0, V) dp[x][j] = -1e18;
            initdfs(root, -1);
        }
        cout << res << ln;
        return;
    }

    // root = 1;
    // initdfs(root, -1);
    // 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: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:160:9: note: in expansion of macro 'REP'
  160 |         REP(x, 0, V) {
      |         ^~~
chase.cpp: In function 'void solve()':
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:170:9: note: in expansion of macro 'REP'
  170 |         REP(i, 1, n) {
      |         ^~~
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:172:13: note: in expansion of macro 'REP'
  172 |             REP(x, 1, n) REP(j, 0, V) dp[x][j] = -1e18;
      |             ^~~
chase.cpp:92:28: warning: unnecessary parentheses in declaration of 'j' [-Wparentheses]
   92 | #define REP(i,a,b) for(int (i)=(a);(i)<=(b);++i)
      |                            ^
chase.cpp:172:26: note: in expansion of macro 'REP'
  172 |             REP(x, 1, n) REP(j, 0, V) dp[x][j] = -1e18;
      |                          ^~~
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 4696 KB Output is correct
2 Correct 1 ms 4696 KB Output is correct
3 Correct 2 ms 4956 KB Output is correct
4 Correct 2 ms 4612 KB Output is correct
5 Correct 1 ms 4696 KB Output is correct
6 Correct 2 ms 4696 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4696 KB Output is correct
2 Correct 1 ms 4696 KB Output is correct
3 Correct 2 ms 4956 KB Output is correct
4 Correct 2 ms 4612 KB Output is correct
5 Correct 1 ms 4696 KB Output is correct
6 Correct 2 ms 4696 KB Output is correct
7 Correct 264 ms 4696 KB Output is correct
8 Correct 24 ms 4700 KB Output is correct
9 Correct 18 ms 4700 KB Output is correct
10 Correct 329 ms 4792 KB Output is correct
11 Correct 111 ms 4788 KB Output is correct
12 Correct 37 ms 4700 KB Output is correct

Subtask #3
0 / 30.0

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

Subtask #4
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4696 KB Output is correct
2 Correct 1 ms 4696 KB Output is correct
3 Correct 2 ms 4956 KB Output is correct
4 Correct 2 ms 4612 KB Output is correct
5 Correct 1 ms 4696 KB Output is correct
6 Correct 2 ms 4696 KB Output is correct
7 Correct 264 ms 4696 KB Output is correct
8 Correct 24 ms 4700 KB Output is correct
9 Correct 18 ms 4700 KB Output is correct
10 Correct 329 ms 4792 KB Output is correct
11 Correct 111 ms 4788 KB Output is correct
12 Correct 37 ms 4700 KB Output is correct
13 Incorrect 30 ms 10320 KB Output isn't correct
14 Halted 0 ms 0 KB -