Submission #839814

#	Time	Username	Problem	Language	Result	Execution time	Memory
839814		AdamGS	가장 긴 여행 (IOI23_longesttrip)	C++17	85 / 100	28 ms	336 KiB

longesttrip

#include "longesttrip.h"
#include<bits/stdc++.h>
using namespace std;
#define rep(a, b) for(int a = 0; a < (b); ++a)
#define st first
#define nd second
#define pb push_back
#define all(a) a.begin(), a.end()
vector<int>longest_trip(int n, int d) {
  vector<int>A, B;
  A.pb(0);
  for(int i=1; i<n; ++i) {
    vector<int>X, Y;
    X.pb(A.back());
    Y.pb(i);
    if(are_connected(X, Y)) A.pb(i);
    else B.pb(i);
    X.clear();
    Y.clear();
    if(B.size()>0) {
      X.pb(A.back());
      Y.pb(B.back());
      if(are_connected(X, Y)) while(B.size()>0) {
        A.pb(B.back());
        B.pop_back();
      }
    }
  }
  if(B.size()>A.size()) swap(A, B);
  if(B.size()==0) return A;
  vector<int>X, Y;
  X.pb(A[0]);
  Y.pb(B[0]);
  if(are_connected(X, Y)) {
    reverse(all(A));
    for(auto i : B) A.pb(i);
    return A;
  }
  Y.clear();
  Y.pb(B.back());
  if(are_connected(X, Y)) {
    for(auto i : A) B.pb(i);
    return B;
  }
  X.clear();
  Y.clear();
  X.pb(A.back());
  Y.pb(B[0]);
  if(are_connected(X, Y)) {
    for(auto i : B) A.pb(i);
    return A;
  }
  if(!are_connected(A, B)) return A;
  int po=0, ko=A.size()-1;
  while(po<ko) {
    int sr=(po+ko)/2;
    vector<int>tmp;
    rep(i, sr+1) tmp.pb(A[i]);
    if(are_connected(tmp, B)) ko=sr; else po=sr+1;
  }
  X.clear();
  X.pb(A[po]);
  int po2=0, ko2=B.size()-1;
  while(po2<ko2) {
    int sr=(po2+ko2)/2;
    vector<int>tmp;
    rep(i, sr+1) tmp.pb(B[i]);
    if(are_connected(X, tmp)) ko2=sr; else po2=sr+1;
  }
  vector<int>ans;
  rep(i, A.size()) ans.pb(A[(i+po+1)%A.size()]);
  rep(i, B.size()) ans.pb(B[(i+po2)%B.size()]);
  return ans;
}

Compilation message (stderr)

longesttrip.cpp: In function 'std::vector<int> longest_trip(int, int)':
longesttrip.cpp:4:36: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    4 | #define rep(a, b) for(int a = 0; a < (b); ++a)
      |                                    ^
longesttrip.cpp:71:3: note: in expansion of macro 'rep'
   71 |   rep(i, A.size()) ans.pb(A[(i+po+1)%A.size()]);
      |   ^~~
longesttrip.cpp:4:36: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    4 | #define rep(a, b) for(int a = 0; a < (b); ++a)
      |                                    ^
longesttrip.cpp:72:3: note: in expansion of macro 'rep'
   72 |   rep(i, B.size()) ans.pb(B[(i+po2)%B.size()]);
      |   ^~~

• Subtask 0: 0 / 0
• Subtask 1: 5 / 5
• Subtask 2: 10 / 10
• Subtask 3: 25 / 25
• Subtask 4: 45 / 60