oj.uz

답안 #779851

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
779851 2023-07-12T01:26:57 Z vjudge1 공장들 (JOI14_factories) C++17
100 / 100
 3441 ms 188164 KB 
#include<bits/stdc++.h>
#include "factories.h"
using namespace std;
typedef long long ll;
const ll INF=1e18;
const int maxn=1e6+5;
const int mod=1e9+7;
const int mo=998244353;
using pi=pair<ll,ll>;
using vi=vector<ll>;
using pii=pair<pair<ll,ll>,ll>;
#define all(x) x.begin(), x.end()
#define len(x) ll(x.size())
#define eb emplace_back
#define PI 3.14159265359
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define MIN(v) *min_element(all(v))
#define MAX(v) *max_element(all(v))
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int n;
vector<pair<int,int>>G[500005];
int sz[500005];
int pa[500005];
int de[500005];
long long dis[500005][22];
long long ans[500005];
int killed[500005];
int dfsz(int u, int p) {
    sz[u] = 1;
    for(auto v : G[u]) if(v.first != p && killed[v.first]==0) {
      sz[u] += dfsz(v.first, u);
    }
    return sz[u];
}
int centroid(int u, int p, int n) {
    for(auto v : G[u]) if(v.first != p && killed[v.first]==0) {
        if(sz[v.first] > n / 2) return centroid(v.first, u, n);
    }
    return u;
  }
void dfs2(int u, int p, int d) {
  
    for(auto v : G[u]) if(v.first != p && killed[v.first]==0) {
    	dis[v.first][d]=dis[u][d]+v.second;
        dfs2(v.first,u,d);
    }
}
void build(int u, int p,int d) {
    int n1 = dfsz(u, p);
    int c = centroid(u, p, n1);
    
    pa[c] = p;
    killed[c]=1;
    dis[c][d]=0;
    de[c]=d;
    dfs2(c, -1, d);
    for(auto v : G[c]) {
       	if(killed[v.first]==0){
        	build(v.first, c,d+1);
    	}
    }
}
void upd(int u){
    int v=u;
    int d=de[u];
    int cc=u;
    while(d>=1){
        ans[cc]=min(ans[cc],dis[u][d]);
 
    	cc=pa[cc];
    	d--;
    }
}
void upd1(int u){
    int v=u;
    int d=de[u];
    int cc=u;
    while(d>=1){
        ans[cc]=INF;
    	cc=pa[cc];
    	d--;
    }
}
long long query(int u) {
    long long mi = INF;
    int cc=u;
    int d=de[u];
    while(d>=1){
        mi=min(ans[cc]+dis[u][d],mi);
    	cc=pa[cc];
    	d--;   
    }
    return mi;
}
void Init(int N,int A[],int B[],int D[]){
	n=N;
	for(int i=0;i<N-1;i++){
		G[A[i]+1].pb({B[i]+1,D[i]});
		G[B[i]+1].pb({A[i]+1,D[i]});
	}
	build(1,-1,1);
	for(int i=1;i<=n;i++){
        ans[i]=INF;
	}
}
long long Query(int S,int X[],int T,int Y[]){
	for(int i=0;i<S;i++){
		upd(X[i]+1);
	}
	long long an=INF;
	for(int i=0;i<T;i++){
		an=min(an,query(Y[i]+1));
	}
	for(int i=0;i<S;i++){
        upd1(X[i]+1);
	}
	return an;
}
/*
signed main(){
 
	int q;
	cin>>n>>q;
	for(int i=1;i<=n-1;i++){
		int x,y,d;
		cin>>x>>y>>d;
		x++;
		y++;
		G[x].push_back({y,d});
		G[y].push_back({x,d});
	}
	build(1,-1,1);
	for(int j=1;j<=q;j++){
		int S,T;
		cin>>S>>T;
		for(int i=1;i<=n;i++){
			ans[i]=INF;
		}
		for(int i=0;i<S;i++){
			int x;
			cin>>x;
			upd(x+1);
		}
		long long an=INF;
		for(int i=0;i<T;i++){
			int y;
			cin>>y;
			an=min(an,query(y+1));
			
		}
		cout<<an<<"\n";
	}
}
*/

