oj.uz

답안 #1060348

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1060348 2024-08-15T13:15:07 Z mychecksedad 가장 긴 여행 (IOI23_longesttrip) C++17
15 / 100
 1000 ms 1488 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.back()][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);
  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;
      }
      if(!ok) break;
    }
  }
  vi res(all(a));
  return res;
}

Compilation message

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

Subtask #0
0.0 / 0.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 176 ms 1328 KB Output is correct

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 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 340 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 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 6 ms 344 KB Output is correct
5 Correct 4 ms 344 KB Output is correct
6 Correct 4 ms 344 KB Output is correct
7 Correct 5 ms 344 KB Output is correct
8 Correct 5 ms 344 KB Output is correct
9 Correct 4 ms 344 KB Output is correct
10 Correct 6 ms 344 KB Output is correct
11 Correct 5 ms 344 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

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 344 KB Output is correct
2 Correct 20 ms 596 KB Output is correct
3 Correct 168 ms 436 KB Output is correct
4 Correct 424 ms 600 KB Output is correct
5 Correct 839 ms 1488 KB Output is correct
6 Correct 7 ms 344 KB Output is correct
7 Correct 23 ms 344 KB Output is correct
8 Correct 157 ms 692 KB Output is correct
9 Correct 299 ms 504 KB Output is correct
10 Correct 815 ms 916 KB Output is correct
11 Correct 804 ms 1016 KB Output is correct
12 Correct 711 ms 736 KB Output is correct
13 Correct 718 ms 764 KB Output is correct
14 Correct 7 ms 344 KB Output is correct
15 Correct 12 ms 432 KB Output is correct
16 Execution timed out 3091 ms 344 KB Time limit exceeded
17 Halted 0 ms 0 KB -

Subtask #4
0.0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 344 KB Output is correct
2 Correct 21 ms 344 KB Output is correct
3 Partially correct 133 ms 440 KB Output is partially correct
4 Partially correct 366 ms 504 KB Output is partially correct
5 Partially correct 763 ms 724 KB Output is partially correct
6 Correct 9 ms 344 KB Output is correct
7 Correct 20 ms 344 KB Output is correct
8 Partially correct 124 ms 440 KB Output is partially correct
9 Partially correct 296 ms 704 KB Output is partially correct
10 Partially correct 728 ms 896 KB Output is partially correct
11 Partially correct 778 ms 884 KB Output is partially correct
12 Partially correct 744 ms 988 KB Output is partially correct
13 Partially correct 723 ms 1176 KB Output is partially correct
14 Correct 8 ms 344 KB Output is correct
15 Correct 11 ms 344 KB Output is correct
16 Execution timed out 3012 ms 344 KB Time limit exceeded
17 Halted 0 ms 0 KB -