# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
840763 | firewater | Longest Trip (IOI23_longesttrip) | C++17 | 21 ms | 2824 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<bits/stdc++.h>
#include "longesttrip.h"
#define MX 100100
using namespace std;
int n,now,x,y,z,xx,yy,gg,zz,to[MX];
vector<int>A,B,ans,ans1,ans2,a[MX];
// queue<int>d;
// bool are_connected(std::vector<int> A, std::vector<int> B)
bool check(int x,int y)
{
A.clear();B.clear();
A.push_back(x);
B.push_back(y);
return are_connected(A,B);
}
bool checkk(int x,vector<int> G)
{
A.clear();
A.push_back(x);
return are_connected(A,G);
}
bool checkkk(int x,vector<int> G)
{
A.clear();
for(int i=0;i<=x;++i)
A.push_back(ans1[i]);
return are_connected(A,G);
}
bool checkkkk(int x,int y)
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... |