提出 #39856692

---

ソースコード 拡げる

#include <bits/stdc++.h>
#define int long long
#ifndef use_ios11
#define use_ios11
using namespace std;
#define log(a) cerr << "\033[32m[DEBUG] " << #a << '=' << (a) << " @ line " << __LINE__ << "\033[0m" << endl
typedef long long ll;
#define pb push_back
typedef pair<int, int> pii;

#define mem(p) memset(&p, 0, sizeof(p))
typedef pair<long long, long long> pll;
#define ir(x) \
    int x;    \
    yin >> x
#define foor(action, actionx2, actionx4, width)         \
    do                                                  \
    {                                                   \
        unsigned long __width = (unsigned long)(width); \
        unsigned long __increment = __width >> 2;       \
        for (; __increment > 0; __increment--)          \
        {                                               \
            actionx4;                                   \
        }                                               \
        switch (__width & 3)                            \
        {                                               \
        case 2:                                         \
            actionx2;                                   \
            break;                                      \
        case 3:                                         \
            actionx2;                                   \
        case 1:                                         \
            action;                                     \
            break;                                      \
        }                                               \
    } while (0)
struct ins
{
    int ans;
    ins()
    {
        ans = 1;
    }
#define endl '\n'
    void read()
    {
    }
    void read1(char &s)
    {
        char c = getchar();
        for (; !isprint(c) || c == ' ' || c == '\n' || c == '\t'; c = getchar())
            ;
        s = c;
        if (c == EOF)
            ans = 0;
    }
    void read1(string &s)
    {
        s = "";
        char c = getchar();
        for (; !isprint(c) || c == ' ' || c == '\n' || c == '\t'; c = getchar())
            ;
        for (; isprint(c) && c != ' ' && c != '\n' && c != '\t'; c = getchar())
            s += c;
        if (c == EOF)
            ans = 0;
    }
    void read1(char *s)
    {
        char c = getchar();
        int tt = 0;
        for (; !isprint(c) || c == ' ' || c == '\n' || c == '\t'; c = getchar())
            ;
        for (; isprint(c) && c != ' ' && c != '\n' && c != '\t'; c = getchar())
            s[tt++] = c;
        s[tt] = '\0';
        if (c == EOF)
            ans = 0;
    }

    template <typename T>
    void read1(T &n)
    {
        T x = 0;
        int f = 1;
        char c = getchar();
        for (; !isdigit(c); c = getchar())
        {
            if (c == '-')
                f = -1;
            if (c == EOF)
            {
                ans = 0;
                return;
            }
        }
        for (; isdigit(c); c = getchar())
            x = x * 10 + c - 48;
        n = x * f;
        if (c == EOF)
            ans = 0;
        if (c != '.')
            return;
        T l = 0.1;
        while ((c = getchar()) <= '9' && c >= '0')
            x = x + (c & 15) * l, l *= 0.1;
        n = x * f;
        if (c == EOF)
            ans = 0;
    }
    void write() {}
    void write1(string s)
    {
        int n = s.size();
        for (int i = 0; i < n; i++)
            putchar(s[i]);
    }
    void write1(const char *s)
    {
        int n = strlen(s);
        for (int i = 0; i < n; i++)
            putchar(s[i]);
    }
    void write1(char *s)
    {
        int n = strlen(s);
        for (int i = 0; i < n; i++)
            putchar(s[i]);
    }

    void write1(char s)
    {
        putchar(s);
    }
    void write1(float s, int x = 6)
    {
        char y[10001];
        sprintf(y, "%%.%df", x);
        printf(y, s);
    }
    void write1(double s, int x = 6)
    {
        char y[10001];
        sprintf(y, "%%.%dlf", x);
        printf(y, s);
    }
    void write1(long double s, int x = 6)
    {
        char y[10001];
        sprintf(y, "%%.%dLf", x);
        printf(y, s);
    }
    template <typename T>
    void write1(T n)
    {
        if (n < 0)
            n = -n, putchar('-');
        if (n > 9)
            write1(n / 10);
        putchar('0' + n % 10);
    }
    friend ins operator>>(ins x, char *n);
    template <typename T>
    friend ins operator>>(ins x, T &n);
    template <typename T>
    friend ins operator<<(ins x, T n);
    operator bool()
    {
        return ans;
    }
};

ins operator>>(ins x, char *n)
{
    if (!x.ans)
        return x;
    x.read1(n);
    return x;
}

