oj.uz

답안 #1079600

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1079600 2024-08-28T18:29:40 Z mindiyak 꿈 (IOI13_dreaming) C++14
47 / 100
 1000 ms 12720 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,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[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[pos]=1;
    while(prev_arr[pos] != -1){
        backtrack[prev_arr[pos]]=1;
        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;
    int cnt = 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 = vi(n,0);
        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;
        cnt += 1;
    }
 
    sort(distances.rbegin(),distances.rend());
 
    if(m == n-1)return ans;
 
    if(cnt >= 2)ans = max(ans,distances[0]+distances[1]+L);
    if(cnt >= 3)ans = max(ans,distances[1]+distances[2]+L+L);

    return ans;
    
}

Subtask #1
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 451 ms 10552 KB Output is correct
2 Correct 471 ms 10376 KB Output is correct
3 Correct 280 ms 7200 KB Output is correct
4 Correct 106 ms 1816 KB Output is correct
5 Correct 64 ms 1372 KB Output is correct
6 Correct 91 ms 2676 KB Output is correct
7 Correct 3 ms 348 KB Output is correct
8 Correct 181 ms 4884 KB Output is correct
9 Correct 270 ms 6044 KB Output is correct
10 Correct 4 ms 520 KB Output is correct
11 Correct 439 ms 8224 KB Output is correct
12 Correct 455 ms 9252 KB Output is correct
13 Correct 5 ms 360 KB Output is correct

Subtask #2
10.0 / 10.0

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

Subtask #3
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 451 ms 10552 KB Output is correct
2 Correct 471 ms 10376 KB Output is correct
3 Correct 280 ms 7200 KB Output is correct
4 Correct 106 ms 1816 KB Output is correct
5 Correct 64 ms 1372 KB Output is correct
6 Correct 91 ms 2676 KB Output is correct
7 Correct 3 ms 348 KB Output is correct
8 Correct 181 ms 4884 KB Output is correct
9 Correct 270 ms 6044 KB Output is correct
10 Correct 4 ms 520 KB Output is correct
11 Correct 439 ms 8224 KB Output is correct
12 Correct 455 ms 9252 KB Output is correct
13 Correct 5 ms 360 KB Output is correct
14 Correct 1 ms 456 KB Output is correct
15 Correct 1 ms 360 KB Output is correct
16 Correct 1 ms 360 KB Output is correct
17 Correct 1 ms 360 KB Output is correct
18 Correct 1 ms 360 KB Output is correct
19 Correct 1 ms 360 KB Output is correct
20 Correct 1 ms 472 KB Output is correct
21 Correct 1 ms 460 KB Output is correct
22 Correct 1 ms 360 KB Output is correct
23 Correct 1 ms 512 KB Output is correct
24 Correct 2 ms 360 KB Output is correct
25 Correct 1 ms 360 KB Output is correct
26 Correct 1 ms 360 KB Output is correct
27 Correct 1 ms 456 KB Output is correct
28 Correct 1 ms 360 KB Output is correct
29 Correct 2 ms 360 KB Output is correct
30 Correct 1 ms 360 KB Output is correct
31 Correct 1 ms 360 KB Output is correct
32 Correct 1 ms 504 KB Output is correct
33 Correct 1 ms 360 KB Output is correct
34 Correct 1 ms 360 KB Output is correct
35 Correct 1 ms 360 KB Output is correct
36 Correct 1 ms 360 KB Output is correct
37 Correct 1 ms 452 KB Output is correct
38 Correct 1 ms 348 KB Output is correct
39 Correct 463 ms 10544 KB Output is correct
40 Correct 579 ms 10380 KB Output is correct
41 Correct 359 ms 7208 KB Output is correct
42 Correct 99 ms 1876 KB Output is correct
43 Correct 1 ms 864 KB Output is correct
44 Correct 1 ms 348 KB Output is correct
45 Correct 2 ms 636 KB Output is correct
46 Correct 1 ms 476 KB Output is correct
47 Correct 2 ms 356 KB Output is correct
48 Correct 2 ms 348 KB Output is correct
49 Correct 1 ms 348 KB Output is correct
50 Correct 1 ms 452 KB Output is correct
51 Correct 1 ms 348 KB Output is correct
52 Correct 2 ms 356 KB Output is correct
53 Correct 2 ms 360 KB Output is correct
54 Correct 1 ms 348 KB Output is correct
55 Correct 1 ms 356 KB Output is correct
56 Correct 1 ms 356 KB Output is correct
57 Correct 620 ms 12384 KB Output is correct
58 Correct 536 ms 12256 KB Output is correct
59 Correct 489 ms 12204 KB Output is correct
60 Correct 573 ms 12208 KB Output is correct
61 Correct 488 ms 12376 KB Output is correct
62 Correct 510 ms 12720 KB Output is correct
63 Correct 516 ms 11972 KB Output is correct
64 Correct 452 ms 11920 KB Output is correct
65 Correct 454 ms 12200 KB Output is correct
66 Correct 440 ms 12432 KB Output is correct
67 Correct 427 ms 12036 KB Output is correct
68 Correct 432 ms 12208 KB Output is correct
69 Correct 418 ms 12468 KB Output is correct
70 Correct 424 ms 12376 KB Output is correct
71 Correct 0 ms 856 KB Output is correct
72 Correct 13 ms 756 KB Output is correct
73 Correct 13 ms 604 KB Output is correct
74 Correct 13 ms 768 KB Output is correct
75 Correct 13 ms 604 KB Output is correct
76 Correct 15 ms 600 KB Output is correct
77 Correct 13 ms 604 KB Output is correct
78 Correct 13 ms 604 KB Output is correct
79 Correct 13 ms 604 KB Output is correct
80 Correct 433 ms 12116 KB Output is correct
81 Correct 431 ms 12104 KB Output is correct
82 Correct 427 ms 12212 KB Output is correct
83 Correct 424 ms 12236 KB Output is correct
84 Correct 10 ms 604 KB Output is correct
85 Correct 9 ms 604 KB Output is correct
86 Correct 10 ms 724 KB Output is correct
87 Correct 15 ms 716 KB Output is correct
88 Correct 11 ms 732 KB Output is correct
89 Correct 11 ms 604 KB Output is correct
90 Correct 12 ms 604 KB Output is correct
91 Correct 19 ms 764 KB Output is correct
92 Correct 15 ms 896 KB Output is correct
93 Correct 11 ms 604 KB Output is correct
94 Correct 1 ms 348 KB Output is correct
95 Correct 1 ms 348 KB Output is correct
96 Correct 1 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 440 KB Output is correct
101 Correct 1 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 43 ms 1472 KB Output is correct
105 Correct 86 ms 2640 KB Output is correct
106 Correct 2 ms 344 KB Output is correct
107 Correct 202 ms 4656 KB Output is correct
108 Correct 220 ms 5788 KB Output is correct
109 Correct 3 ms 348 KB Output is correct
110 Correct 333 ms 8428 KB Output is correct
111 Correct 390 ms 9280 KB Output is correct
112 Correct 4 ms 348 KB Output is correct
113 Correct 468 ms 11648 KB Output is correct

