oj.uz

답안 #752151

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
752151 2023-06-02T11:18:38 Z Sam_a17 Dynamic Diameter (CEOI19_diameter) C++17
100 / 100
 408 ms 59980 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 int N = 3e5 + 10, LOG = 21;
vector<pair<long long, long long>> adj[N];
long long n, q, w, cost[N], which[N];
long long p[N], first[N], last[N];
int op[N];

vector<int> path;
void dfs(int node, int parent) {
  for(auto i: adj[node]) {
    if(i.first == parent) continue;
    path.push_back(i.second);
    dfs(i.first, node);
    path.push_back(i.second);
  }
}

struct segTree {
  struct node {
    long long value, max_abc, max_a, max_bc, max_ab, max_b;
  };

  long long size = 1;
  vector<node> tree;

  void init(long long s) {
    while(size < s) {
      size *= 2;
    }
    tree.assign(2 * size - 1, {0, 0, 0, 0, 0, 0});
  }

  node lef(long long val) {
    return {val, val, val, val, 0, 0};
  }

  node rig(long long val) {
    return {-val, val, 0, val, val, 2 * val};
  }

  node merge(node a, node b) {
    a.max_abc = max({a.max_abc, b.max_abc, a.max_ab + b.max_a + a.value, a.max_a + b.max_bc - a.value});

    a.max_ab = max({a.max_ab, b.max_ab - a.value, a.max_a + b.max_b - 2 * a.value});
    a.max_bc = max({a.max_bc, b.max_bc - a.value, a.max_b + b.max_a + a.value});

    a.max_a = max({a.max_a, b.max_a + a.value});
    a.max_b = max(a.max_b, b.max_b - 2 * a.value);
    
    a.value = a.value + b.value;
    return a;
  }

  void upd(int u, int x, int lx, int rx) {
    if(rx - lx == 1) {
      long long cur = cost[path[lx - 1]];
      if(op[lx]) {
        tree[x] = lef(cur);
      } else {
        tree[x] = rig(cur);
      }
    } else {
      int mid = (lx + rx) / 2;
      if(u < mid) {
        upd(u, 2 * x + 1, lx, mid);
      } else {
        upd(u, 2 * x + 2, mid, rx);
      }
      tree[x] = merge(tree[2 * x + 1], tree[2 * x + 2]);
    }
  }

  void upd(int u) {
    upd(u, 0, 0, size);
  }

  node qry(int l, int r, int x, int lx, int rx) {

    if(lx >= r || rx <= l) {
      return {0, 0, 0, 0, 0, 0};
    }

    if(lx >= l && rx <= r) {
      return tree[x];
    }

    int mid = (lx + rx) / 2;
    node s1 = qry(l, r, 2 * x + 1, lx, mid);
    node s2 = qry(l, r, 2 * x + 2, mid, rx);
    return merge(s1, s2);
  }

  node qry(int l, int r) {
    return qry(l, r, 0, 0, size);
  }
};

segTree seg;

