Submission #298208

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
298208	2020-09-12T14:50:30 Z	tmwilliamlin168	Fun Tour (APIO20_fun)	C++14	100 / 100	469 ms	21744 KB

#include "fun.h"
#include <bits/stdc++.h>
using namespace std;

vector<int> createFunTour(int n, int q) {
	vector<int> d(n), ans, e, g(n);
	array<int, 2> c{n+1};
	for(int i=0, s; i<n; ++i) {
		s=attractionsBehind(0, i);
		if(s>n/2)
			c=min(array<int, 2>{s, i}, c);
	}
	for(int i=0; i<n; ++i) {
		d[i]=hoursRequired(c[1], i);
		if(d[i]==1)
			e.push_back(i);
	}
	vector<vector<int>> d2(e.size()-1), f(3);
	for(int i=0; i<e.size()-1; ++i)
		for(int j=0; j<n; ++j)
			d2[i].push_back(hoursRequired(e[i], j));
	for(int i=0; i<n; ++i) {
		if(i==c[1])
			continue;
		while(g[i]<e.size()-1&&d2[g[i]][i]>d[i])
			++g[i];
		f[g[i]].push_back(i);
	}
	for(int i=0; i<e.size(); ++i) {
		sort(f[i].begin(), f[i].end(), [&](const int &i, const int &j) {
			return d[i]<d[j];
		});
	}
	int p[3]={0, 1, 2}, l=-1;
	while(1) {
		sort(p, p+3, [&](const int &i, const int &j) {
			return f[i].size()>f[j].size();
		});
		if(f[p[0]].size()<f[p[1]].size()+f[p[2]].size()) {
			sort(p, p+3, [&](const int &i, const int &j) {
				return d[f[i].back()]>d[f[j].back()];
			});
			int i=p[0]==l;
			ans.push_back(f[p[i]].back());
			f[p[i]].pop_back();
			l=p[i];
		} else
			break;
	}
	f[p[1]].insert(f[p[1]].end(), f[p[2]].begin(), f[p[2]].end());
	sort(f[p[1]].begin(), f[p[1]].end(), [&](const int &i, const int &j) {
		return d[i]<d[j];
	});
	l=ans.size()>1&&g[ans[ans.size()-2]]^p[0]&&d[ans[ans.size()-2]]>d[ans.back()]&&d[f[p[1]].back()]>d[ans.back()];
	while(f[p[l]].size()) {
		ans.push_back(f[p[l]].back());
		f[p[l]].pop_back();
		l^=1;
	}
	ans.push_back(c[1]);
	return ans;
}

Compilation message

fun.cpp: In function 'std::vector<int> createFunTour(int, int)':
fun.cpp:19:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   19 |  for(int i=0; i<e.size()-1; ++i)
      |               ~^~~~~~~~~~~
