oj.uz

답안 #1059825

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1059825 2024-08-15T08:31:53 Z mychecksedad 가장 긴 여행 (IOI23_longesttrip) C++17
15 / 100
 856 ms 1172 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() == 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];
  }
  vi res;
  int o = 0;
  for(int i = 0; i < S.size(); ++i){
    if(S[i].size() == 1){
      if(o == 0){
        S[0].swap(S[i]);
        ++o;
      }else if(o == 1){
        S.back().swap(S[i]);
        o += 2;
        break;
      }
    }
  }
  if(o == 1){
    for(int i = 1; i < S.size(); ++i){
      bool ok = 0;
      for(int x: S[i]){
        if(is[x][S[0][0]]){
          ok = 1;
          break;
        }
      }
      if(ok){
        S[1].swap(S[i]);
        break;
      }
    }
  }else if(o == 2){
    for(int i = 0; i + 1 < S.size(); ++i){
      bool ok = 0;
      for(int x: S[i]){
        if(is[x][S.back()[0]]){
          ok = 1;
          break;
        }
      }
      if(ok){
        S[int(S.size()) - 2].swap(S[i]);
        break;
      }
    }
  }else if(o == 3 && S.size() > 3){
    vector<bool> b(S.size());
    vector<bool> b2(S.size());
    for(int i = 1; i < S.size(); ++i){
      bool ok = 0;
      for(int x: S[i]){
        if(is[x][S[0][0]]){
          ok = 1;
          break;
        }
      }
      if(ok){
        b[i] = 1;
      }
    }
    for(int i = 0; i + 1 < S.size(); ++i){
      bool ok = 0;
      for(int x: S[i]){
        if(is[x][S.back()[0]]){
          ok = 1;
          break;
        }
      }
      if(ok){
        b2[i] = 1;
        break;
      }
    }
    bool okk = 0;
    for(int i = 0; i < S.size(); ++i){
      for(int j = 0; j < S.size(); ++j){
        if(i == j) continue;
        if(b[i] && b2[j]){
          S[i].swap(S[1]);
          if(j == 1){
            S[int(S.size()) - 2].swap(S[i]);
          }else{
            S[int(S.size()) - 2].swap(S[j]);
          }
          okk = 1;
          break;
        }
      }
      if(okk) break;
    }
    if(!okk) assert(false);
  }
  for(int i = 0; i < S.size(); ++i){
    if(S[i].size() == 1){
      res.pb(S[i][0]);
      continue;
    }
    vi nxt;
    if(i + 1 < S.size()){
      nxt = S[i + 1];
    }
    if(nxt.empty()){
      for(int x: S[i]) res.pb(x);
    }else{
      bool ok = 0;
      for(int j = 1; j < S[i].size(); ++j){
        for(int l = 0; l < S[i + 1].size(); ++l){
          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;
      }
      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:103:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  103 |   for(int i = 0; i < S.size(); ++i){
      |                  ~~^~~~~~~~~~
longesttrip.cpp:116:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  116 |     for(int i = 1; i < S.size(); ++i){
      |                    ~~^~~~~~~~~~
longesttrip.cpp:130:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  130 |     for(int i = 0; i + 1 < S.size(); ++i){
      |                    ~~~~~~^~~~~~~~~~
longesttrip.cpp:146:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  146 |     for(int i = 1; i < S.size(); ++i){
      |                    ~~^~~~~~~~~~
longesttrip.cpp:158:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  158 |     for(int i = 0; i + 1 < S.size(); ++i){
      |                    ~~~~~~^~~~~~~~~~
longesttrip.cpp:172:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  172 |     for(int i = 0; i < S.size(); ++i){
      |                    ~~^~~~~~~~~~
longesttrip.cpp:173:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  173 |       for(int j = 0; j < S.size(); ++j){
      |                      ~~^~~~~~~~~~
longesttrip.cpp:190:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  190 |   for(int i = 0; i < S.size(); ++i){
      |                  ~~^~~~~~~~~~
longesttrip.cpp:196:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  196 |     if(i + 1 < S.size()){
      |        ~~~~~~^~~~~~~~~~
longesttrip.cpp:203:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  203 |       for(int j = 1; j < S[i].size(); ++j){
      |                      ~~^~~~~~~~~~~~~
longesttrip.cpp:204:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  204 |         for(int l = 0; l < S[i + 1].size(); ++l){
      |                        ~~^~~~~~~~~~~~~~~~~

Subtask #0
0.0 / 0.0

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

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 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

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 344 KB Output is correct
2 Correct 5 ms 344 KB Output is correct
3 Correct 3 ms 344 KB Output is correct
4 Correct 3 ms 344 KB Output is correct
5 Correct 7 ms 600 KB Output is correct
6 Correct 5 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 5 ms 344 KB Output is correct
10 Correct 5 ms 436 KB Output is correct
11 Correct 6 ms 344 KB Output is correct
12 Correct 4 ms 344 KB Output is correct
13 Correct 5 ms 344 KB Output is correct

Subtask #3
0.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 344 KB Output is correct
2 Correct 24 ms 344 KB Output is correct
3 Correct 159 ms 436 KB Output is correct
4 Correct 411 ms 744 KB Output is correct
5 Correct 848 ms 880 KB Output is correct
6 Correct 7 ms 344 KB Output is correct
7 Correct 26 ms 344 KB Output is correct
8 Correct 157 ms 436 KB Output is correct
9 Correct 296 ms 736 KB Output is correct
10 Correct 847 ms 956 KB Output is correct
11 Correct 854 ms 988 KB Output is correct
12 Correct 839 ms 980 KB Output is correct
13 Correct 777 ms 972 KB Output is correct
14 Correct 8 ms 596 KB Output is correct
15 Incorrect 1 ms 344 KB Incorrect
16 Halted 0 ms 0 KB -

Subtask #4
0.0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 344 KB Output is correct
2 Correct 23 ms 344 KB Output is correct
3 Partially correct 139 ms 456 KB Output is partially correct
4 Partially correct 437 ms 600 KB Output is partially correct
5 Partially correct 851 ms 1172 KB Output is partially correct
6 Correct 7 ms 344 KB Output is correct
7 Correct 22 ms 344 KB Output is correct
8 Partially correct 128 ms 440 KB Output is partially correct
9 Partially correct 279 ms 704 KB Output is partially correct
10 Partially correct 791 ms 1024 KB Output is partially correct
11 Partially correct 856 ms 776 KB Output is partially correct
12 Partially correct 828 ms 1076 KB Output is partially correct
13 Partially correct 839 ms 912 KB Output is partially correct
14 Correct 6 ms 344 KB Output is correct
15 Incorrect 1 ms 344 KB Incorrect
16 Halted 0 ms 0 KB -