Subtask #4
0 / 18.0

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

Subtask #5
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 456 KB Output is correct
2 Correct 1 ms 360 KB Output is correct
3 Correct 1 ms 360 KB Output is correct
4 Correct 1 ms 360 KB Output is correct
5 Correct 1 ms 360 KB Output is correct
6 Correct 1 ms 360 KB Output is correct
7 Correct 1 ms 472 KB Output is correct
8 Correct 1 ms 460 KB Output is correct
9 Correct 1 ms 360 KB Output is correct
10 Correct 1 ms 512 KB Output is correct
11 Correct 2 ms 360 KB Output is correct
12 Correct 1 ms 360 KB Output is correct
13 Correct 1 ms 360 KB Output is correct
14 Correct 1 ms 456 KB Output is correct
15 Correct 1 ms 360 KB Output is correct
16 Correct 2 ms 360 KB Output is correct
17 Correct 1 ms 360 KB Output is correct
18 Correct 1 ms 360 KB Output is correct
19 Correct 1 ms 504 KB Output is correct
20 Correct 1 ms 360 KB Output is correct
21 Correct 1 ms 360 KB Output is correct
22 Correct 1 ms 360 KB Output is correct
23 Correct 1 ms 360 KB Output is correct
24 Correct 1 ms 452 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 370 ms 792 KB Output is correct
27 Execution timed out 1056 ms 1424 KB Time limit exceeded
28 Halted 0 ms 0 KB -