Compilation message

factories.cpp: In function 'void upd(int)':
factories.cpp:67:9: warning: unused variable 'v' [-Wunused-variable]
   67 |     int v=u;
      |         ^
factories.cpp: In function 'void upd1(int)':
factories.cpp:78:9: warning: unused variable 'v' [-Wunused-variable]
   78 |     int v=u;
      |         ^

Subtask #1
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 12640 KB Output is correct
2 Correct 192 ms 30652 KB Output is correct
3 Correct 194 ms 30788 KB Output is correct
4 Correct 195 ms 30796 KB Output is correct
5 Correct 207 ms 31068 KB Output is correct
6 Correct 155 ms 30752 KB Output is correct
7 Correct 195 ms 30752 KB Output is correct
8 Correct 215 ms 30748 KB Output is correct
9 Correct 206 ms 31060 KB Output is correct
10 Correct 153 ms 30792 KB Output is correct
11 Correct 196 ms 30788 KB Output is correct

Subtask #2
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 12264 KB Output is correct
2 Correct 1216 ms 159968 KB Output is correct
3 Correct 1920 ms 160804 KB Output is correct
4 Correct 507 ms 160284 KB Output is correct
5 Correct 2824 ms 184100 KB Output is correct
6 Correct 2190 ms 162940 KB Output is correct
7 Correct 593 ms 60112 KB Output is correct
8 Correct 284 ms 60924 KB Output is correct
9 Correct 630 ms 63832 KB Output is correct
10 Correct 540 ms 61608 KB Output is correct

Subtask #3
67.0 / 67.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 12640 KB Output is correct
2 Correct 192 ms 30652 KB Output is correct
3 Correct 194 ms 30788 KB Output is correct
4 Correct 195 ms 30796 KB Output is correct
5 Correct 207 ms 31068 KB Output is correct
6 Correct 155 ms 30752 KB Output is correct
7 Correct 195 ms 30752 KB Output is correct
8 Correct 215 ms 30748 KB Output is correct
9 Correct 206 ms 31060 KB Output is correct
10 Correct 153 ms 30792 KB Output is correct
11 Correct 196 ms 30788 KB Output is correct
12 Correct 7 ms 12264 KB Output is correct
13 Correct 1216 ms 159968 KB Output is correct
14 Correct 1920 ms 160804 KB Output is correct
15 Correct 507 ms 160284 KB Output is correct
16 Correct 2824 ms 184100 KB Output is correct
17 Correct 2190 ms 162940 KB Output is correct
18 Correct 593 ms 60112 KB Output is correct
19 Correct 284 ms 60924 KB Output is correct
20 Correct 630 ms 63832 KB Output is correct
21 Correct 540 ms 61608 KB Output is correct
22 Correct 1375 ms 167152 KB Output is correct
23 Correct 1610 ms 169864 KB Output is correct
24 Correct 2372 ms 169100 KB Output is correct
25 Correct 2476 ms 172792 KB Output is correct
26 Correct 2536 ms 169156 KB Output is correct
27 Correct 3441 ms 188164 KB Output is correct
28 Correct 619 ms 170648 KB Output is correct
29 Correct 2390 ms 168804 KB Output is correct
30 Correct 2333 ms 168348 KB Output is correct
31 Correct 2370 ms 169028 KB Output is correct
32 Correct 697 ms 64664 KB Output is correct
33 Correct 258 ms 61372 KB Output is correct
34 Correct 393 ms 58072 KB Output is correct
35 Correct 423 ms 58012 KB Output is correct
36 Correct 521 ms 58448 KB Output is correct
37 Correct 485 ms 58512 KB Output is correct