oj.uz

답안 #571333

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
571333 2022-06-01T19:37:28 Z beaconmc 꿈 (IOI13_dreaming) C++14
28 / 100
 1000 ms 15980 KB 
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
typedef long long ll;
#define FOR(i,x,y) for(ll i=x; i<y; i++)
#define FORNEG(i,x,y) for(ll i=x; i>y; i--)
#define double long double
#include "dreaming.h"

using namespace std;


ll cc[100005];

ll find(ll a){
    while (a!=cc[a]) cc[a] = cc[cc[a]], a = cc[a];
    return a;
}
void unite(ll a,ll b){
    cc[find(a)] = find(b);
}


ll globalmax = -1;

vector<pair<ll, ll>> edges[100005];
vector<ll> sussies[100005];


int sus(vector<ll> a){
	if (a.size()==1) return 0;

	bool visited[100005];
	FOR(i,0,100004) visited[i] = 0;

	vector<vector<ll>> stack;
	ll maxi = 0;
	vector<ll> path;

	stack.push_back({0,a[0]});
	visited[a[0]] = 1;

	while (stack.size()){
		vector<ll> temp;

		vector<ll> node = stack[stack.size()-1];

		stack.pop_back();

		if (maxi < node[0]) path = node, maxi = node[0];


		for (auto&i : edges[node[node.size()-1]]){
			if (!visited[i.first]){
				visited[i.first] = 1;
				temp = node;
				temp[0] += i.second;
				temp.push_back(i.first);
				stack.push_back(temp);
			}
		}
	}


	ll realsus = path[path.size()-1];


	FOR(i,0,100004) visited[i] = 0;

	stack.clear();
	maxi = 0;
	path.clear();
	stack.push_back({0,0,realsus});
	visited[realsus] = 1;



	while (stack.size()){
		vector<ll> temp;

		vector<ll> node = stack[stack.size()-1];
		stack.pop_back();

		if (maxi < node[0]) path = node, maxi = node[0];

		for (auto&i : edges[node[node.size()-1]]){
			if (!visited[i.first]){
				visited[i.first] = 1;
				temp = node;
				temp.pop_back();
				temp[0] += i.second;
				temp.push_back(i.second);
				temp.push_back(i.first);
				stack.push_back(temp);
			}
		}
	}

	ll mini = 1000000000000;
	ll cur = 0;
	globalmax = max(globalmax, path[0]);




	FOR(i,1,path.size()-1){
		cur += path[i];
		mini = min(mini, max(path[0]-cur, cur));
	}


	return mini;

}


int travelTime(int n, int m, int L, int a[], int b[], int t[]){
	FOR(i,0,n) cc[i] = i;

	FOR(i,0,m){
		edges[a[i]].push_back({b[i], t[i]});
		edges[b[i]].push_back({a[i], t[i]});
	}

	FOR(i,0,n){
		for (auto&j : edges[i]){
			unite(i, j.first);
		}
	}

	FOR(i,0,n){
		sussies[find(i)].push_back(i);
	}
	vector<ll> kindasus;


	for (auto&i : sussies){
		if (i.size()==0) continue;
		kindasus.push_back(sus(i));
	}

	sort(kindasus.begin(), kindasus.end());

	// for (auto&i : kindasus){
	// 	cout << i << endl;
	// }

	if (kindasus.size() == 1) return 0;

	if (kindasus.size()==2){
		return max(globalmax, kindasus[kindasus.size()-1] + kindasus[kindasus.size()-2] + L);
	}


	return max(globalmax, max(kindasus[kindasus.size()-2] + kindasus[kindasus.size()-3] + 2*L, kindasus[kindasus.size()-1] + kindasus[kindasus.size()-2] + L));

}

Compilation message

