제출 #1266176

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1266176		quangminh412	Tourism (JOI23_tourism)	C++20	100 / 100	652 ms	21832 KiB

tourism

/*
  Ben Watson

  Quang Minh MasterDDDDD
*/

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

#define ll long long

const string name = "test";

void solve();
signed main()
{
    if (fopen((name + ".inp").c_str(), "r"))
    {
        freopen((name + ".inp").c_str(), "r", stdin);
        freopen((name + ".out").c_str(), "w", stdout);
    }
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    solve();

    return 0;
}

// main program
const int oo = 0x3f3f3f3f;
const int maxn = 1e5 + 1;

struct FenwickTree
{
    vector<int> bits;
    int n;

    FenwickTree(int n) : n(n) { bits.resize(n + 1, 0); }

    void update(int pos, int val)
    {
        for (; pos <= n; pos += (pos & (-pos)))
            bits[pos] += val;
    }

    int query(int pos)
    {
        int res = 0;
        for (; pos > 0; pos -= (pos & (-pos)))
            res += bits[pos];
        return res;
    }
    int query(int l, int r) { return query(r) - query(l - 1); }
};

vector<int> adj[maxn], queries[maxn];
int c[maxn], ans[maxn], L[maxn];
FenwickTree bit(maxn);
int n, m, q;

// tree processing
int pos[maxn], tp[maxn], sz[maxn], par[maxn], d[maxn];

void DFS(int u, int p = -1)
{
    sz[u] = 1;
    for (int v : adj[u])
    {
        if (v == p)
            continue;

        par[v] = u;
        d[v] = d[u] + 1;
        DFS(v, u);
        sz[u] += sz[v];
    }
}

int timeDFS = 0;
void DFS_HLD(int u, int top)
{
    pos[u] = ++timeDFS;
    tp[u] = top;

    int nxt = -1;
    for (int v : adj[u])
        if (v != par[u] && (nxt == -1 || sz[v] > sz[nxt]))
            nxt = v;
    if (nxt != -1)
        DFS_HLD(nxt, top);
    for (int v : adj[u])
        if (v != par[u] && v != nxt)
            DFS_HLD(v, v);
}

// handle queries
set<array<int, 3>> se;

void update(int l, int r, int x)
{
    while (true)
    {
        auto it = se.lower_bound({l, -oo, -oo});
        int u = (*it)[1], v = (*it)[0], val = (*it)[2];
        if (it == se.end() || r < u || v < l)
            break;
        se.erase(it);
        int len = min(v, r) - max(l, u) + 1;
        bit.update(val + 1, -len);
        if (u < l)
            se.insert({l - 1, u, val});
        if (r < v)
            se.insert({v, r + 1, val});
    }
    bit.update(x + 1, r - l + 1);
    se.insert({r, l, x});
}

void update_path(int u, int v, int x)
{
    while (tp[u] != tp[v])
    {
        if (d[tp[u]] < d[tp[v]])
            swap(u, v);
        update(pos[tp[u]], pos[u], x);
        u = par[tp[u]];
    }
    if (d[u] > d[v])
        swap(u, v);
    update(pos[u], pos[v], x);
}

void solve()
{
    cin >> n >> m >> q;
    for (int i = 1; i < n; i++)
    {
        int u, v; cin >> u >> v;
        adj[u].push_back(v);
        adj[v].push_back(u);
    }
    for (int i = 1; i <= m; i++)
        cin >> c[i];

    DFS(1);
    DFS_HLD(1, 1);
    for (int i = 1; i <= q; i++)
    {
        int l, r; cin >> l >> r;
        L[i] = l;
        queries[r].push_back(i);
    }

    for (int i = 1; i <= m; i++)
    {
        if (i != 1)
            update_path(c[i - 1], c[i], i - 1);
        update_path(c[i], c[i], i);

        for (int idx : queries[i])
            ans[idx] = bit.query(L[idx] + 1, m + 1);
    }

    for (int i = 1; i <= q; i++)
        cout << ans[i] << '\n';
}

컴파일 시 표준 에러 (stderr) 메시지

tourism.cpp: In function 'int main()':
tourism.cpp:19:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   19 |         freopen((name + ".inp").c_str(), "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
tourism.cpp:20:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   20 |         freopen((name + ".out").c_str(), "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 5 / 5
• Subtask 2: 5 / 5
• Subtask 3: 7 / 7
• Subtask 4: 18 / 18
• Subtask 5: 24 / 24
• Subtask 6: 41 / 41