Submission #1332582

#	Time	Username	Problem	Language	Result	Execution time	Memory
1332582		retarde	Unique Cities (JOI19_ho_t5)	C++20	0 / 100	647 ms	339968 KiB

joi2019_ho_t5

#include <bits/stdc++.h>
using namespace std;

#define pb push_back
#define pf push_front
#define mp make_pair
#define fi first
#define se second
#define int long long
#define all(x) (x).begin(), (x).end()

typedef long double ld;
typedef long long ll;
typedef pair<ll,ll> pll;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<bool> vb;
typedef vector<vector<int>> vvi;
typedef vector<vector<bool>> vvb;
typedef vector<vector<ll>> vvll;
typedef vector<string> vs;
typedef vector<vector<string>> vvs;
typedef vector<char> vc;
typedef vector<vector<char>> vvc;
typedef map<int, int> mii;
typedef unordered_map<int, int> umii;

const int mod = 1e9 + 7;
const int inf = INTMAX_MAX;
const bool tc = false;

const int mxn = 1e5 + 5;
vi adj[mxn]; int dp[mxn]; pii out[mxn], far[mxn], mxdp[mxn];

void cmx(pii &x, int y, int z = 1) {
    if (x.fi == y) x.se++;
    if (x.fi < y) x = {y, z};
}

void dfs(int node, int prev, int depth) {
    dp[node] = depth; mxdp[node] = {depth, 1};
    if (node) {
        out[node] = out[prev];
        cmx(out[node], mxdp[prev].fi - dp[prev], mxdp[prev].se);
        out[node].fi++;
    }
    for (auto &neighbour : adj[node]) {
        if (neighbour == prev) continue;
        dfs(neighbour, node, depth + 1);
        mxdp[node] = max(mxdp[node], mxdp[neighbour]);
    }
    far[node] = out[node];
    cmx(far[node], mxdp[node].fi - dp[node], mxdp[node].se);
}

inline void solve() {
    int n, m;
    cin >> n >> m;
    for (int i = 0; i < n; i++) {
        int u, v;
        cin >> u >> v;
        u--; v--;
        adj[u].pb(v); adj[v].pb(u);
    }
    dfs(0, -1, 0);

    for (int i = 0; i < n; i++) cout << (far[i].se == 1) << "\n";
}

void setIO(string s) {
    freopen((s + ".in").c_str(), "r", stdin);
    freopen((s + ".out").c_str(), "w", stdout);
}

signed main() {
    ios::sync_with_stdio(false);
    cout.tie(0);
    cin.tie(0);
    //setIO();

    int t = 1;
    if (tc) {
        cin >> t;
    }

    while (t--) {
        solve();
    }
}

Compilation message (stderr)

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

• Subtask 1: 0 / 4
• Subtask 2: 0 / 32
• Subtask 3: 0 / 32
• Subtask 4: 0 / 32