dreaming.cpp: In function 'int sus(std::vector<long long int>)':
dreaming.cpp:4:33: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    4 | #define FOR(i,x,y) for(ll i=x; i<y; i++)
......
  105 |  FOR(i,1,path.size()-1){
      |      ~~~~~~~~~~~~~~~~~           
dreaming.cpp:105:2: note: in expansion of macro 'FOR'
  105 |  FOR(i,1,path.size()-1){
      |  ^~~

Subtask #1
0 / 14.0

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

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 5136 KB Output is correct
2 Correct 3 ms 5076 KB Output is correct
3 Correct 3 ms 5076 KB Output is correct
4 Correct 3 ms 5144 KB Output is correct
5 Correct 2 ms 5076 KB Output is correct
6 Correct 3 ms 5076 KB Output is correct
7 Correct 3 ms 5076 KB Output is correct
8 Correct 3 ms 5016 KB Output is correct
9 Correct 3 ms 5012 KB Output is correct
10 Correct 3 ms 5076 KB Output is correct
11 Correct 3 ms 5136 KB Output is correct
12 Correct 3 ms 5032 KB Output is correct
13 Correct 3 ms 5076 KB Output is correct
14 Correct 3 ms 5076 KB Output is correct
15 Correct 3 ms 5076 KB Output is correct
16 Correct 3 ms 5012 KB Output is correct
17 Correct 3 ms 5076 KB Output is correct
18 Correct 3 ms 5076 KB Output is correct
19 Correct 3 ms 5008 KB Output is correct
20 Correct 3 ms 5076 KB Output is correct
21 Correct 3 ms 5008 KB Output is correct
22 Correct 2 ms 5076 KB Output is correct
23 Correct 3 ms 5076 KB Output is correct
24 Correct 3 ms 5076 KB Output is correct
25 Correct 3 ms 5076 KB Output is correct

Subtask #3
0 / 23.0

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

Subtask #4
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 202 ms 11168 KB Output is correct
2 Correct 198 ms 11092 KB Output is correct
3 Correct 194 ms 11104 KB Output is correct
4 Correct 193 ms 11316 KB Output is correct
5 Correct 194 ms 11244 KB Output is correct
6 Correct 208 ms 11968 KB Output is correct
7 Correct 200 ms 11420 KB Output is correct
8 Correct 189 ms 11048 KB Output is correct
9 Correct 182 ms 11016 KB Output is correct
10 Correct 195 ms 11368 KB Output is correct
11 Correct 4 ms 5012 KB Output is correct
12 Correct 36 ms 10080 KB Output is correct
13 Correct 44 ms 10152 KB Output is correct
14 Correct 35 ms 10116 KB Output is correct
15 Correct 39 ms 10144 KB Output is correct
16 Correct 35 ms 10132 KB Output is correct
17 Correct 34 ms 10048 KB Output is correct
18 Correct 38 ms 10136 KB Output is correct
19 Correct 36 ms 10176 KB Output is correct
20 Correct 3 ms 5076 KB Output is correct
21 Correct 3 ms 5004 KB Output is correct
22 Correct 4 ms 5204 KB Output is correct
23 Correct 36 ms 10120 KB Output is correct

Subtask #5
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 5136 KB Output is correct
2 Correct 3 ms 5076 KB Output is correct
3 Correct 3 ms 5076 KB Output is correct
4 Correct 3 ms 5144 KB Output is correct
5 Correct 2 ms 5076 KB Output is correct
6 Correct 3 ms 5076 KB Output is correct
7 Correct 3 ms 5076 KB Output is correct
8 Correct 3 ms 5016 KB Output is correct
9 Correct 3 ms 5012 KB Output is correct
10 Correct 3 ms 5076 KB Output is correct
11 Correct 3 ms 5136 KB Output is correct
12 Correct 3 ms 5032 KB Output is correct
13 Correct 3 ms 5076 KB Output is correct
14 Correct 3 ms 5076 KB Output is correct
15 Correct 3 ms 5076 KB Output is correct
16 Correct 3 ms 5012 KB Output is correct
17 Correct 3 ms 5076 KB Output is correct
18 Correct 3 ms 5076 KB Output is correct
19 Correct 3 ms 5008 KB Output is correct
20 Correct 3 ms 5076 KB Output is correct
21 Correct 3 ms 5008 KB Output is correct
22 Correct 2 ms 5076 KB Output is correct
23 Correct 3 ms 5076 KB Output is correct
24 Correct 3 ms 5076 KB Output is correct
25 Correct 3 ms 5076 KB Output is correct
26 Correct 4 ms 5204 KB Output is correct
27 Correct 5 ms 5204 KB Output is correct
28 Correct 7 ms 5332 KB Output is correct
29 Correct 5 ms 5204 KB Output is correct
30 Correct 6 ms 5300 KB Output is correct
31 Correct 7 ms 5332 KB Output is correct
32 Correct 4 ms 5148 KB Output is correct
33 Correct 6 ms 5204 KB Output is correct
34 Correct 8 ms 5416 KB Output is correct
35 Correct 3 ms 5076 KB Output is correct
36 Correct 3 ms 5076 KB Output is correct
37 Correct 3 ms 5076 KB Output is correct
38 Correct 3 ms 5100 KB Output is correct
39 Correct 3 ms 5076 KB Output is correct
40 Correct 3 ms 5076 KB Output is correct
41 Correct 3 ms 5076 KB Output is correct
42 Correct 3 ms 5076 KB Output is correct
43 Correct 3 ms 5076 KB Output is correct
44 Correct 3 ms 5012 KB Output is correct
45 Correct 3 ms 5076 KB Output is correct
46 Correct 3 ms 5076 KB Output is correct
47 Correct 3 ms 5076 KB Output is correct
48 Correct 3 ms 5140 KB Output is correct
49 Correct 4 ms 5012 KB Output is correct
50 Correct 3 ms 5076 KB Output is correct
51 Correct 3 ms 5076 KB Output is correct
52 Correct 3 ms 5076 KB Output is correct
53 Correct 3 ms 5008 KB Output is correct
54 Incorrect 13 ms 5588 KB Output isn't correct
55 Halted 0 ms 0 KB -

Subtask #6
0 / 23.0

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