Submission #1070340

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
1070340	2024-08-22T13:26:07 Z	zsombor	Longest Trip (IOI23_longesttrip)	C++17	15 / 100	7 ms	436 KB

longesttrip

#include "longesttrip.h"
#include <bits/stdc++.h>
using namespace std;

vector<int> longest_trip(int N, int D) {
    bool b01=are_connected({0},{1});
    bool b02=are_connected({0},{2});
    vector <int> v;
    if (!b01) v={0,2,1};
    if (!b02) v={0,1,2};
    if (b01 && b02) v={1,0,2};
    deque<int> d;
    for (int i : v) d.push_back(i);
    for (int i=3;i<N;i++) {
        int a=d.front(),b=d.back();
        if (are_connected({a},{i})) d.push_front(i);
        else d.push_back(i);
    }
    v.clear();
    while (d.size()) {
        v.push_back(d.front());
        d.pop_front();
    }
    return v;
}

Compilation message

longesttrip.cpp: In function 'std::vector<int> longest_trip(int, int)':
longesttrip.cpp:15:25: warning: unused variable 'b' [-Wunused-variable]
   15 |         int a=d.front(),b=d.back();
      |                         ^

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	7 ms	344 KB	Output is correct
2	Correct	7 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	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	6 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	5 ms	344 KB	Output is correct
6	Correct	7 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	344 KB	Output is correct
10	Correct	6 ms	436 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

Subtask #3

0.0 / 25.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	3 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
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	344 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	436 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	6 ms	344 KB	Output is correct
2	Correct	5 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	5 ms	344 KB	Output is correct
6	Correct	6 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	6 ms	344 KB	Output is correct
10	Correct	4 ms	344 KB	Output is correct
11	Correct	5 ms	432 KB	Output is correct
12	Correct	5 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	-