oj.uz

답안 #888102

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
888102 2023-12-16T03:24:39 Z thunopro Two Currencies (JOI23_currencies) C++14
100 / 100
 522 ms 94972 KB 
#include<bits/stdc++.h>
using namespace std ; 
#define maxn 200009 
#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

const 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 , m , nq ; 
vi point [maxn] ; 
pii E [maxn] ;  
vi adjList [maxn] ; 

int fac [maxn] ; 
void mapping () 
{
	vi v ; 
	map <int,int> mp ; 
	for ( int i = 2 ; i <= n ; i ++ ) for ( auto x : point [i] ) v . pb (x) ; 
	sort (v.begin(),v.end()) ; 
	for ( int i = 2 ; i <= n ; i ++ ) 
	{
		for ( auto &x : point [i] ) 
		{
			int _x = _lower(v,x) + mp [_lower(v,x)] ; mp [_lower(v,x)] ++ ;  
			fac [_x] = x ; 
			x = _x ; 
		}
	}
}

int dep [maxn] ; 
int num_gold [maxn] ; 
int par [maxn][20] ; 

void dfs ( int u = 1 )
{
	for ( auto v : adjList [u] ) 
	{
		if ( v == par [u][0] ) continue ; 
		par [v][0] = u ; dep [v] = dep [u] + 1 ; 
		for ( int i = 1 ; i <= LOG ; i ++ ) par [v][i] = par[par[v][i-1]][i-1] ; 
		dfs (v) ; 
	}
} 
int lca ( int u , int v ) 
{
	if ( dep [u] < dep [v] ) swap (u,v) ; 
	int h = dep [u] - dep [v] ; 
	for ( int i = LOG ; i >= 0 ; i -- ) if ( h >> i & 1 ) u = par [u][i] ; 
	if ( u == v ) return u ; 
	for ( int i = LOG ; i >= 0 ; i -- ) if ( par [u][i] != par [v][i] ) u = par [u][i] , v = par [v][i] ; 
	return par [u][0] ;  
}

struct shape {
	int left , right ; 
	ll silver ; 
	int num_gold ; 
} T [maxn*30] ; int root [maxn] , cnt = 0 ; 
int build ( int l , int r ) 
{
	int New = ++ cnt ; 
	if ( l == r ) return New ; 
	int mid = (l+r)/2 ; 
	T [New].left = build (l,mid) ; 
	T [New].right = build (mid+1,r) ; 
	return New ; 
}

int update ( int id , int l , int r , int pos , int silver ) 
{
	if ( l > pos || r < pos ) return id ; 
	int New = ++ cnt ; 
	T [New] = T [id] ; 
	if ( l == r ) 
	{
		T [New].silver = silver ; 
		T [New].num_gold = 1 ; 
		return New ; 
	}
	int mid = (l+r)/2 ; 
	T [New].left = update (T[id].left,l,mid,pos,silver) ; 
	T [New].right = update (T[id].right,mid+1,r,pos,silver) ; 
	T [New].silver = T[T[New].left].silver + T[T[New].right].silver ; 
	T [New].num_gold = T[T[New].left].num_gold + T[T[New].right].num_gold ; 
	return New ; 
}

const int N = 2e5 ; 
int loss_max = 0 ; 
void get ( int rootA , int rootB , int rootLCA , ll silver , int l = 1 , int r = N ) 
{
	if ( T[rootA].silver+T[rootB].silver-2*T[rootLCA].silver <= silver ) 
	{
		loss_max += T[rootA].num_gold+T[rootB].num_gold-2*T[rootLCA].num_gold ; 
		return ; 
	}
	if ( l == r ) return ; 
	int mid = (l+r)/2 ; 
	ll sum = T[T[rootA].left].silver + T[T[rootB].left].silver - 2*T[T[rootLCA].left].silver ;
	if ( sum <= silver ) 
	{
		loss_max += T[T[rootA].left].num_gold + T[T[rootB].left].num_gold - 2*T[T[rootLCA].left].num_gold ;
		get (T[rootA].right,T[rootB].right,T[rootLCA].right,silver-sum,mid+1,r) ; 
	}
	else get (T[rootA].left,T[rootB].left,T[rootLCA].left,silver,l,mid) ; 
}

