Submission #1237248

#	Time	Username	Problem	Language	Result	Execution time	Memory
1237248		Malix	상형문자열 (IOI24_hieroglyphs)	C++20	3 / 100	58 ms	18628 KiB

hieroglyphs

#include "hieroglyphs.h"
#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vii;
typedef pair<int,int> pi;
typedef vector<pi> pii;
typedef tuple<int,int,int> ti;
typedef vector<ll> li;
typedef vector<li> lii;
 
#define REP(i,a,b) for(int i=a;i<b;i++)
#define F first
#define S second
#define PB push_back
#define LSOne(s) ((s)&(-s))
#define all(x) (x).begin(),(x).end()
 
ll INF=1000000000000000010;
int inf=1e9+10;
ll M=1e9+7;

std::vector<int> ucs(std::vector<int> A, std::vector<int> B) {
  vii a(200001),b(200001);
  int n=A.size(),m=B.size();
  REP(i,0,n)a[A[i]].PB(i);
  REP(i,0,m)b[B[i]].PB(i);
  vi X,Y;
  REP(i,0,200001)if(a[i].size()&&b[i].size()){
    if(a[i].size()!=b[i].size())return {-1};
    X.PB(a[i][0]);
    Y.PB(b[i][0]);
  }
  sort(all(X));
  sort(all(Y));
  REP(i,0,(int)X.size()){
    X[i]=A[X[i]];
    Y[i]=B[Y[i]];
  }
  if(X==Y)return X;
  return {-1};
}

• 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