oj.uz

답안 #765918

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
765918 2023-06-25T07:31:55 Z Sam_a17 Paths (RMI21_paths) C++17
36 / 100
 600 ms 11724 KB 
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
// #include <atcoder/all>
#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};
 
long long ka() {
	long long x = 0;
	bool z = false;
	while (1)
	{
		char y = getchar();
		if (y == '-')
			z = true;
		else if ('0' <= y && y <= '9')
			x = x * 10 + y - '0';
		else
		{
			if (z)
				x *= -1;
			return x;
		}
	}
}
 
// 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);
  } else if(str == "input") {
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "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 = 1e5 + 10, K = 105;
vector<pair<long long, long long>> adj[N];
long long a[N], n, k;
long long p[N], sub[N];


multiset<long long> mt;
int st;

void dfs(int node, int parent) {
  sub[node] = 0;

  vector<pair<long long, long long>> vi;
  for(auto i: adj[node]) {
    if(i.first == parent) continue;
    p[i.first] = i.second;
    dfs(i.first, node);

    vi.push_back({sub[i.first] + i.second, sub[i.first]});
    sub[node] = max(sub[node], sub[i.first] + i.second);
  }

  sort(rall(vi));
  if(node == st) {
    for(auto i: vi) {
      mt.insert(i.first);
      mt.erase(mt.find(i.second));
    }
  } else {
    if(!vi.empty()) {
      for(int i = 0; i < sz(vi); i++) {
        mt.erase(mt.find(vi[i].second));
        mt.insert(vi[i].first);
      }
    } else {
      mt.insert(0);
    }
  }
}

void solve_() {
  cin >> n >> k;
 
  for(int i = 1; i <= n - 1; i++) {
    int a, b, c; cin >> a >> b >> c;
    adj[a].push_back({b, c});
    adj[b].push_back({a, c});
  }
  
  for(int i = 1; i <= n; i++) {
    mt.clear();
    st = i;
    dfs(i, 0);

    long long s = 0;
    for(int j = 0; j < k; j++) {
      s += *mt.rbegin();
      mt.erase(prev(mt.end()));
    }

    cout << s << '\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

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

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 2 ms 2608 KB Output is correct

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 2 ms 2608 KB Output is correct
3 Correct 8 ms 2644 KB Output is correct
4 Correct 7 ms 2644 KB Output is correct
5 Correct 9 ms 2728 KB Output is correct
6 Correct 6 ms 2712 KB Output is correct
7 Correct 7 ms 2676 KB Output is correct

Subtask #3
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 2 ms 2608 KB Output is correct
3 Correct 8 ms 2644 KB Output is correct
4 Correct 7 ms 2644 KB Output is correct
5 Correct 9 ms 2728 KB Output is correct
6 Correct 6 ms 2712 KB Output is correct
7 Correct 7 ms 2676 KB Output is correct
8 Correct 200 ms 2788 KB Output is correct
9 Correct 135 ms 2880 KB Output is correct
10 Correct 122 ms 2812 KB Output is correct
11 Correct 219 ms 2812 KB Output is correct
12 Correct 145 ms 2772 KB Output is correct

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 2 ms 2608 KB Output is correct
3 Correct 8 ms 2644 KB Output is correct
4 Correct 7 ms 2644 KB Output is correct
5 Correct 9 ms 2728 KB Output is correct
6 Correct 6 ms 2712 KB Output is correct
7 Correct 7 ms 2676 KB Output is correct
8 Correct 200 ms 2788 KB Output is correct
9 Correct 135 ms 2880 KB Output is correct
10 Correct 122 ms 2812 KB Output is correct
11 Correct 219 ms 2812 KB Output is correct
12 Correct 145 ms 2772 KB Output is correct
13 Execution timed out 802 ms 3040 KB Time limit exceeded
14 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1074 ms 11724 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 2 ms 2608 KB Output is correct
3 Correct 8 ms 2644 KB Output is correct
4 Correct 7 ms 2644 KB Output is correct
5 Correct 9 ms 2728 KB Output is correct
6 Correct 6 ms 2712 KB Output is correct
7 Correct 7 ms 2676 KB Output is correct
8 Correct 200 ms 2788 KB Output is correct
9 Correct 135 ms 2880 KB Output is correct
10 Correct 122 ms 2812 KB Output is correct
11 Correct 219 ms 2812 KB Output is correct
12 Correct 145 ms 2772 KB Output is correct
13 Execution timed out 802 ms 3040 KB Time limit exceeded
14 Halted 0 ms 0 KB -