oj.uz

Submission #1060394

# Submission time Handle Problem Language Result Execution time Memory
1060394 2024-08-15T13:41:10 Z mychecksedad Longest Trip (IOI23_longesttrip) C++17
15 / 100
 7 ms 344 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[0]}, vi{i})){
      a.push_front(i);
    }else if(are_connected(vi{a.back()}, vi{i})){
      a.pb(i);
    }else{
      if(b.empty()) b.pb(i);
      else{
        if(are_connected(vi{b[0]}, vi{i})){
          b.push_front(i);
        }else if(are_connected(vi{b.back()}, vi{i})){
          b.pb(i);
        }else{
          if(are_connected(vi{a.back()}, vi{b[0]})){
            for(int x: b) a.pb(x);
            b.clear();
            b.pb(i);
          }else{
            assert(false);
          }
        }
      }
    }
  }
  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;

  for(int i = 0; i < a.size(); ++i){
    for(int j = i + 1; j < a.size(); ++j){
      if(are_connected(vi{a[i]}, vi{a[j]}) == 0){
        u = a[i], v = a[j];
        break;
      }
    }
    if(u != -1) break;
  }

  while(a.size() < n){
    if(are_connected(vi{b.back()}, vi{u}) == 1){
      int cc = 0;
      while(a.front() != u){
        int x = a.front();
        a.pop_front();
        a.pb(x);
        if(cc>n) assert(false);
        ++cc;
      }
      a.push_front(b.back());
      b.pop_back();
    }else{
      int cc = 0;
      while(a.front() != v){
        int x = a.front();
        a.pop_front();
        a.pb(x);
        ++cc;
        if(cc>n) assert(false);
      }
      a.push_front(b.back());
      b.pop_back();
    }
  }
  vi res(all(a));
  return res;
}

Compilation message

longesttrip.cpp: In function 'std::vector<int> longest_trip(int, int)':
longesttrip.cpp:89:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::deque<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   89 |   for(int i = 0; i < a.size(); ++i){
      |                  ~~^~~~~~~~~~
longesttrip.cpp:90:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::deque<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   90 |     for(int j = i + 1; j < a.size(); ++j){
      |                        ~~^~~~~~~~~~
longesttrip.cpp:99:18: warning: comparison of integer expressions of different signedness: 'std::deque<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   99 |   while(a.size() < n){
      |         ~~~~~~~~~^~~
longesttrip.cpp:113:23: warning: 'v' may be used uninitialized in this function [-Wmaybe-uninitialized]
  113 |       while(a.front() != v){
      |             ~~~~~~~~~~^~~~

Subtask #0
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 0 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 7 ms 344 KB Output is correct
2 Correct 4 ms 340 KB Output is correct
3 Correct 7 ms 344 KB Output is correct
4 Correct 6 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 4 ms 340 KB Output is correct
8 Correct 5 ms 344 KB Output is correct
9 Correct 7 ms 344 KB Output is correct
10 Correct 6 ms 344 KB Output is correct
11 Correct 6 ms 344 KB Output is correct
12 Correct 5 ms 344 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 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 7 ms 344 KB Output is correct
6 Incorrect 0 ms 344 KB invalid array
7 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 4 ms 344 KB Output is correct
4 Correct 6 ms 344 KB Output is correct
5 Correct 4 ms 344 KB Output is correct
6 Incorrect 0 ms 344 KB invalid array
7 Halted 0 ms 0 KB -