oj.uz

Submission #253161

# Submission time Handle Problem Language Result Execution time Memory
253161 2020-07-27T05:28:48 Z caoash Museum (CEOI17_museum) C++14
100 / 100
 811 ms 784908 KB 
#pragma GCC target ("sse4")

#include <bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;
 
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;

typedef pair<int, int> pi;
typedef pair<ll,ll> pl;
typedef pair<ld,ld> pd;
typedef pair<int, pi> pii;

typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;

#define fax(i, a) for (int i = 0; i < (a); i++)
#define f0x(i, a, b) for (int i = (a); i < (b); i++)
#define f0xd(i,a,b) for (int i = (b)-1; i >= (a); i--)
#define faxd(i,a) for (int i = (a)-1; i >= 0; i--)
#define trav(a, x) for (auto& a : x)
#define memeset memset

#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound

#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rsz resize

template<class T> void ckmin(T &a, T b) { a = min(a, b); }
template<class T> void ckmax(T &a, T b) { a = max(a, b); }

template <class T, int ...Ns> struct BIT {
    T val = 0;
    void upd(T v) { val += v; }
    T query() { return val; }
};
 
template <class T, int N, int... Ns> struct BIT<T, N, Ns...> {
    BIT<T,Ns...> bit[N + 1];
    template<typename... Args> void upd(int pos, Args... args) {
        for (; pos <= N; pos += (pos&-pos)) bit[pos].upd(args...);
    }
    template<typename... Args> T sum(int r, Args... args) {
        T res = 0; for (; r; r -= (r&-r)) res += bit[r].query(args...); 
        return res;
    }
    template<typename... Args> T query(int l, int r, Args... args) {
        return sum(r,args...)-sum(l-1,args...);
    }
};

namespace input {
    template<class T> void re(complex<T>& x);
    template<class T1, class T2> void re(pair<T1,T2>& p);
    template<class T> void re(vector<T>& a);
    template<class T, size_t SZ> void re(array<T,SZ>& a);

    template<class T> void re(T& x) { cin >> x; }
    void re(double& x) { string t; re(t); x = stod(t); }
    void re(ld& x) { string t; re(t); x = stold(t); }
    template<class T, class... Ts> void re(T& t, Ts&... ts) { 
        re(t); re(ts...); 
    }

    template<class T> void re(complex<T>& x) { T a,b; re(a,b); x = cd(a,b); }
    template<class T1, class T2> void re(pair<T1,T2>& p) { re(p.f,p.s); }
    template<class T> void re(vector<T>& a) { fax(i,sz(a)) re(a[i]); }
    template<class T, size_t SZ> void re(array<T,SZ>& a) { fax(i,SZ) re(a[i]); }
}

using namespace input;

namespace output {
    void pr(int x) { cout << x; }
    void pr(long x) { cout << x; }
    void pr(ll x) { cout << x; }
    void pr(unsigned x) { cout << x; }
    void pr(unsigned long x) { cout << x; }
    void pr(unsigned long long x) { cout << x; }
    void pr(float x) { cout << x; }
    void pr(double x) { cout << x; }
    void pr(ld x) { cout << x; }
    void pr(char x) { cout << x; }
    void pr(const char* x) { cout << x; }
    void pr(const string& x) { cout << x; }
    void pr(bool x) { pr(x ? "true" : "false"); }
    
    template<class T1, class T2> void pr(const pair<T1,T2>& x);
    template<class T> void pr(const T& x);
    
    template<class T, class... Ts> void pr(const T& t, const Ts&... ts) { 
        pr(t); pr(ts...); 
    }
    template<class T1, class T2> void pr(const pair<T1,T2>& x) { 
        pr("{",x.f,", ",x.s,"}"); 
    }
    template<class T> void pr(const T& x) { 
        pr("{"); // const iterator needed for vector<bool>
        bool fst = 1; for (const auto& a: x) pr(!fst?", ":"",a), fst = 0; 
        pr("}");
    }
    
    void ps() { pr("\n"); } // print w/ spaces
    template<class T, class... Ts> void ps(const T& t, const Ts&... ts) { 
        pr(t); if (sizeof...(ts)) pr(" "); ps(ts...); 
    }
    
    void pc() { pr("]\n"); } // debug w/ commas
    template<class T, class... Ts> void pc(const T& t, const Ts&... ts) { 
        pr(t); if (sizeof...(ts)) pr(", "); pc(ts...); 
    }
    #define dbg(x...) pr("[",#x,"] = ["), pc(x);
}

using namespace output;

