oj.uz

답안 #1079571

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1079571 2024-08-28T17:35:00 Z mindiyak 꿈 (IOI13_dreaming) C++14
47 / 100
 1000 ms 16168 KB 
#include "dreaming.h"
#include <bits/stdc++.h>
#include <string>
#include <iostream>
#include <cmath>
#include <numeric>
#include <iomanip>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pi;
typedef pair<int, int> pl;
typedef pair<ld, ld> pd;
typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<vector<int>> vvi;
typedef vector<ld> vd;
typedef vector<long> vl;
typedef vector<ull> vull;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<vpi> vvpi;
#define FOR(i, a, b) for (int i = a; i < (b); i++)
#define F0R(i, a) for (int i = 0; i < (a); i++)
#define FORd(i, a, b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i, a) for (int i = (a)-1; i >= 0; i--)
#define trav(a, x) for (auto &a : x)
#define uid(a, b) uniform_int_distribution<int>(a, b)(rng)
#define len(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define F first
#define nl endl
#define S second
#define lb lower_bound
#define ub upper_bound
#define aint(x) x.begin(), x.end()
#define raint(x) x.rbegin(), x.rend()
#define ins insert
const int MOD = 1000000007;
 
vi visited;
vvpi paths;
vi prev_arr;
set<int> backtrack;
int node = 0;
int maxdist = 0;
int ans = 0;
int n;

void dij(int pos){
    vi dist(n,-1);
    prev_arr = vi(n,-1);

    queue<int> p;
    p.push(pos);
    dist[pos] = 0;

    while(!p.empty()){
        int a = p.front();p.pop();
        visited[a] = 1;

        for(auto b:paths[a]){
            if(a!= pos && prev_arr[a] == b.F)continue;
            dist[b.F] = dist[a] + b.S;
            p.push(b.F);
            prev_arr[b.F] = a;
        }
    }

    FOR(i,0,n){
        if(dist[i] > maxdist){
            maxdist = dist[i];
            node = i;
        }
    }
}

void dij2(int pos,int mxdst){
    vi dist(n,-1);
    vi dist2(n,-1);
    prev_arr = vi(n,-1);

    queue<int> p;
    p.push(pos);
    dist[pos] = 0;
    dist2[pos] = mxdst;

    while(!p.empty()){
        int a = p.front();p.pop();

        for(auto b:paths[a]){
            if(backtrack.count(b.F) == 0)continue;
            if(a!= pos && prev_arr[a] == b.F)continue;
            
            dist[b.F] = dist[a] + b.S;
            dist2[b.F] = dist2[a] - b.S;
            p.push(b.F);
            prev_arr[b.F] = a;
            if(max(dist[b.F],dist2[b.F]) < maxdist){
                maxdist = max(dist[b.F],dist2[b.F]);
                node = b.F;
            }
        }
    }
}

void go_back(int pos){
    backtrack.insert(pos);
    while(prev_arr[pos] != -1){
        backtrack.insert(prev_arr[pos]);
        pos = prev_arr[pos];
    }
}
 
int travelTime(int N, int m, int L, int A[], int B[], int T[]) {
    if(n==1)return 0;
    n = N;
    paths = vvpi(n);
    visited = vi(n,0);
    vi distances(n,0);
    ans = 0;
 
    FOR(i,0,m){
        paths[A[i]].pb({B[i],T[i]});
        paths[B[i]].pb({A[i],T[i]});
    }
 
    for(int i=0;i<n;i++){
        if(visited[i])continue;
        maxdist = 0;
        node = i;
        dij(i);
        cerr << i << " " << node << " " << maxdist << endl;

        maxdist = 0;
        int head = node;
        node = i;
        dij(head);
        cerr << "width " << head << " " << node << " " << maxdist << endl;

        ans = max(ans,maxdist);

        backtrack.clear();
        go_back(node);

        cerr << "path - ";
        for(int a:backtrack)cerr << a << " ";
        cerr << endl;

        dij2(node,maxdist);       

        head = node;
        maxdist = 0;
        dij(head);

        cerr << "center " << head << " " << maxdist << endl;
        cerr << endl;

        distances[i] = maxdist;

    }

    sort(distances.rbegin(),distances.rend());

    if(m == n-1)return ans;

    ans = max(ans,distances[0]+distances[1]+L);

    return ans;
    
}

Subtask #1
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 315 ms 13532 KB Output is correct
2 Correct 272 ms 14616 KB Output is correct
3 Correct 190 ms 10104 KB Output is correct
4 Correct 36 ms 2492 KB Output is correct
5 Correct 27 ms 1624 KB Output is correct
6 Correct 57 ms 3556 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 120 ms 5764 KB Output is correct
9 Correct 157 ms 7624 KB Output is correct
10 Correct 2 ms 348 KB Output is correct
11 Correct 235 ms 10396 KB Output is correct
12 Correct 247 ms 12284 KB Output is correct
13 Correct 3 ms 348 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 448 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct

