# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1081073 | 2024-08-29T18:01:19 Z | Kipras | Longest Trip (IOI23_longesttrip) | C++17 | 2 ms | 344 KB |
#include <bits/stdc++.h> typedef long long ll; using namespace std; bool are_connected(vector<int> a, vector<int> b); vector<int> longest_trip(int N, int D) { if(D==3) { vector<int> a; for(int i = 0; i < N; i++)a.push_back(i); return a; }else if(D==2) { deque<int> q; if(!are_connected({0}, {1})) { q.push_back(0); q.push_back(2); q.push_back(1); } else if(!are_connected({0}, {2})) { q.push_back(0); q.push_back(1); q.push_back(2); } else if(!are_connected({1}, {2})) { q.push_back(1); q.push_back(0); q.push_back(2); } for(int i = 3; i < N; i++) { if(are_connected({q.front()}, {i})) q.push_front(i); else q.push_back(i); } vector<int> a; for(int i = 0; i < N; i++) { a.push_back(q.front()); q.pop_front(); } return a; } }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 344 KB | Incorrect |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 344 KB | Output is correct |
2 | Correct | 1 ms | 344 KB | Output is correct |
3 | Correct | 1 ms | 344 KB | Output is correct |
4 | Correct | 1 ms | 344 KB | Output is correct |
5 | Correct | 0 ms | 344 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 344 KB | Incorrect |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 344 KB | Incorrect |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 344 KB | Incorrect |
2 | Halted | 0 ms | 0 KB | - |