namespace io {
    void setIn(string s) { freopen(s.c_str(),"r",stdin); }
    void setOut(string s) { freopen(s.c_str(),"w",stdout); }
    void setIO(string s = "") {
        ios_base::sync_with_stdio(0); cin.tie(0); // fast I/O
        if (sz(s)) { setIn(s+".in"), setOut(s+".out"); } // for USACO
    }
}

using namespace io;

mt19937 rnd(chrono::high_resolution_clock::now().time_since_epoch().count());

const int MOD = 1000000007; // 998244353
const ll INF = 1e18;
const int MX = 10005;
const ld PI = 4*atan((ld)1);

int k; vpi adj[MX]; int dp[MX][MX][2]; int sz[MX];

void dfs(int v, int p){
	sz[v] = 1;
	dp[v][1][0] = dp[v][1][1] = 0;
	for(pi to : adj[v]){
		if(to.f != p){
			dfs(to.f, v);
			for(int i = sz[v]; i >= 0; i--){
				for(int j = sz[to.f]; j >= 0; j--){
					ckmin(dp[v][i + j][0], dp[v][i][0] + dp[to.f][j][0] + 2 * to.s);
					ckmin(dp[v][i + j][1], dp[v][i][1] + dp[to.f][j][0] + 2 * to.s);
					ckmin(dp[v][i + j][1], dp[v][i][0] + dp[to.f][j][1] + to.s);
					// ckmin(dp[v][i + j][1], dp[v][i][0] + dp[to.f][j][0] + to.s);
				}
			}
			sz[v] += sz[to.f];
		}
	}
}

int main() {
    setIO(); 
    int n, x; re(n, k, x);
    x--;
    fax(i, n - 1){
    	int u, v, w; re(u, v, w)	;
    	u--, v--;
    	adj[u].pb(mp(v, w)), adj[v].pb(mp(u, w));
    }
    fax(i, n + 1) fax(j, n + 1) dp[i][j][0] = dp[i][j][1] = 987654321;
    dfs(x, -1);
    ps(dp[x][k][1]);
}

Compilation message

museum.cpp: In function 'void io::setIn(std::__cxx11::string)':
museum.cpp:133:35: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
     void setIn(string s) { freopen(s.c_str(),"r",stdin); }
                            ~~~~~~~^~~~~~~~~~~~~~~~~~~~~
museum.cpp: In function 'void io::setOut(std::__cxx11::string)':
museum.cpp:134:36: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
     void setOut(string s) { freopen(s.c_str(),"w",stdout); }
                             ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 640 KB Output is correct
2 Correct 1 ms 640 KB Output is correct
3 Correct 1 ms 640 KB Output is correct
4 Correct 1 ms 640 KB Output is correct
5 Correct 1 ms 640 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 599 ms 784320 KB Output is correct
2 Correct 774 ms 784252 KB Output is correct
3 Correct 742 ms 784908 KB Output is correct
4 Correct 592 ms 784504 KB Output is correct
5 Correct 675 ms 784376 KB Output is correct

Subtask #3
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 599 ms 784320 KB Output is correct
2 Correct 774 ms 784252 KB Output is correct
3 Correct 742 ms 784908 KB Output is correct
4 Correct 592 ms 784504 KB Output is correct
5 Correct 675 ms 784376 KB Output is correct
6 Correct 669 ms 784472 KB Output is correct
7 Correct 663 ms 784632 KB Output is correct
8 Correct 811 ms 784392 KB Output is correct
9 Correct 740 ms 784504 KB Output is correct
10 Correct 633 ms 784504 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 640 KB Output is correct
2 Correct 1 ms 640 KB Output is correct
3 Correct 1 ms 640 KB Output is correct
4 Correct 1 ms 640 KB Output is correct
5 Correct 1 ms 640 KB Output is correct
6 Correct 599 ms 784320 KB Output is correct
7 Correct 774 ms 784252 KB Output is correct
8 Correct 742 ms 784908 KB Output is correct
9 Correct 592 ms 784504 KB Output is correct
10 Correct 675 ms 784376 KB Output is correct
11 Correct 669 ms 784472 KB Output is correct
12 Correct 663 ms 784632 KB Output is correct
13 Correct 811 ms 784392 KB Output is correct
14 Correct 740 ms 784504 KB Output is correct
15 Correct 633 ms 784504 KB Output is correct
16 Correct 566 ms 784340 KB Output is correct
17 Correct 570 ms 784376 KB Output is correct
18 Correct 602 ms 784628 KB Output is correct
19 Correct 771 ms 784508 KB Output is correct
20 Correct 674 ms 784504 KB Output is correct
21 Correct 649 ms 784760 KB Output is correct
22 Correct 577 ms 784632 KB Output is correct
23 Correct 738 ms 784504 KB Output is correct
24 Correct 594 ms 784376 KB Output is correct
25 Correct 641 ms 784760 KB Output is correct