oj.uz

답안 #884374

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
884374 2023-12-07T09:04:21 Z mgl_diamond Dynamic Diameter (CEOI19_diameter) C++17
100 / 100
 411 ms 226560 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ii = pair<ll, ll>;

#define foru(i, l, r) for(int i=(l); i<=(r); ++i)
#define ford(i, l, r) for(int i=(l); i>=(r); --i)
#define fore(x, v) for(auto &x : v)
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
#define fi first
#define se second
#define int long long
#define file "input"

template<class T> bool minimize(T &a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<class T> bool maximize(T &a, T b) { if (a < b) { a = b; return 1; } return 0; }

void setIO() {
  ios::sync_with_stdio(0);
  cin.tie(0); cout.tie(0);
  if (fopen(file".inp", "r")) {
    freopen(file".inp", "r", stdin);
    freopen(file".out", "w", stdout);
  }
}

const ll LINF = 1e18;
const int MOD = 998244353;
const int N = 6e5+5;

struct node {
  ll mat[3][3];
  node() { foru(i, 0, 2) foru(j, i, 2) mat[i][j] = -LINF; }
} sgt[N<<2];

int n, m;
ll W, ew[N], dist[N], lazy[N];
int eu[N], ev[N], st[N], en[N], euler[N], par[N];
vector<int> adj[N];

int cnt;
void dfs_first(int u, int p) {
  euler[++cnt] = u;
  st[u] = cnt;
  fore(i, adj[u]) {
    int v = eu[i]^ev[i]^u;
    if (v == p) continue;
    dist[v] = dist[u] + ew[i];
    par[v] = u;
    dfs_first(v, u);
    euler[++cnt] = u;
  }
  en[u] = cnt;
}

void apply(int id, ll val) {
  lazy[id] += val;
  foru(i, 0, 2) foru(j, i, 2) {
    int ad = 0;
    if (i == 0) ad += 1;
    if (i <= 1 && 1 <= j) ad -= 2;
    if (j == 2) ad += 1;
    sgt[id].mat[i][j] += val * ad;
  }
}

void push(int id) {
  if (lazy[id] == 0) return;
  apply(id*2, lazy[id]);
  apply(id*2+1, lazy[id]);
  lazy[id] = 0;
}

node comb(node a, node b) {
  node c;
  foru(i, 0, 2)
    foru(j, i, 2) {
      c.mat[i][j] = max(a.mat[i][j], b.mat[i][j]);
      foru(k, i, j-1) maximize(c.mat[i][j], a.mat[i][k] + b.mat[k+1][j]);
    }
  return c;
}

void build(int id = 1, int lb = 1, int rb = cnt) {
  if (lb ^ rb) {
    int k = id << 1, mb = (lb + rb) >> 1;
    build(k, lb, mb);
    build(k+1, mb+1, rb);
    sgt[id] = comb(sgt[k], sgt[k+1]);
  }
  else {
    sgt[id].mat[0][0] = dist[euler[lb]];
    sgt[id].mat[1][1] = -2 * dist[euler[lb]];
    sgt[id].mat[0][1] = sgt[id].mat[0][0] + sgt[id].mat[1][1];
    sgt[id].mat[1][2] = sgt[id].mat[1][1] + sgt[id].mat[2][2];
    sgt[id].mat[2][2] = dist[euler[lb]];
    sgt[id].mat[0][2] = 0;
  }
  // cout << lb << " " << rb << " " << sgt[id].mat[1][1] << "\n";
}

void update(int l, int r, ll val, int id = 1, int lb = 1, int rb = cnt) {
  if (l <= lb && rb <= r) {
    apply(id, val);
    return;
  }
  if (rb < l || lb > r) {
    return;
  }
  int k = id << 1, mb = (lb + rb) >> 1;
  push(id);
  update(l, r, val, k, lb, mb);
  update(l, r, val, k+1, mb+1, rb);
  sgt[id] = comb(sgt[k], sgt[k+1]);
  // cout << lb << " " << rb << " " << sgt[id].mat[0][1] << "\n";
}

signed main() {
  setIO();

  cin >> n >> m >> W;

  foru(i, 0, n-2) {
    cin >> eu[i] >> ev[i] >> ew[i];
    adj[eu[i]].push_back(i);
    adj[ev[i]].push_back(i);
  }

  dfs_first(1, 0);
  build();

  ll lst = 0;
  foru(z, 1, m) {
    ll x, y;
    cin >> x >> y;
    x = (x+lst) % (n-1);
    y = (y+lst) % W;
    if (par[eu[x]] == ev[x]) swap(eu[x], ev[x]);

    update(st[ev[x]], en[ev[x]], y - ew[x]);
    ew[x] = y;
    lst = sgt[1].mat[0][2];
    cout << lst << "\n";
  }
}

Compilation message

diameter.cpp: In function 'void setIO()':
diameter.cpp:23:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   23 |     freopen(file".inp", "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
diameter.cpp:24:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   24 |     freopen(file".out", "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 53 ms 196948 KB Output is correct
2 Correct 28 ms 197020 KB Output is correct
3 Correct 26 ms 197120 KB Output is correct
4 Correct 26 ms 196956 KB Output is correct
5 Correct 26 ms 197044 KB Output is correct
6 Correct 27 ms 197076 KB Output is correct
7 Correct 26 ms 196944 KB Output is correct
8 Correct 30 ms 197244 KB Output is correct
9 Correct 26 ms 196944 KB Output is correct
10 Correct 27 ms 196944 KB Output is correct
11 Correct 28 ms 196948 KB Output is correct
12 Correct 30 ms 196948 KB Output is correct
13 Correct 27 ms 197048 KB Output is correct
14 Correct 26 ms 197152 KB Output is correct
15 Correct 26 ms 196944 KB Output is correct
16 Correct 28 ms 197068 KB Output is correct
17 Correct 28 ms 196952 KB Output is correct
18 Correct 26 ms 196956 KB Output is correct

Subtask #2
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 53 ms 196948 KB Output is correct
2 Correct 28 ms 197020 KB Output is correct
3 Correct 26 ms 197120 KB Output is correct
4 Correct 26 ms 196956 KB Output is correct
5 Correct 26 ms 197044 KB Output is correct
6 Correct 27 ms 197076 KB Output is correct
7 Correct 26 ms 196944 KB Output is correct
8 Correct 30 ms 197244 KB Output is correct
9 Correct 26 ms 196944 KB Output is correct
10 Correct 27 ms 196944 KB Output is correct
11 Correct 28 ms 196948 KB Output is correct
12 Correct 30 ms 196948 KB Output is correct
13 Correct 27 ms 197048 KB Output is correct
14 Correct 26 ms 197152 KB Output is correct
15 Correct 26 ms 196944 KB Output is correct
16 Correct 28 ms 197068 KB Output is correct
17 Correct 28 ms 196952 KB Output is correct
18 Correct 26 ms 196956 KB Output is correct
19 Correct 31 ms 197200 KB Output is correct
20 Correct 32 ms 197212 KB Output is correct
21 Correct 31 ms 197264 KB Output is correct
22 Correct 32 ms 197208 KB Output is correct
23 Correct 37 ms 197716 KB Output is correct
24 Correct 33 ms 197716 KB Output is correct
25 Correct 35 ms 197712 KB Output is correct
26 Correct 36 ms 197976 KB Output is correct

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 27 ms 196952 KB Output is correct
2 Correct 28 ms 197148 KB Output is correct
3 Correct 27 ms 197208 KB Output is correct
4 Correct 33 ms 197204 KB Output is correct
5 Correct 61 ms 197976 KB Output is correct
6 Correct 27 ms 197092 KB Output is correct
7 Correct 26 ms 197212 KB Output is correct
8 Correct 27 ms 197132 KB Output is correct
9 Correct 29 ms 197200 KB Output is correct
10 Correct 36 ms 197456 KB Output is correct
11 Correct 76 ms 198284 KB Output is correct
12 Correct 28 ms 197464 KB Output is correct
13 Correct 30 ms 197652 KB Output is correct
14 Correct 29 ms 197712 KB Output is correct
15 Correct 41 ms 197948 KB Output is correct
16 Correct 90 ms 198760 KB Output is correct
17 Correct 55 ms 210312 KB Output is correct
18 Correct 54 ms 211160 KB Output is correct
19 Correct 56 ms 213236 KB Output is correct
20 Correct 75 ms 214212 KB Output is correct
21 Correct 184 ms 215648 KB Output is correct

Subtask #4
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 28 ms 197204 KB Output is correct
2 Correct 38 ms 197348 KB Output is correct
3 Correct 78 ms 197712 KB Output is correct
4 Correct 113 ms 198480 KB Output is correct
5 Correct 31 ms 198200 KB Output is correct
6 Correct 42 ms 198228 KB Output is correct
7 Correct 103 ms 198740 KB Output is correct
8 Correct 156 ms 199368 KB Output is correct
9 Correct 44 ms 205288 KB Output is correct
10 Correct 66 ms 205680 KB Output is correct
11 Correct 116 ms 206220 KB Output is correct
12 Correct 190 ms 206944 KB Output is correct
13 Correct 66 ms 214084 KB Output is correct
14 Correct 85 ms 215376 KB Output is correct
15 Correct 191 ms 216148 KB Output is correct
16 Correct 241 ms 216880 KB Output is correct
17 Correct 242 ms 215720 KB Output is correct

Subtask #5
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 264 ms 218064 KB Output is correct
2 Correct 283 ms 219216 KB Output is correct
3 Correct 260 ms 219116 KB Output is correct
4 Correct 269 ms 219276 KB Output is correct
5 Correct 253 ms 218704 KB Output is correct
6 Correct 265 ms 218528 KB Output is correct
7 Correct 304 ms 221984 KB Output is correct
8 Correct 294 ms 222036 KB Output is correct
9 Correct 302 ms 221972 KB Output is correct
10 Correct 309 ms 222056 KB Output is correct
11 Correct 313 ms 221492 KB Output is correct
12 Correct 286 ms 219532 KB Output is correct
13 Correct 342 ms 226332 KB Output is correct
14 Correct 358 ms 226392 KB Output is correct
15 Correct 366 ms 226388 KB Output is correct
16 Correct 357 ms 226272 KB Output is correct
17 Correct 353 ms 225596 KB Output is correct
18 Correct 328 ms 222408 KB Output is correct
19 Correct 360 ms 226560 KB Output is correct
20 Correct 365 ms 226224 KB Output is correct
21 Correct 370 ms 226440 KB Output is correct
22 Correct 377 ms 226224 KB Output is correct
23 Correct 346 ms 225488 KB Output is correct
24 Correct 306 ms 221892 KB Output is correct

Subtask #6
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 53 ms 196948 KB Output is correct
2 Correct 28 ms 197020 KB Output is correct
3 Correct 26 ms 197120 KB Output is correct
4 Correct 26 ms 196956 KB Output is correct
5 Correct 26 ms 197044 KB Output is correct
6 Correct 27 ms 197076 KB Output is correct
7 Correct 26 ms 196944 KB Output is correct
8 Correct 30 ms 197244 KB Output is correct
9 Correct 26 ms 196944 KB Output is correct
10 Correct 27 ms 196944 KB Output is correct
11 Correct 28 ms 196948 KB Output is correct
12 Correct 30 ms 196948 KB Output is correct
13 Correct 27 ms 197048 KB Output is correct
14 Correct 26 ms 197152 KB Output is correct
15 Correct 26 ms 196944 KB Output is correct
16 Correct 28 ms 197068 KB Output is correct
17 Correct 28 ms 196952 KB Output is correct
18 Correct 26 ms 196956 KB Output is correct
19 Correct 31 ms 197200 KB Output is correct
20 Correct 32 ms 197212 KB Output is correct
21 Correct 31 ms 197264 KB Output is correct
22 Correct 32 ms 197208 KB Output is correct
23 Correct 37 ms 197716 KB Output is correct
24 Correct 33 ms 197716 KB Output is correct
25 Correct 35 ms 197712 KB Output is correct
26 Correct 36 ms 197976 KB Output is correct
27 Correct 27 ms 196952 KB Output is correct
28 Correct 28 ms 197148 KB Output is correct
29 Correct 27 ms 197208 KB Output is correct
30 Correct 33 ms 197204 KB Output is correct
31 Correct 61 ms 197976 KB Output is correct
32 Correct 27 ms 197092 KB Output is correct
33 Correct 26 ms 197212 KB Output is correct
34 Correct 27 ms 197132 KB Output is correct
35 Correct 29 ms 197200 KB Output is correct
36 Correct 36 ms 197456 KB Output is correct
37 Correct 76 ms 198284 KB Output is correct
38 Correct 28 ms 197464 KB Output is correct
39 Correct 30 ms 197652 KB Output is correct
40 Correct 29 ms 197712 KB Output is correct
41 Correct 41 ms 197948 KB Output is correct
42 Correct 90 ms 198760 KB Output is correct
43 Correct 55 ms 210312 KB Output is correct
44 Correct 54 ms 211160 KB Output is correct
45 Correct 56 ms 213236 KB Output is correct
46 Correct 75 ms 214212 KB Output is correct
47 Correct 184 ms 215648 KB Output is correct
48 Correct 28 ms 197204 KB Output is correct
49 Correct 38 ms 197348 KB Output is correct
50 Correct 78 ms 197712 KB Output is correct
51 Correct 113 ms 198480 KB Output is correct
52 Correct 31 ms 198200 KB Output is correct
53 Correct 42 ms 198228 KB Output is correct
54 Correct 103 ms 198740 KB Output is correct
55 Correct 156 ms 199368 KB Output is correct
56 Correct 44 ms 205288 KB Output is correct
57 Correct 66 ms 205680 KB Output is correct
58 Correct 116 ms 206220 KB Output is correct
59 Correct 190 ms 206944 KB Output is correct
60 Correct 66 ms 214084 KB Output is correct
61 Correct 85 ms 215376 KB Output is correct
62 Correct 191 ms 216148 KB Output is correct
63 Correct 241 ms 216880 KB Output is correct
64 Correct 242 ms 215720 KB Output is correct
65 Correct 264 ms 218064 KB Output is correct
66 Correct 283 ms 219216 KB Output is correct
67 Correct 260 ms 219116 KB Output is correct
68 Correct 269 ms 219276 KB Output is correct
69 Correct 253 ms 218704 KB Output is correct
70 Correct 265 ms 218528 KB Output is correct
71 Correct 304 ms 221984 KB Output is correct
72 Correct 294 ms 222036 KB Output is correct
73 Correct 302 ms 221972 KB Output is correct
74 Correct 309 ms 222056 KB Output is correct
75 Correct 313 ms 221492 KB Output is correct
76 Correct 286 ms 219532 KB Output is correct
77 Correct 342 ms 226332 KB Output is correct
78 Correct 358 ms 226392 KB Output is correct
79 Correct 366 ms 226388 KB Output is correct
80 Correct 357 ms 226272 KB Output is correct
81 Correct 353 ms 225596 KB Output is correct
82 Correct 328 ms 222408 KB Output is correct
83 Correct 360 ms 226560 KB Output is correct
84 Correct 365 ms 226224 KB Output is correct
85 Correct 370 ms 226440 KB Output is correct
86 Correct 377 ms 226224 KB Output is correct
87 Correct 346 ms 225488 KB Output is correct
88 Correct 306 ms 221892 KB Output is correct
89 Correct 261 ms 218172 KB Output is correct
90 Correct 252 ms 218420 KB Output is correct
91 Correct 284 ms 219956 KB Output is correct
92 Correct 280 ms 219980 KB Output is correct
93 Correct 309 ms 222648 KB Output is correct
94 Correct 305 ms 221552 KB Output is correct
95 Correct 365 ms 223316 KB Output is correct
96 Correct 351 ms 222192 KB Output is correct
97 Correct 352 ms 223056 KB Output is correct
98 Correct 411 ms 225620 KB Output is correct
99 Correct 328 ms 223004 KB Output is correct
100 Correct 403 ms 222928 KB Output is correct