oj.uz

Submission #1060336

# Submission time Handle Problem Language Result Execution time Memory
1060336 2024-08-15T13:06:34 Z mychecksedad Longest Trip (IOI23_longesttrip) C++17
15 / 100
 1000 ms 1496 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];
  }
  
  deque<int> a, b;
  a.pb(0);
  for(int i = 1; i < n; ++i){
    if(is[a[0]][i]){
      a.push_front(i);
    }else if(is[a.back()][i]){
      a.pb(i);
    }else{
      if(b.empty()) b.pb(i);
      else{
        if(is[b[0]][i]){
          b.push_front(i);
        }else if(is[b.back()][i]){
          b.pb(i);
        }else{
          if(is[a[0]][b[0]]){
            for(int x: b) a.push_front(x);
            b.clear();
            b.pb(i);
          }else{
            assert(false);
          }
        }
      }
    }
  }
  while(a.size() < n){
    if(is[a[0]][a.back()] == 0){
      if(is[a[0]][b.back()] == 1){
        a.push_front(b.back());
        b.pop_back();
      }else{
        a.pb(b.back());
        b.pop_back();
      }
    }else{
      bool ok = 1;
      for(int i = 0; i < a.size(); ++i){
        for(int j = i + 1; j < a.size(); ++j){
          int u = a[i], v = a[j];
          if(is[u][v] == 0){
            if(is[b.back()][u] == 1){
              while(a.front() != u){
                int x = a.front();
                a.pop_front();
                a.pb(x);
              }
              a.push_front(b.back());
              b.pop_back();
            }else{
              while(a.front() != v){
                int x = a.front();
                a.pop_front();
                a.pb(x);
              }
              a.push_front(b.back());
              b.pop_back();
            }
            ok = 1;
            break;
          }
          if(ok) break;
        }
      }
    }
  }
  vi res(all(a));
  return res;
}

Compilation message

longesttrip.cpp: In function 'std::vector<int> longest_trip(int, int)':
longesttrip.cpp:129:18: warning: comparison of integer expressions of different signedness: 'std::deque<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
  129 |   while(a.size() < n){
      |         ~~~~~~~~~^~~
longesttrip.cpp:140:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::deque<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  140 |       for(int i = 0; i < a.size(); ++i){
      |                      ~~^~~~~~~~~~
longesttrip.cpp:141:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::deque<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  141 |         for(int j = i + 1; j < a.size(); ++j){
      |                            ~~^~~~~~~~~~

Subtask #0
0.0 / 0.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Execution timed out 3070 ms 1024 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 3 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 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 5 ms 344 KB Output is correct
6 Correct 7 ms 344 KB Output is correct
7 Correct 7 ms 344 KB Output is correct
8 Correct 5 ms 344 KB Output is correct
9 Correct 5 ms 344 KB Output is correct
10 Correct 5 ms 344 KB Output is correct
11 Correct 6 ms 344 KB Output is correct
12 Correct 5 ms 432 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 7 ms 344 KB Output is correct
2 Correct 24 ms 344 KB Output is correct
3 Correct 133 ms 600 KB Output is correct
4 Correct 388 ms 520 KB Output is correct
5 Correct 828 ms 1496 KB Output is correct
6 Correct 5 ms 344 KB Output is correct
7 Correct 22 ms 344 KB Output is correct
8 Correct 148 ms 600 KB Output is correct
9 Correct 318 ms 724 KB Output is correct
10 Correct 873 ms 948 KB Output is correct
11 Correct 802 ms 1044 KB Output is correct
12 Correct 807 ms 848 KB Output is correct
13 Correct 834 ms 888 KB Output is correct
14 Correct 7 ms 344 KB Output is correct
15 Correct 10 ms 344 KB Output is correct
16 Execution timed out 3097 ms 344 KB Time limit exceeded
17 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 22 ms 600 KB Output is correct
3 Partially correct 140 ms 436 KB Output is partially correct
4 Partially correct 407 ms 1104 KB Output is partially correct
5 Partially correct 769 ms 984 KB Output is partially correct
6 Correct 7 ms 344 KB Output is correct
7 Correct 30 ms 600 KB Output is correct
8 Partially correct 125 ms 460 KB Output is partially correct
9 Partially correct 246 ms 752 KB Output is partially correct
10 Partially correct 793 ms 924 KB Output is partially correct
11 Partially correct 820 ms 988 KB Output is partially correct
12 Partially correct 813 ms 984 KB Output is partially correct
13 Partially correct 823 ms 1300 KB Output is partially correct
14 Correct 7 ms 344 KB Output is correct
15 Correct 15 ms 344 KB Output is correct
16 Execution timed out 3068 ms 436 KB Time limit exceeded
17 Halted 0 ms 0 KB -