oj.uz

답안 #761365

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
761365 2023-06-19T14:38:53 Z Dan4Life Vinjete (COI22_vinjete) C++17
40 / 100
 254 ms 274760 KB 
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pb push_back
#define mp make_pair
const int mxN = (int)1e5+10;
const int Lg = (int)8e6/mxN;
int n, mx, IND = 1;
int segTree[mxN*Lg], lazy[mxN*Lg];
vector<pair<int,pair<int,int>>> adj[mxN];
int ans[mxN], root[mxN*Lg], L[mxN*Lg], R[mxN*Lg];
 
int newLeaf(int v){ int p = ++IND; segTree[p]=v; return p; }
 
int newParent(int l, int r){
	int p = ++IND; L[p]=l, R[p]=r; lazy[p]=-1;
	segTree[p] = segTree[L[p]]+segTree[R[p]];
	return p;
}
 
int newLazyChild(int p, int v, int l, int r){
	int ind = ++IND;
    L[ind] = L[p];
    R[ind] = R[p];
    lazy[ind] = v;
    segTree[ind] = (r-l+1)*v;
	return ind;
}
 
void prop(int p, int l, int r){
	if(!p or l==r or lazy[p]==-1) return;
	int mid = (l+r)/2;
    if(!L[p]) L[p]=++IND;
    if(!R[p]) R[p]=++IND;
	L[p] = newLazyChild(L[p],lazy[p],l,mid);
	R[p] = newLazyChild(R[p],lazy[p],mid+1,r);
	lazy[p]=-1;
}
 
int upd(int i, int j, int v, int p, int l=1, int r=mx){
	if(i>r or j<l or i>j or !p) return p; prop(p,l,r);
	if(i<=l and r<=j) return newLazyChild(p,v,l,r);
	int mid = (l+r)/2;
    if(!L[p] and i<=mid) L[p]=++IND;
    if(!R[p] and j>mid) R[p]=++IND;
	return newParent(upd(i,j,v,L[p],l,mid),upd(i,j,v,R[p],mid+1,r));
}
 
int query(int i, int j, int p, int l=1, int r=mx){
	if(i>r or j<l or i>j or !p) return 0; prop(p,l,r);
	if(i<=l and r<=j) return segTree[p];
	int mid = (l+r)/2;
	return query(i,j,L[p],l,mid)+query(i,j,R[p],mid+1,r);
}
 
void dfs(int s, int p){
    ans[s] = segTree[root[s]];
    for(auto x : adj[s]){
        int u = x.fi; if(u==p) continue;
        root[u] = upd(x.se.fi,x.se.se,1,root[s]); dfs(u,s);
    }
}
 
int32_t main()
{
    ios_base::sync_with_stdio(false); cin.tie(0);
    cin >> n >> mx; root[1] = 1;
    memset(lazy,-1,sizeof(lazy));
    for(int i = 1; i < n; i++){
        int a, b, l, r; cin >> a >> b >> l >> r;
        adj[a].pb({b,mp(l,r)}); adj[b].pb({a,mp(l,r)});
    }
    dfs(1,0);
    for(int i = 2; i <= n; i++) cout << ans[i] << "\n";
}
 
/*
const int mxN = (int)1e5+10;
int n, m, ans[mxN];
vector<pair<int,pair<int,int>>> adj[mxN];
 
int segTree[mxN*2];
vector<int> lazy(mxN*2, -1);
 
void prop(int p, int l, int r){
    if(l==r or lazy[p]==-1) return;
    int mid = (l+r)>>1; int rp = p+2*(mid-l+1);
    lazy[p+1] = lazy[rp] = lazy[p]; lazy[p]=-1;
    segTree[p+1] = (mid-l+1)*lazy[p+1];
    segTree[rp] = (r-mid)*lazy[p+1];
}
 
void upd(int i, int j, int v, int p=0, int l=1, int r=n){
    if(i>r or j<l or i>j) return; prop(p,l,r);
    if(i<=l and r<=j){
        lazy[p]=v; segTree[p] = (r-l+1)*v;
        return;
    }
    int mid = (l+r)>>1; int rp = p+2*(mid-l+1);
    upd(i,j,v,p+1,l,mid), upd(i,j,v,rp,mid+1,r);
    segTree[p] = segTree[p+1]+segTree[rp];
}
 
void dfs(int s, int p){
    ans[s] = segTree[0];
    for(auto x : adj[s]){
        int u = x.fi; if(u==p) continue;
        upd(x.se.fi,x.se.se,1); dfs(u,s);
        rollback();
    }
}
*/

Compilation message

Main.cpp: In function 'int upd(int, int, int, int, int, int)':
Main.cpp:42:2: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
   42 |  if(i>r or j<l or i>j or !p) return p; prop(p,l,r);
      |  ^~
