Submission #26926578

---

Source Code Expand

#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <functional>
#include <cmath>
#include <map>
#include <set>
#include <queue>
#include <utility>
#define rep(i,n) for (long long i=0;i<n;i++)

#define DENOM 998244353

using namespace std;
using ll = long long;

struct train_count{
  int l ;
  string s ;
  train_count(){
    this->l = 0 ;
    this->s = "" ;
  }
} ;

struct train{
  int id ;
  train *prev_train, *next_train ;
  train(int x){
    this->id = x ;
    this->prev_train = NULL ;
    this->next_train = NULL ;
  }
  train_count predecessor(){
    train_count result = train_count();
    train *train_predecessor = this->prev_train ;
    while (train_predecessor != NULL) {
      if (result.s == "") {
	result.s = to_string(train_predecessor->id) ;
      } else {
	result.s = to_string(train_predecessor->id) + " " + result.s ;
      }
      ++result.l ;
      train_predecessor = train_predecessor->prev_train ;
    }
    return(result) ;
  }
  train_count successor(){
    train_count result = train_count();
    train *train_successor = this->next_train ;
    while (train_successor != NULL) {
      if (result.s == "") {
	result.s = to_string(train_successor->id) ;
      } else {
	result.s = result.s + " " + to_string(train_successor->id) ;
      }
      ++result.l ;
      train_successor = train_successor->next_train ;
    }
    return(result) ;
  }
};




int main(){
  int n, q ;
  cin >> n >> q ;
  vector<train> v ;
  v.push_back(train(0)) ;
  rep(i, n) {
    v.push_back(train(i+1)) ;
  }
  rep(i, q) {
    int c, x, y ;
    cin >> c >> x;
    if (c!=3) {
      cin >> y ;
      if (c==1) {
	v[x].next_train = &v[y] ;
	v[y].prev_train = &v[x] ;
      }
      if (c==2) {
	v[x].next_train = NULL ;
	v[y].prev_train = NULL ;
      }
    } else {
      train_count pr = v[x].predecessor() ;
      train_count sr = v[x].successor() ;
      cout << pr.l + sr.l + 1 << " " << pr.s + " " + to_string(x) + " " + sr.s << endl ;
	
    }
  }
  return 0 ;
}

Submission Info

Judge Result