oj.uz

답안 #635658

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
635658 2022-08-26T15:27:36 Z shafinalam 꿈 (IOI13_dreaming) C++14
47 / 100
 103 ms 14924 KB 
#define F first
#define S second
#define rep(i,a,b) for(int i=a;!(a==b&&i!=b)&&((i<=b&&b>=a)||(i>=b&&a>=b));i+=(a<=b?1:-1))
#define pb push_back
#define Fbitl __builtin_ffs
#define bit1 __builtin_popcount
#include <iostream>
#include <math.h>
#include <algorithm>
#include <string.h>
#include <vector>
#include <queue>
#include <map>
#include <unordered_map>
 
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<string, string> pss;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vii;
typedef vector<ll> vl;
typedef vector<vl> vvl;
bool visa[(int)1e6];
#include "dreaming.h"
const int Ne = 1e5 + 5;
int mx, idmx;
int mxres;
bool th = false;
vii x[Ne];
vii res;
int R;
int mn = 1e9 , idmn = 1e9;
int dfs(int idx, int cst, int prnt) {
    int res = 0;
    visa[idx] = true;
    if (idx == R&&th) {
        return cst;
    }
    for (auto i : x[idx]) {
        if (i.first == prnt) continue;
        res += dfs(i.first, cst + i.second, idx);
    }
    if (res > 0) {
        int mex = max(cst,mx-cst);
        if (mex < mn) {
            mn = mex;
            idmn = idx;
        }
        return cst;
    }
    if (mx < cst) {
        mx = cst;
        idmx = idx;
    }
    if ( cst == 0 && !th) return idmx;
    if (th) {
        return 0;
    }
    return 0;
}
int travelTime(int N, int M, int L, int A[], int B[], int T[]) {
    for (int i = 0; i < M; i++) {
        x[A[i]].push_back({ B[i],T[i] });
        x[B[i]].push_back({ A[i],T[i] });
    }
    for (int i = 0; i < N; i++) {
        if (visa[i]) continue;
        th = false;
        mx = 0; idmx = 0;
        int a = dfs(i, 0, -1);
        mx = 0; idmx = 0;
        int b = dfs(a, 0, -1);
        mxres = max(mxres, mx);
        if (x[i].empty()) {
            res.push_back({ 0,i });
            continue;
        }
        th = true;
        R = b;
        mn = 1e9, idmn = 1e9;
        dfs(a, 0, -1);
        res.push_back({mn,idmn});
    }
    sort(res.begin(), res.end());
    for (int i = 0; i < res.size() - 1; i++) {
        x[res[i].second].push_back({res[res.size()-1].second,L});
        //cout << res[i].second << " ";
    }
   
    mx = 0;
    for (int i = res.size()-1; i >= res.size() - 2 && i >= 0; i--,mx+=L) {
        mx += res[i].first;
    }
    mx -= L;
    return max(mxres,mx);
}

Compilation message

