#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
#define fastio ios::sync_with_stdio(false), cin.tie(0)
#pragma GCC optimize("Ofast")
#define pb push_back
#define eb emplace_back
#define f first
#define s second
#define q1 hoursRequired
#define q2 attrationsBehind
#include "fun.h"
const int maxn = 500 + 5;
const int INF = 1e9;
vector<int> adj[maxn];
int dist[maxn][maxn];
void dfs(int pos, int prev, int h, int d){
dist[h][pos] = d;
for(auto x : adj[pos]){
if(x == prev) continue;
dfs(x, pos, h, d + 1);
}
}
vector<int> sol1(int n){
for(int i = 0; i < n; i++){
for(int j = i + 1; j < n; j++){
if(q1(i, j) == 1){
adj[i].pb(j), adj[j].pb(i);
}
}
}
for(int i = 0; i < n; i++) dfs(i, -1, i, 0);
vector<int> ans;
for(int i = 0; i < n; i++){
vector<int> use(n);
ans.pb(i);
use[i] = 1;
while(ans.size() < n){
int mx = -1, lst = INF, prv = i;
for(int j = 0; j < n; j++){
if(use[j]) continue;
if(dist[prv][j] <= lst){
if(mx == -1 || dist[prv][j] > dist[prv][mx]) mx = j;
}
}
if(mx == -1) break;
use[mx] = 1, ans.pb(mx);
lst = dist[prv][mx];
prv = mx;
}
if(ans.size() == n) return ans;
}
assert(false);
}
std::vector<int> createFunTour(int n, int Q) {
if(n <= 500) return sol1(n);
}
Compilation message
fun.cpp: In function 'std::vector<int> sol1(int)':
fun.cpp:40:22: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
40 | while(ans.size() < n){
| ~~~~~~~~~~~^~~
fun.cpp:53:19: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
53 | if(ans.size() == n) return ans;
| ~~~~~~~~~~~^~~~
fun.cpp: In function 'std::vector<int> createFunTour(int, int)':
fun.cpp:61:1: warning: control reaches end of non-void function [-Wreturn-type]
61 | }
| ^
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
0 ms |
348 KB |
Tour is not fun |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
0 ms |
348 KB |
Tour is not fun |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Incorrect |
0 ms |
344 KB |
Tour is not fun |
3 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Incorrect |
0 ms |
344 KB |
Tour is not fun |
3 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
0 ms |
348 KB |
Tour is not fun |
2 |
Halted |
0 ms |
0 KB |
- |