oj.uz

답안 #587886

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
587886 2022-07-02T13:27:50 Z MrDeboo 꿈 (IOI13_dreaming) C++17
22 / 100
 1000 ms 7368 KB 
#include "dreaming.h"
#include <bits/stdc++.h>
using namespace std;
int travelTime(int n, int m, int l, int a[], int b[], int t[]){
    vector<pair<int,int>>vct[n];
    for(int i=0;i<m;i++){
        vct[a[i]].push_back({b[i],t[i]});
        vct[b[i]].push_back({a[i],t[i]});
    }
    int ans=0;
    deque<int>v;
    vector<int>vis(n);
    for(int i=0;i<n;i++){
        if(vis[i])continue;
        vis[i]=1;
        vector<int>vc={i};
        {
            deque<int>dq={i};
            while(dq.size()){
                int a=dq.front();
                dq.pop_front();
                for(auto &w:vct[a]){
                    if(!vis[w.first]){
                        vis[w.first]=1;
                        dq.push_back(w.first);
                        vc.push_back(w.first);
                    }
                }
            }
        }
        int f=INT_MAX,ff=0;
        for(auto &w:vc){
            vector<bool>vv(n);
            priority_queue<pair<int,int>,vector<pair<int,int>>,greater<pair<int,int>>>dq;
            dq.push({w,0});
            int g=0;
            while(dq.size()){
                int a=dq.top().first,b=dq.top().second;
                dq.pop();
                if(vv[a])continue;
                vv[a]=1;
                g=max(g,b);
                for(auto &j:vct[a]){
                    if(!vv[j.first]){
                        dq.push({j.first,j.second+b});
                    }
                }
            }
            ff=max(ff,g);
            f=min(f,g);
        }
        ans=max(ans,ff);
        v.push_back(f);
    }
    while(v.size()>1){
        sort(v.begin(),v.end());
        ans=max(ans,v.back()+v[0]+l);
        v.back()=max(v.back(),v[0]+l);
        v.pop_front();
    }
    return ans;
}

Subtask #1
0 / 14.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
0 / 23.0

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

Subtask #4
0 / 18.0

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

Subtask #5
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 272 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 324 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 2 ms 340 KB Output is correct
27 Correct 5 ms 340 KB Output is correct
28 Correct 10 ms 468 KB Output is correct
29 Correct 2 ms 340 KB Output is correct
30 Correct 7 ms 448 KB Output is correct
31 Correct 15 ms 468 KB Output is correct
32 Correct 3 ms 396 KB Output is correct
33 Correct 10 ms 484 KB Output is correct
34 Correct 20 ms 580 KB Output is correct
35 Correct 1 ms 308 KB Output is correct
36 Correct 1 ms 212 KB Output is correct
37 Correct 1 ms 212 KB Output is correct
38 Correct 1 ms 212 KB Output is correct
39 Correct 1 ms 212 KB Output is correct
40 Correct 1 ms 212 KB Output is correct
41 Correct 1 ms 308 KB Output is correct
42 Correct 1 ms 280 KB Output is correct
43 Correct 1 ms 304 KB Output is correct
44 Correct 1 ms 212 KB Output is correct
45 Correct 1 ms 308 KB Output is correct
46 Correct 1 ms 212 KB Output is correct
47 Correct 1 ms 308 KB Output is correct
48 Correct 1 ms 304 KB Output is correct
49 Correct 1 ms 212 KB Output is correct
50 Correct 1 ms 212 KB Output is correct
51 Correct 1 ms 212 KB Output is correct
52 Correct 1 ms 212 KB Output is correct
53 Correct 0 ms 212 KB Output is correct
54 Correct 273 ms 584 KB Output is correct
55 Correct 276 ms 564 KB Output is correct
56 Correct 14 ms 468 KB Output is correct
57 Correct 41 ms 436 KB Output is correct
58 Correct 280 ms 576 KB Output is correct
59 Correct 352 ms 596 KB Output is correct
60 Correct 24 ms 468 KB Output is correct
61 Correct 36 ms 444 KB Output is correct
62 Correct 206 ms 568 KB Output is correct
63 Correct 219 ms 572 KB Output is correct
64 Correct 53 ms 340 KB Output is correct
65 Correct 13 ms 468 KB Output is correct
66 Correct 598 ms 596 KB Output is correct
67 Correct 289 ms 468 KB Output is correct
68 Correct 10 ms 468 KB Output is correct
69 Correct 9 ms 444 KB Output is correct
70 Correct 33 ms 468 KB Output is correct
71 Correct 30 ms 468 KB Output is correct
72 Correct 399 ms 592 KB Output is correct
73 Correct 400 ms 596 KB Output is correct
74 Correct 5 ms 468 KB Output is correct
75 Correct 7 ms 596 KB Output is correct
76 Correct 254 ms 696 KB Output is correct
77 Correct 319 ms 596 KB Output is correct
78 Correct 32 ms 452 KB Output is correct
79 Correct 31 ms 468 KB Output is correct
80 Correct 56 ms 400 KB Output is correct
81 Correct 61 ms 388 KB Output is correct
82 Correct 4 ms 468 KB Output is correct
83 Correct 4 ms 444 KB Output is correct
84 Correct 66 ms 468 KB Output is correct
85 Correct 55 ms 416 KB Output is correct
86 Correct 184 ms 468 KB Output is correct
87 Correct 439 ms 468 KB Output is correct
88 Correct 11 ms 468 KB Output is correct
89 Correct 14 ms 520 KB Output is correct
90 Correct 34 ms 468 KB Output is correct
91 Correct 31 ms 480 KB Output is correct
92 Correct 201 ms 540 KB Output is correct
93 Correct 246 ms 508 KB Output is correct
94 Correct 207 ms 468 KB Output is correct
95 Correct 186 ms 592 KB Output is correct
96 Correct 235 ms 552 KB Output is correct
97 Correct 215 ms 468 KB Output is correct
98 Correct 203 ms 532 KB Output is correct
99 Correct 474 ms 596 KB Output is correct
100 Correct 315 ms 564 KB Output is correct
101 Correct 252 ms 536 KB Output is correct
102 Correct 1 ms 212 KB Output is correct
103 Correct 1 ms 212 KB Output is correct
104 Correct 1 ms 212 KB Output is correct
105 Correct 1 ms 212 KB Output is correct
106 Correct 1 ms 212 KB Output is correct
107 Correct 1 ms 312 KB Output is correct
108 Correct 1 ms 212 KB Output is correct
109 Correct 1 ms 212 KB Output is correct
110 Correct 1 ms 212 KB Output is correct
111 Correct 1 ms 212 KB Output is correct
112 Correct 3 ms 340 KB Output is correct
113 Correct 13 ms 368 KB Output is correct
114 Correct 17 ms 376 KB Output is correct

Subtask #6
0 / 23.0

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