oj.uz

답안 #128506

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
128506 2019-07-11T04:41:00 Z mirbek01 Election Campaign (JOI15_election_campaign) C++11
100 / 100
 367 ms 31796 KB 
# include <bits/stdc++.h>

using namespace std;

const int N = 1e5 + 2;

int n, m, a[N], b[N], c[N], dp[N], sv[N];
int up[17][N], tin[N], tout[N], timer, ver[N];
int t[N * 4], add[N * 4];
vector <int> g[N], qe[N];

void dfs(int v, int pr){
      tin[v] = ++ timer;
      ver[timer] = v;
      up[0][v] = pr;
      for(int i = 1; i <= 16; i ++)
            up[i][v] = up[i - 1][up[i - 1][v]];
      for(int to : g[v]){
            if(to == pr)
                  continue;
            dfs(to, v);
      }
      tout[v] = timer;
}

bool upper(int a, int b){
      return tin[a] <= tin[b] && tout[a] >= tout[b];
}

int lca(int a, int b){
      if(upper(a, b))
            return a;
      if(upper(b, a))
            return b;
      for(int i = 16; i >= 0; i --){
            if(!upper(up[i][a], b))
                  a = up[i][a];
      }
      return up[0][a];
}

void push(int v, int tl, int tr){
      t[v] += (tr - tl + 1) * add[v];
      if(tl != tr){
            add[v << 1] += add[v];
            add[v << 1 | 1] += add[v];
      }
      add[v] = 0;
}

void upd(int l, int r, int val, int v = 1, int tl = 1, int tr = n){
      push(v, tl, tr);
      if(l > tr || tl > r)
            return ;
      if(l <= tl && tr <= r){
            add[v] += val;
            push(v, tl, tr);
            return ;
      }
      int tm = (tl + tr) >> 1;
      upd(l, r, val, v << 1, tl, tm);
      upd(l, r, val, v << 1 | 1, tm + 1, tr);
      t[v] = t[v << 1] + t[v << 1 | 1];
}

int get(int pos, int v = 1, int tl = 1, int tr = n){
      push(v, tl, tr);
      if(tl == tr)
            return t[v];
      int tm = (tl + tr) >> 1;
      if(pos <= tm)
            return get(pos, v << 1, tl, tm);
      return get(pos, v << 1 | 1, tm + 1, tr);
}

void calc(int v, int pr){
      for(int to : g[v]){
            if(to == pr)
                  continue;
            calc(to, v);
            sv[v] += dp[to];
      }

      for(int to : g[v]){
            if(to == pr)
                  continue;
            upd(tin[to], tout[to], sv[v] - dp[to]);
      }

      dp[v] = sv[v];

      for(int i : qe[v]){
            int ret = sv[ a[i] ] + sv[ b[i] ] - sv[v] + c[i];
            ret += get(tin[ a[i] ]);
            ret += get(tin[ b[i] ]);
            dp[v] = max(dp[v], ret);
      }
}

int main(){
      scanf("%d", &n);

      for(int i = 1; i < n; i ++){
            int u, v;
            scanf("%d %d", &u, &v);
            g[u].push_back(v);
            g[v].push_back(u);
      }

      dfs(1, 1);

      scanf("%d", &m);

      for(int i = 1; i <= m; i ++){
            scanf("%d %d %d", a+i, b+i, c+i);
            qe[ lca(a[i], b[i]) ].push_back(i);
      }

      calc(1, 1);

      cout << dp[1] << endl;
}

Compilation message

election_campaign.cpp: In function 'int main()':
election_campaign.cpp:101:12: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
       scanf("%d", &n);
       ~~~~~^~~~~~~~~~
election_campaign.cpp:105:18: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
             scanf("%d %d", &u, &v);
             ~~~~~^~~~~~~~~~~~~~~~~
election_campaign.cpp:112:12: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
       scanf("%d", &m);
       ~~~~~^~~~~~~~~~
