oj.uz

Submission #751236

# Submission time Handle Problem Language Result Execution time Memory
751236 2023-05-31T08:46:43 Z Sam_a17 Worst Reporter 4 (JOI21_worst_reporter4) C++17
0 / 100
 2000 ms 196784 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 = 5005;
long long n, dp[N][N];
long long h[N], c[N], p[N];
vector<int> adj[N];
vector<int> compress;

long long get(int curr, int value) {
  if(curr == n) {
    if(h[curr] != value) {
      return c[curr];
    } else {
      return 0;
    }
  }

  if(dp[curr][value] != -1) {
    return dp[curr][value];
  }

  long long pat = 0;
  if(h[curr] != value) {
    pat += c[curr];
  }

  for(auto i: adj[curr]) {
    long long cr = INT64_MAX;
    for(int j = value; j < sz(compress); j++) {
      cr = min(cr, get(i, j));
    }
    assert(cr != INT64_MAX);
    pat += cr;
  }
  dp[curr][value] = pat;
  return pat;
}

void solve_() {
  cin >> n;

  for(int i = 1; i <= n; i++) {
    cin >> p[i] >> h[i] >> c[i];
    compress.push_back(h[i]);
    if(i != 1) adj[p[i]].push_back(i);
  }

  sort(all(compress));
  uniq(compress);

  for(int i = 1; i <= n; i++) {
    h[i] = lower_bound(all(compress), h[i]) - compress.begin();
  }

  memset(dp, -1, sizeof(dp));

  long long ans = INT64_MAX;
  for(int i = 0; i < sz(compress); i++) {
    ans = min(ans, get(1, i));
  }
  cout << ans << '\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
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 77 ms 196412 KB Output is correct
2 Correct 75 ms 196520 KB Output is correct
3 Correct 74 ms 196432 KB Output is correct
4 Correct 81 ms 196488 KB Output is correct
5 Execution timed out 2080 ms 196784 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #2
0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 77 ms 196412 KB Output is correct
2 Correct 75 ms 196520 KB Output is correct
3 Correct 74 ms 196432 KB Output is correct
4 Correct 81 ms 196488 KB Output is correct
5 Execution timed out 2080 ms 196784 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 77 ms 196412 KB Output is correct
2 Correct 75 ms 196520 KB Output is correct
3 Correct 74 ms 196432 KB Output is correct
4 Correct 81 ms 196488 KB Output is correct
5 Execution timed out 2080 ms 196784 KB Time limit exceeded
6 Halted 0 ms 0 KB -