oj.uz

답안 #581221

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
581221 2022-06-22T11:47:31 Z Sam_a17 Fireworks (APIO16_fireworks) C++14
26 / 100
 2000 ms 6536 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 blt __builtin_popcount

#define pb push_back
#define popf pop_front
#define popb pop_back

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(long double t) {cerr << t;}
void print(unsigned long long 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, class V> void print(T v[],V n) {cerr << "["; for(int i = 0; i < n; i++) {print(v[i]); cerr << " "; } 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(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 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, M = 3e2 + 10;
const long long inf = 1e15;
int n, m, out[N];
vector<pair<long long, long long>> adj[N];
long long dp[M][M];

void dfs(int node, int parent) {
  if(!out[node]) {
    for(int i = 0; i < M; i++) {
      dp[node][i] = inf;
    }

    dp[node][0] = 0;
    return;
  }

  for(auto i: adj[node]) {
    if(i.first == parent) continue;
    dfs(i.first, node);
    for(int j = 0; j < M; j++) {
      long long mini = INT64_MAX;
      for(int k = 0; k <= j; k++) {
        if(dp[i.first][k] == inf) {
          continue;
        }

        mini = min(mini, dp[i.first][k] + abs(i.second - (j - k)));
      }
      dp[node][j] += mini;
    }
  }
}

void solve_() {
  cin >> n >> m;

  for(int i = 2; i <= n; i++) {
    long long p, c; cin >> p >> c;
    adj[i].push_back({p, c});
    adj[p].push_back({i, c});
    out[p]++;
  }
  
  for(int i = n + 1; i <= n + m; i++) {
    long long p, c; cin >> p >> c;
    adj[i].push_back({p, c});
    adj[p].push_back({i, c});
    out[p]++;
  }

  if(n == 1) {
    long long answ = INT64_MAX;
    for(auto i: adj[1]) {
      long long ansi = 0;
      for(auto j: adj[1]) {
        ansi += abs(i.second - j.second);
      }

      answ = min(answ, ansi);
    }

    printf("%lld\n", answ);
    return;
  }

  dfs(1, 0);

  // dbg(dp[1][13])

  long long answ = INT64_MAX;
  for(int i = 0; i < M; i++) {
    answ = min(answ, dp[1][i]);
  }

  printf("%lld\n", answ);
}

int main () {
  setIO();

  auto solve = [&](int test_case)-> void {
    while(test_case--) {
      solve_();
    }
  };

  int test_cases = 1;
  solve(test_cases);

  return 0;
}

Compilation message

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

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 4 ms 5024 KB Output is correct
3 Correct 4 ms 4948 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 3 ms 4948 KB Output is correct
7 Correct 3 ms 4948 KB Output is correct
8 Correct 3 ms 4948 KB Output is correct
9 Correct 3 ms 4948 KB Output is correct
10 Correct 3 ms 4948 KB Output is correct

Subtask #2
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 4948 KB Output is correct
2 Correct 5 ms 5028 KB Output is correct
3 Correct 5 ms 5076 KB Output is correct
4 Correct 9 ms 5180 KB Output is correct
5 Correct 11 ms 5300 KB Output is correct
6 Correct 10 ms 5332 KB Output is correct
7 Correct 10 ms 5332 KB Output is correct
8 Correct 13 ms 5460 KB Output is correct
9 Correct 13 ms 5416 KB Output is correct
10 Correct 15 ms 5460 KB Output is correct
11 Correct 17 ms 5544 KB Output is correct
12 Correct 19 ms 5628 KB Output is correct
13 Correct 16 ms 5632 KB Output is correct
14 Correct 27 ms 5660 KB Output is correct
15 Correct 18 ms 5716 KB Output is correct
16 Correct 18 ms 5724 KB Output is correct
17 Correct 21 ms 5736 KB Output is correct
18 Correct 19 ms 5712 KB Output is correct
19 Correct 19 ms 5668 KB Output is correct

Subtask #3
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 4 ms 5024 KB Output is correct
3 Correct 4 ms 4948 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 3 ms 4948 KB Output is correct
7 Correct 3 ms 4948 KB Output is correct
8 Correct 3 ms 4948 KB Output is correct
9 Correct 3 ms 4948 KB Output is correct
10 Correct 3 ms 4948 KB Output is correct
11 Correct 4 ms 4948 KB Output is correct
12 Correct 5 ms 5028 KB Output is correct
13 Correct 5 ms 5076 KB Output is correct
14 Correct 9 ms 5180 KB Output is correct
15 Correct 11 ms 5300 KB Output is correct
16 Correct 10 ms 5332 KB Output is correct
17 Correct 10 ms 5332 KB Output is correct
18 Correct 13 ms 5460 KB Output is correct
19 Correct 13 ms 5416 KB Output is correct
20 Correct 15 ms 5460 KB Output is correct
21 Correct 17 ms 5544 KB Output is correct
22 Correct 19 ms 5628 KB Output is correct
23 Correct 16 ms 5632 KB Output is correct
24 Correct 27 ms 5660 KB Output is correct
25 Correct 18 ms 5716 KB Output is correct
26 Correct 18 ms 5724 KB Output is correct
27 Correct 21 ms 5736 KB Output is correct
28 Correct 19 ms 5712 KB Output is correct
29 Correct 19 ms 5668 KB Output is correct
30 Execution timed out 2072 ms 6536 KB Time limit exceeded
31 Halted 0 ms 0 KB -

Subtask #4
0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 4 ms 5024 KB Output is correct
3 Correct 4 ms 4948 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 3 ms 4948 KB Output is correct
7 Correct 3 ms 4948 KB Output is correct
8 Correct 3 ms 4948 KB Output is correct
9 Correct 3 ms 4948 KB Output is correct
10 Correct 3 ms 4948 KB Output is correct
11 Correct 4 ms 4948 KB Output is correct
12 Correct 5 ms 5028 KB Output is correct
13 Correct 5 ms 5076 KB Output is correct
14 Correct 9 ms 5180 KB Output is correct
15 Correct 11 ms 5300 KB Output is correct
16 Correct 10 ms 5332 KB Output is correct
17 Correct 10 ms 5332 KB Output is correct
18 Correct 13 ms 5460 KB Output is correct
19 Correct 13 ms 5416 KB Output is correct
20 Correct 15 ms 5460 KB Output is correct
21 Correct 17 ms 5544 KB Output is correct
22 Correct 19 ms 5628 KB Output is correct
23 Correct 16 ms 5632 KB Output is correct
24 Correct 27 ms 5660 KB Output is correct
25 Correct 18 ms 5716 KB Output is correct
26 Correct 18 ms 5724 KB Output is correct
27 Correct 21 ms 5736 KB Output is correct
28 Correct 19 ms 5712 KB Output is correct
29 Correct 19 ms 5668 KB Output is correct
30 Execution timed out 2072 ms 6536 KB Time limit exceeded
31 Halted 0 ms 0 KB -