oj.uz

답안 #891657

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
891657 2023-12-23T13:46:16 Z thunopro Sprinkler (JOI22_sprinkler) C++14
3 / 100
 4000 ms 56848 KB 
#include<bits/stdc++.h>
using namespace std ; 
#define maxn 400009 
#define ll long long 
#define fi first 
#define se second 
#define pb push_back 
#define left id<<1 
#define right id<<1|1
#define re exit(0);
#define _lower(v,x) lower_bound(v.begin(),v.end(),x)-v.begin()+1
 
int mod = 1e9+7 ; 
const int INF = 1e9 ;
const int LOG = 18 ; 
 
typedef vector<int> vi ; 
typedef pair<int,int> pii ; 
typedef vector<pii> vii ;
typedef vector<ll> vl ;  
typedef pair<ll,ll> pll ; 
typedef vector<pll> vll ; 
 
void add ( int&a , int b ) { if ((a+=b) > mod ) a -= mod ; } 
void sub ( int&a , int b ) { if ((a-=b) < 0 ) a += mod ; } 
template<typename T> void chkmin(T& x, T y) {if(x > y) x = y;}
template<typename T> void chkmax(T& x, T y) {if(x < y) x = y;}
 
void rf ( ) 
{
	freopen ("bai1.inp","r",stdin) ; 
//	freopen ("bai1.out","w",stdout) ;
}
 
int _pow ( int a , int n ) 
{
	if ( n == 0 ) return 1 ; 
	int res = _pow ( a , n / 2 ) ; 
	if ( n % 2 ) return ( 1ll * res * res % mod * a % mod ) ; 
	else return ( 1ll * res * res % mod ) ; 
}
 
int n ;
 
vi adjList [maxn] ;
int a [maxn] ; 
 
int nq ; 
struct shape {
	int op , x , d , w ; 
} q [maxn] ; 
 
bool vis [maxn] ; 
void update_near ( int u , int d , int w , int par = -1 ) 
{
	a [u] = 1ll*a[u]*w%mod ; 
	if ( d == 0 ) return ; 
	for ( auto v : adjList [u] ) 
	{
		if ( v != par ) update_near (v,d-1,w,u) ; 
	}
}
void sub1 () 
{
	for ( int rn = 1 ; rn <= nq ; rn ++ ) 
	{
		if ( q[rn].op == 1 ) 
		{
			int x = q [rn].x , d = q [rn].d , w = q [rn].w ; 
			update_near (x,d,w) ; 
		}
		else cout << a [q[rn].x] << "\n" ;  
	}
}
 
bool check_sub2 () 
{
	for ( int i = 1 ; i <= nq ; i ++ ) 
	{
		if ( q [i].op == 1 && q [i].d >= 2 ) return false ; 
	}
	return true ; 
}
 
 
vi vex [maxn] ; 
int special [maxn] ;
int lazy_val [maxn] ; 
int sp [maxn] ; 
 
