oj.uz

Submission #761364

# Submission time Handle Problem Language Result Execution time Memory
761364 2023-06-19T14:36:05 Z Dan4Life Vinjete (COI22_vinjete) C++17
69 / 100
 397 ms 499804 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 = 150;
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], 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

# Verdict Execution time Memory Grader output
1 Correct 27 ms 62164 KB Output is correct
2 Correct 22 ms 62176 KB Output is correct
3 Correct 27 ms 62036 KB Output is correct
4 Correct 23 ms 62028 KB Output is correct
5 Correct 27 ms 61660 KB Output is correct
6 Correct 23 ms 61624 KB Output is correct
7 Correct 26 ms 61372 KB Output is correct
8 Correct 22 ms 61396 KB Output is correct
9 Correct 23 ms 62004 KB Output is correct
10 Correct 23 ms 62112 KB Output is correct
11 Correct 24 ms 61952 KB Output is correct
12 Correct 23 ms 61916 KB Output is correct
13 Correct 23 ms 61568 KB Output is correct
14 Correct 22 ms 61524 KB Output is correct
15 Correct 22 ms 61396 KB Output is correct
16 Correct 22 ms 61424 KB Output is correct
17 Correct 23 ms 62068 KB Output is correct
18 Correct 24 ms 61956 KB Output is correct
19 Correct 24 ms 61960 KB Output is correct
20 Correct 22 ms 61908 KB Output is correct
21 Correct 22 ms 61616 KB Output is correct
22 Correct 23 ms 61620 KB Output is correct
23 Correct 22 ms 61348 KB Output is correct
24 Correct 22 ms 61336 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 62164 KB Output is correct
2 Correct 22 ms 62176 KB Output is correct
3 Correct 27 ms 62036 KB Output is correct
4 Correct 23 ms 62028 KB Output is correct
5 Correct 27 ms 61660 KB Output is correct
6 Correct 23 ms 61624 KB Output is correct
7 Correct 26 ms 61372 KB Output is correct
8 Correct 22 ms 61396 KB Output is correct
9 Correct 23 ms 62004 KB Output is correct
10 Correct 23 ms 62112 KB Output is correct
11 Correct 24 ms 61952 KB Output is correct
12 Correct 23 ms 61916 KB Output is correct
13 Correct 23 ms 61568 KB Output is correct
14 Correct 22 ms 61524 KB Output is correct
15 Correct 22 ms 61396 KB Output is correct
16 Correct 22 ms 61424 KB Output is correct
17 Correct 23 ms 62068 KB Output is correct
18 Correct 24 ms 61956 KB Output is correct
19 Correct 24 ms 61960 KB Output is correct
20 Correct 22 ms 61908 KB Output is correct
21 Correct 22 ms 61616 KB Output is correct
22 Correct 23 ms 61620 KB Output is correct
23 Correct 22 ms 61348 KB Output is correct
24 Correct 22 ms 61336 KB Output is correct
25 Correct 25 ms 64084 KB Output is correct
26 Correct 24 ms 64076 KB Output is correct
27 Correct 25 ms 65340 KB Output is correct
28 Correct 25 ms 65388 KB Output is correct
29 Correct 28 ms 62140 KB Output is correct
30 Correct 29 ms 62108 KB Output is correct
31 Correct 25 ms 62860 KB Output is correct
32 Correct 23 ms 62932 KB Output is correct
33 Correct 23 ms 62868 KB Output is correct
34 Correct 24 ms 62916 KB Output is correct
35 Correct 25 ms 63484 KB Output is correct
36 Correct 24 ms 63636 KB Output is correct
37 Correct 32 ms 65292 KB Output is correct
38 Correct 26 ms 65328 KB Output is correct
39 Correct 24 ms 62100 KB Output is correct
40 Correct 22 ms 62076 KB Output is correct
41 Correct 24 ms 62800 KB Output is correct
42 Correct 24 ms 62884 KB Output is correct
43 Correct 30 ms 63328 KB Output is correct
44 Correct 29 ms 63468 KB Output is correct
45 Correct 27 ms 64944 KB Output is correct
46 Correct 27 ms 65116 KB Output is correct
47 Correct 23 ms 62036 KB Output is correct
48 Correct 24 ms 61988 KB Output is correct
49 Correct 24 ms 62856 KB Output is correct
50 Correct 24 ms 62900 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 62164 KB Output is correct
2 Correct 22 ms 62176 KB Output is correct
3 Correct 27 ms 62036 KB Output is correct
4 Correct 23 ms 62028 KB Output is correct
5 Correct 27 ms 61660 KB Output is correct
6 Correct 23 ms 61624 KB Output is correct
7 Correct 26 ms 61372 KB Output is correct
8 Correct 22 ms 61396 KB Output is correct
9 Correct 23 ms 62004 KB Output is correct
10 Correct 23 ms 62112 KB Output is correct
11 Correct 24 ms 61952 KB Output is correct
12 Correct 23 ms 61916 KB Output is correct
13 Correct 23 ms 61568 KB Output is correct
14 Correct 22 ms 61524 KB Output is correct
15 Correct 22 ms 61396 KB Output is correct
16 Correct 22 ms 61424 KB Output is correct
17 Correct 23 ms 62068 KB Output is correct
18 Correct 24 ms 61956 KB Output is correct
19 Correct 24 ms 61960 KB Output is correct
20 Correct 22 ms 61908 KB Output is correct
21 Correct 22 ms 61616 KB Output is correct
22 Correct 23 ms 61620 KB Output is correct
23 Correct 22 ms 61348 KB Output is correct
24 Correct 22 ms 61336 KB Output is correct
25 Correct 80 ms 114120 KB Output is correct
26 Correct 74 ms 114124 KB Output is correct
27 Correct 82 ms 112516 KB Output is correct
28 Correct 82 ms 112404 KB Output is correct
29 Correct 54 ms 74700 KB Output is correct
30 Correct 50 ms 74660 KB Output is correct
31 Correct 30 ms 63444 KB Output is correct
32 Correct 26 ms 63464 KB Output is correct
33 Correct 28 ms 63536 KB Output is correct
34 Correct 27 ms 63472 KB Output is correct
35 Correct 84 ms 104716 KB Output is correct
36 Correct 88 ms 104968 KB Output is correct
37 Correct 103 ms 110792 KB Output is correct
38 Correct 94 ms 110484 KB Output is correct
39 Correct 55 ms 72676 KB Output is correct
40 Correct 55 ms 72784 KB Output is correct
41 Correct 28 ms 63316 KB Output is correct
42 Correct 28 ms 63200 KB Output is correct
43 Correct 75 ms 101428 KB Output is correct
44 Correct 88 ms 101672 KB Output is correct
45 Correct 87 ms 105264 KB Output is correct
46 Correct 86 ms 104368 KB Output is correct
47 Correct 56 ms 71992 KB Output is correct
48 Correct 56 ms 72080 KB Output is correct
49 Correct 29 ms 63532 KB Output is correct
50 Correct 34 ms 63260 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 62164 KB Output is correct
2 Correct 22 ms 62176 KB Output is correct
3 Correct 27 ms 62036 KB Output is correct
4 Correct 23 ms 62028 KB Output is correct
5 Correct 27 ms 61660 KB Output is correct
6 Correct 23 ms 61624 KB Output is correct
7 Correct 26 ms 61372 KB Output is correct
8 Correct 22 ms 61396 KB Output is correct
9 Correct 23 ms 62004 KB Output is correct
10 Correct 23 ms 62112 KB Output is correct
11 Correct 24 ms 61952 KB Output is correct
12 Correct 23 ms 61916 KB Output is correct
13 Correct 23 ms 61568 KB Output is correct
14 Correct 22 ms 61524 KB Output is correct
15 Correct 22 ms 61396 KB Output is correct
16 Correct 22 ms 61424 KB Output is correct
17 Correct 23 ms 62068 KB Output is correct
18 Correct 24 ms 61956 KB Output is correct
19 Correct 24 ms 61960 KB Output is correct
20 Correct 22 ms 61908 KB Output is correct
21 Correct 22 ms 61616 KB Output is correct
22 Correct 23 ms 61620 KB Output is correct
23 Correct 22 ms 61348 KB Output is correct
24 Correct 22 ms 61336 KB Output is correct
25 Correct 80 ms 114120 KB Output is correct
26 Correct 74 ms 114124 KB Output is correct
27 Correct 82 ms 112516 KB Output is correct
28 Correct 82 ms 112404 KB Output is correct
29 Correct 54 ms 74700 KB Output is correct
30 Correct 50 ms 74660 KB Output is correct
31 Correct 30 ms 63444 KB Output is correct
32 Correct 26 ms 63464 KB Output is correct
33 Correct 28 ms 63536 KB Output is correct
34 Correct 27 ms 63472 KB Output is correct
35 Correct 84 ms 104716 KB Output is correct
36 Correct 88 ms 104968 KB Output is correct
37 Correct 103 ms 110792 KB Output is correct
38 Correct 94 ms 110484 KB Output is correct
39 Correct 55 ms 72676 KB Output is correct
40 Correct 55 ms 72784 KB Output is correct
41 Correct 28 ms 63316 KB Output is correct
42 Correct 28 ms 63200 KB Output is correct
43 Correct 75 ms 101428 KB Output is correct
44 Correct 88 ms 101672 KB Output is correct
45 Correct 87 ms 105264 KB Output is correct
46 Correct 86 ms 104368 KB Output is correct
47 Correct 56 ms 71992 KB Output is correct
48 Correct 56 ms 72080 KB Output is correct
49 Correct 29 ms 63532 KB Output is correct
50 Correct 34 ms 63260 KB Output is correct
51 Correct 161 ms 204176 KB Output is correct
52 Correct 158 ms 204148 KB Output is correct
53 Correct 283 ms 202772 KB Output is correct
54 Correct 204 ms 202740 KB Output is correct
55 Correct 126 ms 96324 KB Output is correct
56 Correct 110 ms 96244 KB Output is correct
57 Correct 39 ms 69732 KB Output is correct
58 Correct 39 ms 69708 KB Output is correct
59 Correct 38 ms 69628 KB Output is correct
60 Correct 48 ms 69732 KB Output is correct
61 Correct 178 ms 178884 KB Output is correct
62 Correct 181 ms 179036 KB Output is correct
63 Correct 217 ms 197820 KB Output is correct
64 Correct 221 ms 196992 KB Output is correct
65 Correct 119 ms 91980 KB Output is correct
66 Correct 120 ms 91768 KB Output is correct
67 Correct 40 ms 68812 KB Output is correct
68 Correct 40 ms 68700 KB Output is correct
69 Correct 173 ms 170036 KB Output is correct
70 Correct 171 ms 170068 KB Output is correct
71 Correct 225 ms 186736 KB Output is correct
72 Correct 227 ms 185736 KB Output is correct
73 Correct 132 ms 89952 KB Output is correct
74 Correct 140 ms 89744 KB Output is correct
75 Correct 41 ms 68456 KB Output is correct
76 Correct 41 ms 69320 KB Output is correct

