QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#177439 | #7119. Longest Trip | triple321# | 0 | 7ms | 4128kb | C++20 | 1.2kb | 2023-09-12 23:13:15 | 2023-09-12 23:13:16 |
Judging History
answer
#include "longesttrip.h"
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#pragma GCC optimize("Ofast")
using namespace std;
using namespace __gnu_pbds;
#define lg long long
#define ordered_set tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>
#define fastio ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
vector<lg> adj[257];
vector<int> ans, cur;
lg vis[257];
void dfs(lg src)
{
vis[src] = true;
// cout << "ENTER " << src << '\n';
cur.push_back(src);
if(cur.size() > (lg)ans.size()) ans = cur;
for(auto it : adj[src])
{
if(vis[it]) continue;
dfs(it);
}
cur.pop_back();
// cout << "LEAVE " << src << '\n';
vis[src] = false;
return;
}
std::vector<int> longest_trip(int n, int d)
{
for(int i = 0; i < n; i++) adj[i].clear();
ans.clear();
for(int i = 0; i < n; i++)
{
for(int j = i+1; j < n; j++)
{
bool b = are_connected({i}, {j});
if(b)
{
adj[i].push_back(j);
adj[j].push_back(i);
}
}
}
for(int i = 0; i < n; i++)
{
dfs(i);
// cout << '\n';
}
return ans;
}
/*
1
5 1
1
1 1
0 0 1
0 0 0 1
*/
詳細信息
Subtask #1:
score: 0
Time Limit Exceeded
Test #1:
score: 5
Accepted
time: 6ms
memory: 3832kb
input:
341 3 3 1 1 1 1 3 3 1 1 1 1 3 3 1 1 1 1 3 3 1 1 1 1 3 3 1 1 1 1 3 3 1 1 1 1 3 3 1 1 1 1 3 3 1 1 1 1 3 3 1 1 1 1 3 3 1 1 1 1 3 3 1 1 1 1 3 3 1 1 1 1 3 3 1 1 1 1 3 3 1 1 1 1 3 3 1 1 1 1 3 3 1 1 1 1 3 3 1 1 1 1 3 3 1 1 1 1 3 3 1 1 1 1 3 3 1 1 1 1 3 3 1 1 1 1 3 3 1 1 1 1 3 3 1 1 1 1 3 3 1 1 1 1 3 3 1 1 ...
output:
3kC2Ia2048BfyJVGojMUKKtilctlZKcB 0 1 1 0 1 3kC2Ia2048BfyJVGojMUKKtilctlZKcB 0 1 1 0 2 3kC2Ia2048BfyJVGojMUKKtilctlZKcB 0 1 1 1 2 3kC2Ia2048BfyJVGojMUKKtilctlZKcB 1 3 0 1 2 3kC2Ia2048BfyJVGojMUKKtilctlZKcB 0 1 1 0 1 3kC2Ia2048BfyJVGojMUKKtilctlZKcB 0 1 1 0 2 3kC2Ia2048BfyJVGojMUKKtilctlZKcB 0 1 1 1 2...
result:
ok
Test #2:
score: -5
Time Limit Exceeded
input:
103 10 3 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 10 3 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 10 3 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 10 3 ...
output:
3kC2Ia2048BfyJVGojMUKKtilctlZKcB 0 1 1 0 1 3kC2Ia2048BfyJVGojMUKKtilctlZKcB 0 1 1 0 2 3kC2Ia2048BfyJVGojMUKKtilctlZKcB 0 1 1 0 3 3kC2Ia2048BfyJVGojMUKKtilctlZKcB 0 1 1 0 4 3kC2Ia2048BfyJVGojMUKKtilctlZKcB 0 1 1 0 5 3kC2Ia2048BfyJVGojMUKKtilctlZKcB 0 1 1 0 6 3kC2Ia2048BfyJVGojMUKKtilctlZKcB 0 1 1 0 7...
result:
Subtask #2:
score: 0
Time Limit Exceeded
Test #6:
score: 10
Accepted
time: 0ms
memory: 4128kb
input:
341 3 2 1 1 1 1 3 2 1 1 1 1 3 2 1 1 1 1 3 2 1 1 1 1 3 2 1 1 1 1 3 2 1 1 1 1 3 2 1 1 1 1 3 2 1 1 1 1 3 2 1 1 1 1 3 2 1 1 1 1 3 2 1 1 1 1 3 2 1 1 1 1 3 2 1 1 1 1 3 2 1 1 1 1 3 2 1 1 1 1 3 2 1 1 1 1 3 2 1 1 1 1 3 2 1 1 1 1 3 2 1 1 1 1 3 2 1 1 1 1 3 2 1 1 1 1 3 2 1 1 1 1 3 2 1 1 1 1 3 2 1 1 1 1 3 2 1 1 ...
output:
3kC2Ia2048BfyJVGojMUKKtilctlZKcB 0 1 1 0 1 3kC2Ia2048BfyJVGojMUKKtilctlZKcB 0 1 1 0 2 3kC2Ia2048BfyJVGojMUKKtilctlZKcB 0 1 1 1 2 3kC2Ia2048BfyJVGojMUKKtilctlZKcB 1 3 0 1 2 3kC2Ia2048BfyJVGojMUKKtilctlZKcB 0 1 1 0 1 3kC2Ia2048BfyJVGojMUKKtilctlZKcB 0 1 1 0 2 3kC2Ia2048BfyJVGojMUKKtilctlZKcB 0 1 1 1 2...
result:
ok
Test #7:
score: -10
Time Limit Exceeded
input:
103 10 2 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 10 2 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 10 2 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 10 2 ...
output:
3kC2Ia2048BfyJVGojMUKKtilctlZKcB 0 1 1 0 1 3kC2Ia2048BfyJVGojMUKKtilctlZKcB 0 1 1 0 2 3kC2Ia2048BfyJVGojMUKKtilctlZKcB 0 1 1 0 3 3kC2Ia2048BfyJVGojMUKKtilctlZKcB 0 1 1 0 4 3kC2Ia2048BfyJVGojMUKKtilctlZKcB 0 1 1 0 5 3kC2Ia2048BfyJVGojMUKKtilctlZKcB 0 1 1 0 6 3kC2Ia2048BfyJVGojMUKKtilctlZKcB 0 1 1 0 7...
result:
Subtask #3:
score: 0
Time Limit Exceeded
Test #19:
score: 25
Accepted
time: 4ms
memory: 3776kb
input:
341 3 1 1 1 1 1 3 1 1 1 1 1 3 1 1 1 1 1 3 1 1 1 1 1 3 1 1 1 1 1 3 1 1 1 1 1 3 1 1 1 1 1 3 1 1 1 1 1 3 1 1 1 1 1 3 1 1 1 1 1 3 1 1 1 1 1 3 1 1 1 1 1 3 1 1 1 1 1 3 1 1 1 1 1 3 1 1 1 1 1 3 1 1 1 1 1 3 1 1 1 1 1 3 1 1 1 1 1 3 1 1 1 1 1 3 1 1 1 1 1 3 1 1 1 1 1 3 1 1 1 1 1 3 1 1 1 1 1 3 1 1 1 1 1 3 1 1 1 ...
output:
3kC2Ia2048BfyJVGojMUKKtilctlZKcB 0 1 1 0 1 3kC2Ia2048BfyJVGojMUKKtilctlZKcB 0 1 1 0 2 3kC2Ia2048BfyJVGojMUKKtilctlZKcB 0 1 1 1 2 3kC2Ia2048BfyJVGojMUKKtilctlZKcB 1 3 0 1 2 3kC2Ia2048BfyJVGojMUKKtilctlZKcB 0 1 1 0 1 3kC2Ia2048BfyJVGojMUKKtilctlZKcB 0 1 1 0 2 3kC2Ia2048BfyJVGojMUKKtilctlZKcB 0 1 1 1 2...
result:
ok
Test #20:
score: -25
Time Limit Exceeded
input:
103 10 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 10 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 10 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 10 1 ...
output:
3kC2Ia2048BfyJVGojMUKKtilctlZKcB 0 1 1 0 1 3kC2Ia2048BfyJVGojMUKKtilctlZKcB 0 1 1 0 2 3kC2Ia2048BfyJVGojMUKKtilctlZKcB 0 1 1 0 3 3kC2Ia2048BfyJVGojMUKKtilctlZKcB 0 1 1 0 4 3kC2Ia2048BfyJVGojMUKKtilctlZKcB 0 1 1 0 5 3kC2Ia2048BfyJVGojMUKKtilctlZKcB 0 1 1 0 6 3kC2Ia2048BfyJVGojMUKKtilctlZKcB 0 1 1 0 7...
result:
Subtask #4:
score: 0
Time Limit Exceeded
Test #83:
score: 60
Accepted
time: 7ms
memory: 3836kb
input:
341 3 1 1 1 1 1 3 1 1 1 1 1 3 1 1 1 1 1 3 1 1 1 1 1 3 1 1 1 1 1 3 1 1 1 1 1 3 1 1 1 1 1 3 1 1 1 1 1 3 1 1 1 1 1 3 1 1 1 1 1 3 1 1 1 1 1 3 1 1 1 1 1 3 1 1 1 1 1 3 1 1 1 1 1 3 1 1 1 1 1 3 1 1 1 1 1 3 1 1 1 1 1 3 1 1 1 1 1 3 1 1 1 1 1 3 1 1 1 1 1 3 1 1 1 1 1 3 1 1 1 1 1 3 1 1 1 1 1 3 1 1 1 1 1 3 1 1 1 ...
output:
3kC2Ia2048BfyJVGojMUKKtilctlZKcB 0 1 1 0 1 3kC2Ia2048BfyJVGojMUKKtilctlZKcB 0 1 1 0 2 3kC2Ia2048BfyJVGojMUKKtilctlZKcB 0 1 1 1 2 3kC2Ia2048BfyJVGojMUKKtilctlZKcB 1 3 0 1 2 3kC2Ia2048BfyJVGojMUKKtilctlZKcB 0 1 1 0 1 3kC2Ia2048BfyJVGojMUKKtilctlZKcB 0 1 1 0 2 3kC2Ia2048BfyJVGojMUKKtilctlZKcB 0 1 1 1 2...
result:
ok
Test #84:
score: 0
Time Limit Exceeded
input:
103 10 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 10 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 10 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 10 1 ...
output:
3kC2Ia2048BfyJVGojMUKKtilctlZKcB 0 1 1 0 1 3kC2Ia2048BfyJVGojMUKKtilctlZKcB 0 1 1 0 2 3kC2Ia2048BfyJVGojMUKKtilctlZKcB 0 1 1 0 3 3kC2Ia2048BfyJVGojMUKKtilctlZKcB 0 1 1 0 4 3kC2Ia2048BfyJVGojMUKKtilctlZKcB 0 1 1 0 5 3kC2Ia2048BfyJVGojMUKKtilctlZKcB 0 1 1 0 6 3kC2Ia2048BfyJVGojMUKKtilctlZKcB 0 1 1 0 7...