# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
980594 | 12345678 | Longest Trip (IOI23_longesttrip) | C++17 | 12 ms | 864 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;
const int nx=305;
std::vector<int> longest_trip(int N, int D)
{
vector<int> d[2];
d[0].push_back(0);
d[1].push_back(1);
bool not_connected=0;
for (int i=2; i<N; i++)
{
if (are_connected(vector<int> {d[0].back()}, vector<int> {i}))
{
not_connected=0;
d[0].push_back(i);
continue;
}
if (not_connected||are_connected(vector<int> {d[1].back()}, vector<int> {i}))
{
not_connected=1;
d[1].push_back(i);
continue;
}
if (d[1].size()==1) not_connected=1;
else not_connected=0;
while (!d[1].empty()) d[0].push_back(d[1].back()), d[1].pop_back();
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... |