oj.uz

답안 #1108696

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1108696 2024-11-04T19:16:53 Z jerzyk 가장 긴 여행 (IOI23_longesttrip) C++17
30 / 100
 16 ms 612 KB 
#include <bits/stdc++.h>
#include "longesttrip.h"

using namespace std;
#define pb push_back
#define st first
#define nd second
typedef long long ll;
typedef long double ld;
const ll I = 1000LL * 1000LL * 1000LL * 1000LL * 1000LL * 1000LL;
const int II = 2 * 1000 * 1000 * 1000;
const int N = 1000 * 1000 + 7;

bool SQ(int a, int b)
{
	vector<int> v1 = {a}, v2 = {b};
	return are_connected(v1, v2);
}

void J(vector<int> &a, vector<int> &b)
{
	for(int i = 0; i < (int)b.size(); ++i)
		a.pb(b[i]);
	b.clear();
}

vector<int> longest_trip(int _N, int _X_D)
{
	int n = _N;
	vector<int> l1, l2;
	l1.pb(0);

	if(n == 1) return l1;

	for(int i = 1; i < n; ++i)
	{
		if(SQ(i, l1.back()))
		{
			l1.pb(i);
			continue;
		}
		if((int)l2.size() == 0 || SQ(i, l2.back()))
		{
			l2.pb(i);
			continue;
		}
		reverse(l2.begin(), l2.end());
		J(l1, l2);

		l2.pb(i);
	}
	if(l1.size() < l2.size())
		swap(l1, l2);
	return l1;
}

Subtask #0
0.0 / 0.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 504 KB Output is correct
2 Incorrect 3 ms 336 KB Incorrect
3 Halted 0 ms 0 KB -

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 336 KB Output is correct
2 Correct 7 ms 336 KB Output is correct
3 Correct 10 ms 336 KB Output is correct
4 Correct 9 ms 336 KB Output is correct
5 Correct 8 ms 336 KB Output is correct

Subtask #2
0.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 336 KB Output is correct
2 Correct 9 ms 336 KB Output is correct
3 Correct 11 ms 336 KB Output is correct
4 Correct 7 ms 336 KB Output is correct
5 Correct 9 ms 336 KB Output is correct
6 Incorrect 1 ms 336 KB Incorrect
7 Halted 0 ms 0 KB -

Subtask #3
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 336 KB Output is correct
2 Correct 8 ms 336 KB Output is correct
3 Correct 8 ms 504 KB Output is correct
4 Correct 7 ms 336 KB Output is correct
5 Correct 8 ms 336 KB Output is correct
6 Correct 8 ms 336 KB Output is correct
7 Correct 10 ms 336 KB Output is correct
8 Correct 8 ms 508 KB Output is correct
9 Correct 9 ms 336 KB Output is correct
10 Correct 8 ms 336 KB Output is correct
11 Correct 8 ms 336 KB Output is correct
12 Correct 7 ms 336 KB Output is correct
13 Correct 9 ms 336 KB Output is correct
14 Correct 10 ms 336 KB Output is correct
15 Correct 9 ms 336 KB Output is correct
16 Correct 8 ms 336 KB Output is correct
17 Correct 9 ms 336 KB Output is correct
18 Correct 9 ms 336 KB Output is correct
19 Correct 9 ms 336 KB Output is correct
20 Correct 8 ms 336 KB Output is correct
21 Correct 8 ms 336 KB Output is correct
22 Correct 10 ms 592 KB Output is correct
23 Correct 9 ms 336 KB Output is correct
24 Correct 8 ms 436 KB Output is correct
25 Correct 12 ms 336 KB Output is correct
26 Correct 12 ms 336 KB Output is correct
27 Correct 9 ms 336 KB Output is correct
28 Correct 13 ms 336 KB Output is correct
29 Correct 8 ms 336 KB Output is correct
30 Correct 9 ms 336 KB Output is correct
31 Correct 9 ms 336 KB Output is correct
32 Correct 11 ms 336 KB Output is correct
33 Correct 8 ms 336 KB Output is correct
34 Correct 9 ms 336 KB Output is correct
35 Correct 11 ms 336 KB Output is correct
36 Correct 8 ms 336 KB Output is correct
37 Correct 10 ms 336 KB Output is correct
38 Correct 9 ms 336 KB Output is correct
39 Correct 11 ms 336 KB Output is correct
40 Correct 11 ms 336 KB Output is correct
41 Correct 12 ms 336 KB Output is correct
42 Correct 15 ms 336 KB Output is correct
43 Correct 9 ms 336 KB Output is correct
44 Correct 11 ms 336 KB Output is correct
45 Correct 8 ms 336 KB Output is correct
46 Correct 13 ms 336 KB Output is correct
47 Correct 9 ms 336 KB Output is correct
48 Correct 8 ms 336 KB Output is correct
49 Correct 9 ms 336 KB Output is correct
50 Correct 11 ms 336 KB Output is correct
51 Correct 11 ms 336 KB Output is correct
52 Correct 9 ms 336 KB Output is correct
53 Correct 9 ms 336 KB Output is correct
54 Correct 9 ms 336 KB Output is correct
55 Correct 9 ms 336 KB Output is correct
56 Correct 7 ms 336 KB Output is correct
57 Correct 11 ms 336 KB Output is correct
58 Correct 16 ms 612 KB Output is correct
59 Correct 11 ms 336 KB Output is correct
60 Correct 10 ms 612 KB Output is correct
61 Correct 13 ms 336 KB Output is correct
62 Correct 11 ms 592 KB Output is correct
63 Correct 13 ms 336 KB Output is correct
64 Correct 11 ms 336 KB Output is correct

Subtask #4
0.0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 336 KB Output is correct
2 Correct 11 ms 336 KB Output is correct
3 Correct 12 ms 336 KB Output is correct
4 Correct 9 ms 336 KB Output is correct
5 Correct 10 ms 336 KB Output is correct
6 Incorrect 1 ms 336 KB Incorrect
7 Halted 0 ms 0 KB -