void dfs_addvalue ( int u = 1 ) 
{
	for ( auto v : adjList [u] ) 
	{
		if ( v == par [u][0] ) continue ; 
		root [v] = root [u] ; 
		for ( auto x : point [v] ) 
		{
			root [v] = 	update (root[v],1,N,x,fac[x]) ; 
		}
		num_gold [v] = num_gold [u] + (int)point[v].size () ; 
		dfs_addvalue (v) ; 
	}
}
void build () 
{
	mapping () ; 
	root [1] = build (1,n) ; 
	dfs_addvalue () ; 
}
void solve () 
{
	for ( int i = 1 ; i <= nq ; i ++ ) 
	{
		int u , v , gold ; ll silver ; 
		cin >> u >> v >> gold >> silver ; 
		
		loss_max = 0 ; 
		get (root[u],root[v],root[lca(u,v)],silver) ; 		 
		gold -= (num_gold[u]+num_gold[v]-2*num_gold[lca(u,v)]) - loss_max ; 
		
		if ( gold < 0 ) cout << - 1 << "\n" ; 
		else cout << gold << "\n" ; 
	}
}
int main ( ) 
{
	ios_base :: sync_with_stdio (0) ; 
	cin.tie(0) ; cout.tie(0) ;
//	rf ( ) ; 
	cin >> n >> m >> nq ; 
	
	for ( int i = 1 ; i < n ; i ++ ) 
	{
		int u , v ; cin >> u >> v ; 
		adjList [u] . pb (v) ; 
		adjList [v] . pb (u) ; 
		E [i] = {u,v} ; 
	}
	
	dfs () ; 

	for ( int i = 1 ; i <= m ; i ++ ) 
	{
		int p , c ; cin >> p >> c ; 
		int u = E[p].fi , v = E[p].se ; 
		if ( dep [u] > dep [v] ) swap (u,v) ; 
		point [v] . pb (c) ; 
	}
	
	build () ; 
	solve () ; 
}




//-std=c++11

Compilation message

currencies.cpp: In function 'void rf()':
currencies.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
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 15192 KB Output is correct
2 Correct 3 ms 14940 KB Output is correct
3 Correct 3 ms 14936 KB Output is correct
4 Correct 3 ms 15192 KB Output is correct
5 Correct 6 ms 17244 KB Output is correct
6 Correct 6 ms 17244 KB Output is correct
7 Correct 6 ms 17244 KB Output is correct
8 Correct 6 ms 17244 KB Output is correct
9 Correct 6 ms 17244 KB Output is correct
10 Correct 6 ms 17252 KB Output is correct
11 Correct 6 ms 17244 KB Output is correct
12 Correct 8 ms 17244 KB Output is correct
13 Correct 7 ms 17496 KB Output is correct
14 Correct 7 ms 17496 KB Output is correct
15 Correct 7 ms 17500 KB Output is correct
16 Correct 7 ms 17456 KB Output is correct
17 Correct 7 ms 17244 KB Output is correct
18 Correct 7 ms 17496 KB Output is correct
19 Correct 6 ms 17452 KB Output is correct
20 Correct 6 ms 17244 KB Output is correct
21 Correct 6 ms 17324 KB Output is correct
22 Correct 6 ms 17244 KB Output is correct
23 Correct 6 ms 17244 KB Output is correct
24 Correct 6 ms 17244 KB Output is correct
25 Correct 6 ms 17304 KB Output is correct
26 Correct 6 ms 17416 KB Output is correct
27 Correct 7 ms 17696 KB Output is correct
28 Correct 7 ms 17244 KB Output is correct
29 Correct 6 ms 17244 KB Output is correct
30 Correct 6 ms 17244 KB Output is correct
31 Correct 6 ms 17244 KB Output is correct
32 Correct 6 ms 17244 KB Output is correct
33 Correct 7 ms 17500 KB Output is correct
34 Correct 7 ms 17500 KB Output is correct
35 Correct 7 ms 17568 KB Output is correct