election_campaign.cpp:115:18: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
             scanf("%d %d %d", a+i, b+i, c+i);
             ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 5112 KB Output is correct
2 Correct 6 ms 5112 KB Output is correct
3 Correct 6 ms 5112 KB Output is correct
4 Correct 7 ms 5116 KB Output is correct
5 Correct 161 ms 20096 KB Output is correct
6 Correct 99 ms 27896 KB Output is correct
7 Correct 178 ms 25168 KB Output is correct
8 Correct 132 ms 20216 KB Output is correct
9 Correct 186 ms 23544 KB Output is correct
10 Correct 128 ms 20088 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 5116 KB Output is correct
2 Correct 6 ms 5112 KB Output is correct
3 Correct 7 ms 5368 KB Output is correct
4 Correct 186 ms 31392 KB Output is correct
5 Correct 186 ms 31336 KB Output is correct
6 Correct 179 ms 31452 KB Output is correct
7 Correct 183 ms 31352 KB Output is correct
8 Correct 181 ms 31324 KB Output is correct
9 Correct 181 ms 31500 KB Output is correct
10 Correct 186 ms 31340 KB Output is correct

Subtask #3
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 5116 KB Output is correct
2 Correct 6 ms 5112 KB Output is correct
3 Correct 7 ms 5368 KB Output is correct
4 Correct 186 ms 31392 KB Output is correct
5 Correct 186 ms 31336 KB Output is correct
6 Correct 179 ms 31452 KB Output is correct
7 Correct 183 ms 31352 KB Output is correct
8 Correct 181 ms 31324 KB Output is correct
9 Correct 181 ms 31500 KB Output is correct
10 Correct 186 ms 31340 KB Output is correct
11 Correct 20 ms 6268 KB Output is correct
12 Correct 188 ms 31648 KB Output is correct
13 Correct 189 ms 31736 KB Output is correct
14 Correct 184 ms 31684 KB Output is correct
15 Correct 187 ms 31612 KB Output is correct
16 Correct 183 ms 31740 KB Output is correct
17 Correct 190 ms 31776 KB Output is correct
18 Correct 187 ms 31796 KB Output is correct
19 Correct 178 ms 31768 KB Output is correct
20 Correct 186 ms 31708 KB Output is correct

Subtask #4
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 287 ms 21556 KB Output is correct
2 Correct 178 ms 31448 KB Output is correct
3 Correct 367 ms 28372 KB Output is correct
4 Correct 263 ms 23028 KB Output is correct
5 Correct 302 ms 28152 KB Output is correct
6 Correct 283 ms 23244 KB Output is correct
7 Correct 348 ms 27700 KB Output is correct
8 Correct 283 ms 23592 KB Output is correct
9 Correct 188 ms 31500 KB Output is correct
10 Correct 330 ms 26712 KB Output is correct

Subtask #5
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 5112 KB Output is correct
2 Correct 6 ms 5112 KB Output is correct
3 Correct 6 ms 5112 KB Output is correct
4 Correct 7 ms 5116 KB Output is correct
5 Correct 161 ms 20096 KB Output is correct
6 Correct 99 ms 27896 KB Output is correct
7 Correct 178 ms 25168 KB Output is correct
8 Correct 132 ms 20216 KB Output is correct
9 Correct 186 ms 23544 KB Output is correct
10 Correct 128 ms 20088 KB Output is correct
11 Correct 8 ms 5368 KB Output is correct
12 Correct 8 ms 5368 KB Output is correct
13 Correct 8 ms 5368 KB Output is correct
14 Correct 8 ms 5368 KB Output is correct
15 Correct 10 ms 5368 KB Output is correct
16 Correct 9 ms 5368 KB Output is correct
17 Correct 7 ms 5368 KB Output is correct
18 Correct 8 ms 5368 KB Output is correct
19 Correct 8 ms 5368 KB Output is correct
20 Correct 7 ms 5368 KB Output is correct