Subtask #5
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 27 ms 62164 KB Output is correct
2 Correct 22 ms 62176 KB Output is correct
3 Correct 27 ms 62036 KB Output is correct
4 Correct 23 ms 62028 KB Output is correct
5 Correct 27 ms 61660 KB Output is correct
6 Correct 23 ms 61624 KB Output is correct
7 Correct 26 ms 61372 KB Output is correct
8 Correct 22 ms 61396 KB Output is correct
9 Correct 23 ms 62004 KB Output is correct
10 Correct 23 ms 62112 KB Output is correct
11 Correct 24 ms 61952 KB Output is correct
12 Correct 23 ms 61916 KB Output is correct
13 Correct 23 ms 61568 KB Output is correct
14 Correct 22 ms 61524 KB Output is correct
15 Correct 22 ms 61396 KB Output is correct
16 Correct 22 ms 61424 KB Output is correct
17 Correct 23 ms 62068 KB Output is correct
18 Correct 24 ms 61956 KB Output is correct
19 Correct 24 ms 61960 KB Output is correct
20 Correct 22 ms 61908 KB Output is correct
21 Correct 22 ms 61616 KB Output is correct
22 Correct 23 ms 61620 KB Output is correct
23 Correct 22 ms 61348 KB Output is correct
24 Correct 22 ms 61336 KB Output is correct
25 Correct 25 ms 64084 KB Output is correct
26 Correct 24 ms 64076 KB Output is correct
27 Correct 25 ms 65340 KB Output is correct
28 Correct 25 ms 65388 KB Output is correct
29 Correct 28 ms 62140 KB Output is correct
30 Correct 29 ms 62108 KB Output is correct
31 Correct 25 ms 62860 KB Output is correct
32 Correct 23 ms 62932 KB Output is correct
33 Correct 23 ms 62868 KB Output is correct
34 Correct 24 ms 62916 KB Output is correct
35 Correct 25 ms 63484 KB Output is correct
36 Correct 24 ms 63636 KB Output is correct
37 Correct 32 ms 65292 KB Output is correct
38 Correct 26 ms 65328 KB Output is correct
39 Correct 24 ms 62100 KB Output is correct
40 Correct 22 ms 62076 KB Output is correct
41 Correct 24 ms 62800 KB Output is correct
42 Correct 24 ms 62884 KB Output is correct
43 Correct 30 ms 63328 KB Output is correct
44 Correct 29 ms 63468 KB Output is correct
45 Correct 27 ms 64944 KB Output is correct
46 Correct 27 ms 65116 KB Output is correct
47 Correct 23 ms 62036 KB Output is correct
48 Correct 24 ms 61988 KB Output is correct
49 Correct 24 ms 62856 KB Output is correct
50 Correct 24 ms 62900 KB Output is correct
51 Correct 80 ms 114120 KB Output is correct
52 Correct 74 ms 114124 KB Output is correct
53 Correct 82 ms 112516 KB Output is correct
54 Correct 82 ms 112404 KB Output is correct
55 Correct 54 ms 74700 KB Output is correct
56 Correct 50 ms 74660 KB Output is correct
57 Correct 30 ms 63444 KB Output is correct
58 Correct 26 ms 63464 KB Output is correct
59 Correct 28 ms 63536 KB Output is correct
60 Correct 27 ms 63472 KB Output is correct
61 Correct 84 ms 104716 KB Output is correct
62 Correct 88 ms 104968 KB Output is correct
63 Correct 103 ms 110792 KB Output is correct
64 Correct 94 ms 110484 KB Output is correct
65 Correct 55 ms 72676 KB Output is correct
66 Correct 55 ms 72784 KB Output is correct
67 Correct 28 ms 63316 KB Output is correct
68 Correct 28 ms 63200 KB Output is correct
69 Correct 75 ms 101428 KB Output is correct
70 Correct 88 ms 101672 KB Output is correct
71 Correct 87 ms 105264 KB Output is correct
72 Correct 86 ms 104368 KB Output is correct
73 Correct 56 ms 71992 KB Output is correct
74 Correct 56 ms 72080 KB Output is correct
75 Correct 29 ms 63532 KB Output is correct
76 Correct 34 ms 63260 KB Output is correct
77 Correct 161 ms 204176 KB Output is correct
78 Correct 158 ms 204148 KB Output is correct
79 Correct 283 ms 202772 KB Output is correct
80 Correct 204 ms 202740 KB Output is correct
81 Correct 126 ms 96324 KB Output is correct
82 Correct 110 ms 96244 KB Output is correct
83 Correct 39 ms 69732 KB Output is correct
84 Correct 39 ms 69708 KB Output is correct
85 Correct 38 ms 69628 KB Output is correct
86 Correct 48 ms 69732 KB Output is correct
87 Correct 178 ms 178884 KB Output is correct
88 Correct 181 ms 179036 KB Output is correct
89 Correct 217 ms 197820 KB Output is correct
90 Correct 221 ms 196992 KB Output is correct
91 Correct 119 ms 91980 KB Output is correct
92 Correct 120 ms 91768 KB Output is correct
93 Correct 40 ms 68812 KB Output is correct
94 Correct 40 ms 68700 KB Output is correct
95 Correct 173 ms 170036 KB Output is correct
96 Correct 171 ms 170068 KB Output is correct
97 Correct 225 ms 186736 KB Output is correct
98 Correct 227 ms 185736 KB Output is correct
99 Correct 132 ms 89952 KB Output is correct
100 Correct 140 ms 89744 KB Output is correct
101 Correct 41 ms 68456 KB Output is correct
102 Correct 41 ms 69320 KB Output is correct
103 Runtime error 397 ms 499804 KB Execution killed with signal 11
104 Halted 0 ms 0 KB -