Subtask #3
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 315 ms 13532 KB Output is correct
2 Correct 272 ms 14616 KB Output is correct
3 Correct 190 ms 10104 KB Output is correct
4 Correct 36 ms 2492 KB Output is correct
5 Correct 27 ms 1624 KB Output is correct
6 Correct 57 ms 3556 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 120 ms 5764 KB Output is correct
9 Correct 157 ms 7624 KB Output is correct
10 Correct 2 ms 348 KB Output is correct
11 Correct 235 ms 10396 KB Output is correct
12 Correct 247 ms 12284 KB Output is correct
13 Correct 3 ms 348 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 448 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 1 ms 348 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 286 ms 14732 KB Output is correct
40 Correct 290 ms 14672 KB Output is correct
41 Correct 172 ms 9716 KB Output is correct
42 Correct 36 ms 2396 KB Output is correct
43 Correct 1 ms 348 KB Output is correct
44 Correct 0 ms 464 KB Output is correct
45 Correct 1 ms 348 KB Output is correct
46 Correct 1 ms 348 KB Output is correct
47 Correct 0 ms 440 KB Output is correct
48 Correct 0 ms 416 KB Output is correct
49 Correct 1 ms 344 KB Output is correct
50 Correct 1 ms 348 KB Output is correct
51 Correct 0 ms 348 KB Output is correct
52 Correct 0 ms 348 KB Output is correct
53 Correct 1 ms 348 KB Output is correct
54 Correct 0 ms 348 KB Output is correct
55 Correct 0 ms 348 KB Output is correct
56 Correct 1 ms 604 KB Output is correct
57 Correct 55 ms 11556 KB Output is correct
58 Correct 53 ms 11844 KB Output is correct
59 Correct 50 ms 11840 KB Output is correct
60 Correct 50 ms 11852 KB Output is correct
61 Correct 44 ms 11856 KB Output is correct
62 Correct 46 ms 12348 KB Output is correct
63 Correct 43 ms 11236 KB Output is correct
64 Correct 39 ms 11332 KB Output is correct
65 Correct 40 ms 11592 KB Output is correct
66 Correct 41 ms 11588 KB Output is correct
67 Correct 44 ms 11852 KB Output is correct
68 Correct 43 ms 11844 KB Output is correct
69 Correct 51 ms 12128 KB Output is correct
70 Correct 50 ms 12148 KB Output is correct
71 Correct 0 ms 348 KB Output is correct
72 Correct 3 ms 604 KB Output is correct
73 Correct 2 ms 604 KB Output is correct
74 Correct 2 ms 712 KB Output is correct
75 Correct 2 ms 604 KB Output is correct
76 Correct 2 ms 604 KB Output is correct
77 Correct 2 ms 604 KB Output is correct
78 Correct 2 ms 604 KB Output is correct
79 Correct 2 ms 796 KB Output is correct
80 Correct 52 ms 11860 KB Output is correct
81 Correct 49 ms 11864 KB Output is correct
82 Correct 42 ms 11844 KB Output is correct
83 Correct 45 ms 11840 KB Output is correct
84 Correct 1 ms 604 KB Output is correct
85 Correct 1 ms 484 KB Output is correct
86 Correct 2 ms 604 KB Output is correct
87 Correct 2 ms 604 KB Output is correct
88 Correct 2 ms 504 KB Output is correct
89 Correct 2 ms 600 KB Output is correct
90 Correct 2 ms 600 KB Output is correct
91 Correct 1 ms 604 KB Output is correct
92 Correct 2 ms 604 KB Output is correct
93 Correct 2 ms 712 KB Output is correct
94 Correct 1 ms 348 KB Output is correct
95 Correct 0 ms 348 KB Output is correct
96 Correct 0 ms 348 KB Output is correct
97 Correct 1 ms 348 KB Output is correct
98 Correct 1 ms 348 KB Output is correct
99 Correct 1 ms 348 KB Output is correct
100 Correct 1 ms 348 KB Output is correct
101 Correct 0 ms 348 KB Output is correct
102 Correct 1 ms 348 KB Output is correct
103 Correct 1 ms 348 KB Output is correct
104 Correct 27 ms 1628 KB Output is correct
105 Correct 57 ms 3592 KB Output is correct
106 Correct 1 ms 344 KB Output is correct
107 Correct 120 ms 5772 KB Output is correct
108 Correct 149 ms 7768 KB Output is correct
109 Correct 2 ms 348 KB Output is correct
110 Correct 208 ms 10368 KB Output is correct
111 Correct 294 ms 12280 KB Output is correct
112 Correct 3 ms 344 KB Output is correct
113 Correct 305 ms 16168 KB Output is correct

Subtask #4
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 1071 ms 7292 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 448 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 6 ms 348 KB Output is correct
27 Correct 14 ms 660 KB Output is correct
28 Correct 21 ms 788 KB Output is correct
29 Correct 6 ms 344 KB Output is correct
30 Correct 12 ms 856 KB Output is correct
31 Correct 17 ms 604 KB Output is correct
32 Incorrect 5 ms 348 KB Output isn't correct
33 Halted 0 ms 0 KB -