void sub2 () 
{
	for ( int i = 1 ; i <= n ; i ++ ) lazy_val [i] = 1 ; 
	int num = 0 ; 
	for ( int i = 1 ; i <= n ; i ++ ) 
	{
		if ( adjList [i].size () > 500 )  
		{
			special [i] = true ; 
		}
	}
	for ( int i = 1 ; i <= n ; i ++ ) 
	{
		if ( special [i] == false ) 
		{
			for ( auto x : adjList [i] ) 
			{
				if ( special [x] == true ) vex [i] . pb (x) ; 
			}
		}
	}
	for ( int rn = 1 ; rn <= nq ; rn ++ ) 
	{
		if ( q[rn].op == 1 ) 
		{
			int x = q [rn].x , d = q [rn].d , w = q [rn].w ; 
			if ( d == 0 ) 
			{
				a [x] = 1ll*a[x]*w%mod ; 
				continue ; 
			}
			if ( special [x] == false ) update_near (x,d,w) ;
			else lazy_val [x] = 1ll*lazy_val[x]*w%mod ; 	
		}
		else 
		{
			int x = q [rn].x ; 
			int res = 1ll*a[x]*lazy_val[x]%mod ; 
			for ( auto v : vex [x] ) res = 1ll*res*lazy_val[v]%mod ; 
			cout << res << "\n" ; 
		}
	}
}
int main ( ) 
{
	ios_base :: sync_with_stdio (0) ; 
	cin.tie(0) ; cout.tie(0) ;
//	rf () ; 
	cin >> n >> mod ; 
	for ( int i = 1 ; i < n ; i ++ ) 
	{
		int u , v ; cin >> u >> v ; 
		adjList [u] . pb (v) ; 
		adjList [v] . pb (u) ; 
	}
	
	for ( int i = 1 ; i <= n ; i ++ ) cin >> a [i] ; 
	
	cin >> nq ; 
	for ( int i = 1 ; i <= nq ; i ++ ) 
	{
		cin >> q [i].op ; 
		if ( q[i].op == 1 ) 
		{
			cin >> q[i].x >> q[i].d >> q[i].w ; 
		}
		else cin >> q[i].x ; 
	}
 
	if ( n <= 1000 && nq <= 1000 ) sub1 () ; 
	else sub2 () ; 
}
 
 
 
 
//-std=c++11

Compilation message

sprinkler.cpp: In function 'void sub2()':
sprinkler.cpp:94:6: warning: unused variable 'num' [-Wunused-variable]
   94 |  int num = 0 ;
      |      ^~~
sprinkler.cpp: In function 'void rf()':
sprinkler.cpp:31:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   31 |  freopen ("bai1.inp","r",stdin) ;
      |  ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 21592 KB Output is correct
2 Correct 4 ms 21592 KB Output is correct
3 Correct 6 ms 21596 KB Output is correct
4 Correct 5 ms 21696 KB Output is correct
5 Correct 6 ms 21596 KB Output is correct
6 Correct 8 ms 21592 KB Output is correct
7 Correct 9 ms 21756 KB Output is correct
8 Correct 9 ms 21596 KB Output is correct
9 Correct 5 ms 21596 KB Output is correct
10 Correct 5 ms 21596 KB Output is correct
11 Correct 5 ms 21732 KB Output is correct
12 Correct 5 ms 21592 KB Output is correct
13 Correct 5 ms 21596 KB Output is correct
14 Correct 5 ms 21596 KB Output is correct
15 Correct 5 ms 21596 KB Output is correct
16 Correct 5 ms 21596 KB Output is correct
17 Correct 5 ms 21592 KB Output is correct
18 Correct 5 ms 21592 KB Output is correct
19 Correct 5 ms 21596 KB Output is correct
20 Correct 5 ms 21596 KB Output is correct
21 Correct 5 ms 21592 KB Output is correct
22 Correct 5 ms 21596 KB Output is correct
23 Correct 5 ms 21728 KB Output is correct
24 Correct 4 ms 21592 KB Output is correct
25 Correct 5 ms 21592 KB Output is correct
26 Correct 5 ms 21500 KB Output is correct
27 Correct 6 ms 21596 KB Output is correct
28 Correct 5 ms 21596 KB Output is correct

Subtask #2
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 21592 KB Output is correct
2 Correct 169 ms 41624 KB Output is correct
3 Correct 186 ms 38624 KB Output is correct
4 Correct 192 ms 40016 KB Output is correct
5 Correct 184 ms 40140 KB Output is correct
6 Correct 196 ms 40188 KB Output is correct
7 Correct 201 ms 40528 KB Output is correct
8 Correct 218 ms 47192 KB Output is correct
9 Correct 166 ms 49748 KB Output is correct
10 Correct 241 ms 50616 KB Output is correct
11 Correct 201 ms 49984 KB Output is correct
12 Correct 253 ms 50532 KB Output is correct
13 Correct 191 ms 56412 KB Output is correct
14 Correct 185 ms 56848 KB Output is correct
15 Incorrect 209 ms 56588 KB Output isn't correct
16 Halted 0 ms 0 KB -

