oj.uz

Submission #719042

# Submission time Handle Problem Language Result Execution time Memory
719042 2023-04-05T09:07:17 Z Sam_a17 Village (BOI20_village) C++17
50 / 100
 109 ms 37436 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(x) __builtin_popcount(x)
 
#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(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 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 long long N = 2e5 + 10, inf = 1e8;
vector<int> adj[N];
long long dp[N][2], each[N], pat[N];
vector<pair<int, int>> dpp[N][2];

void dfs(int node, int parent) {
  int c = 0;
  for(auto i: adj[node]) {
    if(i == parent) continue;
    dfs(i, node);
    c++;
  }

  if(!c) {
    dp[node][0] = 0;
    dp[node][1] = inf;
  } else {

    long long s = 0;
    for(auto i: adj[node]) {
      if(i == parent) continue;
      dp[node][0] += dp[i][1];
      dp[node][0] = min(dp[node][0], inf);

      s += min(dp[i][1], dp[i][0] + 2);
      if(dp[i][0] + 2 <= dp[i][1]) {
        dpp[node][1].push_back({i, 1});
      } else {
        dpp[node][1].push_back({i, 0});
      }
    }

    long long sx = INT32_MAX;
    int it = 0;

    pair<int, int> pp;
    for(auto i: adj[node]) {
      if(i == parent) continue;

      if(s - min(dp[i][1], dp[i][0] + 2) + min(dp[i][1] + 2, dp[i][0] + 2) < sx) {
        sx = s - min(dp[i][1], dp[i][0] + 2) + min(dp[i][1] + 2, dp[i][0] + 2);
        pp = {i, 1};
      }
      it++;
    }

    for(auto &i: dpp[node][1]) {
      if(i.first == pp.first) {
        i.second = 1;
      }
    }
    dp[node][1] = sx;
  } 
}

void gen_edges(int node, int state, int parent) {
  if(state == 0) {
    for(auto i: adj[node]) {
      if(i == parent) continue;
      gen_edges(i, 1, node);
    }
  } else {
    int cnt = 0;
    for(auto i: dpp[node][1]) {
      if(i.second == 1) {
        cnt++;
        swap(each[node], each[i.first]);
        if(dp[i.first][0] > dp[i.first][1]) {
          gen_edges(i.first, 1, node);
        } else {
          gen_edges(i.first, 0, node);
        }
      } else {
        gen_edges(i.first, 1, node);
      }
    }

    assert(cnt >= 1);
  }
}

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

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

  dfs(1, 0);

  for(int i = 1; i <= n; i++) {
    each[i] = i;
  }
  gen_edges(1, 1, 0);

  for(int i = 1; i <= n; i++) {
    pat[each[i]] = i;
    assert(each[i] != i);
  }

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

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

Subtask #1
6.0 / 12.0

# Verdict Execution time Memory Grader output
1 Partially correct 8 ms 14420 KB Partially correct
2 Partially correct 7 ms 14420 KB Partially correct
3 Correct 7 ms 14420 KB Output is correct
4 Partially correct 7 ms 14420 KB Partially correct
5 Partially correct 8 ms 14512 KB Partially correct
6 Partially correct 7 ms 14324 KB Partially correct
7 Correct 8 ms 14420 KB Output is correct
8 Partially correct 7 ms 14428 KB Partially correct
9 Partially correct 8 ms 14420 KB Partially correct
10 Partially correct 9 ms 14420 KB Partially correct
11 Partially correct 7 ms 14420 KB Partially correct
12 Partially correct 7 ms 14420 KB Partially correct
13 Partially correct 8 ms 14420 KB Partially correct
14 Correct 8 ms 14420 KB Output is correct
15 Partially correct 8 ms 14348 KB Partially correct
16 Partially correct 7 ms 14420 KB Partially correct
17 Partially correct 8 ms 14424 KB Partially correct

Subtask #2
19.0 / 38.0

# Verdict Execution time Memory Grader output
1 Partially correct 8 ms 14416 KB Partially correct
2 Partially correct 8 ms 14420 KB Partially correct
3 Partially correct 8 ms 14420 KB Partially correct
4 Partially correct 8 ms 14548 KB Partially correct
5 Partially correct 8 ms 14548 KB Partially correct
6 Partially correct 9 ms 14512 KB Partially correct
7 Partially correct 8 ms 14548 KB Partially correct
8 Partially correct 8 ms 14548 KB Partially correct
9 Partially correct 8 ms 14548 KB Partially correct
10 Partially correct 8 ms 14548 KB Partially correct
11 Partially correct 10 ms 14560 KB Partially correct
12 Correct 8 ms 14548 KB Output is correct
13 Partially correct 10 ms 14548 KB Partially correct
14 Partially correct 8 ms 14464 KB Partially correct
15 Partially correct 8 ms 14420 KB Partially correct
16 Partially correct 8 ms 14444 KB Partially correct
17 Partially correct 8 ms 14548 KB Partially correct
18 Partially correct 8 ms 14420 KB Partially correct
19 Partially correct 8 ms 14548 KB Partially correct
20 Partially correct 8 ms 14420 KB Partially correct
21 Partially correct 8 ms 14548 KB Partially correct
22 Partially correct 8 ms 14424 KB Partially correct
23 Partially correct 9 ms 14428 KB Partially correct
24 Partially correct 8 ms 14420 KB Partially correct
25 Partially correct 8 ms 14420 KB Partially correct
26 Partially correct 10 ms 14548 KB Partially correct
27 Partially correct 7 ms 14420 KB Partially correct
28 Partially correct 8 ms 14428 KB Partially correct
29 Partially correct 8 ms 14524 KB Partially correct
30 Partially correct 8 ms 14512 KB Partially correct

