oj.uz

Submission #761360

# Submission time Handle Problem Language Result Execution time Memory
761360 2023-06-19T14:33:58 Z Dan4Life Vinjete (COI22_vinjete) C++17
24 / 100
 121 ms 141644 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;

int n, mx, IND = 1;
int segTree[mxN*40], lazy[mxN*40];
vector<pair<int,pair<int,int>>> adj[mxN];
int ans[mxN], root[mxN], L[mxN*40], R[mxN*40];

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 9 ms 19156 KB Output is correct
2 Correct 9 ms 19156 KB Output is correct
3 Correct 9 ms 19084 KB Output is correct
4 Correct 11 ms 18956 KB Output is correct
5 Correct 8 ms 18596 KB Output is correct
6 Correct 8 ms 18624 KB Output is correct
7 Correct 7 ms 18388 KB Output is correct
8 Correct 8 ms 18332 KB Output is correct
9 Correct 9 ms 19028 KB Output is correct
10 Correct 9 ms 19028 KB Output is correct
11 Correct 9 ms 18900 KB Output is correct
12 Correct 9 ms 18900 KB Output is correct
13 Correct 9 ms 18516 KB Output is correct
14 Correct 9 ms 18516 KB Output is correct
15 Correct 8 ms 18260 KB Output is correct
16 Correct 8 ms 18388 KB Output is correct
17 Correct 8 ms 19008 KB Output is correct
18 Correct 9 ms 18908 KB Output is correct
19 Correct 9 ms 18900 KB Output is correct
20 Correct 9 ms 18840 KB Output is correct
21 Correct 8 ms 18516 KB Output is correct
22 Correct 8 ms 18516 KB Output is correct
23 Correct 8 ms 18260 KB Output is correct
24 Correct 8 ms 18260 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 19156 KB Output is correct
2 Correct 9 ms 19156 KB Output is correct
3 Correct 9 ms 19084 KB Output is correct
4 Correct 11 ms 18956 KB Output is correct
5 Correct 8 ms 18596 KB Output is correct
6 Correct 8 ms 18624 KB Output is correct
7 Correct 7 ms 18388 KB Output is correct
8 Correct 8 ms 18332 KB Output is correct
9 Correct 9 ms 19028 KB Output is correct
10 Correct 9 ms 19028 KB Output is correct
11 Correct 9 ms 18900 KB Output is correct
12 Correct 9 ms 18900 KB Output is correct
13 Correct 9 ms 18516 KB Output is correct
14 Correct 9 ms 18516 KB Output is correct
15 Correct 8 ms 18260 KB Output is correct
16 Correct 8 ms 18388 KB Output is correct
17 Correct 8 ms 19008 KB Output is correct
18 Correct 9 ms 18908 KB Output is correct
19 Correct 9 ms 18900 KB Output is correct
20 Correct 9 ms 18840 KB Output is correct
21 Correct 8 ms 18516 KB Output is correct
22 Correct 8 ms 18516 KB Output is correct
23 Correct 8 ms 18260 KB Output is correct
24 Correct 8 ms 18260 KB Output is correct
25 Correct 10 ms 20948 KB Output is correct
26 Correct 10 ms 20948 KB Output is correct
27 Correct 12 ms 22356 KB Output is correct
28 Correct 11 ms 22316 KB Output is correct
29 Correct 8 ms 19028 KB Output is correct
30 Correct 9 ms 19048 KB Output is correct
31 Correct 10 ms 19880 KB Output is correct
32 Correct 9 ms 19796 KB Output is correct
33 Correct 9 ms 19796 KB Output is correct
34 Correct 10 ms 19776 KB Output is correct
35 Correct 10 ms 20564 KB Output is correct
36 Correct 12 ms 20564 KB Output is correct
37 Correct 11 ms 22188 KB Output is correct
38 Correct 12 ms 22260 KB Output is correct
39 Correct 11 ms 19028 KB Output is correct
40 Correct 9 ms 19028 KB Output is correct
41 Correct 10 ms 19796 KB Output is correct
42 Correct 10 ms 19796 KB Output is correct
43 Correct 10 ms 20368 KB Output is correct
44 Correct 10 ms 20308 KB Output is correct
45 Correct 11 ms 21844 KB Output is correct
46 Correct 11 ms 22048 KB Output is correct
47 Correct 9 ms 18920 KB Output is correct
48 Correct 9 ms 18984 KB Output is correct
49 Correct 11 ms 19796 KB Output is correct
50 Correct 11 ms 19800 KB Output is correct