Subtask #2
28.0 / 28.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 15192 KB Output is correct
2 Correct 6 ms 17304 KB Output is correct
3 Correct 5 ms 17244 KB Output is correct
4 Correct 6 ms 17244 KB Output is correct
5 Correct 185 ms 76732 KB Output is correct
6 Correct 181 ms 69860 KB Output is correct
7 Correct 168 ms 65848 KB Output is correct
8 Correct 148 ms 63192 KB Output is correct
9 Correct 143 ms 65000 KB Output is correct
10 Correct 236 ms 81640 KB Output is correct
11 Correct 233 ms 81972 KB Output is correct
12 Correct 230 ms 81672 KB Output is correct
13 Correct 223 ms 81804 KB Output is correct
14 Correct 234 ms 81784 KB Output is correct
15 Correct 413 ms 89636 KB Output is correct
16 Correct 419 ms 90076 KB Output is correct
17 Correct 416 ms 89476 KB Output is correct
18 Correct 323 ms 82228 KB Output is correct
19 Correct 318 ms 82084 KB Output is correct
20 Correct 317 ms 82228 KB Output is correct
21 Correct 192 ms 81288 KB Output is correct
22 Correct 198 ms 81580 KB Output is correct
23 Correct 194 ms 81604 KB Output is correct
24 Correct 190 ms 81536 KB Output is correct
25 Correct 222 ms 81652 KB Output is correct
26 Correct 218 ms 81544 KB Output is correct
27 Correct 212 ms 81664 KB Output is correct
28 Correct 171 ms 81688 KB Output is correct
29 Correct 167 ms 81716 KB Output is correct
30 Correct 192 ms 81932 KB Output is correct
31 Correct 176 ms 81716 KB Output is correct

Subtask #3
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 14936 KB Output is correct
2 Correct 7 ms 17500 KB Output is correct
3 Correct 7 ms 17500 KB Output is correct
4 Correct 7 ms 17500 KB Output is correct
5 Correct 259 ms 76300 KB Output is correct
6 Correct 246 ms 68860 KB Output is correct
7 Correct 309 ms 81928 KB Output is correct
8 Correct 436 ms 94800 KB Output is correct
9 Correct 457 ms 94964 KB Output is correct
10 Correct 440 ms 94768 KB Output is correct
11 Correct 349 ms 94312 KB Output is correct
12 Correct 344 ms 94276 KB Output is correct
13 Correct 349 ms 94428 KB Output is correct
14 Correct 243 ms 94768 KB Output is correct
15 Correct 249 ms 94644 KB Output is correct
16 Correct 275 ms 94824 KB Output is correct
17 Correct 276 ms 94972 KB Output is correct

