답안 #291978

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
291978 2020-09-06T06:34:33 Z khangal 꿈 (IOI13_dreaming) C++14
컴파일 오류
0 ms 0 KB
    #include<bits/stdc++.h>
    #include "dreaming.h" 
    #include <ext/pb_ds/assoc_container.hpp>
    #include <ext/pb_ds/tree_policy.hpp>
    using namespace __gnu_pbds;
    using namespace std;
    typedef int ll;
    typedef double db;
    typedef pair<ll,ll> pl;
    typedef vector<ll> vl;
    typedef vector<vl> vvl;
    #define po pop_back
    #define pb push_back
    #define mk make_pair
    #define mt make_tuple
    #define lw lower_bound
    #define up upper_bound
    #define ff first
    #define ss second
    #define BOOST ios_base::sync_with_stdio(); cin.tie(0); cout.tie(0);
    #define MOD 1000000007
    #define MAX 1e18
    #define MIN -1e18
    #define rep(i,a,b) for(ll i=a;i<=b;i++)
    #define per(i,a,b) for(ll i=b;i>=a;i--)
    #define con continue
    #define freopen freopen("input.txt", "r", stdin);freopen("output.txt", "w", stdout);
    #define PI 3.14159265358979323846264338327950288419716939937510582097494459230781640628
    #define read(x) scanf("%lld",&x);
    #define print(x) printf("%lld ",x);
    #define endl '\n';
    typedef tree<ll , null_type, less_equal<ll>, rb_tree_tag, tree_order_statistics_node_update> indexed_multi_set;
    typedef tree<ll , null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
    // template< typename T>
    // using indexed_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
    int n,m,ans,mid,mn,mx,cnt,T,sum,h1,h2,e[1234567],b,c[1234567],d[1<<20],k,i,j,l,r,h,a[1234567],w,x,y,z,t;
    bool used[1234567];
    pair<int,int> p[1234567];
    vector<pl> vc[1234567];
    vl vec,vv1,vv2;
    // string s1,s;
    // int sz[1234567],par[1234567];
    int tr[5234567],pare[1234567],maxx;
    ll dx[4]={-1,1,0,0},dy[4]={0,0,-1,1},c1[123][123];
    map<ll,ll> mp;
    pair < int , int > dfs ( int chi , int par ) {
        used [ chi ] = 1 ;
        prr = { 0 , chi } ;
        for( auto &u : vc [ chi ] ) {
            if ( u . second == par ) continue;
            pp = dfs ( u . second , chi ) ;
            prr = max ( prr , { pp . first + u . first , pp . second } ) ;
        }
        a [ chi ] = prr . first ;
        pare [ chi ] = par ;
        return prr ; 
    }
    int travelTime (int N, int M, int L, int A[], int B[], int T[]) {
        for ( int i = 0 ; i < M ; i ++ ) {
            vc [ A [ i ] ] . push_back ( { T [ i ] , B [ i ] } ) ;
            vc [ B [ i ] ] . push_back ( { T [ i ] , A [ i ] } ) ;
        }
        for ( int i = 0 ; i < N ; i ++ ) {
            if ( used [ i ] != 0 ) continue ;
            pr = dfs ( dfs ( i , -1 ) . second , -1 ) ;
            x = pr . second ;
            y = pr . first ;
            for ( int j = x ; j >= 0 ; j = pare [ j ] ) {
                y = min ( y , max ( a [ j ] , pr . first - a [ j ] ) ) ;
            }
            vec . push_back ( y ) ; 
            maxx = max ( maxx , pr. first ) ; 
        }
        sort ( vec . rbegin ( ) , vec . rend ( ) ) ;
        if ( vec . size ( ) > 2 ) {
            ans = L + vec [ 0 ] + vec [ 1 ] ;
            for ( int i = 2 ; i < vec . size ( ) ; i ++ ) {
                ans = max ( ans , L + L + vec [ 1 ] + vec [ i ] ) ;
            }
        }
        else {
            if ( vec . size ( ) == 2 ) ans = L + vec [ 0 ] + vec [ 1 ] ;
            else ans = 0 ;
        }
        ans = max ( ans , maxx ) ;
        return ans ;
    }

Compilation message

dreaming.cpp: In function 'std::pair<int, int> dfs(int, int)':
dreaming.cpp:48:9: error: 'prr' was not declared in this scope; did you mean 'par'?
   48 |         prr = { 0 , chi } ;
      |         ^~~
      |         par
dreaming.cpp:51:13: error: 'pp' was not declared in this scope; did you mean 'mp'?
   51 |             pp = dfs ( u . second , chi ) ;
      |             ^~
      |             mp
dreaming.cpp: In function 'int travelTime(int, int, int, int*, int*, int*)':
dreaming.cpp:65:13: error: 'pr' was not declared in this scope; did you mean 'tr'?
   65 |             pr = dfs ( dfs ( i , -1 ) . second , -1 ) ;
      |             ^~
      |             tr
dreaming.cpp:77:33: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   77 |             for ( int i = 2 ; i < vec . size ( ) ; i ++ ) {
      |                               ~~^~~~~~~~~~~~~~~~