Subtask #3
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 21592 KB Output is correct
2 Correct 169 ms 41624 KB Output is correct
3 Correct 186 ms 38624 KB Output is correct
4 Correct 192 ms 40016 KB Output is correct
5 Correct 184 ms 40140 KB Output is correct
6 Correct 196 ms 40188 KB Output is correct
7 Correct 201 ms 40528 KB Output is correct
8 Correct 218 ms 47192 KB Output is correct
9 Correct 166 ms 49748 KB Output is correct
10 Correct 241 ms 50616 KB Output is correct
11 Correct 201 ms 49984 KB Output is correct
12 Correct 253 ms 50532 KB Output is correct
13 Correct 191 ms 56412 KB Output is correct
14 Correct 185 ms 56848 KB Output is correct
15 Incorrect 209 ms 56588 KB Output isn't correct
16 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 21596 KB Output is correct
2 Correct 394 ms 39024 KB Output is correct
3 Correct 1667 ms 38544 KB Output is correct
4 Correct 794 ms 38504 KB Output is correct
5 Correct 3087 ms 38732 KB Output is correct
6 Execution timed out 4017 ms 38444 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 21596 KB Output is correct
2 Correct 373 ms 41908 KB Output is correct
3 Correct 1389 ms 38728 KB Output is correct
4 Correct 520 ms 40016 KB Output is correct
5 Correct 2374 ms 40412 KB Output is correct
6 Execution timed out 4038 ms 38528 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 21592 KB Output is correct
2 Correct 4 ms 21592 KB Output is correct
3 Correct 6 ms 21596 KB Output is correct
4 Correct 5 ms 21696 KB Output is correct
5 Correct 6 ms 21596 KB Output is correct
6 Correct 8 ms 21592 KB Output is correct
7 Correct 9 ms 21756 KB Output is correct
8 Correct 9 ms 21596 KB Output is correct
9 Correct 5 ms 21596 KB Output is correct
10 Correct 5 ms 21596 KB Output is correct
11 Correct 5 ms 21732 KB Output is correct
12 Correct 5 ms 21592 KB Output is correct
13 Correct 5 ms 21596 KB Output is correct
14 Correct 5 ms 21596 KB Output is correct
15 Correct 5 ms 21596 KB Output is correct
16 Correct 5 ms 21596 KB Output is correct
17 Correct 5 ms 21592 KB Output is correct
18 Correct 5 ms 21592 KB Output is correct
19 Correct 5 ms 21596 KB Output is correct
20 Correct 5 ms 21596 KB Output is correct
21 Correct 5 ms 21592 KB Output is correct
22 Correct 5 ms 21596 KB Output is correct
23 Correct 5 ms 21728 KB Output is correct
24 Correct 4 ms 21592 KB Output is correct
25 Correct 5 ms 21592 KB Output is correct
26 Correct 5 ms 21500 KB Output is correct
27 Correct 6 ms 21596 KB Output is correct
28 Correct 5 ms 21596 KB Output is correct
29 Correct 5 ms 21592 KB Output is correct
30 Correct 169 ms 41624 KB Output is correct
31 Correct 186 ms 38624 KB Output is correct
32 Correct 192 ms 40016 KB Output is correct
33 Correct 184 ms 40140 KB Output is correct
34 Correct 196 ms 40188 KB Output is correct
35 Correct 201 ms 40528 KB Output is correct
36 Correct 218 ms 47192 KB Output is correct
37 Correct 166 ms 49748 KB Output is correct
38 Correct 241 ms 50616 KB Output is correct
39 Correct 201 ms 49984 KB Output is correct
40 Correct 253 ms 50532 KB Output is correct
41 Correct 191 ms 56412 KB Output is correct
42 Correct 185 ms 56848 KB Output is correct
43 Incorrect 209 ms 56588 KB Output isn't correct
44 Halted 0 ms 0 KB -