oj.uz

Submission #752324

# Submission time Handle Problem Language Result Execution time Memory
752324 2023-06-02T19:42:17 Z Sam_a17 Worst Reporter 4 (JOI21_worst_reporter4) C++17
79 / 100
 319 ms 68440 KB 
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
//#include "temp.cpp"
#include <cstdio>
using namespace std;
 
#ifndef ONLINE_JUDGE
#define dbg(x) cerr << #x <<" "; print(x); cerr << endl;
#else
#define dbg(x)
#endif
 
#define sz(x) (int((x).size()))
#define len(x) (int)x.length()
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define clr(x) (x).clear()
#define uniq(x) x.resize(unique(all(x)) - x.begin());
 
#define pb push_back
#define popf pop_front
#define popb pop_back
#define ld long double
#define ll long long
 
void print(long long t) {cerr << t;}
void print(int t) {cerr << t;}
void print(string t) {cerr << t;}
void print(char t) {cerr << t;}
void print(double t) {cerr << t;}
void print(unsigned long long t) {cerr << t;}
void print(long double t) {cerr << t;}
 
template <class T, class V> void print(pair <T, V> p);
template <class T> void print(vector <T> v);
template <class T> void print(set <T> v);
template <class T, class V> void print(map <T, V> v);
template <class T> void print(multiset <T> v);
template <class T> void print(T v[],T n) {cerr << "["; for(int i = 0; i < n; i++) {cerr << v[i] << " ";} cerr << "]";}
template <class T, class V> void print(pair <T, V> p) {cerr << "{"; print(p.first); cerr << ","; print(p.second); cerr << "}";}
template <class T> void print(vector <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(deque <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(set <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(multiset <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T, class V> void print(map <T, V> v) {cerr << "[ "; for (auto i : v) {print(i); cerr << " ";} cerr << "]";}
 
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
#define nl '\n'
 
// for random generations
mt19937 myrand(chrono::steady_clock::now().time_since_epoch().count());
// mt19937 myrand(131);
 
// for grid problems
int dx[8] = {-1,0,1,0,1,-1,1,-1};
int dy[8] = {0,1,0,-1,1,1,-1,-1};
 
// lowest / (1 << 17) >= 1e5 / (1 << 18) >= 2e5 / (1 << 21) >= 1e6
void fastIO() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr); cout.tie(nullptr);
}
// file in/out
void setIO(string str = "") {
  fastIO();
 
  if (str != "") {
    freopen((str + ".in").c_str(), "r", stdin);
    freopen((str + ".out").c_str(), "w", stdout);
  }
}
 
// Indexed Set
template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
const int N = 2e5 + 10;
long long n;
long long h[N], c[N], p[N];
vector<int> adj[N];
vector<int> compress;
 
map<long long, long long> dp[N];
 
void dfs(int node, int parent) {
  for(auto i: adj[node]) {
    if(i == parent) continue;
    dfs(i, node);
 
    if(sz(dp[i]) > sz(dp[node])) {
      dp[i].swap(dp[node]);
    }
 
    for(auto j: dp[i]) {
      dp[node][j.first] += j.second;
    }

    dp[i].clear();
  }
  
  dp[node][h[node]] += c[node];

  long long curr = c[node];
  while(true) {
    auto it = dp[node].lower_bound(h[node]);
    if(it == dp[node].begin()) break;
    it = prev(it);
    if(curr >= it->second) {
      dp[node].erase(it);
      curr -= it->second;
    } else {
      it->second -= curr;
      break;
    }
  }
}
 
 
void solve_() {
  cin >> n;
 
  for(int i = 1; i <= n; i++) {
    cin >> p[i] >> h[i] >> c[i];
    if(i != 1) adj[p[i]].push_back(i);
  }

  dfs(1, 0);

  long long tot = 0;
  for(int i = 1; i <= n; i++) {
    tot += c[i];
  }

  for(auto i: dp[1]) {
    tot -= i.second;
  }

  cout << tot << '\n';
}
 
int main() {
  setIO();
  
  auto solve = [&](int test_case)-> void {
    while(test_case--) {
      solve_();
    }
  };
 
  int test_cases = 1; 
  // cin >> test_cases;
  solve(test_cases);
 
  return 0;
}

Compilation message

worst_reporter2.cpp: In function 'void setIO(std::string)':
worst_reporter2.cpp:69:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   69 |     freopen((str + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
worst_reporter2.cpp:70:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   70 |     freopen((str + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 14420 KB Output is correct
2 Correct 9 ms 14496 KB Output is correct
3 Correct 9 ms 14428 KB Output is correct
4 Correct 8 ms 14432 KB Output is correct
5 Correct 12 ms 14944 KB Output is correct
6 Correct 11 ms 14688 KB Output is correct
7 Correct 11 ms 14748 KB Output is correct
8 Correct 11 ms 14952 KB Output is correct
9 Correct 11 ms 14728 KB Output is correct
10 Correct 11 ms 14816 KB Output is correct
11 Correct 10 ms 14688 KB Output is correct
12 Correct 11 ms 15692 KB Output is correct
13 Correct 10 ms 15592 KB Output is correct
14 Correct 10 ms 15184 KB Output is correct
15 Correct 11 ms 15212 KB Output is correct
16 Correct 15 ms 14988 KB Output is correct
17 Correct 10 ms 14676 KB Output is correct
18 Correct 10 ms 14676 KB Output is correct
19 Correct 11 ms 15316 KB Output is correct
20 Correct 10 ms 15188 KB Output is correct
21 Correct 9 ms 15060 KB Output is correct
22 Correct 11 ms 14924 KB Output is correct
23 Correct 9 ms 14692 KB Output is correct
24 Correct 12 ms 15316 KB Output is correct
25 Correct 10 ms 15188 KB Output is correct
26 Correct 11 ms 15592 KB Output is correct
27 Correct 15 ms 15316 KB Output is correct
28 Correct 11 ms 15444 KB Output is correct
29 Correct 10 ms 15724 KB Output is correct
30 Correct 11 ms 15720 KB Output is correct
31 Correct 11 ms 15720 KB Output is correct

Subtask #2
65.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 14420 KB Output is correct
2 Correct 9 ms 14496 KB Output is correct
3 Correct 9 ms 14428 KB Output is correct
4 Correct 8 ms 14432 KB Output is correct
5 Correct 12 ms 14944 KB Output is correct
6 Correct 11 ms 14688 KB Output is correct
7 Correct 11 ms 14748 KB Output is correct
8 Correct 11 ms 14952 KB Output is correct
9 Correct 11 ms 14728 KB Output is correct
10 Correct 11 ms 14816 KB Output is correct
11 Correct 10 ms 14688 KB Output is correct
12 Correct 11 ms 15692 KB Output is correct
13 Correct 10 ms 15592 KB Output is correct
14 Correct 10 ms 15184 KB Output is correct
15 Correct 11 ms 15212 KB Output is correct
16 Correct 15 ms 14988 KB Output is correct
17 Correct 10 ms 14676 KB Output is correct
18 Correct 10 ms 14676 KB Output is correct
19 Correct 11 ms 15316 KB Output is correct
20 Correct 10 ms 15188 KB Output is correct
21 Correct 9 ms 15060 KB Output is correct
22 Correct 11 ms 14924 KB Output is correct
23 Correct 9 ms 14692 KB Output is correct
24 Correct 12 ms 15316 KB Output is correct
25 Correct 10 ms 15188 KB Output is correct
26 Correct 11 ms 15592 KB Output is correct
27 Correct 15 ms 15316 KB Output is correct
28 Correct 11 ms 15444 KB Output is correct
29 Correct 10 ms 15724 KB Output is correct
30 Correct 11 ms 15720 KB Output is correct
31 Correct 11 ms 15720 KB Output is correct
32 Correct 15 ms 14948 KB Output is correct
33 Correct 309 ms 39668 KB Output is correct
34 Correct 202 ms 27796 KB Output is correct
35 Correct 319 ms 37568 KB Output is correct
36 Correct 203 ms 27744 KB Output is correct
37 Correct 179 ms 27400 KB Output is correct
38 Correct 136 ms 27136 KB Output is correct
39 Correct 143 ms 65016 KB Output is correct
40 Correct 142 ms 64864 KB Output is correct
41 Correct 104 ms 64916 KB Output is correct
42 Correct 139 ms 47792 KB Output is correct
43 Correct 134 ms 47688 KB Output is correct
44 Correct 259 ms 39548 KB Output is correct
45 Correct 167 ms 27700 KB Output is correct
46 Correct 86 ms 27172 KB Output is correct
47 Correct 205 ms 51404 KB Output is correct
48 Correct 112 ms 44512 KB Output is correct
49 Correct 100 ms 44524 KB Output is correct
50 Correct 181 ms 36568 KB Output is correct
51 Correct 84 ms 24252 KB Output is correct
52 Correct 219 ms 52036 KB Output is correct
53 Correct 109 ms 44992 KB Output is correct
54 Correct 113 ms 65132 KB Output is correct
55 Correct 159 ms 53012 KB Output is correct
56 Correct 161 ms 63512 KB Output is correct
57 Correct 148 ms 68440 KB Output is correct
58 Correct 165 ms 65776 KB Output is correct
59 Correct 167 ms 65804 KB Output is correct

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 14420 KB Output is correct
2 Correct 9 ms 14496 KB Output is correct
3 Correct 9 ms 14428 KB Output is correct
4 Correct 8 ms 14432 KB Output is correct
5 Correct 12 ms 14944 KB Output is correct
6 Correct 11 ms 14688 KB Output is correct
7 Correct 11 ms 14748 KB Output is correct
8 Correct 11 ms 14952 KB Output is correct
9 Correct 11 ms 14728 KB Output is correct
10 Correct 11 ms 14816 KB Output is correct
11 Correct 10 ms 14688 KB Output is correct
12 Correct 11 ms 15692 KB Output is correct
13 Correct 10 ms 15592 KB Output is correct
14 Correct 10 ms 15184 KB Output is correct
15 Correct 11 ms 15212 KB Output is correct
16 Correct 15 ms 14988 KB Output is correct
17 Correct 10 ms 14676 KB Output is correct
18 Correct 10 ms 14676 KB Output is correct
19 Correct 11 ms 15316 KB Output is correct
20 Correct 10 ms 15188 KB Output is correct
21 Correct 9 ms 15060 KB Output is correct
22 Correct 11 ms 14924 KB Output is correct
23 Correct 9 ms 14692 KB Output is correct
24 Correct 12 ms 15316 KB Output is correct
25 Correct 10 ms 15188 KB Output is correct
26 Correct 11 ms 15592 KB Output is correct
27 Correct 15 ms 15316 KB Output is correct
28 Correct 11 ms 15444 KB Output is correct
29 Correct 10 ms 15724 KB Output is correct
30 Correct 11 ms 15720 KB Output is correct
31 Correct 11 ms 15720 KB Output is correct
32 Correct 15 ms 14948 KB Output is correct
33 Correct 309 ms 39668 KB Output is correct
34 Correct 202 ms 27796 KB Output is correct
35 Correct 319 ms 37568 KB Output is correct
36 Correct 203 ms 27744 KB Output is correct
37 Correct 179 ms 27400 KB Output is correct
38 Correct 136 ms 27136 KB Output is correct
39 Correct 143 ms 65016 KB Output is correct
40 Correct 142 ms 64864 KB Output is correct
41 Correct 104 ms 64916 KB Output is correct
42 Correct 139 ms 47792 KB Output is correct
43 Correct 134 ms 47688 KB Output is correct
44 Correct 259 ms 39548 KB Output is correct
45 Correct 167 ms 27700 KB Output is correct
46 Correct 86 ms 27172 KB Output is correct
47 Correct 205 ms 51404 KB Output is correct
48 Correct 112 ms 44512 KB Output is correct
49 Correct 100 ms 44524 KB Output is correct
50 Correct 181 ms 36568 KB Output is correct
51 Correct 84 ms 24252 KB Output is correct
52 Correct 219 ms 52036 KB Output is correct
53 Correct 109 ms 44992 KB Output is correct
54 Correct 113 ms 65132 KB Output is correct
55 Correct 159 ms 53012 KB Output is correct
56 Correct 161 ms 63512 KB Output is correct
57 Correct 148 ms 68440 KB Output is correct
58 Correct 165 ms 65776 KB Output is correct
59 Correct 167 ms 65804 KB Output is correct
60 Correct 7 ms 14428 KB Output is correct
61 Incorrect 8 ms 14428 KB Output isn't correct
62 Halted 0 ms 0 KB -