void solve_() {
  cin >> n >> q >> w;
  seg.init(2 * n + 10);
  for(int i = 1; i <= n - 1; i++) {
    long long a, b, c; cin >> a >> b >> c;
    if(a > b) swap(a, b);

    adj[a].push_back({b, i});
    adj[b].push_back({a, i});

    //
    cost[i] = c;
    which[i] = b;
  }

  dfs(1, 0);
  
  memset(first, -1, sizeof(first));
  memset(last, -1, sizeof(last));

  for(int i = 0; i < sz(path); i++) {
    if(first[path[i]] == -1) {
      first[path[i]] = (i + 1);
      op[i + 1] = 1;
    } 
    last[path[i]] = (i + 1);
  }

  for(int i = 1; i <= sz(path); i++) {
    seg.upd(i);
  }

  long long las = 0;
  while(q--) {
    long long d, e; cin >> d >> e;
    d = (d + las) % (n - 1);
    e = (e + las) % w;
    d++;
    cost[d] = e;

    seg.upd(first[d]);
    seg.upd(last[d]);
    
    cout << seg.tree[0].max_abc << '\n';
    las = seg.tree[0].max_abc;
  }
}

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

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

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 11988 KB Output is correct
2 Correct 7 ms 11988 KB Output is correct
3 Correct 6 ms 11988 KB Output is correct
4 Correct 6 ms 11988 KB Output is correct
5 Correct 7 ms 11984 KB Output is correct
6 Correct 6 ms 11988 KB Output is correct
7 Correct 7 ms 12116 KB Output is correct
8 Correct 8 ms 12036 KB Output is correct
9 Correct 6 ms 12104 KB Output is correct
10 Correct 9 ms 12112 KB Output is correct
11 Correct 6 ms 11988 KB Output is correct
12 Correct 7 ms 12108 KB Output is correct
13 Correct 8 ms 12116 KB Output is correct
14 Correct 7 ms 12108 KB Output is correct
15 Correct 8 ms 12096 KB Output is correct
16 Correct 7 ms 12116 KB Output is correct
17 Correct 8 ms 12116 KB Output is correct
18 Correct 7 ms 12116 KB Output is correct

Subtask #2
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 11988 KB Output is correct
2 Correct 7 ms 11988 KB Output is correct
3 Correct 6 ms 11988 KB Output is correct
4 Correct 6 ms 11988 KB Output is correct
5 Correct 7 ms 11984 KB Output is correct
6 Correct 6 ms 11988 KB Output is correct
7 Correct 7 ms 12116 KB Output is correct
8 Correct 8 ms 12036 KB Output is correct
9 Correct 6 ms 12104 KB Output is correct
10 Correct 9 ms 12112 KB Output is correct
11 Correct 6 ms 11988 KB Output is correct
12 Correct 7 ms 12108 KB Output is correct
13 Correct 8 ms 12116 KB Output is correct
14 Correct 7 ms 12108 KB Output is correct
15 Correct 8 ms 12096 KB Output is correct
16 Correct 7 ms 12116 KB Output is correct
17 Correct 8 ms 12116 KB Output is correct
18 Correct 7 ms 12116 KB Output is correct
19 Correct 14 ms 12372 KB Output is correct
20 Correct 15 ms 12372 KB Output is correct
21 Correct 14 ms 12372 KB Output is correct
22 Correct 12 ms 12516 KB Output is correct
23 Correct 14 ms 14164 KB Output is correct
24 Correct 14 ms 14304 KB Output is correct
25 Correct 14 ms 14292 KB Output is correct
26 Correct 15 ms 14728 KB Output is correct

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 11988 KB Output is correct
2 Correct 9 ms 11988 KB Output is correct
3 Correct 8 ms 12128 KB Output is correct
4 Correct 18 ms 12316 KB Output is correct
5 Correct 46 ms 13244 KB Output is correct
6 Correct 8 ms 11988 KB Output is correct
7 Correct 7 ms 12116 KB Output is correct
8 Correct 7 ms 12244 KB Output is correct
9 Correct 9 ms 12184 KB Output is correct
10 Correct 18 ms 12456 KB Output is correct
11 Correct 57 ms 13520 KB Output is correct
12 Correct 10 ms 14036 KB Output is correct
13 Correct 11 ms 14044 KB Output is correct
14 Correct 11 ms 14180 KB Output is correct
15 Correct 23 ms 14412 KB Output is correct
16 Correct 80 ms 15520 KB Output is correct
17 Correct 91 ms 46780 KB Output is correct
18 Correct 99 ms 46776 KB Output is correct
19 Correct 103 ms 46808 KB Output is correct
20 Correct 175 ms 47108 KB Output is correct
21 Correct 217 ms 48332 KB Output is correct