Subtask #3
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 19156 KB Output is correct
2 Correct 9 ms 19156 KB Output is correct
3 Correct 9 ms 19084 KB Output is correct
4 Correct 11 ms 18956 KB Output is correct
5 Correct 8 ms 18596 KB Output is correct
6 Correct 8 ms 18624 KB Output is correct
7 Correct 7 ms 18388 KB Output is correct
8 Correct 8 ms 18332 KB Output is correct
9 Correct 9 ms 19028 KB Output is correct
10 Correct 9 ms 19028 KB Output is correct
11 Correct 9 ms 18900 KB Output is correct
12 Correct 9 ms 18900 KB Output is correct
13 Correct 9 ms 18516 KB Output is correct
14 Correct 9 ms 18516 KB Output is correct
15 Correct 8 ms 18260 KB Output is correct
16 Correct 8 ms 18388 KB Output is correct
17 Correct 8 ms 19008 KB Output is correct
18 Correct 9 ms 18908 KB Output is correct
19 Correct 9 ms 18900 KB Output is correct
20 Correct 9 ms 18840 KB Output is correct
21 Correct 8 ms 18516 KB Output is correct
22 Correct 8 ms 18516 KB Output is correct
23 Correct 8 ms 18260 KB Output is correct
24 Correct 8 ms 18260 KB Output is correct
25 Runtime error 121 ms 141644 KB Execution killed with signal 11
26 Halted 0 ms 0 KB -

Subtask #4
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 19156 KB Output is correct
2 Correct 9 ms 19156 KB Output is correct
3 Correct 9 ms 19084 KB Output is correct
4 Correct 11 ms 18956 KB Output is correct
5 Correct 8 ms 18596 KB Output is correct
6 Correct 8 ms 18624 KB Output is correct
7 Correct 7 ms 18388 KB Output is correct
8 Correct 8 ms 18332 KB Output is correct
9 Correct 9 ms 19028 KB Output is correct
10 Correct 9 ms 19028 KB Output is correct
11 Correct 9 ms 18900 KB Output is correct
12 Correct 9 ms 18900 KB Output is correct
13 Correct 9 ms 18516 KB Output is correct
14 Correct 9 ms 18516 KB Output is correct
15 Correct 8 ms 18260 KB Output is correct
16 Correct 8 ms 18388 KB Output is correct
17 Correct 8 ms 19008 KB Output is correct
18 Correct 9 ms 18908 KB Output is correct
19 Correct 9 ms 18900 KB Output is correct
20 Correct 9 ms 18840 KB Output is correct
21 Correct 8 ms 18516 KB Output is correct
22 Correct 8 ms 18516 KB Output is correct
23 Correct 8 ms 18260 KB Output is correct
24 Correct 8 ms 18260 KB Output is correct
25 Runtime error 121 ms 141644 KB Execution killed with signal 11
26 Halted 0 ms 0 KB -

Subtask #5
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 19156 KB Output is correct
2 Correct 9 ms 19156 KB Output is correct
3 Correct 9 ms 19084 KB Output is correct
4 Correct 11 ms 18956 KB Output is correct
5 Correct 8 ms 18596 KB Output is correct
6 Correct 8 ms 18624 KB Output is correct
7 Correct 7 ms 18388 KB Output is correct
8 Correct 8 ms 18332 KB Output is correct
9 Correct 9 ms 19028 KB Output is correct
10 Correct 9 ms 19028 KB Output is correct
11 Correct 9 ms 18900 KB Output is correct
12 Correct 9 ms 18900 KB Output is correct
13 Correct 9 ms 18516 KB Output is correct
14 Correct 9 ms 18516 KB Output is correct
15 Correct 8 ms 18260 KB Output is correct
16 Correct 8 ms 18388 KB Output is correct
17 Correct 8 ms 19008 KB Output is correct
18 Correct 9 ms 18908 KB Output is correct
19 Correct 9 ms 18900 KB Output is correct
20 Correct 9 ms 18840 KB Output is correct
21 Correct 8 ms 18516 KB Output is correct
22 Correct 8 ms 18516 KB Output is correct
23 Correct 8 ms 18260 KB Output is correct
24 Correct 8 ms 18260 KB Output is correct
25 Correct 10 ms 20948 KB Output is correct
26 Correct 10 ms 20948 KB Output is correct
27 Correct 12 ms 22356 KB Output is correct
28 Correct 11 ms 22316 KB Output is correct
29 Correct 8 ms 19028 KB Output is correct
30 Correct 9 ms 19048 KB Output is correct
31 Correct 10 ms 19880 KB Output is correct
32 Correct 9 ms 19796 KB Output is correct
33 Correct 9 ms 19796 KB Output is correct
34 Correct 10 ms 19776 KB Output is correct
35 Correct 10 ms 20564 KB Output is correct
36 Correct 12 ms 20564 KB Output is correct
37 Correct 11 ms 22188 KB Output is correct
38 Correct 12 ms 22260 KB Output is correct
39 Correct 11 ms 19028 KB Output is correct
40 Correct 9 ms 19028 KB Output is correct
41 Correct 10 ms 19796 KB Output is correct
42 Correct 10 ms 19796 KB Output is correct
43 Correct 10 ms 20368 KB Output is correct
44 Correct 10 ms 20308 KB Output is correct
45 Correct 11 ms 21844 KB Output is correct
46 Correct 11 ms 22048 KB Output is correct
47 Correct 9 ms 18920 KB Output is correct
48 Correct 9 ms 18984 KB Output is correct
49 Correct 11 ms 19796 KB Output is correct
50 Correct 11 ms 19800 KB Output is correct
51 Runtime error 121 ms 141644 KB Execution killed with signal 11
52 Halted 0 ms 0 KB -