Main.cpp:42:40: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
   42 |  if(i>r or j<l or i>j or !p) return p; prop(p,l,r);
      |                                        ^~~~
Main.cpp: In function 'int query(int, int, int, int, int)':
Main.cpp:51:2: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
   51 |  if(i>r or j<l or i>j or !p) return 0; prop(p,l,r);
      |  ^~
Main.cpp:51:40: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
   51 |  if(i>r or j<l or i>j or !p) return 0; prop(p,l,r);
      |                                        ^~~~

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 34388 KB Output is correct
2 Correct 16 ms 34388 KB Output is correct
3 Correct 15 ms 34280 KB Output is correct
4 Correct 15 ms 34228 KB Output is correct
5 Correct 15 ms 33876 KB Output is correct
6 Correct 14 ms 33808 KB Output is correct
7 Correct 14 ms 33620 KB Output is correct
8 Correct 17 ms 33620 KB Output is correct
9 Correct 15 ms 34268 KB Output is correct
10 Correct 15 ms 34312 KB Output is correct
11 Correct 14 ms 34260 KB Output is correct
12 Correct 14 ms 34160 KB Output is correct
13 Correct 16 ms 33808 KB Output is correct
14 Correct 15 ms 33856 KB Output is correct
15 Correct 15 ms 33544 KB Output is correct
16 Correct 14 ms 33652 KB Output is correct
17 Correct 15 ms 34200 KB Output is correct
18 Correct 15 ms 34260 KB Output is correct
19 Correct 15 ms 34132 KB Output is correct
20 Correct 16 ms 34132 KB Output is correct
21 Correct 15 ms 33748 KB Output is correct
22 Correct 15 ms 33840 KB Output is correct
23 Correct 14 ms 33620 KB Output is correct
24 Correct 14 ms 33620 KB Output is correct

Subtask #2
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 34388 KB Output is correct
2 Correct 16 ms 34388 KB Output is correct
3 Correct 15 ms 34280 KB Output is correct
4 Correct 15 ms 34228 KB Output is correct
5 Correct 15 ms 33876 KB Output is correct
6 Correct 14 ms 33808 KB Output is correct
7 Correct 14 ms 33620 KB Output is correct
8 Correct 17 ms 33620 KB Output is correct
9 Correct 15 ms 34268 KB Output is correct
10 Correct 15 ms 34312 KB Output is correct
11 Correct 14 ms 34260 KB Output is correct
12 Correct 14 ms 34160 KB Output is correct
13 Correct 16 ms 33808 KB Output is correct
14 Correct 15 ms 33856 KB Output is correct
15 Correct 15 ms 33544 KB Output is correct
16 Correct 14 ms 33652 KB Output is correct
17 Correct 15 ms 34200 KB Output is correct
18 Correct 15 ms 34260 KB Output is correct
19 Correct 15 ms 34132 KB Output is correct
20 Correct 16 ms 34132 KB Output is correct
21 Correct 15 ms 33748 KB Output is correct
22 Correct 15 ms 33840 KB Output is correct
23 Correct 14 ms 33620 KB Output is correct
24 Correct 14 ms 33620 KB Output is correct
25 Correct 16 ms 36300 KB Output is correct
26 Correct 17 ms 36308 KB Output is correct
27 Correct 17 ms 37588 KB Output is correct
28 Correct 17 ms 37588 KB Output is correct
29 Correct 15 ms 34276 KB Output is correct
30 Correct 15 ms 34344 KB Output is correct
31 Correct 16 ms 35156 KB Output is correct
32 Correct 19 ms 35064 KB Output is correct
33 Correct 16 ms 35148 KB Output is correct
34 Correct 16 ms 35040 KB Output is correct
35 Correct 16 ms 35796 KB Output is correct
36 Correct 21 ms 35812 KB Output is correct
37 Correct 18 ms 37460 KB Output is correct
38 Correct 17 ms 37588 KB Output is correct
39 Correct 15 ms 34316 KB Output is correct
40 Correct 15 ms 34260 KB Output is correct
41 Correct 16 ms 35116 KB Output is correct
42 Correct 16 ms 35072 KB Output is correct
43 Correct 16 ms 35616 KB Output is correct
44 Correct 21 ms 35660 KB Output is correct
45 Correct 17 ms 37100 KB Output is correct
46 Correct 18 ms 37332 KB Output is correct
47 Correct 15 ms 34300 KB Output is correct
48 Correct 15 ms 34260 KB Output is correct
49 Correct 16 ms 35160 KB Output is correct
50 Correct 16 ms 35156 KB Output is correct

