# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
974761 | Nika533 | Longest Trip (IOI23_longesttrip) | C++17 | 768 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.
#pragma GCC diagnostic warning "-std=c++11"
#include <bits/stdc++.h>
#include "longesttrip.h"
#define pb push_back
#define f first
#define s second
#define MOD 1000000007
#define flush fflush(stdout)
#define all(x) (x).begin(),(x).end()
#define allr(x) (x).rbegin(), (x).rend()
#define pii pair<int,int>
using namespace std;
int n,m,T,k;
vector<int> longest_trip(int N, int D) {
vector<int> v;
int e[N][N];
for (int i=0; i<N; i++) {
for (int j=0; j<N; j++) {
e[i][j]=0;
}
}
vector<int> v1,v2;
for (int i=0; i<N; i++) {
for (int j=i+1; j<N; j++) {
vector<int> a,b; a.pb(i); b.pb(j);
if (are_connected(a,b)) {
e[i][j]=1; e[j][i]=1;
}
}
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... |