Subtask #6
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 451 ms 10552 KB Output is correct
2 Correct 471 ms 10376 KB Output is correct
3 Correct 280 ms 7200 KB Output is correct
4 Correct 106 ms 1816 KB Output is correct
5 Correct 64 ms 1372 KB Output is correct
6 Correct 91 ms 2676 KB Output is correct
7 Correct 3 ms 348 KB Output is correct
8 Correct 181 ms 4884 KB Output is correct
9 Correct 270 ms 6044 KB Output is correct
10 Correct 4 ms 520 KB Output is correct
11 Correct 439 ms 8224 KB Output is correct
12 Correct 455 ms 9252 KB Output is correct
13 Correct 5 ms 360 KB Output is correct
14 Correct 1 ms 456 KB Output is correct
15 Correct 1 ms 360 KB Output is correct
16 Correct 1 ms 360 KB Output is correct
17 Correct 1 ms 360 KB Output is correct
18 Correct 1 ms 360 KB Output is correct
19 Correct 1 ms 360 KB Output is correct
20 Correct 1 ms 472 KB Output is correct
21 Correct 1 ms 460 KB Output is correct
22 Correct 1 ms 360 KB Output is correct
23 Correct 1 ms 512 KB Output is correct
24 Correct 2 ms 360 KB Output is correct
25 Correct 1 ms 360 KB Output is correct
26 Correct 1 ms 360 KB Output is correct
27 Correct 1 ms 456 KB Output is correct
28 Correct 1 ms 360 KB Output is correct
29 Correct 2 ms 360 KB Output is correct
30 Correct 1 ms 360 KB Output is correct
31 Correct 1 ms 360 KB Output is correct
32 Correct 1 ms 504 KB Output is correct
33 Correct 1 ms 360 KB Output is correct
34 Correct 1 ms 360 KB Output is correct
35 Correct 1 ms 360 KB Output is correct
36 Correct 1 ms 360 KB Output is correct
37 Correct 1 ms 452 KB Output is correct
38 Correct 1 ms 348 KB Output is correct
39 Correct 463 ms 10544 KB Output is correct
40 Correct 579 ms 10380 KB Output is correct
41 Correct 359 ms 7208 KB Output is correct
42 Correct 99 ms 1876 KB Output is correct
43 Correct 1 ms 864 KB Output is correct
44 Correct 1 ms 348 KB Output is correct
45 Correct 2 ms 636 KB Output is correct
46 Correct 1 ms 476 KB Output is correct
47 Correct 2 ms 356 KB Output is correct
48 Correct 2 ms 348 KB Output is correct
49 Correct 1 ms 348 KB Output is correct
50 Correct 1 ms 452 KB Output is correct
51 Correct 1 ms 348 KB Output is correct
52 Correct 2 ms 356 KB Output is correct
53 Correct 2 ms 360 KB Output is correct
54 Correct 1 ms 348 KB Output is correct
55 Correct 1 ms 356 KB Output is correct
56 Correct 1 ms 356 KB Output is correct
57 Correct 620 ms 12384 KB Output is correct
58 Correct 536 ms 12256 KB Output is correct
59 Correct 489 ms 12204 KB Output is correct
60 Correct 573 ms 12208 KB Output is correct
61 Correct 488 ms 12376 KB Output is correct
62 Correct 510 ms 12720 KB Output is correct
63 Correct 516 ms 11972 KB Output is correct
64 Correct 452 ms 11920 KB Output is correct
65 Correct 454 ms 12200 KB Output is correct
66 Correct 440 ms 12432 KB Output is correct
67 Correct 427 ms 12036 KB Output is correct
68 Correct 432 ms 12208 KB Output is correct
69 Correct 418 ms 12468 KB Output is correct
70 Correct 424 ms 12376 KB Output is correct
71 Correct 0 ms 856 KB Output is correct
72 Correct 13 ms 756 KB Output is correct
73 Correct 13 ms 604 KB Output is correct
74 Correct 13 ms 768 KB Output is correct
75 Correct 13 ms 604 KB Output is correct
76 Correct 15 ms 600 KB Output is correct
77 Correct 13 ms 604 KB Output is correct
78 Correct 13 ms 604 KB Output is correct
79 Correct 13 ms 604 KB Output is correct
80 Correct 433 ms 12116 KB Output is correct
81 Correct 431 ms 12104 KB Output is correct
82 Correct 427 ms 12212 KB Output is correct
83 Correct 424 ms 12236 KB Output is correct
84 Correct 10 ms 604 KB Output is correct
85 Correct 9 ms 604 KB Output is correct
86 Correct 10 ms 724 KB Output is correct
87 Correct 15 ms 716 KB Output is correct
88 Correct 11 ms 732 KB Output is correct
89 Correct 11 ms 604 KB Output is correct
90 Correct 12 ms 604 KB Output is correct
91 Correct 19 ms 764 KB Output is correct
92 Correct 15 ms 896 KB Output is correct
93 Correct 11 ms 604 KB Output is correct
94 Correct 1 ms 348 KB Output is correct
95 Correct 1 ms 348 KB Output is correct
96 Correct 1 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 440 KB Output is correct
101 Correct 1 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 43 ms 1472 KB Output is correct
105 Correct 86 ms 2640 KB Output is correct
106 Correct 2 ms 344 KB Output is correct
107 Correct 202 ms 4656 KB Output is correct
108 Correct 220 ms 5788 KB Output is correct
109 Correct 3 ms 348 KB Output is correct
110 Correct 333 ms 8428 KB Output is correct
111 Correct 390 ms 9280 KB Output is correct
112 Correct 4 ms 348 KB Output is correct
113 Correct 468 ms 11648 KB Output is correct
114 Execution timed out 1058 ms 8892 KB Time limit exceeded
115 Halted 0 ms 0 KB -