oj.uz

Submission #752095

# Submission time Handle Problem Language Result Execution time Memory
752095 2023-06-02T09:38:06 Z Sam_a17 Meetings 2 (JOI21_meetings2) C++17
4 / 100
 4000 ms 5804 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 blt(x) __builtin_popcount(x)
#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);
  } else {
    // 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 = 2e5 + 10, LOG = 21;
vector<int> adj[N];
int n, up[N][LOG];
int depths[N];

void dfs(int node, int parent, int depth) {
  for(auto i: adj[node]) {
    if(i == parent) continue;
    up[i][0] = node;
    for(int j = 1; j < LOG; j++) {
      up[i][j] = up[up[i][j - 1]][j - 1];
    } depths[i] = depths[node] + 1;
    dfs(i, node, depth + 1);
  }
}

int lca(int a, int b) {
  if(a == b) {
    return a;
  }

  if(depths[a] > depths[b]) {
    swap(a, b);
  }

  int delta = depths[b] - depths[a];
  for(int i = 0; i < LOG; i++) {
    if(delta & (1 << i)) {
      b = up[b][i];
    }
  }

  if(a == b) {
    return a;
  }

  for(int i = LOG - 1; i >= 0; i--) {
    if(up[a][i] != up[b][i]) {
      a = up[a][i], b = up[b][i];
    }
  }
  return up[a][0];
}

int dist(int a, int b) {
  return depths[a] + depths[b] - 2 * depths[lca(a, b)];
}

void solve_() {
  cin >> n;

  for(int i = 1; i <= n - 1; i++) {
    int a, b; cin >> a >> b;
    adj[a].push_back(b);
    adj[b].push_back(a);
  }

  dfs(1, 0, 0);

  vector<int> answ(n + 1, 0);
  for(int mask = 1; mask < (1 << n); mask++) {
    vector<int> active;
    for(int i = 0; i < n; i++) {
      if(mask & (1 << i)) {
        active.push_back(i + 1);
      }
    }

    map<int, int> dists;
    int min_dist = n * n;
    for(int i = 1; i <= n; i++) {
      int s = 0;
      for(auto j: active) {
        s += dist(j, i);
      }
      dists[s]++;
      min_dist = min(min_dist, s);
    }

    int curr = blt(mask);
    answ[curr] = max(answ[curr], dists[min_dist]);
  }

  for(int i = 1; i <= n; i++) {
    cout << answ[i] << '\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

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

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4960 KB Output is correct
2 Correct 3 ms 4960 KB Output is correct
3 Correct 3 ms 4960 KB Output is correct
4 Correct 110 ms 5044 KB Output is correct
5 Correct 110 ms 5032 KB Output is correct
6 Correct 113 ms 5036 KB Output is correct
7 Correct 105 ms 4960 KB Output is correct
8 Correct 250 ms 5028 KB Output is correct
9 Correct 545 ms 5024 KB Output is correct
10 Correct 619 ms 5016 KB Output is correct
11 Correct 561 ms 5020 KB Output is correct
12 Correct 512 ms 5024 KB Output is correct
13 Correct 579 ms 4948 KB Output is correct
14 Correct 109 ms 4948 KB Output is correct
15 Correct 104 ms 4948 KB Output is correct
16 Correct 231 ms 5040 KB Output is correct
17 Correct 500 ms 5024 KB Output is correct
18 Correct 569 ms 5068 KB Output is correct
19 Correct 241 ms 4948 KB Output is correct
20 Correct 545 ms 5024 KB Output is correct
21 Correct 220 ms 5032 KB Output is correct

Subtask #2
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4960 KB Output is correct
2 Correct 3 ms 4960 KB Output is correct
3 Correct 3 ms 4960 KB Output is correct
4 Correct 110 ms 5044 KB Output is correct
5 Correct 110 ms 5032 KB Output is correct
6 Correct 113 ms 5036 KB Output is correct
7 Correct 105 ms 4960 KB Output is correct
8 Correct 250 ms 5028 KB Output is correct
9 Correct 545 ms 5024 KB Output is correct
10 Correct 619 ms 5016 KB Output is correct
11 Correct 561 ms 5020 KB Output is correct
12 Correct 512 ms 5024 KB Output is correct
13 Correct 579 ms 4948 KB Output is correct
14 Correct 109 ms 4948 KB Output is correct
15 Correct 104 ms 4948 KB Output is correct
16 Correct 231 ms 5040 KB Output is correct
17 Correct 500 ms 5024 KB Output is correct
18 Correct 569 ms 5068 KB Output is correct
19 Correct 241 ms 4948 KB Output is correct
20 Correct 545 ms 5024 KB Output is correct
21 Correct 220 ms 5032 KB Output is correct
22 Execution timed out 4056 ms 5804 KB Time limit exceeded
23 Halted 0 ms 0 KB -

Subtask #3
0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4960 KB Output is correct
2 Correct 3 ms 4960 KB Output is correct
3 Correct 3 ms 4960 KB Output is correct
4 Correct 110 ms 5044 KB Output is correct
5 Correct 110 ms 5032 KB Output is correct
6 Correct 113 ms 5036 KB Output is correct
7 Correct 105 ms 4960 KB Output is correct
8 Correct 250 ms 5028 KB Output is correct
9 Correct 545 ms 5024 KB Output is correct
10 Correct 619 ms 5016 KB Output is correct
11 Correct 561 ms 5020 KB Output is correct
12 Correct 512 ms 5024 KB Output is correct
13 Correct 579 ms 4948 KB Output is correct
14 Correct 109 ms 4948 KB Output is correct
15 Correct 104 ms 4948 KB Output is correct
16 Correct 231 ms 5040 KB Output is correct
17 Correct 500 ms 5024 KB Output is correct
18 Correct 569 ms 5068 KB Output is correct
19 Correct 241 ms 4948 KB Output is correct
20 Correct 545 ms 5024 KB Output is correct
21 Correct 220 ms 5032 KB Output is correct
22 Execution timed out 4056 ms 5804 KB Time limit exceeded
23 Halted 0 ms 0 KB -