oj.uz

Submission #937252

# Submission time Handle Problem Language Result Execution time Memory
937252 2024-03-03T17:06:44 Z Dan4Life Longest Trip (IOI23_longesttrip) C++17
0 / 100
 6 ms 344 KB 
#include "longesttrip.h"
#include <bits/stdc++.h>
using namespace std;

#define pf push_front
#define pb push_back
#define sz(a) (int)a.size()
#define all(a) begin(a),end(a)

bool edge(int i, int j){
	return are_connected({i},{j});
}

vector<int> longest_trip(int N, int D)
{
	vector<int> v; deque<int> dq;
	v.clear(); dq.clear(); 
	dq.pb(0); int i = 1;
	while(sz(dq)<N){
		if(i==1){
			if(edge(0,1)){
				dq.pb(1);
				if(edge(1,2)) dq.pb(2);
				else dq.pf(2);
			}
			else{
				dq.pb(2); dq.pb(1);
			}
			i = 4;
		}
		else{
			if(edge(dq.back(),i)) dq.pb(i);
			else dq.pf(i);
			i++;
		}
	}
	for(auto u : dq) v.pb(u);
    return v;
}

Subtask #0
0.0 / 0.0

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

Subtask #1
0.0 / 5.0

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

Subtask #2
0.0 / 10.0

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

Subtask #3
0.0 / 25.0

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

Subtask #4
0.0 / 60.0

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