제출 #1119366

#제출 시각아이디문제언어결과실행 시간메모리
1119366yeediotMagic Tree (CEOI19_magictree)C++17
3 / 100
2064 ms38216 KiB
#include<bits/stdc++.h> using namespace std; #define int long long #define F first #define S second #define all(x) x.begin(),x.end() #define pii pair<int,int> #define pb push_back #define sz(x) (int)(x.size()) #define chmin(x,y) x=min(x,y) #define chmax(x,y) x=max(x,y) #define vi vector<int> #define vp vector<pii> #define vvi vector<vi> #define ykh mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count()) #define __lg(x) 63-__builtin_clzll(x) #define pow2(x) (1LL<<x) void __print(int x) {cerr << x;} void __print(float x) {cerr << x;} void __print(double x) {cerr << x;} void __print(long double x) {cerr << x;} void __print(char x) {cerr << '\'' << x << '\'';} void __print(const char *x) {cerr << '\"' << x << '\"';} void __print(const string &x) {cerr << '\"' << x << '\"';} void __print(bool x) {cerr << (x ? "true" : "false");} template<typename T, typename V> void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';} template<typename T> void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";} void _print() {cerr << "]\n";} template <typename T, typename... V> void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);} #ifdef local void CHECK(); void setio(){ freopen("/Users/iantsai/cpp/input.txt","r",stdin); freopen("/Users/iantsai/cpp/output.txt","w",stdout); } #define debug(x...) cerr << "[" << #x << "] = ["; _print(x) #else void setio(){} #define debug(x...) #endif #define TOI_is_so_de ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);setio(); const int mxn = 1e5 + 5; vector<int>adj[mxn]; int n, m, k, d[mxn], w[mxn], ans = 0; vector<vector<int>>dp; map<int, int>mp[mxn]; void dfs(int v, int pa){ for(auto u : adj[v]){ if(u == pa) continue; dfs(u, v); /*for(int i = 0; i <= k; i++){ dp[v][i] += dp[u][i]; chmax(ans, dp[v][i]); }*/ if(sz(mp[v]) < sz(mp[u])){ swap(mp[v], mp[u]); } for(auto x : mp[u]){ mp[v][x.F] += x.S; } } /*cout << v << ' '; for(int i = 0; i <= k; i++){ cout << dp[v][i] << ' '; } cout << '\n';*/ int cur = 0; if(w[v] == 0) return; auto it = mp[v].lower_bound(d[v]); for(; it != mp[v].end() and cur <= w[v];){ cur += it->S; if(cur <= w[v])it = mp[v].erase(it); else{ cur-=it->S; it->S -= w[v]-cur; } } mp[v][d[v]] += w[v]; // for(int i = 0; i <= k; i++){ // cur = max(cur, dp[v][i]); // if(i == d[v]) cur = max(cur, dp[v][i] + w[v]); // dp[v][i] = cur; // } } void solve(){ cin >> n >> m >> k; for(int i = 2; i <= n; i++){ int p; cin >> p; adj[p].pb(i); } for(int i = 1; i <= m; i++){ int a, b, c; cin >> a >> b >> c; d[a] = b; w[a] = c; } dfs(1, 1); ans = 0; for(auto x : mp[1]){ ans += x.S; } cout << ans << '\n'; } signed main(){ TOI_is_so_de; int t = 1; //cin >> t; while(t--){ solve(); } #ifdef local CHECK(); #endif } /* input: */ #ifdef local void CHECK(){ cerr << "\n[Time]: " << 1000.0 * clock() / CLOCKS_PER_SEC << " ms.\n"; function<bool(string,string)> compareFiles = [](string p1, string p2)->bool { std::ifstream file1(p1); std::ifstream file2(p2); if(!file1.is_open() || !file2.is_open()) return false; std::string line1, line2; while (getline(file1, line1) && getline(file2, line2)) { if (line1 != line2)return false; } int cnta = 0, cntb = 0; while(getline(file1,line1))cnta++; while(getline(file2,line2))cntb++; return cntb - cnta <= 1; }; bool check = compareFiles("output.txt","expected.txt"); if(check) cerr<<"ACCEPTED\n"; else cerr<<"WRONG ANSWER!\n"; } #else #endif
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...