oj.uz

Submission #849307

# Submission time Handle Problem Language Result Execution time Memory
849307 2023-09-14T12:28:06 Z Muaath_5 Longest Trip (IOI23_longesttrip) C++17
0 / 100
 2 ms 344 KB 
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define ld long double

using namespace std;

const ll N = 1005, INF = 7e15;

bool are_connected(vector<int> A, vector<int> B);

vector<int> longest_trip(int N, int D)
{
	if (D == 1) {
		vector<int> ans(N-1);
		iota(ans.begin(), ans.end(), 0);
		return ans;
	}
	else if (D == 2) {

	}
	else {
		// you have two paths and the other points
		// if p1
	}
	return {};
}

Subtask #0
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Incorrect
2 Halted 0 ms 0 KB -

Subtask #1
0.0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Incorrect
2 Halted 0 ms 0 KB -

Subtask #2
0.0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Incorrect
2 Halted 0 ms 0 KB -

Subtask #3
0.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Incorrect 0 ms 344 KB Incorrect
7 Halted 0 ms 0 KB -

Subtask #4
0.0 / 60.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 344 KB Incorrect
2 Halted 0 ms 0 KB -