#include "longesttrip.h"
#include <bits/stdc++.h>
using namespace std;
int idx[300];
vector <int> longest_trip(int N, int D){
vector <int> a,b;
iota(idx,idx+N,0);
shuffle(idx,idx+N,default_random_engine(chrono::steady_clock::now().time_since_epoch().count()));
a.push_back(idx[0]);
b.push_back(idx[1]);
int ch=0;
for (int j=2;j<N;j++){
int i=idx[j];
if (are_connected({a.back()},{i})){
a.push_back(i);
ch=1;
continue;
}
if (ch||are_connected({b.back()},{i})){
b.push_back(i);
ch=1;
continue;
}
ch=0;
reverse(b.begin(),b.end());
for (int i:b)
a.push_back(i);
b={i};
}
if (a.size()<b.size())
swap(a,b);
if (!are_connected(a,b))
return a;
vector <int> x={0,a.size()-1},y={0,b.size()-1};
for (int i:x)
for (int j:y)
if (are_connected({a[i]},{b[j]})){
if (!i)
reverse(a.begin(),a.end());
if (j)
reverse(b.begin(),b.end());
for (int k:b)
a.push_back(k);
return a;
}
int l=0,r=b.size()-1,i=-1;
while (l<=r){
int mid=(l+r)>>1;
vector <int> tmp;
for (int i=0;i<=mid;i++)
tmp.push_back(b[i]);
if (are_connected(a,tmp)){
i=mid;
r=mid-1;
}
else
l=mid+1;
}
l=0,r=a.size()-1;
int j=-1;
while (l<=r){
int mid=(l+r)>>1;
vector <int> tmp;
for (int i=0;i<=mid;i++)
tmp.push_back(a[i]);
if (are_connected(tmp,{b[i]})){
j=mid;
r=mid-1;
}
else
l=mid+1;
}
vector <int> c;
for (int k=(j+1)%a.size();c.size()<a.size();k=(k+1)%a.size())
c.push_back(a[k]);
for (int k=i;c.size()<a.size()+b.size();k=(k+1)%b.size())
c.push_back(b[k]);
return c;
}
Compilation message
longesttrip.cpp: In function 'std::vector<int> longest_trip(int, int)':
longesttrip.cpp:34:31: warning: narrowing conversion of '(a.std::vector<int>::size() - 1)' from 'std::vector<int>::size_type' {aka 'long unsigned int'} to 'int' [-Wnarrowing]
34 | vector <int> x={0,a.size()-1},y={0,b.size()-1};
| ~~~~~~~~^~
longesttrip.cpp:34:31: warning: narrowing conversion of '(a.std::vector<int>::size() - 1)' from 'std::vector<int>::size_type' {aka 'long unsigned int'} to 'int' [-Wnarrowing]
longesttrip.cpp:34:48: warning: narrowing conversion of '(b.std::vector<int>::size() - 1)' from 'std::vector<int>::size_type' {aka 'long unsigned int'} to 'int' [-Wnarrowing]
34 | vector <int> x={0,a.size()-1},y={0,b.size()-1};
| ~~~~~~~~^~
longesttrip.cpp:34:48: warning: narrowing conversion of '(b.std::vector<int>::size() - 1)' from 'std::vector<int>::size_type' {aka 'long unsigned int'} to 'int' [-Wnarrowing]
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
344 KB |
Incorrect |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
8 ms |
344 KB |
Output is correct |
2 |
Correct |
7 ms |
344 KB |
Output is correct |
3 |
Correct |
4 ms |
344 KB |
Output is correct |
4 |
Correct |
4 ms |
344 KB |
Output is correct |
5 |
Correct |
5 ms |
600 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
6 ms |
344 KB |
Output is correct |
2 |
Correct |
5 ms |
344 KB |
Output is correct |
3 |
Correct |
4 ms |
344 KB |
Output is correct |
4 |
Correct |
4 ms |
344 KB |
Output is correct |
5 |
Correct |
4 ms |
600 KB |
Output is correct |
6 |
Correct |
8 ms |
344 KB |
Output is correct |
7 |
Correct |
5 ms |
344 KB |
Output is correct |
8 |
Correct |
5 ms |
344 KB |
Output is correct |
9 |
Correct |
5 ms |
596 KB |
Output is correct |
10 |
Correct |
4 ms |
344 KB |
Output is correct |
11 |
Correct |
4 ms |
344 KB |
Output is correct |
12 |
Correct |
4 ms |
344 KB |
Output is correct |
13 |
Correct |
5 ms |
344 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
7 ms |
344 KB |
Output is correct |
2 |
Correct |
5 ms |
344 KB |
Output is correct |
3 |
Correct |
4 ms |
344 KB |
Output is correct |
4 |
Correct |
4 ms |
344 KB |
Output is correct |
5 |
Correct |
5 ms |
600 KB |
Output is correct |
6 |
Correct |
10 ms |
344 KB |
Output is correct |
7 |
Correct |
5 ms |
344 KB |
Output is correct |
8 |
Correct |
5 ms |
344 KB |
Output is correct |
9 |
Correct |
5 ms |
344 KB |
Output is correct |
10 |
Correct |
5 ms |
596 KB |
Output is correct |
11 |
Correct |
5 ms |
344 KB |
Output is correct |
12 |
Correct |
4 ms |
344 KB |
Output is correct |
13 |
Correct |
5 ms |
344 KB |
Output is correct |
14 |
Correct |
6 ms |
340 KB |
Output is correct |
15 |
Incorrect |
1 ms |
344 KB |
Incorrect |
16 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
8 ms |
344 KB |
Output is correct |
2 |
Correct |
7 ms |
344 KB |
Output is correct |
3 |
Correct |
5 ms |
344 KB |
Output is correct |
4 |
Correct |
4 ms |
344 KB |
Output is correct |
5 |
Correct |
4 ms |
344 KB |
Output is correct |
6 |
Correct |
11 ms |
344 KB |
Output is correct |
7 |
Correct |
5 ms |
344 KB |
Output is correct |
8 |
Correct |
5 ms |
344 KB |
Output is correct |
9 |
Correct |
4 ms |
344 KB |
Output is correct |
10 |
Correct |
5 ms |
600 KB |
Output is correct |
11 |
Correct |
6 ms |
344 KB |
Output is correct |
12 |
Correct |
5 ms |
344 KB |
Output is correct |
13 |
Correct |
5 ms |
344 KB |
Output is correct |
14 |
Correct |
7 ms |
344 KB |
Output is correct |
15 |
Incorrect |
0 ms |
344 KB |
Incorrect |
16 |
Halted |
0 ms |
0 KB |
- |