제출 #1133601

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1133601		Theo830	상형문자열 (IOI24_hieroglyphs)	C++20	3 / 100	1094 ms	24128 KiB

hieroglyphs

#include <bits/stdc++.h>
using namespace std;
typedef int ll;
const ll INF = 1e9+7;
const ll MOD = 998244353;
typedef pair<ll,ll> ii;
#define iii pair<ii,ll>
#define f(i,a,b) for(ll i = a;i < b;i++)
#define pb push_back
#define vll vector<ll>
#define F first
#define S second
#define all(x) (x).begin(), (x).end()
///I hope I will get uprating and don't make mistakes
///I will never stop programming
///sqrt(-1) Love C++
///Please don't hack me
///@TheofanisOrfanou Theo830
///Think different approaches (bs,dp,greedy,graphs,shortest paths,mst)
///Stay Calm
///Look for special cases
///Beware of overflow and array bounds
///Think the problem backwards
///Training
#include "hieroglyphs.h"
vector<int> ucs(std::vector<int> a, std::vector<int> b){
    vector<int>ans;
    map<ll,ll>mp1,mp2;
    map<ll,vector<ll> >ex;
    for(auto x:a){
        mp1[x]++;
    }
    ll w = 0;
    for(auto x:b){
        mp2[x]++;
        ex[x].pb(w);
        w++;
    }
    vector<int>A,B;
    vector<int>posi,posi2;
    ll z = 0;
    posi.pb(-1);
    posi2.pb(-1);
    for(auto x:a){
        if(mp1[x] <= mp2[x]){
            A.pb(x);
            posi.pb(z);
        }
        z++;
    }
    z = 0;
    ll q = 0;
    for(auto x:b){
        if(mp2[x] < mp1[x]){
            B.pb(x);
        }
        if(q < A.size() && A[q] == x){
            posi2.pb(z);
            q++;
        }
        z++;
    }
    ll last = a.size();
    ll pos = b.size();
    bool ok = 1;
    while(!B.empty() && ok){
        bool ivra = 0;
        ll t;
        f(j,posi.back() + 1,last){
            if(a[j] == B.back()){
                ivra = 1;
                t = j;
            }
        }
        bool iv = 0;
        f(j,posi2.back() + 1,pos){
            if(b[j] == B.back()){
                iv = 1;
            }
        }
        if(ivra && iv){
            last = t;
            ans.pb(B.back());
            while(pos >= 0 && ans.back() != b[pos]){
                pos--;
            }
            B.pop_back();
        }
        else if(!A.empty()){
            last = posi.back();
            posi.pop_back();
            posi2.pop_back();
            ans.pb(A.back());
            while(pos >= 0 && ans.back() != b[pos]){
                pos--;
            }
            A.pop_back();
        }
        else{
            ok = 0;
        }
    }
    while(!A.empty()){
        ans.pb(A.back());
        A.pop_back();
    }
    reverse(all(ans));
    pos = 0;
    for(auto x:a){
        if(pos < ans.size() && ans[pos] == x){
            pos++;
        }
    }
    ok &= pos == (ll)ans.size();
    pos = 0;
    for(auto x:b){
        if(pos < ans.size() && ans[pos] == x){
            pos++;
        }
    }
    ok &= pos == (ll)ans.size();
    if(!ok){
        ans.clear();
        ans.pb(-1);
    }
    return ans;
}
/*
int main() {
  int N, M;
  assert(2 == scanf("%d%d", &N, &M));
  std::vector<int> A(N), B(M);
  for (int i = 0; i < N; i++)
    assert(1 == scanf("%d", &A[i]));
  for (int j = 0; j < M; j++)
    assert(1 == scanf("%d", &B[j]));
  fclose(stdin);

  std::vector<int> R = ucs(A, B);

  int T = (int)R.size();
  printf("%d\n", T);
  for (int i = 0; i < T; i++)
    printf("%s%d", (i == 0 ? "" : " "), R[i]);
  printf("\n");
  fclose(stdout);

  return 0;
}

*/

• Subtask 0: 0 / 0
• Subtask 1: 3 / 3
• Subtask 2: 0 / 15
• Subtask 3: 0 / 10
• Subtask 4: 0 / 16
• Subtask 5: 0 / 14
• Subtask 6: 0 / 42