oj.uz

답안 #1079616

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1079616 2024-08-28T18:56:38 Z mindiyak 꿈 (IOI13_dreaming) C++14
22 / 100
 1000 ms 22248 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;
int node = 0;
int maxdist = 0;
int ans = 0;
int n;
map<pair<int,int>,int> cons;
 
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;
            if(dist[b.F] > maxdist){
                maxdist = dist[b.F];
                node = b.F;
            }
        }
    }
}

void dij2(int pos,int prev,int len){
    if(len > maxdist){
        maxdist = len;
        node = pos;
    }
    cerr << pos  << " " << prev << endl;
    visited[pos] = 1;

    for(auto a:paths[pos]){
        if(a.F == prev)continue;
        cerr << "s " << a.F << " " << pos << endl;
        prev_arr[a.F] = pos;
        dij2(a.F,pos,len+a.S);
    }
}

void go_back(int pos,int counter1){
    int counter2 = 0;

    while(prev_arr[pos] != -1){
        cerr << pos << " " << prev_arr[pos] << endl;
        counter1 -= cons[{min(pos,prev_arr[pos]),max(pos,prev_arr[pos])}];
        counter2 += cons[{min(pos,prev_arr[pos]),max(pos,prev_arr[pos])}];
        maxdist = min(max(counter1,counter2),maxdist);

        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){
        cons[{min(A[i],B[i]),max(A[i],B[i])}] = T[i];
        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;
        prev_arr = vi(n,-1);
        dij2(i,-1,0);

        cerr << "end " << node << " " << maxdist << endl;
 
        maxdist = 0;
        int head = node;
        node = i;
        prev_arr = vi(n,-1);
        dij2(head,-1,0);

        cerr << "start " << node << " " << maxdist << endl;

        ans = max(ans,maxdist);
 
        go_back(node,maxdist);

        cerr << "finish " << maxdist << endl << 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
0 / 14.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
0 / 23.0

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

Subtask #4
0 / 18.0

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

Subtask #5
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 348 KB Output is correct
2 Correct 2 ms 348 KB Output is correct
3 Correct 2 ms 348 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 2 ms 348 KB Output is correct
6 Correct 2 ms 476 KB Output is correct
7 Correct 2 ms 348 KB Output is correct
8 Correct 2 ms 344 KB Output is correct
9 Correct 2 ms 448 KB Output is correct
10 Correct 2 ms 348 KB Output is correct
11 Correct 2 ms 348 KB Output is correct
12 Correct 2 ms 464 KB Output is correct
13 Correct 3 ms 344 KB Output is correct
14 Correct 2 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 2 ms 348 KB Output is correct
17 Correct 2 ms 348 KB Output is correct
18 Correct 2 ms 348 KB Output is correct
19 Correct 2 ms 468 KB Output is correct
20 Correct 2 ms 348 KB Output is correct
21 Correct 2 ms 348 KB Output is correct
22 Correct 2 ms 348 KB Output is correct
23 Correct 2 ms 348 KB Output is correct
24 Correct 2 ms 348 KB Output is correct
25 Correct 2 ms 348 KB Output is correct
26 Correct 21 ms 604 KB Output is correct
27 Correct 40 ms 800 KB Output is correct
28 Correct 62 ms 860 KB Output is correct
29 Correct 20 ms 604 KB Output is correct
30 Correct 41 ms 752 KB Output is correct
31 Correct 61 ms 988 KB Output is correct
32 Correct 20 ms 604 KB Output is correct
33 Correct 40 ms 832 KB Output is correct
34 Correct 60 ms 944 KB Output is correct
35 Correct 1 ms 348 KB Output is correct
36 Correct 2 ms 348 KB Output is correct
37 Correct 2 ms 348 KB Output is correct
38 Correct 2 ms 348 KB Output is correct
39 Correct 2 ms 464 KB Output is correct
40 Correct 3 ms 348 KB Output is correct
41 Correct 3 ms 348 KB Output is correct
42 Correct 2 ms 348 KB Output is correct
43 Correct 2 ms 348 KB Output is correct
44 Correct 2 ms 348 KB Output is correct
45 Correct 2 ms 344 KB Output is correct
46 Correct 2 ms 348 KB Output is correct
47 Correct 2 ms 348 KB Output is correct
48 Correct 2 ms 348 KB Output is correct
49 Correct 2 ms 348 KB Output is correct
50 Correct 2 ms 348 KB Output is correct
51 Correct 2 ms 348 KB Output is correct
52 Correct 1 ms 344 KB Output is correct
53 Correct 1 ms 348 KB Output is correct
54 Correct 65 ms 1120 KB Output is correct
55 Correct 64 ms 1104 KB Output is correct
56 Correct 65 ms 852 KB Output is correct
57 Correct 66 ms 604 KB Output is correct
58 Correct 56 ms 988 KB Output is correct
59 Correct 58 ms 856 KB Output is correct
60 Correct 65 ms 772 KB Output is correct
61 Correct 67 ms 604 KB Output is correct
62 Correct 56 ms 860 KB Output is correct
63 Correct 55 ms 856 KB Output is correct
64 Correct 70 ms 604 KB Output is correct
65 Correct 64 ms 896 KB Output is correct
66 Correct 53 ms 996 KB Output is correct
67 Correct 55 ms 856 KB Output is correct
68 Correct 65 ms 852 KB Output is correct
69 Correct 69 ms 928 KB Output is correct
70 Correct 64 ms 756 KB Output is correct
71 Correct 65 ms 604 KB Output is correct
72 Correct 54 ms 856 KB Output is correct
73 Correct 54 ms 856 KB Output is correct
74 Correct 74 ms 860 KB Output is correct
75 Correct 64 ms 860 KB Output is correct
76 Correct 55 ms 1036 KB Output is correct
77 Correct 54 ms 860 KB Output is correct
78 Correct 65 ms 804 KB Output is correct
79 Correct 67 ms 604 KB Output is correct
80 Correct 69 ms 652 KB Output is correct
81 Correct 63 ms 664 KB Output is correct
82 Correct 63 ms 988 KB Output is correct
83 Correct 65 ms 856 KB Output is correct
84 Correct 70 ms 804 KB Output is correct
85 Correct 68 ms 604 KB Output is correct
86 Correct 59 ms 856 KB Output is correct
87 Correct 57 ms 932 KB Output is correct
88 Correct 66 ms 848 KB Output is correct
89 Correct 67 ms 848 KB Output is correct
90 Correct 64 ms 848 KB Output is correct
91 Correct 64 ms 604 KB Output is correct
92 Correct 42 ms 860 KB Output is correct
93 Correct 38 ms 848 KB Output is correct
94 Correct 43 ms 860 KB Output is correct
95 Correct 47 ms 856 KB Output is correct
96 Correct 48 ms 916 KB Output is correct
97 Correct 49 ms 948 KB Output is correct
98 Correct 46 ms 928 KB Output is correct
99 Correct 63 ms 856 KB Output is correct
100 Correct 54 ms 916 KB Output is correct
101 Correct 48 ms 956 KB Output is correct
102 Correct 2 ms 348 KB Output is correct
103 Correct 2 ms 348 KB Output is correct
104 Correct 2 ms 468 KB Output is correct
105 Correct 2 ms 348 KB Output is correct
106 Correct 2 ms 348 KB Output is correct
107 Correct 2 ms 348 KB Output is correct
108 Correct 2 ms 348 KB Output is correct
109 Correct 2 ms 348 KB Output is correct
110 Correct 2 ms 348 KB Output is correct
111 Correct 3 ms 348 KB Output is correct
112 Correct 7 ms 512 KB Output is correct
113 Correct 13 ms 584 KB Output is correct
114 Correct 23 ms 600 KB Output is correct

Subtask #6
0 / 23.0

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