# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1006778 | amin | Longest Trip (IOI23_longesttrip) | C++17 | 867 ms | 848 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "longesttrip.h"
#include <bits/stdc++.h>
using namespace std;
vector<int> mer(vector<int>a,vector<int>b)
{
vector<int>ans;
reverse(b.begin(),b.end());
ans=a;
for(int i=0;i<b.size();i++)
{
ans.push_back(b[i]);
}
return ans;
}
vector<int> longest_trip(int n, int d)
{
int c[n][n];
for(int i=0;i<n;i++)
{
c[i][i]=0;
for(int y=0;y<i;y++)
{
if(are_connected({i},{y}))
{
c[i][y]=1;
c[y][i]=1;
}else
{
c[i][y]=0;
c[y][i]=0;
}
}
}
vector<int>v1;
vector<int>v2;
v1.push_back(0);
v2.push_back(1);
for(int i=2;i<=n;i++)
{
int x=v1[v1.size()-1];
int y=v2[v2.size()-1];
if(c[x][y]==1)
{
// cout<<1<<' '<<i<<endl;
v1=mer(v1,v2);
v2.clear();
if(i!=n)
v2.push_back(i);
continue;
}
if(i==n)
break;
if(c[x][i]==1)
{
//cout<<2<<' '<<i<<endl;
v1.push_back(i);
continue;
}
if(c[y][i]==1)
{
//cout<<3<<' '<<i<<endl;
v2.push_back(i);
continue;
}
}
if(v2.size()>v1.size())
swap(v1,v2);
return v1;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |