| # | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1029082 | 2024-07-20T12:10:33 Z | YassineBenYounes | Longest Trip (IOI23_longesttrip) | C++17 | 0 ms | 0 KB |
#include<bits/stdc++.h>
//#include "longesttrip.h"
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef double db;
ll gcd(ll a , ll b) {return b ? gcd(b , a % b) : a ;} // greatest common divisor (PGCD)
ll lcm(ll a , ll b) {return (a * b) / gcd(a , b);} // least common multiple (PPCM)
int dx[8] = {1, 0, 0, -1, 1, 1, -1, -1};
int dy[8] = {0, 1, -1, 0, 1, -1, -1, 1};
#define endl "\n"
#define ss second
#define ff first
#define all(x) (x).begin() , (x).end()
#define pb push_back
#define vi vector<int>
#define vii vector<pair<int,int>>
#define vl vector<ll>
#define vll vector<pair<ll,ll>>
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pdd pair<double,double>
#define vdd vector<pdd>
#define speed ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define pbds tree<pii, null_type, less<pii>,rb_tree_tag, tree_order_statistics_node_update>
using namespace __gnu_pbds;
using namespace std;
////////////////////Only Clear Code//////////////////////////
void usaco_problem(){
freopen("milkvisits.in", "r", stdin);
freopen("milkvisits.out", "w", stdout);
}
void init(){
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif // ONLINE_JUDGE
}
const int mx = 305;
const int LOG = 22;
const int inf = 1e9;
const ll mod = 998244353;
const int sq = 320;
vi graph[mx];
bool vis[mx];
vi ans;
void dfs(int node){
vis[node] = 1;
ans.pb(node);
for(int adj : graph[node]){
if(vis[adj])continue;
dfs(adj);
break;
}
}
vi longest_trip(int N, int D){
if(D == 3){
vi res;
for(int i = 0; i < N;i++){
res.pb(i);
}
return res;
}
else{
for(int i = 0; i < N;i++){
graph[i].clear();
}
for(int i = 0; i < N;i++){
for(int j = i+1;j < N;j++){
if(are_connected({i}, {j})){
graph[i].pb(j);
graph[j].pb(i);
}
}
}
vi res;
for(int i = 0; i < N;i++){
memset(vis, 0, sizeof vis);
ans.clear();
dfs(i);
if(ans.size() > res.size())res = ans;
}
return res;
}
}
/*
int32_t main(){
init();
speed;
}*/
/*
NEVER GIVE UP!
DOING SMTHNG IS BETTER THAN DOING NTHNG!!!
Your Guide when stuck:
- Continue keyword only after reading the whole input
- Don't use memset with testcases
- Check for corner cases(n=1, n=0)
- Check where you declare n(Be careful of declaring it globally and in main)
*/