oj.uz

답안 #291743

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
291743 2020-09-05T18:09:45 Z Badrangiikh 꿈 (IOI13_dreaming) C++14
32 / 100
 67 ms 11768 KB 
#include "dreaming.h"
#include<bits/stdc++.h>
using namespace std;

int ans , maxx , x , y ;
int pare [ 100005 ] ;
int a [ 100005 ] ;
pair < int , int > pr , prr , pp ;
vector < pair < int , int > > vc [ 100005 ] ;
vector < int > vec ;
bool used [ 100005 ] ;


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:45:29: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   45 |         for ( int i = 2 ; i < vec . size ( ) ; i ++ ) {
      |                           ~~^~~~~~~~~~~~~~~~

Subtask #1
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 61 ms 11768 KB Output is correct
2 Correct 63 ms 11640 KB Output is correct
3 Correct 39 ms 8568 KB Output is correct
4 Correct 9 ms 3968 KB Output is correct
5 Correct 8 ms 3456 KB Output is correct
6 Correct 16 ms 4608 KB Output is correct
7 Correct 2 ms 2688 KB Output is correct
8 Correct 29 ms 5880 KB Output is correct
9 Correct 36 ms 7160 KB Output is correct
10 Correct 2 ms 2688 KB Output is correct
11 Correct 54 ms 8568 KB Output is correct
12 Correct 67 ms 10104 KB Output is correct
13 Correct 3 ms 2816 KB Output is correct

Subtask #2
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 61 ms 11768 KB Output is correct
2 Correct 63 ms 11640 KB Output is correct
3 Correct 39 ms 8568 KB Output is correct
4 Correct 9 ms 3968 KB Output is correct
5 Correct 8 ms 3456 KB Output is correct
6 Correct 16 ms 4608 KB Output is correct
7 Correct 2 ms 2688 KB Output is correct
8 Correct 29 ms 5880 KB Output is correct
9 Correct 36 ms 7160 KB Output is correct
10 Correct 2 ms 2688 KB Output is correct
11 Correct 54 ms 8568 KB Output is correct
12 Correct 67 ms 10104 KB Output is correct
13 Correct 3 ms 2816 KB Output is correct
14 Incorrect 3 ms 2720 KB Output isn't correct
15 Halted 0 ms 0 KB -

Subtask #3
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 61 ms 11768 KB Output is correct
2 Correct 63 ms 11640 KB Output is correct
3 Correct 39 ms 8568 KB Output is correct
4 Correct 9 ms 3968 KB Output is correct
5 Correct 8 ms 3456 KB Output is correct
6 Correct 16 ms 4608 KB Output is correct
7 Correct 2 ms 2688 KB Output is correct
8 Correct 29 ms 5880 KB Output is correct
9 Correct 36 ms 7160 KB Output is correct
10 Correct 2 ms 2688 KB Output is correct
11 Correct 54 ms 8568 KB Output is correct
12 Correct 67 ms 10104 KB Output is correct
13 Correct 3 ms 2816 KB Output is correct
14 Incorrect 3 ms 2720 KB Output isn't correct
15 Halted 0 ms 0 KB -

Subtask #4
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 29 ms 6272 KB Output is correct
2 Correct 29 ms 6264 KB Output is correct
3 Correct 37 ms 6332 KB Output is correct
4 Correct 29 ms 6264 KB Output is correct
5 Correct 28 ms 6272 KB Output is correct
6 Correct 32 ms 6656 KB Output is correct
7 Correct 30 ms 6404 KB Output is correct
8 Correct 29 ms 6144 KB Output is correct
9 Correct 28 ms 6136 KB Output is correct
10 Correct 32 ms 6400 KB Output is correct
11 Correct 2 ms 2688 KB Output is correct
12 Correct 8 ms 4220 KB Output is correct
13 Correct 8 ms 4220 KB Output is correct
14 Correct 8 ms 4220 KB Output is correct
15 Correct 8 ms 4220 KB Output is correct
16 Correct 8 ms 4220 KB Output is correct
17 Correct 8 ms 4092 KB Output is correct
18 Correct 8 ms 4220 KB Output is correct
19 Correct 8 ms 4220 KB Output is correct
20 Correct 2 ms 2688 KB Output is correct
21 Correct 2 ms 2688 KB Output is correct
22 Correct 2 ms 2688 KB Output is correct
23 Correct 8 ms 4220 KB Output is correct

Subtask #5
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 61 ms 11768 KB Output is correct
2 Correct 63 ms 11640 KB Output is correct
3 Correct 39 ms 8568 KB Output is correct
4 Correct 9 ms 3968 KB Output is correct
5 Correct 8 ms 3456 KB Output is correct
6 Correct 16 ms 4608 KB Output is correct
7 Correct 2 ms 2688 KB Output is correct
8 Correct 29 ms 5880 KB Output is correct
9 Correct 36 ms 7160 KB Output is correct
10 Correct 2 ms 2688 KB Output is correct
11 Correct 54 ms 8568 KB Output is correct
12 Correct 67 ms 10104 KB Output is correct
13 Correct 3 ms 2816 KB Output is correct
14 Incorrect 2 ms 2688 KB Output isn't correct
15 Halted 0 ms 0 KB -

Subtask #6
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 61 ms 11768 KB Output is correct
2 Correct 63 ms 11640 KB Output is correct
3 Correct 39 ms 8568 KB Output is correct
4 Correct 9 ms 3968 KB Output is correct
5 Correct 8 ms 3456 KB Output is correct
6 Correct 16 ms 4608 KB Output is correct
7 Correct 2 ms 2688 KB Output is correct
8 Correct 29 ms 5880 KB Output is correct
9 Correct 36 ms 7160 KB Output is correct
10 Correct 2 ms 2688 KB Output is correct
11 Correct 54 ms 8568 KB Output is correct
12 Correct 67 ms 10104 KB Output is correct
13 Correct 3 ms 2816 KB Output is correct
14 Incorrect 3 ms 2720 KB Output isn't correct
15 Halted 0 ms 0 KB -