oj.uz

Submission #1023825

# Submission time Handle Problem Language Result Execution time Memory
1023825 2024-07-15T07:04:59 Z dozer Dreaming (IOI13_dreaming) C++14
32 / 100
 38 ms 21368 KB 
#include <bits/stdc++.h>
using namespace std;
#include "dreaming.h"
#define sp " "
#define endl "\n"
#define pb push_back
#define pii pair<int, int>
#define st first
#define nd second
#define fileio() freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout)
#define fastio() cin.tie(0), ios_base::sync_with_stdio(0)
#define mid (l + r) / 2
#define LL node * 2
#define RR node * 2 + 1
#define ll long long
#define MAXN 300005


const int modulo = 1e9 + 7;
const ll INF = 2e18 + 7;


#define fail(s, x...) do { \
		fprintf(stderr, s "\n", ## x); \
		exit(1); \
	} while(0)

#define MAX_N 100000

int maks[MAXN], sub_maks[MAXN], vis[MAXN];
vector<pii> adj[MAXN];
int MINI;


void dfs2(int node, int root){
	int ans = 0;
	for (auto i : adj[node]){
		if (i.st == root) continue;
		dfs2(i.st, node);
		ans = max(ans, sub_maks[i.st] + i.nd);
	}
	sub_maks[node] = ans;
}

void dfs(int node, int root, int m){
	vis[node] = 1;
	maks[node] = max(m, sub_maks[node]);
	MINI = min(MINI, maks[node]);

	vector<array<int, 3>> v;
	for (auto i : adj[node]){
		if (i.st == root) continue;
		v.pb({sub_maks[i.st] + i.nd, i.st, i.nd});
	}

	sort(v.begin(), v.end());
	for (int i = 0; i < v.size(); i++){
		int to = v[i][1], w = v[i][2];
		int add = m;
		if (i + 1 < v.size()) add = max(add, v.back()[0]);
		else add = max(add, v[v.size() - 2][0]);

		dfs(to, node, add + w);
	}
}


int travelTime(int N, int M, int L, int A[], int B[], int T[]) {
	for (int i = 1; i <= N; i++){
		vis[i] = 0, adj[i].clear(), maks[i] = 0, sub_maks[i] = 0;
	}
    for (int i = 0; i < M; i++){
    	A[i]++, B[i]++;
    	adj[A[i]].pb({B[i], T[i]});
    	adj[B[i]].pb({A[i], T[i]});
    }

    int ANS = 0;
    priority_queue<int> q;
    for (int i = 1; i <= N; i++){
    	if (vis[i]) continue;
    	MINI = modulo;
    	dfs2(i, 0);
    	dfs(i, 0, 0);
    	q.push(MINI);
    }

    for (int i = 1; i <= N; i++) ANS = max(ANS, maks[i]);

    while(!q.empty()){
    	int a = q.top();
    	q.pop();
    	if (q.empty()) break;
    	int b = q.top();
    	q.pop();
    	int neww = max(a, b + L);
    	ANS = max(ANS, a + b + L);
    	q.push(neww);
    }

    return ANS;
}

Compilation message

dreaming.cpp: In function 'void dfs(int, int, int)':
dreaming.cpp:57:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::array<int, 3> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   57 |  for (int i = 0; i < v.size(); i++){
      |                  ~~^~~~~~~~~~
dreaming.cpp:60:13: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::array<int, 3> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   60 |   if (i + 1 < v.size()) add = max(add, v.back()[0]);
      |       ~~~~~~^~~~~~~~~~

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 21368 KB Output is correct
2 Correct 35 ms 20820 KB Output is correct
3 Correct 26 ms 19540 KB Output is correct
4 Correct 7 ms 9560 KB Output is correct
5 Correct 7 ms 8540 KB Output is correct
6 Correct 11 ms 10432 KB Output is correct
7 Correct 3 ms 7516 KB Output is correct
8 Correct 19 ms 13124 KB Output is correct
9 Correct 25 ms 16980 KB Output is correct
10 Correct 3 ms 7512 KB Output is correct
11 Correct 33 ms 17452 KB Output is correct
12 Correct 38 ms 19296 KB Output is correct
13 Correct 4 ms 7768 KB Output is correct

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 7516 KB Output is correct
2 Correct 3 ms 7516 KB Output is correct
3 Incorrect 3 ms 7496 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 21368 KB Output is correct
2 Correct 35 ms 20820 KB Output is correct
3 Correct 26 ms 19540 KB Output is correct
4 Correct 7 ms 9560 KB Output is correct
5 Correct 7 ms 8540 KB Output is correct
6 Correct 11 ms 10432 KB Output is correct
7 Correct 3 ms 7516 KB Output is correct
8 Correct 19 ms 13124 KB Output is correct
9 Correct 25 ms 16980 KB Output is correct
10 Correct 3 ms 7512 KB Output is correct
11 Correct 33 ms 17452 KB Output is correct
12 Correct 38 ms 19296 KB Output is correct
13 Correct 4 ms 7768 KB Output is correct
14 Correct 3 ms 7516 KB Output is correct
15 Correct 3 ms 7516 KB Output is correct
16 Incorrect 3 ms 7496 KB Output isn't correct
17 Halted 0 ms 0 KB -

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 11612 KB Output is correct
2 Correct 24 ms 11632 KB Output is correct
3 Correct 20 ms 11612 KB Output is correct
4 Correct 20 ms 11740 KB Output is correct
5 Correct 20 ms 11612 KB Output is correct
6 Correct 21 ms 11992 KB Output is correct
7 Correct 29 ms 11864 KB Output is correct
8 Correct 20 ms 11644 KB Output is correct
9 Correct 20 ms 11612 KB Output is correct
10 Correct 20 ms 11868 KB Output is correct
11 Correct 3 ms 7516 KB Output is correct
12 Correct 9 ms 9176 KB Output is correct
13 Correct 9 ms 9176 KB Output is correct
14 Correct 10 ms 9172 KB Output is correct
15 Correct 9 ms 9176 KB Output is correct
16 Correct 10 ms 9140 KB Output is correct
17 Correct 9 ms 9176 KB Output is correct
18 Correct 10 ms 9176 KB Output is correct
19 Correct 10 ms 9152 KB Output is correct
20 Correct 3 ms 7260 KB Output is correct
21 Correct 3 ms 7488 KB Output is correct
22 Correct 3 ms 7768 KB Output is correct
23 Correct 10 ms 9176 KB Output is correct

Subtask #5
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 7516 KB Output is correct
2 Correct 3 ms 7516 KB Output is correct
3 Incorrect 3 ms 7496 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 21368 KB Output is correct
2 Correct 35 ms 20820 KB Output is correct
3 Correct 26 ms 19540 KB Output is correct
4 Correct 7 ms 9560 KB Output is correct
5 Correct 7 ms 8540 KB Output is correct
6 Correct 11 ms 10432 KB Output is correct
7 Correct 3 ms 7516 KB Output is correct
8 Correct 19 ms 13124 KB Output is correct
9 Correct 25 ms 16980 KB Output is correct
10 Correct 3 ms 7512 KB Output is correct
11 Correct 33 ms 17452 KB Output is correct
12 Correct 38 ms 19296 KB Output is correct
13 Correct 4 ms 7768 KB Output is correct
14 Correct 3 ms 7516 KB Output is correct
15 Correct 3 ms 7516 KB Output is correct
16 Incorrect 3 ms 7496 KB Output isn't correct
17 Halted 0 ms 0 KB -