백준 알고리즘 5397번 : 키로거

링크

https://www.acmicpc.net/problem/5397

sol1) 연결 리스트

#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#include<bits/stdc++.h>
#define X first
#define Y second
#define pb push_back
#define fastio cin.tie(0)->sync_with_stdio(0)
#define sz(v) (int)(v).size()
#define all(v) v.begin(), v.end()
#define rall(v) (v).rbegin(), (v).rend()
#define compress(v) sort(all(v)), (v).erase(unique(all(v)), (v).end())
#define OOB(x, y) ((x) < 0 || (x) >= n || (y) < 0 || (y) >= m)
#define debug(x) cout << (#x) << ": " << (x) << '\n'
using namespace std;
using ll = long long;
using ull = unsigned long long;
using dbl = double;
using ldb = long double;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
using vi = vector<int>;
using vs = vector<string>;
using tii = tuple<int,int,int>;
template<typename T> using wector = vector<vector<T>>;

const int MOD = 1e9 + 7;
const int INF = 1e9 + 7;
const ll LNF = 1e18 + 7;

int main() {
  fastio;
  int tc; cin >> tc;
  while(tc--){
    string init; cin >> init;
    list<char> L;
    auto cursor = L.end();
    for(auto& c : init){
      if(c == '>') {if(cursor != L.end()) cursor++;}
      else if(c == '<') {if(cursor != L.begin()) cursor--;}
      else if(c == '-') {if(cursor != L.begin()) L.erase(prev(cursor));}
      else L.insert(cursor, c);
    }
    for(auto i : L) cout << i;
    cout << "\n";
  }
  return 0;
}