Subtask #4
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 12400 KB Output is correct
2 Correct 12 ms 12512 KB Output is correct
3 Correct 35 ms 13008 KB Output is correct
4 Correct 59 ms 13788 KB Output is correct
5 Correct 16 ms 16300 KB Output is correct
6 Correct 30 ms 16340 KB Output is correct
7 Correct 65 ms 17044 KB Output is correct
8 Correct 89 ms 17740 KB Output is correct
9 Correct 52 ms 29620 KB Output is correct
10 Correct 60 ms 29676 KB Output is correct
11 Correct 115 ms 30436 KB Output is correct
12 Correct 140 ms 31184 KB Output is correct
13 Correct 95 ms 47040 KB Output is correct
14 Correct 168 ms 47132 KB Output is correct
15 Correct 149 ms 47800 KB Output is correct
16 Correct 191 ms 48604 KB Output is correct
17 Correct 250 ms 48432 KB Output is correct

Subtask #5
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 268 ms 50784 KB Output is correct
2 Correct 350 ms 50788 KB Output is correct
3 Correct 282 ms 50788 KB Output is correct
4 Correct 300 ms 50776 KB Output is correct
5 Correct 298 ms 50764 KB Output is correct
6 Correct 328 ms 50612 KB Output is correct
7 Correct 288 ms 54388 KB Output is correct
8 Correct 298 ms 54464 KB Output is correct
9 Correct 376 ms 54356 KB Output is correct
10 Correct 355 ms 54340 KB Output is correct
11 Correct 312 ms 54260 KB Output is correct
12 Correct 294 ms 53084 KB Output is correct
13 Correct 408 ms 59672 KB Output is correct
14 Correct 346 ms 59816 KB Output is correct
15 Correct 297 ms 59796 KB Output is correct
16 Correct 307 ms 59760 KB Output is correct
17 Correct 305 ms 59024 KB Output is correct
18 Correct 260 ms 55008 KB Output is correct
19 Correct 373 ms 59668 KB Output is correct
20 Correct 299 ms 59752 KB Output is correct
21 Correct 333 ms 59980 KB Output is correct
22 Correct 316 ms 59692 KB Output is correct
23 Correct 302 ms 58972 KB Output is correct
24 Correct 340 ms 55088 KB Output is correct