template <typename T>
ins operator>>(ins x, T &n)
{
    if (!x.ans)
        return x;
    x.read1(n);
    return x;
}
template <typename T>
ins operator<<(ins x, T n)
{
    x.write1(n);
    return x;
}
ins yin;
ins yout;
#endif
const int maxn = 5e5 + 10;
int n, x[maxn], y[maxn], z[maxn], fa[maxn], dep[maxn], sz[maxn], son[maxn], dd[maxn], top[maxn], dfn[maxn], cnt, val[maxn], Ldfn[maxn], Rdfn[maxn];
struct ZhkSegmentTree
{
#define ls num << 1
#define rs num << 1 | 1
    int sum[maxn << 2], tag[maxn << 2], len[maxn << 2];
    inline void pushup(int num)
    {
        sum[num] = sum[ls] + sum[rs];
    }
    inline void down(int num, int x)
    {
        tag[num] = tag[num] + x;
        sum[num] = sum[num] + (ll)len[num] * x;
    }
    inline void pushdown(int num)
    {
        if (tag[num])
        {
            down(ls, tag[num]);
            down(rs, tag[num]);
            tag[num] = 0;
        }
    }
    inline void build(int num, int l, int r)
    {
        len[num] = r - l + 1;
        if (l == r)
        {
            sum[num] = val[dd[l]];
            return;
        }
        int mid = (l + r) >> 1;
        build(ls, l, mid);
        build(rs, mid + 1, r);
        pushup(num);
    }
    inline void change(int num, int l, int r, int L, int R, int x)
    {
        // cout<<l<<" "<<r<<" "<<L<<" "<<R<<endl;
        if (L <= l && r <= R)
        {
            down(num, x);
            return;
        }
        pushdown(num);
        int mid = (l + r) >> 1;
        if (mid >= L)
            change(ls, l, mid, L, R, x);
        if (mid < R)
            change(rs, mid + 1, r, L, R, x);
        pushup(num);
    }
    inline int query(int num, int l, int r, int L, int R)
    {
        if (L <= l && r <= R)
            return sum[num];
        pushdown(num);
        int mid = (l + r) >> 1;
        if (mid < L)
            return query(rs, mid + 1, r, L, R);
        if (mid >= R)
            return query(ls, l, mid, L, R);
        return query(ls, l, mid, L, R) + query(rs, mid + 1, r, L, R);
    }
} T;
vector<int> v[maxn];
inline void dfs1(int x, int f)
{
    sz[x] = 1;
    fa[x] = f;
    dep[x] = dep[f] + 1;
    for (auto i : v[x])
        if (i != f)
        {
            dfs1(i, x);
            sz[x] += sz[i];
            if (sz[i] > sz[son[x]])
                son[x] = i;
        }
}
inline void dfs2(int x, int f)
{
    top[x] = f;
    Ldfn[x] = dfn[x] = ++cnt, Rdfn[x] = Ldfn[x] + sz[x] - 1;
    dd[cnt] = x;
    if (!son[x])
        return;
    dfs2(son[x], f);
    for (auto i : v[x])
        if (i != fa[x] && i != son[x])
            dfs2(i, i);
}
inline int LCA(int x, int y)
{
    while (top[x] != top[y])
    {
        if (dep[top[x]] < dep[top[y]])
            swap(x, y);
        x = fa[top[x]];
    }
    if (dep[x] > dep[y])
        swap(x, y);
    return x;
}
inline int answer(int x, int y)
{
    int ans = 0;
    while (top[x] != top[y])
    {
        if (dep[top[x]] < dep[top[y]])
            swap(x, y);
        ans = ans + T.query(1, 1, n, dfn[top[x]], dfn[x]);
        x = fa[top[x]];
    }
    if (dep[x] > dep[y])
        swap(x, y);
    ans = ans + T.query(1, 1, n, dfn[x], dfn[y]);
    return ans;
}
signed main()
{
    int Q;
    yin >> n;
    for (int i = 1; i < n; i++)
    {
        yin >> x[i] >> y[i] >> z[i];
        v[x[i]].push_back(y[i]);
        v[y[i]].push_back(x[i]);
    }
    dfs1(1, 0);
    for (int i = 1; i < n; i++)
    {
        if (dep[x[i]] < dep[y[i]])
            swap(x[i], y[i]);
        val[x[i]] = z[i];
    }
    dfs2(1, 1);
    T.build(1, 1, n);
    yin >> Q;
    while (Q--)
    {
        int flg, x, y;
        yin >> flg >> x;
        if (flg == 1)
        {
            yin >> y;
            T.change(1, 1, n, dfn[::x[x]], dfn[::x[x]], y - val[::x[x]]);
            val[::x[x]] = y;
        }
        if (flg == 2)
        {
            yin >> y;
            int k = LCA(x, y);
            yout << (answer(x, y) - T.query(1, 1, n, dfn[k], dfn[k])) << endl;
        }
    }
    return 0;
}

提出情報

コンパイルエラー

./Main.cpp: In member function ‘void ins::write1(float, long long int)’:
./Main.cpp:138:25: warning: format ‘%d’ expects argument of type ‘int’, but argument 3 has type ‘long long int’ [-Wformat=]
  138 |         sprintf(y, "%%.%df", x);
      |                        ~^    ~
      |                         |    |
      |                         int  long long int
      |                        %lld
./Main.cpp: In member function ‘void ins::write1(double, long long int)’:
./Main.cpp:144:25: warning: format ‘%d’ expects argument of type ‘int’, but argument 3 has type ‘long long int’ [-Wformat=]
  144 |         sprintf(y, "%%.%dlf", x);
      |                        ~^     ~
      |                         |     |
      |                         int   long long int
      |                        %lld
./Main.cpp: In member function ‘void ins::write1(long double, long long int)’:
./Main.cpp:150:25: warning: format ‘%d’ expects argument of type ‘int’, but argument 3 has type ‘long long int’ [-Wformat=]
  150 |         sprintf(y, "%%.%dLf", x);
      |                        ~^     ~
      |                         |     |
      |                         int   long long int
      |                        %lld
./Main.cpp: In function ‘int main()’:
./Main.cpp:349:9: warning: ‘flg’ may be used uninitialized in this function [-Wmaybe-uninitialized]
  349 |         if (flg == 2)
      |         ^~
./Main.cpp:346:70: warning: ‘x’ may be used uninitialized in this function [-Wmaybe-uninitialized]
  346 |             T.change(1, 1, n, dfn[::x[x]], dfn[::x[x]], y - val[::x[x]]);
      |                                                                 ~~~~~^

ジャッジ結果