# | TimeUTC-0 | 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
{
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... |