Subtask #3
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 34388 KB Output is correct
2 Correct 16 ms 34388 KB Output is correct
3 Correct 15 ms 34280 KB Output is correct
4 Correct 15 ms 34228 KB Output is correct
5 Correct 15 ms 33876 KB Output is correct
6 Correct 14 ms 33808 KB Output is correct
7 Correct 14 ms 33620 KB Output is correct
8 Correct 17 ms 33620 KB Output is correct
9 Correct 15 ms 34268 KB Output is correct
10 Correct 15 ms 34312 KB Output is correct
11 Correct 14 ms 34260 KB Output is correct
12 Correct 14 ms 34160 KB Output is correct
13 Correct 16 ms 33808 KB Output is correct
14 Correct 15 ms 33856 KB Output is correct
15 Correct 15 ms 33544 KB Output is correct
16 Correct 14 ms 33652 KB Output is correct
17 Correct 15 ms 34200 KB Output is correct
18 Correct 15 ms 34260 KB Output is correct
19 Correct 15 ms 34132 KB Output is correct
20 Correct 16 ms 34132 KB Output is correct
21 Correct 15 ms 33748 KB Output is correct
22 Correct 15 ms 33840 KB Output is correct
23 Correct 14 ms 33620 KB Output is correct
24 Correct 14 ms 33620 KB Output is correct
25 Correct 66 ms 86312 KB Output is correct
26 Correct 67 ms 86244 KB Output is correct
27 Correct 78 ms 84712 KB Output is correct
28 Correct 77 ms 84540 KB Output is correct
29 Correct 43 ms 46920 KB Output is correct
30 Correct 43 ms 46924 KB Output is correct
31 Correct 16 ms 35656 KB Output is correct
32 Correct 17 ms 35692 KB Output is correct
33 Correct 17 ms 35752 KB Output is correct
34 Correct 17 ms 35632 KB Output is correct
35 Correct 71 ms 76960 KB Output is correct
36 Correct 71 ms 77260 KB Output is correct
37 Correct 80 ms 82996 KB Output is correct
38 Correct 80 ms 82620 KB Output is correct
39 Correct 44 ms 44976 KB Output is correct
40 Correct 44 ms 45012 KB Output is correct
41 Correct 18 ms 35504 KB Output is correct
42 Correct 17 ms 35440 KB Output is correct
43 Correct 69 ms 73732 KB Output is correct
44 Correct 67 ms 73848 KB Output is correct
45 Correct 78 ms 77500 KB Output is correct
46 Correct 79 ms 76620 KB Output is correct
47 Correct 44 ms 44108 KB Output is correct
48 Correct 45 ms 44348 KB Output is correct
49 Correct 17 ms 35796 KB Output is correct
50 Correct 18 ms 35284 KB Output is correct

Subtask #4
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 34388 KB Output is correct
2 Correct 16 ms 34388 KB Output is correct
3 Correct 15 ms 34280 KB Output is correct
4 Correct 15 ms 34228 KB Output is correct
5 Correct 15 ms 33876 KB Output is correct
6 Correct 14 ms 33808 KB Output is correct
7 Correct 14 ms 33620 KB Output is correct
8 Correct 17 ms 33620 KB Output is correct
9 Correct 15 ms 34268 KB Output is correct
10 Correct 15 ms 34312 KB Output is correct
11 Correct 14 ms 34260 KB Output is correct
12 Correct 14 ms 34160 KB Output is correct
13 Correct 16 ms 33808 KB Output is correct
14 Correct 15 ms 33856 KB Output is correct
15 Correct 15 ms 33544 KB Output is correct
16 Correct 14 ms 33652 KB Output is correct
17 Correct 15 ms 34200 KB Output is correct
18 Correct 15 ms 34260 KB Output is correct
19 Correct 15 ms 34132 KB Output is correct
20 Correct 16 ms 34132 KB Output is correct
21 Correct 15 ms 33748 KB Output is correct
22 Correct 15 ms 33840 KB Output is correct
23 Correct 14 ms 33620 KB Output is correct
24 Correct 14 ms 33620 KB Output is correct
25 Correct 66 ms 86312 KB Output is correct
26 Correct 67 ms 86244 KB Output is correct
27 Correct 78 ms 84712 KB Output is correct
28 Correct 77 ms 84540 KB Output is correct
29 Correct 43 ms 46920 KB Output is correct
30 Correct 43 ms 46924 KB Output is correct
31 Correct 16 ms 35656 KB Output is correct
32 Correct 17 ms 35692 KB Output is correct
33 Correct 17 ms 35752 KB Output is correct
34 Correct 17 ms 35632 KB Output is correct
35 Correct 71 ms 76960 KB Output is correct
36 Correct 71 ms 77260 KB Output is correct
37 Correct 80 ms 82996 KB Output is correct
38 Correct 80 ms 82620 KB Output is correct
39 Correct 44 ms 44976 KB Output is correct
40 Correct 44 ms 45012 KB Output is correct
41 Correct 18 ms 35504 KB Output is correct
42 Correct 17 ms 35440 KB Output is correct
43 Correct 69 ms 73732 KB Output is correct
44 Correct 67 ms 73848 KB Output is correct
45 Correct 78 ms 77500 KB Output is correct
46 Correct 79 ms 76620 KB Output is correct
47 Correct 44 ms 44108 KB Output is correct
48 Correct 45 ms 44348 KB Output is correct
49 Correct 17 ms 35796 KB Output is correct
50 Correct 18 ms 35284 KB Output is correct
51 Runtime error 254 ms 274760 KB Execution killed with signal 11
52 Halted 0 ms 0 KB -

