oj.uz

답안 #291981

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
291981 2020-09-06T06:36:15 Z khangal 꿈 (IOI13_dreaming) C++14
32 / 100
 97 ms 38316 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;
pl prr,pp,pr;
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 'int travelTime(int, int, int, int*, int*, int*)':
dreaming.cpp:78:29: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   78 |         for ( int i = 2 ; i < vec . size ( ) ; i ++ ) {
      |                           ~~^~~~~~~~~~~~~~~~

Subtask #1
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 83 ms 38316 KB Output is correct
2 Correct 94 ms 38260 KB Output is correct
3 Correct 63 ms 35172 KB Output is correct
4 Correct 30 ms 30720 KB Output is correct
5 Correct 28 ms 30080 KB Output is correct
6 Correct 36 ms 31352 KB Output is correct
7 Correct 20 ms 29312 KB Output is correct
8 Correct 51 ms 32504 KB Output is correct
9 Correct 57 ms 33784 KB Output is correct
10 Correct 21 ms 29440 KB Output is correct
11 Correct 87 ms 35192 KB Output is correct
12 Correct 97 ms 36728 KB Output is correct
13 Correct 21 ms 29440 KB Output is correct

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 83 ms 38316 KB Output is correct
2 Correct 94 ms 38260 KB Output is correct
3 Correct 63 ms 35172 KB Output is correct
4 Correct 30 ms 30720 KB Output is correct
5 Correct 28 ms 30080 KB Output is correct
6 Correct 36 ms 31352 KB Output is correct
7 Correct 20 ms 29312 KB Output is correct
8 Correct 51 ms 32504 KB Output is correct
9 Correct 57 ms 33784 KB Output is correct
10 Correct 21 ms 29440 KB Output is correct
11 Correct 87 ms 35192 KB Output is correct
12 Correct 97 ms 36728 KB Output is correct
13 Correct 21 ms 29440 KB Output is correct
14 Incorrect 19 ms 29312 KB Output isn't correct
15 Halted 0 ms 0 KB -

Subtask #3
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 83 ms 38316 KB Output is correct
2 Correct 94 ms 38260 KB Output is correct
3 Correct 63 ms 35172 KB Output is correct
4 Correct 30 ms 30720 KB Output is correct
5 Correct 28 ms 30080 KB Output is correct
6 Correct 36 ms 31352 KB Output is correct
7 Correct 20 ms 29312 KB Output is correct
8 Correct 51 ms 32504 KB Output is correct
9 Correct 57 ms 33784 KB Output is correct
10 Correct 21 ms 29440 KB Output is correct
11 Correct 87 ms 35192 KB Output is correct
12 Correct 97 ms 36728 KB Output is correct
13 Correct 21 ms 29440 KB Output is correct
14 Incorrect 19 ms 29312 KB Output isn't correct
15 Halted 0 ms 0 KB -

Subtask #4
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 52 ms 32848 KB Output is correct
2 Correct 52 ms 32864 KB Output is correct
3 Correct 49 ms 32860 KB Output is correct
4 Correct 64 ms 32888 KB Output is correct
5 Correct 61 ms 32888 KB Output is correct
6 Correct 52 ms 33272 KB Output is correct
7 Correct 57 ms 33016 KB Output is correct
8 Correct 46 ms 32760 KB Output is correct
9 Correct 60 ms 32760 KB Output is correct
10 Correct 57 ms 33016 KB Output is correct
11 Correct 24 ms 29312 KB Output is correct
12 Correct 28 ms 30844 KB Output is correct
13 Correct 30 ms 30964 KB Output is correct
14 Correct 30 ms 30844 KB Output is correct
15 Correct 30 ms 30844 KB Output is correct
16 Correct 27 ms 30844 KB Output is correct
17 Correct 33 ms 30708 KB Output is correct
18 Correct 34 ms 30964 KB Output is correct
19 Correct 25 ms 30836 KB Output is correct
20 Correct 22 ms 29312 KB Output is correct
21 Correct 21 ms 29312 KB Output is correct
22 Correct 26 ms 29432 KB Output is correct
23 Correct 26 ms 30836 KB Output is correct

Subtask #5
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 83 ms 38316 KB Output is correct
2 Correct 94 ms 38260 KB Output is correct
3 Correct 63 ms 35172 KB Output is correct
4 Correct 30 ms 30720 KB Output is correct
5 Correct 28 ms 30080 KB Output is correct
6 Correct 36 ms 31352 KB Output is correct
7 Correct 20 ms 29312 KB Output is correct
8 Correct 51 ms 32504 KB Output is correct
9 Correct 57 ms 33784 KB Output is correct
10 Correct 21 ms 29440 KB Output is correct
11 Correct 87 ms 35192 KB Output is correct
12 Correct 97 ms 36728 KB Output is correct
13 Correct 21 ms 29440 KB Output is correct
14 Incorrect 22 ms 29440 KB Output isn't correct
15 Halted 0 ms 0 KB -

Subtask #6
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 83 ms 38316 KB Output is correct
2 Correct 94 ms 38260 KB Output is correct
3 Correct 63 ms 35172 KB Output is correct
4 Correct 30 ms 30720 KB Output is correct
5 Correct 28 ms 30080 KB Output is correct
6 Correct 36 ms 31352 KB Output is correct
7 Correct 20 ms 29312 KB Output is correct
8 Correct 51 ms 32504 KB Output is correct
9 Correct 57 ms 33784 KB Output is correct
10 Correct 21 ms 29440 KB Output is correct
11 Correct 87 ms 35192 KB Output is correct
12 Correct 97 ms 36728 KB Output is correct
13 Correct 21 ms 29440 KB Output is correct
14 Incorrect 19 ms 29312 KB Output isn't correct
15 Halted 0 ms 0 KB -