Subtask #3
25.0 / 50.0

# Verdict Execution time Memory Grader output
1 Partially correct 8 ms 14420 KB Partially correct
2 Partially correct 7 ms 14420 KB Partially correct
3 Correct 7 ms 14420 KB Output is correct
4 Partially correct 7 ms 14420 KB Partially correct
5 Partially correct 8 ms 14512 KB Partially correct
6 Partially correct 7 ms 14324 KB Partially correct
7 Correct 8 ms 14420 KB Output is correct
8 Partially correct 7 ms 14428 KB Partially correct
9 Partially correct 8 ms 14420 KB Partially correct
10 Partially correct 9 ms 14420 KB Partially correct
11 Partially correct 7 ms 14420 KB Partially correct
12 Partially correct 7 ms 14420 KB Partially correct
13 Partially correct 8 ms 14420 KB Partially correct
14 Correct 8 ms 14420 KB Output is correct
15 Partially correct 8 ms 14348 KB Partially correct
16 Partially correct 7 ms 14420 KB Partially correct
17 Partially correct 8 ms 14424 KB Partially correct
18 Partially correct 8 ms 14416 KB Partially correct
19 Partially correct 8 ms 14420 KB Partially correct
20 Partially correct 8 ms 14420 KB Partially correct
21 Partially correct 8 ms 14548 KB Partially correct
22 Partially correct 8 ms 14548 KB Partially correct
23 Partially correct 9 ms 14512 KB Partially correct
24 Partially correct 8 ms 14548 KB Partially correct
25 Partially correct 8 ms 14548 KB Partially correct
26 Partially correct 8 ms 14548 KB Partially correct
27 Partially correct 8 ms 14548 KB Partially correct
28 Partially correct 10 ms 14560 KB Partially correct
29 Correct 8 ms 14548 KB Output is correct
30 Partially correct 10 ms 14548 KB Partially correct
31 Partially correct 8 ms 14464 KB Partially correct
32 Partially correct 8 ms 14420 KB Partially correct
33 Partially correct 8 ms 14444 KB Partially correct
34 Partially correct 8 ms 14548 KB Partially correct
35 Partially correct 8 ms 14420 KB Partially correct
36 Partially correct 8 ms 14548 KB Partially correct
37 Partially correct 8 ms 14420 KB Partially correct
38 Partially correct 8 ms 14548 KB Partially correct
39 Partially correct 8 ms 14424 KB Partially correct
40 Partially correct 9 ms 14428 KB Partially correct
41 Partially correct 8 ms 14420 KB Partially correct
42 Partially correct 8 ms 14420 KB Partially correct
43 Partially correct 10 ms 14548 KB Partially correct
44 Partially correct 7 ms 14420 KB Partially correct
45 Partially correct 8 ms 14428 KB Partially correct
46 Partially correct 8 ms 14524 KB Partially correct
47 Partially correct 8 ms 14512 KB Partially correct
48 Partially correct 75 ms 24612 KB Partially correct
49 Partially correct 87 ms 25664 KB Partially correct
50 Partially correct 82 ms 25728 KB Partially correct
51 Partially correct 64 ms 23232 KB Partially correct
52 Partially correct 81 ms 25508 KB Partially correct
53 Partially correct 71 ms 24396 KB Partially correct
54 Partially correct 44 ms 25496 KB Partially correct
55 Partially correct 109 ms 37436 KB Partially correct
56 Partially correct 96 ms 31024 KB Partially correct
57 Partially correct 92 ms 29164 KB Partially correct
58 Partially correct 89 ms 27732 KB Partially correct
59 Partially correct 86 ms 25656 KB Partially correct
60 Correct 55 ms 25104 KB Output is correct
61 Partially correct 57 ms 25276 KB Partially correct
62 Partially correct 63 ms 25148 KB Partially correct
63 Partially correct 55 ms 24532 KB Partially correct
64 Partially correct 73 ms 25404 KB Partially correct
65 Partially correct 64 ms 25404 KB Partially correct
66 Partially correct 54 ms 24704 KB Partially correct
67 Partially correct 42 ms 22464 KB Partially correct
68 Partially correct 51 ms 23756 KB Partially correct
69 Partially correct 56 ms 25536 KB Partially correct
70 Partially correct 53 ms 24872 KB Partially correct
71 Partially correct 42 ms 22080 KB Partially correct
72 Partially correct 47 ms 23176 KB Partially correct
73 Partially correct 57 ms 25532 KB Partially correct
74 Partially correct 53 ms 24512 KB Partially correct
75 Partially correct 84 ms 25372 KB Partially correct
76 Partially correct 82 ms 25348 KB Partially correct
77 Partially correct 64 ms 25388 KB Partially correct
78 Partially correct 44 ms 21620 KB Partially correct
79 Partially correct 49 ms 22760 KB Partially correct
80 Partially correct 85 ms 25388 KB Partially correct
81 Partially correct 80 ms 25420 KB Partially correct
82 Partially correct 64 ms 24948 KB Partially correct