Submission #980126

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
980126	2024-05-12T00:01:26 Z	vjudge1	Longest Trip (IOI23_longesttrip)	C++17	15 / 100	6 ms	608 KB

longesttrip

#include "longesttrip.h"
#include <bits/stdc++.h>
#define rep(a,b,c) for(int a=b; a<c; a++)
#define repa(a,b) for(auto a:b)
#define ll long long
#define pll pair<ll, ll>
#define pb push_back
#define pf push_front
#define fi first
#define se second

using namespace std;

vector<int> longest_trip(int N, int D){
	deque<int> ans;
	vector<int> aaa;
	ans.pb(0);
	int lf;
	if(are_connected({1},{0})) ans.pb(1), lf=2;
	else ans.pb(2), lf=1;
	if(are_connected({1},{2})) ans.pb(lf);
	else ans.pf(lf);
	rep(i,3,N){
		if(are_connected({i},{ans.back()})) ans.pb(i);
		else ans.pf(i);
	}
	repa(e,ans) aaa.pb(e);
	return aaa;
}

Subtask #0

0.0 / 0.0

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

Subtask #1

5.0 / 5.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	5 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	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	344 KB	Output is correct
5	Correct	4 ms	344 KB	Output is correct
6	Correct	6 ms	344 KB	Output is correct
7	Correct	6 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	5 ms	608 KB	Output is correct
11	Correct	4 ms	344 KB	Output is correct
12	Correct	5 ms	344 KB	Output is correct
13	Correct	6 ms	600 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	5 ms	344 KB	Output is correct
4	Correct	4 ms	344 KB	Output is correct
5	Correct	5 ms	600 KB	Output is correct
6	Correct	5 ms	344 KB	Output is correct
7	Correct	5 ms	344 KB	Output is correct
8	Correct	5 ms	344 KB	Output is correct
9	Correct	4 ms	344 KB	Output is correct
10	Correct	5 ms	540 KB	Output is correct
11	Correct	4 ms	344 KB	Output is correct
12	Correct	5 ms	344 KB	Output is correct
13	Correct	4 ms	600 KB	Output is correct
14	Incorrect	1 ms	344 KB	Incorrect
15	Halted	0 ms	0 KB	-

Subtask #4

0.0 / 60.0

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