Submission #1068687

#TimeUsernameProblemLanguageResultExecution timeMemory
1068687MalixLongest Trip (IOI23_longesttrip)C++17
5 / 100
8 ms600 KiB
#include "longesttrip.h" #include <bits/stdc++.h> using namespace std; typedef long long ll; typedef vector<int> vi; typedef vector<vi> vii; typedef pair<int,int> pi; typedef vector<pi> pii; typedef tuple<int,int,int> tii; typedef vector<ll> li; typedef vector<li> lii; #define REP(i,a,b) for(int i=a;i<b;i++) #define F first #define S second #define PB push_back #define MP make_pair #define LSOne(s) ((s)&(-s)) ll INF=1e18+10; int inf=1e9+10; ll M=1e9+7; std::vector<int> longest_trip(int n, int d) { if(d==3){ vi ans; REP(i,0,n)ans.PB(i); return ans; } if(d==2){ deque<int> dq; vi a,b; a.PB(0);b.PB(1); if(are_connected(a,b)){ dq.PB(0); dq.PB(1); b.pop_back();b.PB(2); if(are_connected(a,b))dq.push_front(2); else dq.push_front(2); } else{ dq.PB(0); dq.PB(2); dq.PB(1); } REP(i,3,n){ a.clear();b.clear(); a.PB(dq.back());b.PB(i); if(are_connected(a,b))dq.push_back(i); else dq.push_front(i); } vi ans; REP(i,0,n){ ans.PB(dq.front()); dq.pop_front(); } return ans; } return {}; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...