Subtask #6
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 11988 KB Output is correct
2 Correct 7 ms 11988 KB Output is correct
3 Correct 6 ms 11988 KB Output is correct
4 Correct 6 ms 11988 KB Output is correct
5 Correct 7 ms 11984 KB Output is correct
6 Correct 6 ms 11988 KB Output is correct
7 Correct 7 ms 12116 KB Output is correct
8 Correct 8 ms 12036 KB Output is correct
9 Correct 6 ms 12104 KB Output is correct
10 Correct 9 ms 12112 KB Output is correct
11 Correct 6 ms 11988 KB Output is correct
12 Correct 7 ms 12108 KB Output is correct
13 Correct 8 ms 12116 KB Output is correct
14 Correct 7 ms 12108 KB Output is correct
15 Correct 8 ms 12096 KB Output is correct
16 Correct 7 ms 12116 KB Output is correct
17 Correct 8 ms 12116 KB Output is correct
18 Correct 7 ms 12116 KB Output is correct
19 Correct 14 ms 12372 KB Output is correct
20 Correct 15 ms 12372 KB Output is correct
21 Correct 14 ms 12372 KB Output is correct
22 Correct 12 ms 12516 KB Output is correct
23 Correct 14 ms 14164 KB Output is correct
24 Correct 14 ms 14304 KB Output is correct
25 Correct 14 ms 14292 KB Output is correct
26 Correct 15 ms 14728 KB Output is correct
27 Correct 8 ms 11988 KB Output is correct
28 Correct 9 ms 11988 KB Output is correct
29 Correct 8 ms 12128 KB Output is correct
30 Correct 18 ms 12316 KB Output is correct
31 Correct 46 ms 13244 KB Output is correct
32 Correct 8 ms 11988 KB Output is correct
33 Correct 7 ms 12116 KB Output is correct
34 Correct 7 ms 12244 KB Output is correct
35 Correct 9 ms 12184 KB Output is correct
36 Correct 18 ms 12456 KB Output is correct
37 Correct 57 ms 13520 KB Output is correct
38 Correct 10 ms 14036 KB Output is correct
39 Correct 11 ms 14044 KB Output is correct
40 Correct 11 ms 14180 KB Output is correct
41 Correct 23 ms 14412 KB Output is correct
42 Correct 80 ms 15520 KB Output is correct
43 Correct 91 ms 46780 KB Output is correct
44 Correct 99 ms 46776 KB Output is correct
45 Correct 103 ms 46808 KB Output is correct
46 Correct 175 ms 47108 KB Output is correct
47 Correct 217 ms 48332 KB Output is correct
48 Correct 8 ms 12400 KB Output is correct
49 Correct 12 ms 12512 KB Output is correct
50 Correct 35 ms 13008 KB Output is correct
51 Correct 59 ms 13788 KB Output is correct
52 Correct 16 ms 16300 KB Output is correct
53 Correct 30 ms 16340 KB Output is correct
54 Correct 65 ms 17044 KB Output is correct
55 Correct 89 ms 17740 KB Output is correct
56 Correct 52 ms 29620 KB Output is correct
57 Correct 60 ms 29676 KB Output is correct
58 Correct 115 ms 30436 KB Output is correct
59 Correct 140 ms 31184 KB Output is correct
60 Correct 95 ms 47040 KB Output is correct
61 Correct 168 ms 47132 KB Output is correct
62 Correct 149 ms 47800 KB Output is correct
63 Correct 191 ms 48604 KB Output is correct
64 Correct 250 ms 48432 KB Output is correct
65 Correct 268 ms 50784 KB Output is correct
66 Correct 350 ms 50788 KB Output is correct
67 Correct 282 ms 50788 KB Output is correct
68 Correct 300 ms 50776 KB Output is correct
69 Correct 298 ms 50764 KB Output is correct
70 Correct 328 ms 50612 KB Output is correct
71 Correct 288 ms 54388 KB Output is correct
72 Correct 298 ms 54464 KB Output is correct
73 Correct 376 ms 54356 KB Output is correct
74 Correct 355 ms 54340 KB Output is correct
75 Correct 312 ms 54260 KB Output is correct
76 Correct 294 ms 53084 KB Output is correct
77 Correct 408 ms 59672 KB Output is correct
78 Correct 346 ms 59816 KB Output is correct
79 Correct 297 ms 59796 KB Output is correct
80 Correct 307 ms 59760 KB Output is correct
81 Correct 305 ms 59024 KB Output is correct
82 Correct 260 ms 55008 KB Output is correct
83 Correct 373 ms 59668 KB Output is correct
84 Correct 299 ms 59752 KB Output is correct
85 Correct 333 ms 59980 KB Output is correct
86 Correct 316 ms 59692 KB Output is correct
87 Correct 302 ms 58972 KB Output is correct
88 Correct 340 ms 55088 KB Output is correct
89 Correct 267 ms 49812 KB Output is correct
90 Correct 292 ms 50348 KB Output is correct
91 Correct 281 ms 52148 KB Output is correct
92 Correct 302 ms 52168 KB Output is correct
93 Correct 274 ms 55552 KB Output is correct
94 Correct 295 ms 54224 KB Output is correct
95 Correct 282 ms 56256 KB Output is correct
96 Correct 297 ms 54760 KB Output is correct
97 Correct 367 ms 56080 KB Output is correct
98 Correct 309 ms 58932 KB Output is correct
99 Correct 283 ms 55888 KB Output is correct
100 Correct 313 ms 55772 KB Output is correct