답안 #568722

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
568722	2022-05-26T06:18:55 Z	_karan_gandhi	즐거운 행로 (APIO20_fun)	C++17	26 / 100	121 ms	25320 KB

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

#define ll long long
#define all(v) v.begin(), v.end()
#define endl '\n'
#define pl(var) " [" << #var << ": " << (var) << "] "

template<typename A, typename B> ostream& operator<<(ostream &cout, pair<A, B> const &p) { return cout << "[" << p.first << ", " << p.second << "]"; }
template<typename A> ostream& operator<<(ostream &cout, vector<A> const &v) { cout << "["; for(int i = 0; i < (int)v.size(); i++) {if (i) cout << ", "; cout << v[i];} return cout << "]";}
template<typename A, typename B> istream& operator>>(istream& cin, pair<A, B> &p) { cin >> p.first; return cin >> p.second; }

std::vector<int> createFunTour(int n, int Q) {
	vector<vector<pair<int, int>>> distances(n);

	int diameter = 0;
	int a, b;
	for (int i = 0; i < n; i++) {
		for (int j = i + 1; j < n; j++) {
			int d = hoursRequired(i, j);
			if (d > diameter) {
				a = i;
				b = j;
				diameter = d;
			}
			distances[i].emplace_back(d, j);
			distances[j].emplace_back(d, i);
		}
	}

	// cout << pl(a) << pl(b) << endl;

	vector<int> ans;
	ans.push_back(b);
	ans.push_back(a);
	int u = a;

	// cout << pl(u) << endl;
	// cout << pl(distances[u]) << endl;
	for (int i = 0; i < n; i++) {
		sort(all(distances[i]));
		reverse(all(distances[i]));
	}
	vector<bool> vis(n, 0);
	vis[a] = vis[b] = 1;
	while (ans.size() != n) {
		// cout << pl(u) << endl;
		for (auto [d, v] : distances[u]) {
			if (!vis[v]) {
				ans.push_back(v);
				vis[v] = 1;
				u = v;
				break;
			}
		}
	}

	assert(ans.size() == n);
	// cout << ans << endl;
	return ans;
}

Compilation message

