oj.uz

답안 #947661

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
947661 2024-03-16T17:53:23 Z yeediot 공장들 (JOI14_factories) C++14
100 / 100
 4761 ms 381008 KB 
#include<bits/stdc++.h>
#include "factories.h"
using namespace std;
#define F first
#define S second
#define all(x) x.begin(),x.end()
#define pii pair<int,int>
#define pb push_back
#define sz(x) (int)(x.size())
#define chmin(x,y) x=min(x,y)
#define chmax(x,y) x=max(x,y)
#define vi vector<int>
#define vp vector<pii>
#define vvi vector<vi>
#define ykh mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count())
#define __lg(x) 63-__builtin_clzll(x)
#define pow2(x) (1LL<<x)
void __print(int x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}
#ifdef local
void setio(){freopen("/Users/iantsai/Library/Mobile Documents/com~apple~CloudDocs/cpp/Empty.md","r",stdin);}
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
void setio(){}
#define debug(x...)
#endif
const int mxn=5e5+5;
vector<pii>adj[mxn];
int cnt[mxn];
bool vis[mxn];
vector<pair<int,long long>>p[mxn];
pair<long long,long long> mn[mxn];
void cnt_sz(int v,int pa){
    cnt[v]=1;
    for(auto [u,d]:adj[v]){
        if(vis[u] or u==pa)continue;
        cnt_sz(u,v);
        cnt[v]+=cnt[u];
    }
}
int find_cen(int v,int pa,int tar){
    for(auto [u,d]:adj[v]){
        if(vis[u] or u==pa)continue;
        if(cnt[u]*2>tar)return find_cen(u,v,tar);
    }
    return v;
}
void dfs(int v,int pa,int top,long long cur){
    p[v].pb({top,cur});
    for(auto [u,d]:adj[v]){
        if(vis[u] or u==pa)continue;
        dfs(u,v,top,cur+d);
    }
}
void cen(int v){
    cnt_sz(v,v);
    v=find_cen(v,v,cnt[v]);
    vis[v]=1;
    dfs(v,v,v,0);
    for(auto [u,d]:adj[v]){
        if(vis[u])continue;
        cen(u);
    }
}
void Init(int N,int A[],int B[],int D[]){
    for(int i=0;i<N-1;i++){
        adj[A[i]].pb({B[i],D[i]});
        adj[B[i]].pb({A[i],D[i]});
    }
    cen(1);
}
long long Query(int S,int X[],int T,int Y[]){
    for(int i=0;i<S;i++){
        for(auto [u,l]:p[X[i]]){
            mn[u]={1e18,1e18};
        }
    }
    for(int i=0;i<T;i++){
        for(auto [u,l]:p[Y[i]]){
            mn[u]={1e18,1e18};
        }
    }
    long long ans=1e18;
    for(int i=0;i<S;i++){
        for(auto [u,l]:p[X[i]]){
            chmin(mn[u].F,l);
        }
    }
    for(int i=0;i<T;i++){
        for(auto [u,l]:p[Y[i]]){
            chmin(mn[u].S,l);
            chmin(ans,mn[u].F+mn[u].S);
        }
    }
    for(int i=0;i<S;i++){
        for(auto [u,l]:p[X[i]]){
            chmin(ans,mn[u].F+mn[u].S);
        }
    }
     for(int i=0;i<T;i++){
        for(auto [u,l]:p[Y[i]]){
            chmin(ans,mn[u].F+mn[u].S);
        }
    }
    return ans;
}
 /*
 input:
 
 */

Compilation message

