#include "longesttrip.h"
#include<bits/stdc++.h>
using namespace std;
std::vector<int> longest_trip(int N, int D)
{
for(int i=0;i<N;i++){
for(int j=i+1;j<N;j++){
are_connected({i},{j});
}
}
vector<int>v;
for(int i=0;i<N;i++){
v.push_back(i);
}
return v;
}
# |
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 |
6 ms |
344 KB |
Output is correct |
2 |
Correct |
19 ms |
344 KB |
Output is correct |
3 |
Correct |
127 ms |
340 KB |
Output is correct |
4 |
Correct |
319 ms |
344 KB |
Output is correct |
5 |
Correct |
680 ms |
416 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
5 ms |
344 KB |
Output is correct |
2 |
Correct |
18 ms |
344 KB |
Output is correct |
3 |
Correct |
115 ms |
344 KB |
Output is correct |
4 |
Correct |
345 ms |
344 KB |
Output is correct |
5 |
Correct |
694 ms |
408 KB |
Output is correct |
6 |
Incorrect |
0 ms |
344 KB |
Incorrect |
7 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
5 ms |
344 KB |
Output is correct |
2 |
Correct |
22 ms |
344 KB |
Output is correct |
3 |
Correct |
120 ms |
344 KB |
Output is correct |
4 |
Correct |
354 ms |
344 KB |
Output is correct |
5 |
Correct |
635 ms |
412 KB |
Output is correct |
6 |
Incorrect |
0 ms |
344 KB |
Incorrect |
7 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
5 ms |
344 KB |
Output is correct |
2 |
Correct |
25 ms |
344 KB |
Output is correct |
3 |
Partially correct |
128 ms |
344 KB |
Output is partially correct |
4 |
Partially correct |
343 ms |
344 KB |
Output is partially correct |
5 |
Partially correct |
708 ms |
412 KB |
Output is partially correct |
6 |
Incorrect |
0 ms |
344 KB |
Incorrect |
7 |
Halted |
0 ms |
0 KB |
- |