oj.uz

Submission #1061065

# Submission time Handle Problem Language Result Execution time Memory
1061065 2024-08-16T06:07:48 Z mychecksedad Longest Trip (IOI23_longesttrip) C++17
15 / 100
 15 ms 432 KB 
#include "longesttrip.h"
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define all(x) x.begin(),x.end()
#define ll long long
#define ff first
#define ss second
#define vi vector<int>
const int N = 200005;
 
std::vector<int> longest_trip(int n, int D)
{
  if(D == 3){
    vector<int> v;
    for(int i = 0; i < n; ++i) v.pb(i);
    return v;
  }
  if(D == 2){
    deque<int> v;
    v.pb(0);
    int o = -1;
    for(int i = 1; i < n; ++i){
      bool x = are_connected(vi{0}, vi{i});
      if(x){
        o = i;
        v.pb(i);
        break;
      }
    }
    if(o == -1){
      vi res;
      for(int i = 1; i < n; ++i){
        res.pb(i);
      }
      return res;
    }
    for(int i = 1; i < n; ++i){
      if(o == i) continue;
      bool x = are_connected(vi{v[0]}, vi{i});
      if(x){
        v.push_front(i);
      }else v.pb(i);
    }
    vector<int> res(all(v));
    return res;
  }
  vector<vector<int>> g(n);
  
  deque<int> a, b;
  a.pb(0);
  for(int i = 1; i < n; ++i){
    if(are_connected(vi{a.back()}, vi{i})){
      a.pb(i);
    }else if(!b.empty() && are_connected(vi{b.back()}, vi{i})){
      b.pb(i);
    }else{
      if(b.empty()) b.pb(i);
      else{
        reverse(all(b));
        for(int x: b) a.pb(x);
        b.clear();
        b.pb(i);
      }
    }
    // for(int x:)
  }
  if(b.size()>a.size())swap(a,b);
 
  vi A(all(a));
  vi B(all(b));
 
  if(B.empty()) return A;
 
  if(are_connected(A, B) == 0){
    return A;
  }
 
  int u = -1, v;
 
  if(are_connected(vi{a[0]}, vi{a.back()}) == 0){
    if(are_connected(vi{a[0]}, vi{b.back()}) == 1){
      reverse(all(b));
      for(int x: b) a.push_front(x);
    }else{
      reverse(all(b));
      for(int x: b) a.pb(x);
    }
  }else{
    // cout << "f" << endl;
    int ul = 0, ur = int(b.size()) - 1, ub = -1; vi aa(all(a));
    while(ul <= ur){
      int um = ul+ur>>1;
      vi z;
      for(int j = 0; j <= um; ++j) z.pb(b[j]); 
      if(are_connected(z, aa)){
        ub = um;
        ur = um - 1;
      }else ul = um + 1;
    }
    if(ub == -1){
      assert(false);
      return aa;
    }
    ul = 0, ur = int(a.size()) - 1; int ua = -1;
    while(ul <= ur){
      int um = ul+ur>>1;
      vi z;
      for(int j = 0; j <= um; ++j) z.pb(a[j]);
      if(are_connected(z, vi{b[ub]})){
        ua = um;
        ur = um - 1;
      }else ul = um + 1;
    }
    if(ua == -1){
      assert(false);
      vi res(all(a));
      return res;
    }
    int uu = b[ub];
    while(b.front() != uu){
      int x = b.front();
      b.pop_front();
      b.pb(x);
    }
    u = a[ua];
    while(a.front() != u){
      int x = a.front();
      a.pop_front();
      a.pb(x);
    }
    assert(are_connected(vi{u}, vi{uu}));
    reverse(all(b));
    for(int x: b) a.push_front(x);
  }
  vi res(all(a));
  return res;
}

Compilation message

longesttrip.cpp: In function 'std::vector<int> longest_trip(int, int)':
longesttrip.cpp:93:18: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   93 |       int um = ul+ur>>1;
      |                ~~^~~
longesttrip.cpp:107:18: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  107 |       int um = ul+ur>>1;
      |                ~~^~~
longesttrip.cpp:79:15: warning: unused variable 'v' [-Wunused-variable]
   79 |   int u = -1, v;
      |               ^

Subtask #0
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 2 ms 344 KB Output is correct

Subtask #1
5.0 / 5.0

# 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 0 ms 344 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 0 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 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 8 ms 344 KB Output is correct
7 Correct 5 ms 344 KB Output is correct
8 Correct 7 ms 344 KB Output is correct
9 Correct 6 ms 344 KB Output is correct
10 Correct 5 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 4 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 5 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 5 ms 344 KB Output is correct
6 Correct 9 ms 344 KB Output is correct
7 Incorrect 5 ms 344 KB Incorrect
8 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 8 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 6 ms 344 KB Output is correct
6 Correct 15 ms 344 KB Output is correct
7 Incorrect 5 ms 344 KB Incorrect
8 Halted 0 ms 0 KB -