Submission #1028916

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
1028916	2024-07-20T10:17:36 Z	Mr_Husanboy	Longest Trip (IOI23_longesttrip)	C++17	15 / 100	8 ms	600 KB

longesttrip

#include "longesttrip.h"
#include <bits/stdc++.h>

using namespace std;

#define ll long long
#define ff first
#define ss second
#define all(a) (a).begin(), (a).end()

template<typename T>
int len(T &a){return a.size();}


int ask(int a, int b){
    return are_connected({a}, {b});
}


vector<int> longest_trip(int n, int d)
{
    deque<int> cur = {0};
    vector<int> done(n, 0);
    done[0] = 1;
    for(int i = 1; i < n; i ++){
        if(ask(cur[0], i)){
            cur.push_back(i);
            done[i] = 1;
            break;
        }
    }
    for(int i = 0; i < n; i ++){
        if(done[i]) continue;
        if(ask(cur[0], i)){
            cur.push_front(i);
        }else cur.push_back(i);
    }
    vector<int> res;
    for(auto u : cur) res.push_back(u);
    return res;      
}

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

5.0 / 5.0

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