fun.cpp:25:13: warning: comparison of integer expressions of different signedness: '__gnu_cxx::__alloc_traits<std::allocator<int>, int>::value_type' {aka 'int'} and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   25 |   while(g[i]<e.size()-1&&d2[g[i]][i]>d[i])
fun.cpp:29:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   29 |  for(int i=0; i<e.size(); ++i) {
      |               ~^~~~~~~~~

Subtask #1
10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	384 KB	Output is correct
2	Correct	1 ms	256 KB	Output is correct
3	Correct	1 ms	256 KB	Output is correct
4	Correct	1 ms	256 KB	Output is correct
5	Correct	1 ms	256 KB	Output is correct
6	Correct	1 ms	256 KB	Output is correct
7	Correct	1 ms	256 KB	Output is correct
8	Correct	1 ms	384 KB	Output is correct
9	Correct	1 ms	256 KB	Output is correct
10	Correct	1 ms	256 KB	Output is correct
11	Correct	1 ms	256 KB	Output is correct
12	Correct	1 ms	256 KB	Output is correct
13	Correct	1 ms	384 KB	Output is correct
14	Correct	0 ms	256 KB	Output is correct
15	Correct	1 ms	256 KB	Output is correct
16	Correct	1 ms	256 KB	Output is correct
17	Correct	1 ms	256 KB	Output is correct
18	Correct	1 ms	384 KB	Output is correct
19	Correct	1 ms	256 KB	Output is correct
20	Correct	1 ms	256 KB	Output is correct

Subtask #2
16.0 / 16.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	384 KB	Output is correct
2	Correct	1 ms	256 KB	Output is correct
3	Correct	1 ms	256 KB	Output is correct
4	Correct	1 ms	256 KB	Output is correct
5	Correct	1 ms	256 KB	Output is correct
6	Correct	1 ms	256 KB	Output is correct
7	Correct	1 ms	256 KB	Output is correct
8	Correct	1 ms	384 KB	Output is correct
9	Correct	1 ms	256 KB	Output is correct
10	Correct	1 ms	256 KB	Output is correct
11	Correct	1 ms	256 KB	Output is correct
12	Correct	1 ms	256 KB	Output is correct
13	Correct	1 ms	384 KB	Output is correct
14	Correct	0 ms	256 KB	Output is correct
15	Correct	1 ms	256 KB	Output is correct
16	Correct	1 ms	256 KB	Output is correct
17	Correct	1 ms	256 KB	Output is correct
18	Correct	1 ms	384 KB	Output is correct
19	Correct	1 ms	256 KB	Output is correct
20	Correct	1 ms	256 KB	Output is correct
21	Correct	1 ms	256 KB	Output is correct
22	Correct	0 ms	256 KB	Output is correct
23	Correct	1 ms	256 KB	Output is correct
24	Correct	2 ms	384 KB	Output is correct
25	Correct	1 ms	256 KB	Output is correct
26	Correct	1 ms	384 KB	Output is correct
27	Correct	1 ms	384 KB	Output is correct
28	Correct	1 ms	256 KB	Output is correct
29	Correct	1 ms	384 KB	Output is correct
30	Correct	1 ms	384 KB	Output is correct
31	Correct	1 ms	384 KB	Output is correct
32	Correct	1 ms	384 KB	Output is correct
33	Correct	1 ms	384 KB	Output is correct
34	Correct	2 ms	384 KB	Output is correct
35	Correct	1 ms	384 KB	Output is correct
36	Correct	1 ms	384 KB	Output is correct
37	Correct	1 ms	384 KB	Output is correct
38	Correct	1 ms	384 KB	Output is correct
39	Correct	1 ms	384 KB	Output is correct
40	Correct	1 ms	384 KB	Output is correct
41	Correct	1 ms	384 KB	Output is correct

Subtask #3
21.0 / 21.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	256 KB	Output is correct
2	Correct	1 ms	256 KB	Output is correct
3	Correct	1 ms	256 KB	Output is correct
4	Correct	1 ms	256 KB	Output is correct
5	Correct	1 ms	256 KB	Output is correct
6	Correct	1 ms	256 KB	Output is correct
7	Correct	1 ms	384 KB	Output is correct
8	Correct	1 ms	256 KB	Output is correct
9	Correct	1 ms	256 KB	Output is correct
10	Correct	0 ms	256 KB	Output is correct
11	Correct	1 ms	256 KB	Output is correct
12	Correct	2 ms	384 KB	Output is correct
13	Correct	1 ms	256 KB	Output is correct
14	Correct	1 ms	384 KB	Output is correct
15	Correct	1 ms	384 KB	Output is correct
16	Correct	1 ms	384 KB	Output is correct
17	Correct	1 ms	384 KB	Output is correct
18	Correct	154 ms	17008 KB	Output is correct
19	Correct	1 ms	384 KB	Output is correct
20	Correct	2 ms	640 KB	Output is correct
21	Correct	4 ms	768 KB	Output is correct
22	Correct	8 ms	1408 KB	Output is correct
23	Correct	18 ms	2560 KB	Output is correct
24	Correct	20 ms	3328 KB	Output is correct
25	Correct	88 ms	10000 KB	Output is correct

Subtask #4
19.0 / 19.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	256 KB	Output is correct
2	Correct	1 ms	256 KB	Output is correct
3	Correct	1 ms	256 KB	Output is correct
4	Correct	1 ms	256 KB	Output is correct
5	Correct	1 ms	256 KB	Output is correct
6	Correct	1 ms	384 KB	Output is correct
7	Correct	1 ms	256 KB	Output is correct
8	Correct	1 ms	384 KB	Output is correct
9	Correct	1 ms	384 KB	Output is correct
10	Correct	1 ms	384 KB	Output is correct
11	Correct	1 ms	384 KB	Output is correct
12	Correct	1 ms	384 KB	Output is correct
13	Correct	2 ms	384 KB	Output is correct
14	Correct	12 ms	1920 KB	Output is correct
15	Correct	175 ms	16880 KB	Output is correct
16	Correct	203 ms	16756 KB	Output is correct
17	Correct	32 ms	4216 KB	Output is correct
18	Correct	74 ms	8000 KB	Output is correct
19	Correct	134 ms	13512 KB	Output is correct
20	Correct	5 ms	896 KB	Output is correct

Subtask #5
34.0 / 34.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	384 KB	Output is correct
2	Correct	1 ms	256 KB	Output is correct
3	Correct	1 ms	256 KB	Output is correct
4	Correct	1 ms	256 KB	Output is correct
5	Correct	1 ms	256 KB	Output is correct
6	Correct	1 ms	256 KB	Output is correct
7	Correct	1 ms	256 KB	Output is correct
8	Correct	1 ms	384 KB	Output is correct
9	Correct	1 ms	256 KB	Output is correct
10	Correct	1 ms	256 KB	Output is correct
11	Correct	1 ms	256 KB	Output is correct
12	Correct	1 ms	256 KB	Output is correct
13	Correct	1 ms	384 KB	Output is correct
14	Correct	0 ms	256 KB	Output is correct
15	Correct	1 ms	256 KB	Output is correct
16	Correct	1 ms	256 KB	Output is correct
17	Correct	1 ms	256 KB	Output is correct
18	Correct	1 ms	384 KB	Output is correct
19	Correct	1 ms	256 KB	Output is correct
20	Correct	1 ms	256 KB	Output is correct
21	Correct	1 ms	256 KB	Output is correct
22	Correct	0 ms	256 KB	Output is correct
23	Correct	1 ms	256 KB	Output is correct
24	Correct	2 ms	384 KB	Output is correct
25	Correct	1 ms	256 KB	Output is correct
26	Correct	1 ms	384 KB	Output is correct
27	Correct	1 ms	384 KB	Output is correct
28	Correct	1 ms	256 KB	Output is correct
29	Correct	1 ms	384 KB	Output is correct
30	Correct	1 ms	384 KB	Output is correct
31	Correct	1 ms	384 KB	Output is correct
32	Correct	1 ms	384 KB	Output is correct
33	Correct	1 ms	384 KB	Output is correct
34	Correct	2 ms	384 KB	Output is correct
35	Correct	1 ms	384 KB	Output is correct
36	Correct	1 ms	384 KB	Output is correct
37	Correct	1 ms	384 KB	Output is correct
38	Correct	1 ms	384 KB	Output is correct
39	Correct	1 ms	384 KB	Output is correct
40	Correct	1 ms	384 KB	Output is correct
41	Correct	1 ms	384 KB	Output is correct
42	Correct	1 ms	384 KB	Output is correct
43	Correct	1 ms	384 KB	Output is correct
44	Correct	154 ms	17008 KB	Output is correct
45	Correct	1 ms	384 KB	Output is correct
46	Correct	2 ms	640 KB	Output is correct
47	Correct	4 ms	768 KB	Output is correct
48	Correct	8 ms	1408 KB	Output is correct
49	Correct	18 ms	2560 KB	Output is correct
50	Correct	20 ms	3328 KB	Output is correct
51	Correct	88 ms	10000 KB	Output is correct
52	Correct	2 ms	384 KB	Output is correct
53	Correct	12 ms	1920 KB	Output is correct
54	Correct	175 ms	16880 KB	Output is correct
55	Correct	203 ms	16756 KB	Output is correct
56	Correct	32 ms	4216 KB	Output is correct
57	Correct	74 ms	8000 KB	Output is correct
58	Correct	134 ms	13512 KB	Output is correct
59	Correct	5 ms	896 KB	Output is correct
60	Correct	225 ms	16624 KB	Output is correct
61	Correct	289 ms	19056 KB	Output is correct
62	Correct	242 ms	17308 KB	Output is correct
63	Correct	269 ms	21120 KB	Output is correct
64	Correct	254 ms	20592 KB	Output is correct
65	Correct	316 ms	17136 KB	Output is correct
66	Correct	359 ms	19440 KB	Output is correct
67	Correct	291 ms	21028 KB	Output is correct
68	Correct	307 ms	20336 KB	Output is correct
69	Correct	469 ms	21744 KB	Output is correct
70	Correct	245 ms	17136 KB	Output is correct
71	Correct	272 ms	20848 KB	Output is correct
72	Correct	339 ms	19696 KB	Output is correct
73	Correct	289 ms	20080 KB	Output is correct
74	Correct	399 ms	21744 KB	Output is correct
75	Correct	230 ms	17136 KB	Output is correct
76	Correct	265 ms	20976 KB	Output is correct
77	Correct	276 ms	21104 KB	Output is correct
78	Correct	285 ms	20208 KB	Output is correct
79	Correct	385 ms	21744 KB	Output is correct
80	Correct	337 ms	21488 KB	Output is correct
81	Correct	230 ms	16880 KB	Output is correct
82	Correct	244 ms	16880 KB	Output is correct
83	Correct	274 ms	17140 KB	Output is correct
84	Correct	91 ms	7500 KB	Output is correct

Submission #298208

Compilation message

Subtask #1 10.0 / 10.0

Subtask #2 16.0 / 16.0

Subtask #3 21.0 / 21.0

Subtask #4 19.0 / 19.0

Subtask #5 34.0 / 34.0

Subtask #1
10.0 / 10.0

Subtask #2
16.0 / 16.0

Subtask #3
21.0 / 21.0

Subtask #4
19.0 / 19.0

Subtask #5
34.0 / 34.0