Subtask #5
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 34388 KB Output is correct
2 Correct 16 ms 34388 KB Output is correct
3 Correct 15 ms 34280 KB Output is correct
4 Correct 15 ms 34228 KB Output is correct
5 Correct 15 ms 33876 KB Output is correct
6 Correct 14 ms 33808 KB Output is correct
7 Correct 14 ms 33620 KB Output is correct
8 Correct 17 ms 33620 KB Output is correct
9 Correct 15 ms 34268 KB Output is correct
10 Correct 15 ms 34312 KB Output is correct
11 Correct 14 ms 34260 KB Output is correct
12 Correct 14 ms 34160 KB Output is correct
13 Correct 16 ms 33808 KB Output is correct
14 Correct 15 ms 33856 KB Output is correct
15 Correct 15 ms 33544 KB Output is correct
16 Correct 14 ms 33652 KB Output is correct
17 Correct 15 ms 34200 KB Output is correct
18 Correct 15 ms 34260 KB Output is correct
19 Correct 15 ms 34132 KB Output is correct
20 Correct 16 ms 34132 KB Output is correct
21 Correct 15 ms 33748 KB Output is correct
22 Correct 15 ms 33840 KB Output is correct
23 Correct 14 ms 33620 KB Output is correct
24 Correct 14 ms 33620 KB Output is correct
25 Correct 16 ms 36300 KB Output is correct
26 Correct 17 ms 36308 KB Output is correct
27 Correct 17 ms 37588 KB Output is correct
28 Correct 17 ms 37588 KB Output is correct
29 Correct 15 ms 34276 KB Output is correct
30 Correct 15 ms 34344 KB Output is correct
31 Correct 16 ms 35156 KB Output is correct
32 Correct 19 ms 35064 KB Output is correct
33 Correct 16 ms 35148 KB Output is correct
34 Correct 16 ms 35040 KB Output is correct
35 Correct 16 ms 35796 KB Output is correct
36 Correct 21 ms 35812 KB Output is correct
37 Correct 18 ms 37460 KB Output is correct
38 Correct 17 ms 37588 KB Output is correct
39 Correct 15 ms 34316 KB Output is correct
40 Correct 15 ms 34260 KB Output is correct
41 Correct 16 ms 35116 KB Output is correct
42 Correct 16 ms 35072 KB Output is correct
43 Correct 16 ms 35616 KB Output is correct
44 Correct 21 ms 35660 KB Output is correct
45 Correct 17 ms 37100 KB Output is correct
46 Correct 18 ms 37332 KB Output is correct
47 Correct 15 ms 34300 KB Output is correct
48 Correct 15 ms 34260 KB Output is correct
49 Correct 16 ms 35160 KB Output is correct
50 Correct 16 ms 35156 KB Output is correct
51 Correct 66 ms 86312 KB Output is correct
52 Correct 67 ms 86244 KB Output is correct
53 Correct 78 ms 84712 KB Output is correct
54 Correct 77 ms 84540 KB Output is correct
55 Correct 43 ms 46920 KB Output is correct
56 Correct 43 ms 46924 KB Output is correct
57 Correct 16 ms 35656 KB Output is correct
58 Correct 17 ms 35692 KB Output is correct
59 Correct 17 ms 35752 KB Output is correct
60 Correct 17 ms 35632 KB Output is correct
61 Correct 71 ms 76960 KB Output is correct
62 Correct 71 ms 77260 KB Output is correct
63 Correct 80 ms 82996 KB Output is correct
64 Correct 80 ms 82620 KB Output is correct
65 Correct 44 ms 44976 KB Output is correct
66 Correct 44 ms 45012 KB Output is correct
67 Correct 18 ms 35504 KB Output is correct
68 Correct 17 ms 35440 KB Output is correct
69 Correct 69 ms 73732 KB Output is correct
70 Correct 67 ms 73848 KB Output is correct
71 Correct 78 ms 77500 KB Output is correct
72 Correct 79 ms 76620 KB Output is correct
73 Correct 44 ms 44108 KB Output is correct
74 Correct 45 ms 44348 KB Output is correct
75 Correct 17 ms 35796 KB Output is correct
76 Correct 18 ms 35284 KB Output is correct
77 Runtime error 254 ms 274760 KB Execution killed with signal 11
78 Halted 0 ms 0 KB -