dreaming.cpp: In function 'int travelTime(int, int, int, int*, int*, int*)':
dreaming.cpp:88:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   88 |     for (int i = 0; i < res.size() - 1; i++) {
      |                     ~~^~~~~~~~~~~~~~~~
dreaming.cpp:94:34: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   94 |     for (int i = res.size()-1; i >= res.size() - 2 && i >= 0; i--,mx+=L) {
      |                                ~~^~~~~~~~~~~~~~~~~

Subtask #1
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 42 ms 12360 KB Output is correct
2 Correct 57 ms 13500 KB Output is correct
3 Correct 35 ms 9904 KB Output is correct
4 Correct 9 ms 4232 KB Output is correct
5 Correct 6 ms 3540 KB Output is correct
6 Correct 14 ms 4984 KB Output is correct
7 Correct 2 ms 2644 KB Output is correct
8 Correct 23 ms 6488 KB Output is correct
9 Correct 31 ms 7972 KB Output is correct
10 Correct 2 ms 2644 KB Output is correct
11 Correct 45 ms 9748 KB Output is correct
12 Correct 60 ms 11540 KB Output is correct
13 Correct 2 ms 2676 KB Output is correct

Subtask #2
10.0 / 10.0

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

Subtask #3
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 42 ms 12360 KB Output is correct
2 Correct 57 ms 13500 KB Output is correct
3 Correct 35 ms 9904 KB Output is correct
4 Correct 9 ms 4232 KB Output is correct
5 Correct 6 ms 3540 KB Output is correct
6 Correct 14 ms 4984 KB Output is correct
7 Correct 2 ms 2644 KB Output is correct
8 Correct 23 ms 6488 KB Output is correct
9 Correct 31 ms 7972 KB Output is correct
10 Correct 2 ms 2644 KB Output is correct
11 Correct 45 ms 9748 KB Output is correct
12 Correct 60 ms 11540 KB Output is correct
13 Correct 2 ms 2676 KB Output is correct
14 Correct 2 ms 2644 KB Output is correct
15 Correct 2 ms 2644 KB Output is correct
16 Correct 2 ms 2636 KB Output is correct
17 Correct 2 ms 2644 KB Output is correct
18 Correct 2 ms 2644 KB Output is correct
19 Correct 2 ms 2644 KB Output is correct
20 Correct 2 ms 2644 KB Output is correct
21 Correct 2 ms 2664 KB Output is correct
22 Correct 2 ms 2644 KB Output is correct
23 Correct 2 ms 2644 KB Output is correct
24 Correct 2 ms 2644 KB Output is correct
25 Correct 2 ms 2620 KB Output is correct
26 Correct 2 ms 2644 KB Output is correct
27 Correct 2 ms 2644 KB Output is correct
28 Correct 2 ms 2664 KB Output is correct
29 Correct 2 ms 2644 KB Output is correct
30 Correct 2 ms 2644 KB Output is correct
31 Correct 2 ms 2644 KB Output is correct
32 Correct 2 ms 2660 KB Output is correct
33 Correct 2 ms 2644 KB Output is correct
34 Correct 2 ms 2664 KB Output is correct
35 Correct 2 ms 2644 KB Output is correct
36 Correct 1 ms 2644 KB Output is correct
37 Correct 2 ms 2644 KB Output is correct
38 Correct 2 ms 2688 KB Output is correct
39 Correct 49 ms 13580 KB Output is correct
40 Correct 50 ms 13484 KB Output is correct
41 Correct 31 ms 9892 KB Output is correct
42 Correct 9 ms 4180 KB Output is correct
43 Correct 2 ms 2644 KB Output is correct
44 Correct 2 ms 2656 KB Output is correct
45 Correct 2 ms 2644 KB Output is correct
46 Correct 2 ms 2660 KB Output is correct
47 Correct 2 ms 2644 KB Output is correct
48 Correct 2 ms 2688 KB Output is correct
49 Correct 2 ms 2644 KB Output is correct
50 Correct 2 ms 2644 KB Output is correct
51 Correct 2 ms 2644 KB Output is correct
52 Correct 2 ms 2660 KB Output is correct
53 Correct 2 ms 2644 KB Output is correct
54 Correct 2 ms 2644 KB Output is correct
55 Correct 2 ms 2644 KB Output is correct
56 Correct 2 ms 2668 KB Output is correct
57 Correct 57 ms 9312 KB Output is correct
58 Correct 59 ms 9164 KB Output is correct
59 Correct 59 ms 9100 KB Output is correct
60 Correct 56 ms 9172 KB Output is correct
61 Correct 54 ms 9184 KB Output is correct
62 Correct 53 ms 9196 KB Output is correct
63 Correct 50 ms 8840 KB Output is correct
64 Correct 57 ms 8848 KB Output is correct
65 Correct 53 ms 9180 KB Output is correct
66 Correct 55 ms 9148 KB Output is correct
67 Correct 55 ms 9092 KB Output is correct
68 Correct 57 ms 9184 KB Output is correct
69 Correct 63 ms 9384 KB Output is correct
70 Correct 60 ms 9400 KB Output is correct
71 Correct 2 ms 2644 KB Output is correct
72 Correct 2 ms 2772 KB Output is correct
73 Correct 3 ms 2772 KB Output is correct
74 Correct 3 ms 2772 KB Output is correct
75 Correct 3 ms 2804 KB Output is correct
76 Correct 3 ms 2772 KB Output is correct
77 Correct 3 ms 2772 KB Output is correct
78 Correct 3 ms 2804 KB Output is correct
79 Correct 3 ms 2772 KB Output is correct
80 Correct 55 ms 9152 KB Output is correct
81 Correct 68 ms 9152 KB Output is correct
82 Correct 69 ms 9288 KB Output is correct
83 Correct 55 ms 9240 KB Output is correct
84 Correct 2 ms 2804 KB Output is correct
85 Correct 2 ms 2772 KB Output is correct
86 Correct 2 ms 2772 KB Output is correct
87 Correct 3 ms 2772 KB Output is correct
88 Correct 3 ms 2772 KB Output is correct
89 Correct 3 ms 2772 KB Output is correct
90 Correct 4 ms 2804 KB Output is correct
91 Correct 3 ms 2772 KB Output is correct
92 Correct 3 ms 2772 KB Output is correct
93 Correct 3 ms 2772 KB Output is correct
94 Correct 2 ms 2644 KB Output is correct
95 Correct 2 ms 2644 KB Output is correct
96 Correct 2 ms 2660 KB Output is correct
97 Correct 2 ms 2644 KB Output is correct
98 Correct 2 ms 2644 KB Output is correct
99 Correct 2 ms 2644 KB Output is correct
100 Correct 1 ms 2644 KB Output is correct
101 Correct 2 ms 2644 KB Output is correct
102 Correct 2 ms 2644 KB Output is correct
103 Correct 2 ms 2668 KB Output is correct
104 Correct 6 ms 3524 KB Output is correct
105 Correct 15 ms 5056 KB Output is correct
106 Correct 2 ms 2644 KB Output is correct
107 Correct 26 ms 6392 KB Output is correct
108 Correct 28 ms 8016 KB Output is correct
109 Correct 2 ms 2644 KB Output is correct
110 Correct 44 ms 9744 KB Output is correct
111 Correct 55 ms 11592 KB Output is correct
112 Correct 2 ms 2772 KB Output is correct
113 Correct 103 ms 14924 KB Output is correct

Subtask #4
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 29 ms 6508 KB Output is correct
2 Incorrect 26 ms 6560 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 2 ms 2636 KB Output is correct
4 Correct 2 ms 2644 KB Output is correct
5 Correct 2 ms 2644 KB Output is correct
6 Correct 2 ms 2644 KB Output is correct
7 Correct 2 ms 2644 KB Output is correct
8 Correct 2 ms 2664 KB Output is correct
9 Correct 2 ms 2644 KB Output is correct
10 Correct 2 ms 2644 KB Output is correct
11 Correct 2 ms 2644 KB Output is correct
12 Correct 2 ms 2620 KB Output is correct
13 Correct 2 ms 2644 KB Output is correct
14 Correct 2 ms 2644 KB Output is correct
15 Correct 2 ms 2664 KB Output is correct
16 Correct 2 ms 2644 KB Output is correct
17 Correct 2 ms 2644 KB Output is correct
18 Correct 2 ms 2644 KB Output is correct
19 Correct 2 ms 2660 KB Output is correct
20 Correct 2 ms 2644 KB Output is correct
21 Correct 2 ms 2664 KB Output is correct
22 Correct 2 ms 2644 KB Output is correct
23 Correct 1 ms 2644 KB Output is correct
24 Correct 2 ms 2644 KB Output is correct
25 Correct 2 ms 2688 KB Output is correct
26 Correct 2 ms 2644 KB Output is correct
27 Correct 3 ms 2772 KB Output is correct
28 Correct 3 ms 2804 KB Output is correct
29 Correct 2 ms 2644 KB Output is correct
30 Correct 2 ms 2672 KB Output is correct
31 Correct 3 ms 2772 KB Output is correct
32 Incorrect 2 ms 2644 KB Output isn't correct
33 Halted 0 ms 0 KB -

Subtask #6
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 42 ms 12360 KB Output is correct
2 Correct 57 ms 13500 KB Output is correct
3 Correct 35 ms 9904 KB Output is correct
4 Correct 9 ms 4232 KB Output is correct
5 Correct 6 ms 3540 KB Output is correct
6 Correct 14 ms 4984 KB Output is correct
7 Correct 2 ms 2644 KB Output is correct
8 Correct 23 ms 6488 KB Output is correct
9 Correct 31 ms 7972 KB Output is correct
10 Correct 2 ms 2644 KB Output is correct
11 Correct 45 ms 9748 KB Output is correct
12 Correct 60 ms 11540 KB Output is correct
13 Correct 2 ms 2676 KB Output is correct
14 Correct 2 ms 2644 KB Output is correct
15 Correct 2 ms 2644 KB Output is correct
16 Correct 2 ms 2636 KB Output is correct
17 Correct 2 ms 2644 KB Output is correct
18 Correct 2 ms 2644 KB Output is correct
19 Correct 2 ms 2644 KB Output is correct
20 Correct 2 ms 2644 KB Output is correct
21 Correct 2 ms 2664 KB Output is correct
22 Correct 2 ms 2644 KB Output is correct
23 Correct 2 ms 2644 KB Output is correct
24 Correct 2 ms 2644 KB Output is correct
25 Correct 2 ms 2620 KB Output is correct
26 Correct 2 ms 2644 KB Output is correct
27 Correct 2 ms 2644 KB Output is correct
28 Correct 2 ms 2664 KB Output is correct
29 Correct 2 ms 2644 KB Output is correct
30 Correct 2 ms 2644 KB Output is correct
31 Correct 2 ms 2644 KB Output is correct
32 Correct 2 ms 2660 KB Output is correct
33 Correct 2 ms 2644 KB Output is correct
34 Correct 2 ms 2664 KB Output is correct
35 Correct 2 ms 2644 KB Output is correct
36 Correct 1 ms 2644 KB Output is correct
37 Correct 2 ms 2644 KB Output is correct
38 Correct 2 ms 2688 KB Output is correct
39 Correct 49 ms 13580 KB Output is correct
40 Correct 50 ms 13484 KB Output is correct
41 Correct 31 ms 9892 KB Output is correct
42 Correct 9 ms 4180 KB Output is correct
43 Correct 2 ms 2644 KB Output is correct
44 Correct 2 ms 2656 KB Output is correct
45 Correct 2 ms 2644 KB Output is correct
46 Correct 2 ms 2660 KB Output is correct
47 Correct 2 ms 2644 KB Output is correct
48 Correct 2 ms 2688 KB Output is correct
49 Correct 2 ms 2644 KB Output is correct
50 Correct 2 ms 2644 KB Output is correct
51 Correct 2 ms 2644 KB Output is correct
52 Correct 2 ms 2660 KB Output is correct
53 Correct 2 ms 2644 KB Output is correct
54 Correct 2 ms 2644 KB Output is correct
55 Correct 2 ms 2644 KB Output is correct
56 Correct 2 ms 2668 KB Output is correct
57 Correct 57 ms 9312 KB Output is correct
58 Correct 59 ms 9164 KB Output is correct
59 Correct 59 ms 9100 KB Output is correct
60 Correct 56 ms 9172 KB Output is correct
61 Correct 54 ms 9184 KB Output is correct
62 Correct 53 ms 9196 KB Output is correct
63 Correct 50 ms 8840 KB Output is correct
64 Correct 57 ms 8848 KB Output is correct
65 Correct 53 ms 9180 KB Output is correct
66 Correct 55 ms 9148 KB Output is correct
67 Correct 55 ms 9092 KB Output is correct
68 Correct 57 ms 9184 KB Output is correct
69 Correct 63 ms 9384 KB Output is correct
70 Correct 60 ms 9400 KB Output is correct
71 Correct 2 ms 2644 KB Output is correct
72 Correct 2 ms 2772 KB Output is correct
73 Correct 3 ms 2772 KB Output is correct
74 Correct 3 ms 2772 KB Output is correct
75 Correct 3 ms 2804 KB Output is correct
76 Correct 3 ms 2772 KB Output is correct
77 Correct 3 ms 2772 KB Output is correct
78 Correct 3 ms 2804 KB Output is correct
79 Correct 3 ms 2772 KB Output is correct
80 Correct 55 ms 9152 KB Output is correct
81 Correct 68 ms 9152 KB Output is correct
82 Correct 69 ms 9288 KB Output is correct
83 Correct 55 ms 9240 KB Output is correct
84 Correct 2 ms 2804 KB Output is correct
85 Correct 2 ms 2772 KB Output is correct
86 Correct 2 ms 2772 KB Output is correct
87 Correct 3 ms 2772 KB Output is correct
88 Correct 3 ms 2772 KB Output is correct
89 Correct 3 ms 2772 KB Output is correct
90 Correct 4 ms 2804 KB Output is correct
91 Correct 3 ms 2772 KB Output is correct
92 Correct 3 ms 2772 KB Output is correct
93 Correct 3 ms 2772 KB Output is correct
94 Correct 2 ms 2644 KB Output is correct
95 Correct 2 ms 2644 KB Output is correct
96 Correct 2 ms 2660 KB Output is correct
97 Correct 2 ms 2644 KB Output is correct
98 Correct 2 ms 2644 KB Output is correct
99 Correct 2 ms 2644 KB Output is correct
100 Correct 1 ms 2644 KB Output is correct
101 Correct 2 ms 2644 KB Output is correct
102 Correct 2 ms 2644 KB Output is correct
103 Correct 2 ms 2668 KB Output is correct
104 Correct 6 ms 3524 KB Output is correct
105 Correct 15 ms 5056 KB Output is correct
106 Correct 2 ms 2644 KB Output is correct
107 Correct 26 ms 6392 KB Output is correct
108 Correct 28 ms 8016 KB Output is correct
109 Correct 2 ms 2644 KB Output is correct
110 Correct 44 ms 9744 KB Output is correct
111 Correct 55 ms 11592 KB Output is correct
112 Correct 2 ms 2772 KB Output is correct
113 Correct 103 ms 14924 KB Output is correct
114 Correct 29 ms 6508 KB Output is correct
115 Incorrect 26 ms 6560 KB Output isn't correct
116 Halted 0 ms 0 KB -