factories.cpp: In function 'void cnt_sz(int, int)':
factories.cpp:41:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   41 |     for(auto [u,d]:adj[v]){
      |              ^
factories.cpp: In function 'int find_cen(int, int, int)':
factories.cpp:48:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   48 |     for(auto [u,d]:adj[v]){
      |              ^
factories.cpp: In function 'void dfs(int, int, int, long long int)':
factories.cpp:56:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   56 |     for(auto [u,d]:adj[v]){
      |              ^
factories.cpp: In function 'void cen(int)':
factories.cpp:66:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   66 |     for(auto [u,d]:adj[v]){
      |              ^
factories.cpp: In function 'long long int Query(int, int*, int, int*)':
factories.cpp:80:18: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   80 |         for(auto [u,l]:p[X[i]]){
      |                  ^
factories.cpp:85:18: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   85 |         for(auto [u,l]:p[Y[i]]){
      |                  ^
factories.cpp:91:18: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   91 |         for(auto [u,l]:p[X[i]]){
      |                  ^
factories.cpp:96:18: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   96 |         for(auto [u,l]:p[Y[i]]){
      |                  ^
factories.cpp:102:18: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
  102 |         for(auto [u,l]:p[X[i]]){
      |                  ^
factories.cpp:107:18: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
  107 |         for(auto [u,l]:p[Y[i]]){
      |                  ^

Subtask #1
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 45656 KB Output is correct
2 Correct 281 ms 50772 KB Output is correct
3 Correct 303 ms 51284 KB Output is correct
4 Correct 369 ms 60528 KB Output is correct
5 Correct 349 ms 60788 KB Output is correct
6 Correct 181 ms 59472 KB Output is correct
7 Correct 303 ms 60496 KB Output is correct
8 Correct 322 ms 60756 KB Output is correct
9 Correct 349 ms 60952 KB Output is correct
10 Correct 191 ms 59728 KB Output is correct
11 Correct 292 ms 60544 KB Output is correct

Subtask #2
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 45660 KB Output is correct
2 Correct 1738 ms 203128 KB Output is correct
3 Correct 2646 ms 273848 KB Output is correct
4 Correct 677 ms 118716 KB Output is correct
5 Correct 3435 ms 371424 KB Output is correct
6 Correct 2722 ms 292360 KB Output is correct
7 Correct 768 ms 98028 KB Output is correct
8 Correct 289 ms 75276 KB Output is correct
9 Correct 873 ms 111700 KB Output is correct
10 Correct 797 ms 98808 KB Output is correct

Subtask #3
67.0 / 67.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 45656 KB Output is correct
2 Correct 281 ms 50772 KB Output is correct
3 Correct 303 ms 51284 KB Output is correct
4 Correct 369 ms 60528 KB Output is correct
5 Correct 349 ms 60788 KB Output is correct
6 Correct 181 ms 59472 KB Output is correct
7 Correct 303 ms 60496 KB Output is correct
8 Correct 322 ms 60756 KB Output is correct
9 Correct 349 ms 60952 KB Output is correct
10 Correct 191 ms 59728 KB Output is correct
11 Correct 292 ms 60544 KB Output is correct
12 Correct 9 ms 45660 KB Output is correct
13 Correct 1738 ms 203128 KB Output is correct
14 Correct 2646 ms 273848 KB Output is correct
15 Correct 677 ms 118716 KB Output is correct
16 Correct 3435 ms 371424 KB Output is correct
17 Correct 2722 ms 292360 KB Output is correct
18 Correct 768 ms 98028 KB Output is correct
19 Correct 289 ms 75276 KB Output is correct
20 Correct 873 ms 111700 KB Output is correct
21 Correct 797 ms 98808 KB Output is correct
22 Correct 2822 ms 224816 KB Output is correct
23 Correct 2455 ms 228164 KB Output is correct
24 Correct 4341 ms 297464 KB Output is correct
25 Correct 4212 ms 297916 KB Output is correct
26 Correct 3417 ms 298744 KB Output is correct
27 Correct 4761 ms 381008 KB Output is correct
28 Correct 899 ms 125116 KB Output is correct
29 Correct 3118 ms 296276 KB Output is correct
30 Correct 3195 ms 297888 KB Output is correct
31 Correct 3155 ms 297960 KB Output is correct
32 Correct 1553 ms 112636 KB Output is correct
33 Correct 321 ms 75384 KB Output is correct
34 Correct 662 ms 91496 KB Output is correct
35 Correct 673 ms 92500 KB Output is correct
36 Correct 937 ms 97324 KB Output is correct
37 Correct 892 ms 97544 KB Output is correct