oj.uz

답안 #253833

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
253833 2020-07-28T21:00:51 Z blacktulip Putovanje (COCI20_putovanje) C++17
110 / 110
 271 ms 49656 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long lo;
typedef pair< lo,lo > PII;

#define fi first
#define se second
#define mp make_pair
#define endl "\n"
#define pb push_back
#define int long long
#define fio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define FOR for(int i=1;i<=n;i++)
#define mid ((start+end)/2)
#define ort ((bas+son)/2)

const lo inf = 1000000000000000000;
const lo KOK = 100000;
const lo LOG = 30;
const lo li = 500005;
const lo mod = 1000000007;

int n,m,b[li],a[li],k,flag,t,c1[li],c2[li],fa[li][LOG],dep[li],vis[li],vis1[li],sum[li];
int cev;
string s;
vector<PII> v[li];

inline void build_lca(){
	for(int j=1;j<=27;j++){
		FOR fa[i][j]=fa[fa[i][j-1]][j-1];
	}
}

inline int ask_lca(int x,int y){
	if(dep[x]<dep[y])swap(x,y);
	int fark=dep[x]-dep[y];
	for(int i=27;i>=0;i--){
		if((1<<i)<=fark){
			fark-=(1<<i);
			x=fa[x][i];
		}
	}
	if(x==y){return x;}
	for(int i=27;i>=0;i--){
		if(fa[x][i]==fa[y][i])continue;
		x=fa[x][i];
		y=fa[y][i];
	}
	return fa[x][0];
}

inline void dfs(int node,int ata,int der){
	dep[node]=der;
	fa[node][0]=ata;
	for(int i=0;i<(int)v[node].size();i++){
		int go=v[node][i].fi;
		if(go==ata)continue;
		dfs(go,node,der+1);
	}
}

inline void solve(int node,int ata){
	for(int i=0;i<(int)v[node].size();i++){
		int go=v[node][i].fi;
		int ind=v[node][i].se;
		if(go==ata)continue;
		//~ int sum=0;
		//~ a[ind]=sum;
		solve(go,node);
		sum[node]+=sum[go];
		a[ind]=sum[go];
	}
	sum[node]+=vis[node];
}

main(void){
	scanf("%lld",&n);
	for(int i=1;i<n;i++){
		int x,y;
		scanf("%lld %lld %lld %lld",&x,&y,&c1[i],&c2[i]);
		v[x].pb({y,i});
		v[y].pb({x,i});
		//~ cout<<x<<": : : "<<y<<endl;
	}
	dfs(1,0,0);
	build_lca();
	for(int i=1;i<n;i++){
		int x=i;
		int y=i+1;
		flag=-1;
		vis[x]++;
		vis[y]++;
		int at=ask_lca(x,y);
		vis[at]-=2;
	}
	//~ FOR{
		//~ printf("%d %d\n",vis[i],vis1[i]);
	//~ }
	solve(1,0);
	int ans=0;
	for(int i=1;i<n;i++){ 
		ans+=min(c1[i]*a[i],c2[i]);
		//~ cout<<a[i]<<endl;
	}
	printf("%lld\n",ans);
	return 0;
}

Compilation message

putovanje.cpp:78:10: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main(void){
          ^
putovanje.cpp: In function 'int main()':
putovanje.cpp:79:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%lld",&n);
  ~~~~~^~~~~~~~~~~
putovanje.cpp:82:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lld %lld %lld %lld",&x,&y,&c1[i],&c2[i]);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 12160 KB Output is correct
2 Correct 11 ms 12800 KB Output is correct
3 Correct 10 ms 12892 KB Output is correct
4 Correct 10 ms 12800 KB Output is correct
5 Correct 11 ms 12800 KB Output is correct
6 Correct 8 ms 12160 KB Output is correct
7 Correct 12 ms 12288 KB Output is correct
8 Correct 10 ms 12544 KB Output is correct
9 Correct 13 ms 12800 KB Output is correct

Subtask #2
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 203 ms 44536 KB Output is correct
2 Correct 219 ms 45432 KB Output is correct
3 Correct 271 ms 48760 KB Output is correct
4 Correct 270 ms 49656 KB Output is correct
5 Correct 9 ms 12416 KB Output is correct
6 Correct 170 ms 43768 KB Output is correct
7 Correct 143 ms 34680 KB Output is correct
8 Correct 206 ms 45048 KB Output is correct
9 Correct 133 ms 47352 KB Output is correct
10 Correct 128 ms 46204 KB Output is correct
11 Correct 135 ms 49016 KB Output is correct
12 Correct 128 ms 49272 KB Output is correct

Subtask #3
65.0 / 65.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 12160 KB Output is correct
2 Correct 11 ms 12800 KB Output is correct
3 Correct 10 ms 12892 KB Output is correct
4 Correct 10 ms 12800 KB Output is correct
5 Correct 11 ms 12800 KB Output is correct
6 Correct 8 ms 12160 KB Output is correct
7 Correct 12 ms 12288 KB Output is correct
8 Correct 10 ms 12544 KB Output is correct
9 Correct 13 ms 12800 KB Output is correct
10 Correct 203 ms 44536 KB Output is correct
11 Correct 219 ms 45432 KB Output is correct
12 Correct 271 ms 48760 KB Output is correct
13 Correct 270 ms 49656 KB Output is correct
14 Correct 9 ms 12416 KB Output is correct
15 Correct 170 ms 43768 KB Output is correct
16 Correct 143 ms 34680 KB Output is correct
17 Correct 206 ms 45048 KB Output is correct
18 Correct 133 ms 47352 KB Output is correct
19 Correct 128 ms 46204 KB Output is correct
20 Correct 135 ms 49016 KB Output is correct
21 Correct 128 ms 49272 KB Output is correct
22 Correct 167 ms 46472 KB Output is correct
23 Correct 161 ms 42232 KB Output is correct
24 Correct 180 ms 45816 KB Output is correct
25 Correct 12 ms 12416 KB Output is correct
26 Correct 75 ms 27640 KB Output is correct
27 Correct 126 ms 40956 KB Output is correct
28 Correct 110 ms 43128 KB Output is correct
29 Correct 121 ms 49244 KB Output is correct
30 Correct 125 ms 48876 KB Output is correct
31 Correct 10 ms 12672 KB Output is correct