Subtask #4
32.0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 15192 KB Output is correct
2 Correct 3 ms 14940 KB Output is correct
3 Correct 3 ms 14936 KB Output is correct
4 Correct 3 ms 15192 KB Output is correct
5 Correct 6 ms 17244 KB Output is correct
6 Correct 6 ms 17244 KB Output is correct
7 Correct 6 ms 17244 KB Output is correct
8 Correct 6 ms 17244 KB Output is correct
9 Correct 6 ms 17244 KB Output is correct
10 Correct 6 ms 17252 KB Output is correct
11 Correct 6 ms 17244 KB Output is correct
12 Correct 8 ms 17244 KB Output is correct
13 Correct 7 ms 17496 KB Output is correct
14 Correct 7 ms 17496 KB Output is correct
15 Correct 7 ms 17500 KB Output is correct
16 Correct 7 ms 17456 KB Output is correct
17 Correct 7 ms 17244 KB Output is correct
18 Correct 7 ms 17496 KB Output is correct
19 Correct 6 ms 17452 KB Output is correct
20 Correct 6 ms 17244 KB Output is correct
21 Correct 6 ms 17324 KB Output is correct
22 Correct 6 ms 17244 KB Output is correct
23 Correct 6 ms 17244 KB Output is correct
24 Correct 6 ms 17244 KB Output is correct
25 Correct 6 ms 17304 KB Output is correct
26 Correct 6 ms 17416 KB Output is correct
27 Correct 7 ms 17696 KB Output is correct
28 Correct 7 ms 17244 KB Output is correct
29 Correct 6 ms 17244 KB Output is correct
30 Correct 6 ms 17244 KB Output is correct
31 Correct 6 ms 17244 KB Output is correct
32 Correct 6 ms 17244 KB Output is correct
33 Correct 7 ms 17500 KB Output is correct
34 Correct 7 ms 17500 KB Output is correct
35 Correct 7 ms 17568 KB Output is correct
36 Correct 2 ms 15192 KB Output is correct
37 Correct 6 ms 17304 KB Output is correct
38 Correct 5 ms 17244 KB Output is correct
39 Correct 6 ms 17244 KB Output is correct
40 Correct 185 ms 76732 KB Output is correct
41 Correct 181 ms 69860 KB Output is correct
42 Correct 168 ms 65848 KB Output is correct
43 Correct 148 ms 63192 KB Output is correct
44 Correct 143 ms 65000 KB Output is correct
45 Correct 236 ms 81640 KB Output is correct
46 Correct 233 ms 81972 KB Output is correct
47 Correct 230 ms 81672 KB Output is correct
48 Correct 223 ms 81804 KB Output is correct
49 Correct 234 ms 81784 KB Output is correct
50 Correct 413 ms 89636 KB Output is correct
51 Correct 419 ms 90076 KB Output is correct
52 Correct 416 ms 89476 KB Output is correct
53 Correct 323 ms 82228 KB Output is correct
54 Correct 318 ms 82084 KB Output is correct
55 Correct 317 ms 82228 KB Output is correct
56 Correct 192 ms 81288 KB Output is correct
57 Correct 198 ms 81580 KB Output is correct
58 Correct 194 ms 81604 KB Output is correct
59 Correct 190 ms 81536 KB Output is correct
60 Correct 222 ms 81652 KB Output is correct
61 Correct 218 ms 81544 KB Output is correct
62 Correct 212 ms 81664 KB Output is correct
63 Correct 171 ms 81688 KB Output is correct
64 Correct 167 ms 81716 KB Output is correct
65 Correct 192 ms 81932 KB Output is correct
66 Correct 176 ms 81716 KB Output is correct
67 Correct 2 ms 14936 KB Output is correct
68 Correct 7 ms 17500 KB Output is correct
69 Correct 7 ms 17500 KB Output is correct
70 Correct 7 ms 17500 KB Output is correct
71 Correct 259 ms 76300 KB Output is correct
72 Correct 246 ms 68860 KB Output is correct
73 Correct 309 ms 81928 KB Output is correct
74 Correct 436 ms 94800 KB Output is correct
75 Correct 457 ms 94964 KB Output is correct
76 Correct 440 ms 94768 KB Output is correct
77 Correct 349 ms 94312 KB Output is correct
78 Correct 344 ms 94276 KB Output is correct
79 Correct 349 ms 94428 KB Output is correct
80 Correct 243 ms 94768 KB Output is correct
81 Correct 249 ms 94644 KB Output is correct
82 Correct 275 ms 94824 KB Output is correct
83 Correct 276 ms 94972 KB Output is correct
84 Correct 234 ms 82256 KB Output is correct
85 Correct 207 ms 70000 KB Output is correct
86 Correct 170 ms 57872 KB Output is correct
87 Correct 305 ms 86344 KB Output is correct
88 Correct 308 ms 86372 KB Output is correct
89 Correct 298 ms 86324 KB Output is correct
90 Correct 327 ms 86624 KB Output is correct
91 Correct 306 ms 86256 KB Output is correct
92 Correct 522 ms 92112 KB Output is correct
93 Correct 518 ms 93600 KB Output is correct
94 Correct 421 ms 86832 KB Output is correct
95 Correct 399 ms 86840 KB Output is correct
96 Correct 400 ms 86836 KB Output is correct
97 Correct 418 ms 87088 KB Output is correct
98 Correct 270 ms 86204 KB Output is correct
99 Correct 257 ms 85920 KB Output is correct
100 Correct 273 ms 86304 KB Output is correct
101 Correct 261 ms 86216 KB Output is correct
102 Correct 298 ms 86468 KB Output is correct
103 Correct 281 ms 86208 KB Output is correct
104 Correct 284 ms 86216 KB Output is correct
105 Correct 235 ms 86276 KB Output is correct
106 Correct 236 ms 86216 KB Output is correct
107 Correct 248 ms 86632 KB Output is correct
108 Correct 251 ms 86336 KB Output is correct