oj.uz

Submission #939831

# Submission time Handle Problem Language Result Execution time Memory
939831 2024-03-06T19:37:25 Z weajink Longest Trip (IOI23_longesttrip) C++17
15 / 100
 9 ms 800 KB 
#include <bits/stdc++.h>
#include "longesttrip.h"
using namespace std;
typedef long long ll;

vector<int> sciezka[2];

void dodaj_wierzcholek(int v){
	if (!sciezka[0].size() || are_connected({v},{sciezka[0].back()})){
		sciezka[0].push_back(v);
		return;
	}
	if (!sciezka[1].size() || are_connected({v},{sciezka[1].back()})){
		sciezka[1].push_back(v);
		return;
	}
	for (int i = (int)sciezka[1].size()-1; i >= 0; i--) sciezka[0].push_back(sciezka[1][i]);
	sciezka[1] = {v};
}
void dodaj_wierzcholki(int v1, int v2){
	if (are_connected({v1},{v2})){
		dodaj_wierzcholek(v1);
		if (sciezka[0].back() == v1) sciezka[0].push_back(v2);
		else sciezka[1].push_back(v2);
		return;
	}
	if (!are_connected({v1},{sciezka[0].back()})) swap(v1,v2);
	sciezka[0].push_back(v1);
	if (are_connected({v1},{sciezka[1].back()})){
		for (int x : sciezka[1]) sciezka[0].push_back(x);
		sciezka[1] = {v2};
	}else sciezka[1].push_back(v2);
}
int zbinsearchuj(vector<int> A, vector<int> B){
	if (A.size() == 1) return A.back();
	vector<int> polowy[2];
	for (int i = 0; i < (int)A.size(); i++){
		polowy[i>=((int)A.size()/2)].push_back(A[i]);
	}
	if (are_connected(polowy[0],B)) return zbinsearchuj(polowy[0],B);
	else return zbinsearchuj(polowy[1],B); 
}	
vector<int> longest_trip(int N, int D){
	sciezka[0].clear();
	sciezka[1].clear();
	for (int i = 0; i < N; i++){
		if (sciezka[0].size() && sciezka[1].size() && i < N-1){
			dodaj_wierzcholki(i,i+1);
			i++;
		}else dodaj_wierzcholek(i);
	}
	if (sciezka[0].size() < sciezka[1].size()) swap(sciezka[0],sciezka[1]);
	if (!sciezka[1].size()) return sciezka[0];
	if (!are_connected(sciezka[0],sciezka[1])) return sciezka[0];
	//
	if (are_connected({sciezka[0].back()},{sciezka[1][0]})){
		vector<int> wynik;
		for (int x : sciezka[0]) wynik.push_back(x);
		for (int x : sciezka[1]) wynik.push_back(x);
		return wynik;
	}
	reverse(sciezka[0].begin(),sciezka[0].end());
	if (are_connected({sciezka[0].back()},{sciezka[1][0]})){
		vector<int> wynik;
		for (int x : sciezka[0]) wynik.push_back(x);
		for (int x : sciezka[1]) wynik.push_back(x);
		return wynik;
	}
	reverse(sciezka[1].begin(),sciezka[1].end());
	if (are_connected({sciezka[0].back()},{sciezka[1][0]})){
		vector<int> wynik;
		for (int x : sciezka[0]) wynik.push_back(x);
		for (int x : sciezka[1]) wynik.push_back(x);
		return wynik;
	}
	reverse(sciezka[0].begin(),sciezka[0].end());
	if (are_connected({sciezka[0].back()},{sciezka[1][0]})){
		vector<int> wynik;
		for (int x : sciezka[0]) wynik.push_back(x);
		for (int x : sciezka[1]) wynik.push_back(x);
		return wynik;
	}
	//
	int a = zbinsearchuj(sciezka[0],sciezka[1]);
	int b = zbinsearchuj(sciezka[1],{a});
	vector<int> wy[2];
	bool flag = 0;
	for (int x : sciezka[0]){
		wy[flag].push_back(x);
		if (x == a) flag = 1;
	}
	vector<int> wynik;
	for (int x : wy[1]) wynik.push_back(x);
	for (int x : wy[0]) wynik.push_back(x);
	wy[0] = wy[1] = {};	
	flag = 0;
	for (int x : sciezka[1]){
		if (x == b) flag = 1;
		wy[flag].push_back(x);
	}
	for (int x : wy[1]) wynik.push_back(x);
	for (int x : wy[0]) wynik.push_back(x);
	return wynik;
}

Subtask #0
0.0 / 0.0

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

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 344 KB Output is correct
2 Correct 5 ms 344 KB Output is correct
3 Correct 5 ms 344 KB Output is correct
4 Correct 5 ms 344 KB Output is correct
5 Correct 5 ms 600 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 344 KB Output is correct
2 Correct 4 ms 344 KB Output is correct
3 Correct 4 ms 344 KB Output is correct
4 Correct 4 ms 340 KB Output is correct
5 Correct 4 ms 600 KB Output is correct
6 Correct 7 ms 344 KB Output is correct
7 Correct 7 ms 344 KB Output is correct
8 Correct 5 ms 344 KB Output is correct
9 Correct 5 ms 600 KB Output is correct
10 Correct 4 ms 344 KB Output is correct
11 Correct 4 ms 344 KB Output is correct
12 Correct 4 ms 344 KB Output is correct
13 Correct 5 ms 344 KB Output is correct

Subtask #3
0.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 344 KB Output is correct
2 Correct 6 ms 344 KB Output is correct
3 Correct 4 ms 344 KB Output is correct
4 Correct 4 ms 344 KB Output is correct
5 Correct 5 ms 344 KB Output is correct
6 Correct 7 ms 344 KB Output is correct
7 Correct 7 ms 344 KB Output is correct
8 Correct 4 ms 344 KB Output is correct
9 Correct 4 ms 344 KB Output is correct
10 Correct 5 ms 344 KB Output is correct
11 Correct 5 ms 344 KB Output is correct
12 Correct 5 ms 344 KB Output is correct
13 Correct 4 ms 344 KB Output is correct
14 Correct 6 ms 344 KB Output is correct
15 Correct 7 ms 344 KB Output is correct
16 Incorrect 2 ms 344 KB Incorrect
17 Halted 0 ms 0 KB -

Subtask #4
0.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 344 KB Output is correct
2 Correct 5 ms 344 KB Output is correct
3 Correct 5 ms 344 KB Output is correct
4 Correct 4 ms 344 KB Output is correct
5 Correct 4 ms 344 KB Output is correct
6 Correct 7 ms 344 KB Output is correct
7 Correct 5 ms 344 KB Output is correct
8 Correct 4 ms 344 KB Output is correct
9 Correct 5 ms 800 KB Output is correct
10 Correct 5 ms 600 KB Output is correct
11 Correct 5 ms 344 KB Output is correct
12 Correct 6 ms 344 KB Output is correct
13 Correct 6 ms 344 KB Output is correct
14 Correct 9 ms 344 KB Output is correct
15 Correct 7 ms 344 KB Output is correct
16 Incorrect 2 ms 344 KB Incorrect
17 Halted 0 ms 0 KB -