Subtask #6
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 315 ms 13532 KB Output is correct
2 Correct 272 ms 14616 KB Output is correct
3 Correct 190 ms 10104 KB Output is correct
4 Correct 36 ms 2492 KB Output is correct
5 Correct 27 ms 1624 KB Output is correct
6 Correct 57 ms 3556 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 120 ms 5764 KB Output is correct
9 Correct 157 ms 7624 KB Output is correct
10 Correct 2 ms 348 KB Output is correct
11 Correct 235 ms 10396 KB Output is correct
12 Correct 247 ms 12284 KB Output is correct
13 Correct 3 ms 348 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 448 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 1 ms 348 KB Output is correct
34 Correct 1 ms 348 KB Output is correct
35 Correct 0 ms 348 KB Output is correct
36 Correct 1 ms 348 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 286 ms 14732 KB Output is correct
40 Correct 290 ms 14672 KB Output is correct
41 Correct 172 ms 9716 KB Output is correct
42 Correct 36 ms 2396 KB Output is correct
43 Correct 1 ms 348 KB Output is correct
44 Correct 0 ms 464 KB Output is correct
45 Correct 1 ms 348 KB Output is correct
46 Correct 1 ms 348 KB Output is correct
47 Correct 0 ms 440 KB Output is correct
48 Correct 0 ms 416 KB Output is correct
49 Correct 1 ms 344 KB Output is correct
50 Correct 1 ms 348 KB Output is correct
51 Correct 0 ms 348 KB Output is correct
52 Correct 0 ms 348 KB Output is correct
53 Correct 1 ms 348 KB Output is correct
54 Correct 0 ms 348 KB Output is correct
55 Correct 0 ms 348 KB Output is correct
56 Correct 1 ms 604 KB Output is correct
57 Correct 55 ms 11556 KB Output is correct
58 Correct 53 ms 11844 KB Output is correct
59 Correct 50 ms 11840 KB Output is correct
60 Correct 50 ms 11852 KB Output is correct
61 Correct 44 ms 11856 KB Output is correct
62 Correct 46 ms 12348 KB Output is correct
63 Correct 43 ms 11236 KB Output is correct
64 Correct 39 ms 11332 KB Output is correct
65 Correct 40 ms 11592 KB Output is correct
66 Correct 41 ms 11588 KB Output is correct
67 Correct 44 ms 11852 KB Output is correct
68 Correct 43 ms 11844 KB Output is correct
69 Correct 51 ms 12128 KB Output is correct
70 Correct 50 ms 12148 KB Output is correct
71 Correct 0 ms 348 KB Output is correct
72 Correct 3 ms 604 KB Output is correct
73 Correct 2 ms 604 KB Output is correct
74 Correct 2 ms 712 KB Output is correct
75 Correct 2 ms 604 KB Output is correct
76 Correct 2 ms 604 KB Output is correct
77 Correct 2 ms 604 KB Output is correct
78 Correct 2 ms 604 KB Output is correct
79 Correct 2 ms 796 KB Output is correct
80 Correct 52 ms 11860 KB Output is correct
81 Correct 49 ms 11864 KB Output is correct
82 Correct 42 ms 11844 KB Output is correct
83 Correct 45 ms 11840 KB Output is correct
84 Correct 1 ms 604 KB Output is correct
85 Correct 1 ms 484 KB Output is correct
86 Correct 2 ms 604 KB Output is correct
87 Correct 2 ms 604 KB Output is correct
88 Correct 2 ms 504 KB Output is correct
89 Correct 2 ms 600 KB Output is correct
90 Correct 2 ms 600 KB Output is correct
91 Correct 1 ms 604 KB Output is correct
92 Correct 2 ms 604 KB Output is correct
93 Correct 2 ms 712 KB Output is correct
94 Correct 1 ms 348 KB Output is correct
95 Correct 0 ms 348 KB Output is correct
96 Correct 0 ms 348 KB Output is correct
97 Correct 1 ms 348 KB Output is correct
98 Correct 1 ms 348 KB Output is correct
99 Correct 1 ms 348 KB Output is correct
100 Correct 1 ms 348 KB Output is correct
101 Correct 0 ms 348 KB Output is correct
102 Correct 1 ms 348 KB Output is correct
103 Correct 1 ms 348 KB Output is correct
104 Correct 27 ms 1628 KB Output is correct
105 Correct 57 ms 3592 KB Output is correct
106 Correct 1 ms 344 KB Output is correct
107 Correct 120 ms 5772 KB Output is correct
108 Correct 149 ms 7768 KB Output is correct
109 Correct 2 ms 348 KB Output is correct
110 Correct 208 ms 10368 KB Output is correct
111 Correct 294 ms 12280 KB Output is correct
112 Correct 3 ms 344 KB Output is correct
113 Correct 305 ms 16168 KB Output is correct
114 Execution timed out 1071 ms 7292 KB Time limit exceeded
115 Halted 0 ms 0 KB -