fun.cpp: In function 'std::vector<int> createFunTour(int, int)':
fun.cpp:47:20: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   47 |  while (ans.size() != n) {
      |         ~~~~~~~~~~~^~~~
In file included from /usr/include/c++/10/cassert:44,
                 from /usr/include/x86_64-linux-gnu/c++/10/bits/stdc++.h:33,
                 from fun.cpp:2:
fun.cpp:59:20: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   59 |  assert(ans.size() == n);
      |         ~~~~~~~~~~~^~~~

Subtask #1
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	284 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	292 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	300 KB	Output is correct
8	Correct	1 ms	300 KB	Output is correct
9	Correct	1 ms	300 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	1 ms	212 KB	Output is correct
13	Correct	1 ms	296 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	1 ms	296 KB	Output is correct
17	Correct	1 ms	212 KB	Output is correct
18	Correct	1 ms	212 KB	Output is correct
19	Correct	1 ms	300 KB	Output is correct
20	Correct	0 ms	212 KB	Output is correct

Subtask #2
16.0 / 16.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	284 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	292 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	300 KB	Output is correct
8	Correct	1 ms	300 KB	Output is correct
9	Correct	1 ms	300 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	1 ms	212 KB	Output is correct
13	Correct	1 ms	296 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	1 ms	296 KB	Output is correct
17	Correct	1 ms	212 KB	Output is correct
18	Correct	1 ms	212 KB	Output is correct
19	Correct	1 ms	300 KB	Output is correct
20	Correct	0 ms	212 KB	Output is correct
21	Correct	1 ms	212 KB	Output is correct
22	Correct	1 ms	212 KB	Output is correct
23	Correct	1 ms	212 KB	Output is correct
24	Correct	21 ms	2428 KB	Output is correct
25	Correct	1 ms	320 KB	Output is correct
26	Correct	2 ms	340 KB	Output is correct
27	Correct	3 ms	596 KB	Output is correct
28	Correct	1 ms	212 KB	Output is correct
29	Correct	20 ms	2388 KB	Output is correct
30	Correct	1 ms	340 KB	Output is correct
31	Correct	4 ms	724 KB	Output is correct
32	Correct	6 ms	1364 KB	Output is correct
33	Correct	2 ms	556 KB	Output is correct
34	Correct	23 ms	2388 KB	Output is correct
35	Correct	23 ms	2408 KB	Output is correct
36	Correct	26 ms	2420 KB	Output is correct
37	Correct	2 ms	432 KB	Output is correct
38	Correct	32 ms	2288 KB	Output is correct
39	Correct	9 ms	1364 KB	Output is correct
40	Correct	14 ms	1796 KB	Output is correct
41	Correct	4 ms	684 KB	Output is correct

Subtask #3
0 / 21.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	284 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	1 ms	292 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	1 ms	300 KB	Output is correct
7	Correct	1 ms	300 KB	Output is correct
8	Correct	1 ms	300 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	21 ms	2428 KB	Output is correct
13	Correct	1 ms	320 KB	Output is correct
14	Correct	2 ms	340 KB	Output is correct
15	Correct	3 ms	596 KB	Output is correct
16	Correct	17 ms	2388 KB	Output is correct
17	Correct	17 ms	2472 KB	Output is correct
18	Incorrect	121 ms	25320 KB	Too many queries
19	Halted	0 ms	0 KB	-

Subtask #4
0 / 19.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	284 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	1 ms	296 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	20 ms	2388 KB	Output is correct
9	Correct	1 ms	340 KB	Output is correct
10	Correct	4 ms	724 KB	Output is correct
11	Correct	6 ms	1364 KB	Output is correct
12	Correct	2 ms	556 KB	Output is correct
13	Incorrect	38 ms	8488 KB	Too many queries
14	Halted	0 ms	0 KB	-

Subtask #5
0 / 34.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	284 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	292 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	300 KB	Output is correct
8	Correct	1 ms	300 KB	Output is correct
9	Correct	1 ms	300 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	1 ms	212 KB	Output is correct
13	Correct	1 ms	296 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	0 ms	212 KB	Output is correct
16	Correct	1 ms	296 KB	Output is correct
17	Correct	1 ms	212 KB	Output is correct
18	Correct	1 ms	212 KB	Output is correct
19	Correct	1 ms	300 KB	Output is correct
20	Correct	0 ms	212 KB	Output is correct
21	Correct	1 ms	212 KB	Output is correct
22	Correct	1 ms	212 KB	Output is correct
23	Correct	1 ms	212 KB	Output is correct
24	Correct	21 ms	2428 KB	Output is correct
25	Correct	1 ms	320 KB	Output is correct
26	Correct	2 ms	340 KB	Output is correct
27	Correct	3 ms	596 KB	Output is correct
28	Correct	1 ms	212 KB	Output is correct
29	Correct	20 ms	2388 KB	Output is correct
30	Correct	1 ms	340 KB	Output is correct
31	Correct	4 ms	724 KB	Output is correct
32	Correct	6 ms	1364 KB	Output is correct
33	Correct	2 ms	556 KB	Output is correct
34	Correct	23 ms	2388 KB	Output is correct
35	Correct	23 ms	2408 KB	Output is correct
36	Correct	26 ms	2420 KB	Output is correct
37	Correct	2 ms	432 KB	Output is correct
38	Correct	32 ms	2288 KB	Output is correct
39	Correct	9 ms	1364 KB	Output is correct
40	Correct	14 ms	1796 KB	Output is correct
41	Correct	4 ms	684 KB	Output is correct
42	Correct	17 ms	2388 KB	Output is correct
43	Correct	17 ms	2472 KB	Output is correct
44	Incorrect	121 ms	25320 KB	Too many queries
45	Halted	0 ms	0 KB	-

답안 #568722

Compilation message

Subtask #1 10.0 / 10.0

Subtask #2 16.0 / 16.0

Subtask #3 0 / 21.0

Subtask #4 0 / 19.0

Subtask #5 0 / 34.0

Subtask #1
10.0 / 10.0

Subtask #2
16.0 / 16.0

Subtask #3
0 / 21.0

Subtask #4
0 / 19.0

Subtask #5
0 / 34.0