Subtask #6
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 5112 KB Output is correct
2 Correct 6 ms 5112 KB Output is correct
3 Correct 6 ms 5112 KB Output is correct
4 Correct 7 ms 5116 KB Output is correct
5 Correct 161 ms 20096 KB Output is correct
6 Correct 99 ms 27896 KB Output is correct
7 Correct 178 ms 25168 KB Output is correct
8 Correct 132 ms 20216 KB Output is correct
9 Correct 186 ms 23544 KB Output is correct
10 Correct 128 ms 20088 KB Output is correct
11 Correct 6 ms 5116 KB Output is correct
12 Correct 6 ms 5112 KB Output is correct
13 Correct 7 ms 5368 KB Output is correct
14 Correct 186 ms 31392 KB Output is correct
15 Correct 186 ms 31336 KB Output is correct
16 Correct 179 ms 31452 KB Output is correct
17 Correct 183 ms 31352 KB Output is correct
18 Correct 181 ms 31324 KB Output is correct
19 Correct 181 ms 31500 KB Output is correct
20 Correct 186 ms 31340 KB Output is correct
21 Correct 20 ms 6268 KB Output is correct
22 Correct 188 ms 31648 KB Output is correct
23 Correct 189 ms 31736 KB Output is correct
24 Correct 184 ms 31684 KB Output is correct
25 Correct 187 ms 31612 KB Output is correct
26 Correct 183 ms 31740 KB Output is correct
27 Correct 190 ms 31776 KB Output is correct
28 Correct 187 ms 31796 KB Output is correct
29 Correct 178 ms 31768 KB Output is correct
30 Correct 186 ms 31708 KB Output is correct
31 Correct 287 ms 21556 KB Output is correct
32 Correct 178 ms 31448 KB Output is correct
33 Correct 367 ms 28372 KB Output is correct
34 Correct 263 ms 23028 KB Output is correct
35 Correct 302 ms 28152 KB Output is correct
36 Correct 283 ms 23244 KB Output is correct
37 Correct 348 ms 27700 KB Output is correct
38 Correct 283 ms 23592 KB Output is correct
39 Correct 188 ms 31500 KB Output is correct
40 Correct 330 ms 26712 KB Output is correct
41 Correct 8 ms 5368 KB Output is correct
42 Correct 8 ms 5368 KB Output is correct
43 Correct 8 ms 5368 KB Output is correct
44 Correct 8 ms 5368 KB Output is correct
45 Correct 10 ms 5368 KB Output is correct
46 Correct 9 ms 5368 KB Output is correct
47 Correct 7 ms 5368 KB Output is correct
48 Correct 8 ms 5368 KB Output is correct
49 Correct 8 ms 5368 KB Output is correct
50 Correct 7 ms 5368 KB Output is correct
51 Correct 287 ms 23804 KB Output is correct
52 Correct 190 ms 31696 KB Output is correct
53 Correct 354 ms 27124 KB Output is correct
54 Correct 257 ms 23544 KB Output is correct
55 Correct 327 ms 23516 KB Output is correct
56 Correct 188 ms 31608 KB Output is correct
57 Correct 324 ms 27868 KB Output is correct
58 Correct 274 ms 23412 KB Output is correct
59 Correct 296 ms 24032 KB Output is correct
60 Correct 187 ms 31580 KB Output is correct
61 Correct 317 ms 27948 KB Output is correct
62 Correct 256 ms 23348 KB Output is correct
63 Correct 298 ms 23360 KB Output is correct
64 Correct 185 ms 31608 KB Output is correct
65 Correct 365 ms 27784 KB Output is correct
66 Correct 246 ms 23544 KB Output is correct
67 Correct 303 ms 23412 KB Output is correct
68 Correct 204 ms 31716 KB Output is correct
69 Correct 330 ms 26720 KB Output is correct
70 Correct 259 ms 23448 KB Output is correct