oj.uz

Submission #938935

# Submission time Handle Problem Language Result Execution time Memory
938935 2024-03-05T22:10:22 Z AdamGS Longest Trip (IOI23_longesttrip) C++17
25 / 100
 8 ms 608 KB 
#include "longesttrip.h"
#include<bits/stdc++.h>
using namespace std;
#define rep(a, b) for(int a = 0; a < (b); ++a)
#define st first
#define nd second
#define pb push_back
#define all(a) a.begin(), a.end()
vector<int>longest_trip(int n, int d) {
  vector<pair<int,int>>X, Y;
  vector<int>A, B;
  rep(i, n/2) if(are_connected({2*i}, {2*i+1})) X.pb({2*i, 2*i+1}); else Y.pb({2*i, 2*i+1});
  if(n%2==1) A.pb(n-1);
  for(auto i : X) {
    if(A.size()==0) {
      A.pb(i.st);
      A.pb(i.nd);
      continue;
    }
    if(B.size()==0) {
      B.pb(i.st);
      B.pb(i.nd);
      continue;
    }
    if(are_connected({A.back()}, {i.st})) {
      A.pb(i.st);
      A.pb(i.nd);
      continue;
    }
    if(are_connected({B.back()}, {i.st})) {
      B.pb(i.st);
      B.pb(i.nd);
      continue;
    }
    reverse(all(B));
    for(auto j : B) A.pb(j);
    B.clear();
    B.pb(i.st);
    B.pb(i.nd);
  }
  for(auto i : Y) {
    if(A.size()==0) {
      A.pb(i.st);
      B.pb(i.nd);
      continue;
    }
    if(!are_connected({A.back()}, {i.st})) swap(i.st, i.nd);
    A.pb(i.st);
    if(B.size()==0 || are_connected({B.back()}, {i.nd})) {
      B.pb(i.nd);
      continue;
    }
    reverse(all(B));
    for(auto j : B) A.pb(j);
    B.clear();
    B.pb(i.nd);
  }
  if(A.size()<B.size()) return B;
  return A;
}

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
0.0 / 5.0

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

Subtask #2
0.0 / 10.0

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

Subtask #3
25.0 / 25.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 4 ms 344 KB Output is correct
4 Correct 4 ms 344 KB Output is correct
5 Correct 4 ms 608 KB Output is correct
6 Correct 4 ms 344 KB Output is correct
7 Correct 4 ms 344 KB Output is correct
8 Correct 4 ms 344 KB Output is correct
9 Correct 4 ms 344 KB Output is correct
10 Correct 5 ms 600 KB Output is correct
11 Correct 4 ms 344 KB Output is correct
12 Correct 5 ms 608 KB Output is correct
13 Correct 4 ms 344 KB Output is correct
14 Correct 4 ms 344 KB Output is correct
15 Correct 5 ms 344 KB Output is correct
16 Correct 6 ms 344 KB Output is correct
17 Correct 5 ms 344 KB Output is correct
18 Correct 5 ms 344 KB Output is correct
19 Correct 5 ms 600 KB Output is correct
20 Correct 5 ms 344 KB Output is correct
21 Correct 5 ms 344 KB Output is correct
22 Correct 5 ms 344 KB Output is correct
23 Correct 5 ms 344 KB Output is correct
24 Correct 5 ms 600 KB Output is correct
25 Correct 5 ms 344 KB Output is correct
26 Correct 5 ms 344 KB Output is correct
27 Correct 7 ms 344 KB Output is correct
28 Correct 4 ms 344 KB Output is correct
29 Correct 4 ms 344 KB Output is correct
30 Correct 5 ms 344 KB Output is correct
31 Correct 6 ms 344 KB Output is correct
32 Correct 7 ms 344 KB Output is correct
33 Correct 4 ms 344 KB Output is correct
34 Correct 4 ms 344 KB Output is correct
35 Correct 4 ms 344 KB Output is correct
36 Correct 4 ms 344 KB Output is correct
37 Correct 4 ms 344 KB Output is correct
38 Correct 5 ms 344 KB Output is correct
39 Correct 6 ms 600 KB Output is correct
40 Correct 6 ms 344 KB Output is correct
41 Correct 5 ms 344 KB Output is correct
42 Correct 8 ms 340 KB Output is correct
43 Correct 7 ms 344 KB Output is correct
44 Correct 5 ms 608 KB Output is correct
45 Correct 4 ms 344 KB Output is correct
46 Correct 6 ms 344 KB Output is correct
47 Correct 4 ms 344 KB Output is correct
48 Correct 7 ms 344 KB Output is correct
49 Correct 4 ms 344 KB Output is correct
50 Correct 5 ms 344 KB Output is correct
51 Correct 5 ms 344 KB Output is correct
52 Correct 6 ms 344 KB Output is correct
53 Correct 4 ms 344 KB Output is correct
54 Correct 5 ms 344 KB Output is correct
55 Correct 4 ms 344 KB Output is correct
56 Correct 4 ms 600 KB Output is correct
57 Correct 4 ms 344 KB Output is correct
58 Correct 5 ms 344 KB Output is correct
59 Correct 5 ms 344 KB Output is correct
60 Correct 7 ms 344 KB Output is correct
61 Correct 5 ms 344 KB Output is correct
62 Correct 6 ms 344 KB Output is correct
63 Correct 6 ms 344 KB Output is correct
64 Correct 6 ms 344 KB Output is correct

Subtask #4
0.0 / 60.0

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