oj.uz

Submission #1059901

# Submission time Handle Problem Language Result Execution time Memory
1059901 2024-08-15T08:59:25 Z mychecksedad Longest Trip (IOI23_longesttrip) C++17
15 / 100
 859 ms 1260 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);
  vector<vector<bool>> is(n, vector<bool>(n));
  for(int i = 0; i < n; ++i){
    for(int j = i + 1; j < n; ++j){
      bool ok = are_connected(vi{i}, vi{j});
      if(ok){
        is[i][j] = is[j][i] = 1;
        g[i].pb(j);
        g[j].pb(i);
      }
    }
  }
  vector<vector<int>> S;
  for(int i = 0; i < n; ++i){
    if(g[i].empty()){
      vi res;
      for(int j = 0; j < n; ++j){
        if(j != i) res.pb(j);
      }
      return res;
    }
    bool okk = 0;
    for(auto &s: S){
      bool ok = 1;
      for(int x: s){
        if(is[x][i] == 0) ok = 0;
      }
      if(ok == 1){
        s.pb(i);
        okk = 1;
        break;
      }
    }
    if(okk == 0){
      S.pb(vi{i});
    }
  }
  if(S.size() == 1) return S[0];
  if(S.size() == 2){
    for(int &x: S[0]){
      for(int &y: S[1]){
        if(is[x][y]){
          swap(x, S[0].back());
          swap(y, S[1][0]);
          vi res;
          for(int f: S[0]) res.pb(f);
          for(int f: S[1]) res.pb(f);
          return res;
        }   
      }
    }
    if(S[0].size() > S[1].size()) return S[0];
    return S[1];
  }
  int s = S.size();
  vector<vector<bool>> si(s, vector<bool>(s));
  for(int i = 0; i < s; ++i){
    for(int j = i + 1; j < s; ++j){
       bool ok = 0;
       for(int x: S[i]){
        for(int y: S[j]){
            if(is[x][y]) ok = 1;
        }
       }
       si[i][j] = si[j][i] = ok;
    }
  }
  deque<int> v;
    v.pb(0);
    int o = -1;
    for(int i = 1; i < s; ++i){
      bool x = si[0][i];
      if(x){
        o = i;
        v.pb(i);
        break;
      }
    }
    if(o == -1){
      assert(false);
    }
    for(int i = 1; i < s; ++i){
      if(o == i) continue;
      bool x = si[v[0]][i];
      if(x){
        v.push_front(i);
      }else{
        assert(si[v.back()][i]);
        v.pb(i);
      }
    }
  
  vector<vector<int>> SS(s);
  for(int i = 0; i < s; ++i) SS[i] = S[v[i]];
  SS.swap(S);

  vector<bool> nextgoer(n);
  vector<int> nxt(s);
  for(int i = 0; i + 1 < s; ++i){
    for(int x: S[i]){
      for(int y: S[i + 1]){
        if(is[x][y]) nextgoer[x] = 1;
      }
      if(nextgoer[x]) ++nxt[i];
    }
  }

  vi res;
  for(int i = 0; i < S.size(); ++i){
    if(i + 1 == S.size()){
      for(int x: S[i]) res.pb(x);
    }else{
      bool ok = 0;
      for(int j = (int(S[i].size() == 1 ? 0 : 1)); j < S[i].size(); ++j){
        for(int l = 0; l < S[i + 1].size(); ++l){
          if(i + 2 < S.size() && nxt[i + 1] == 1 && nextgoer[S[i + 1][l]]) continue;
          if(is[S[i][j]][S[i + 1][l]]){
            swap(S[i][j], S[i].back());
            swap(S[i + 1][l], S[i + 1][0]);
            ok = 1;
            break;
          }
        }
        if(ok) break;
      }
      // if(!ok) assert(false);
      for(int x: S[i]) res.pb(x);
    }
  }
  return res;
}

Compilation message

longesttrip.cpp: In function 'std::vector<int> longest_trip(int, int)':
longesttrip.cpp:156:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  156 |   for(int i = 0; i < S.size(); ++i){
      |                  ~~^~~~~~~~~~
longesttrip.cpp:157:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  157 |     if(i + 1 == S.size()){
      |        ~~~~~~^~~~~~~~~~~
longesttrip.cpp:161:54: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  161 |       for(int j = (int(S[i].size() == 1 ? 0 : 1)); j < S[i].size(); ++j){
      |                                                    ~~^~~~~~~~~~~~~
longesttrip.cpp:162:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  162 |         for(int l = 0; l < S[i + 1].size(); ++l){
      |                        ~~^~~~~~~~~~~~~~~~~
longesttrip.cpp:163:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  163 |           if(i + 2 < S.size() && nxt[i + 1] == 1 && nextgoer[S[i + 1][l]]) continue;
      |              ~~~~~~^~~~~~~~~~

Subtask #0
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 225 ms 940 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 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

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 7 ms 344 KB Output is correct
4 Correct 6 ms 344 KB Output is correct
5 Correct 5 ms 432 KB Output is correct
6 Correct 6 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 7 ms 344 KB Output is correct
10 Correct 5 ms 432 KB Output is correct
11 Correct 7 ms 436 KB Output is correct
12 Correct 7 ms 344 KB Output is correct
13 Correct 8 ms 600 KB Output is correct

Subtask #3
0.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 344 KB Output is correct
2 Correct 30 ms 344 KB Output is correct
3 Correct 132 ms 460 KB Output is correct
4 Correct 372 ms 732 KB Output is correct
5 Correct 678 ms 904 KB Output is correct
6 Correct 7 ms 344 KB Output is correct
7 Correct 25 ms 440 KB Output is correct
8 Correct 132 ms 444 KB Output is correct
9 Correct 268 ms 740 KB Output is correct
10 Correct 705 ms 956 KB Output is correct
11 Correct 810 ms 732 KB Output is correct
12 Correct 834 ms 980 KB Output is correct
13 Correct 859 ms 1260 KB Output is correct
14 Correct 5 ms 344 KB Output is correct
15 Correct 9 ms 344 KB Output is correct
16 Incorrect 18 ms 344 KB Incorrect
17 Halted 0 ms 0 KB -

Subtask #4
0.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 344 KB Output is correct
2 Correct 22 ms 344 KB Output is correct
3 Partially correct 154 ms 344 KB Output is partially correct
4 Partially correct 376 ms 756 KB Output is partially correct
5 Partially correct 817 ms 928 KB Output is partially correct
6 Correct 6 ms 344 KB Output is correct
7 Correct 22 ms 344 KB Output is correct
8 Partially correct 155 ms 344 KB Output is partially correct
9 Partially correct 291 ms 720 KB Output is partially correct
10 Partially correct 830 ms 960 KB Output is partially correct
11 Partially correct 803 ms 984 KB Output is partially correct
12 Partially correct 825 ms 996 KB Output is partially correct
13 Partially correct 797 ms 1208 KB Output is partially correct
14 Correct 9 ms 344 KB Output is correct
15 Correct 11 ms 344 KB Output is correct
16 Incorrect 20 ms 344 KB Incorrect
17 Halted 0 ms 0 KB -