| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1214251 | Nelt | 상형문자열 (IOI24_hieroglyphs) | C++20 | 158 ms | 17096 KiB |
#include "hieroglyphs.h"
#include <bits/stdc++.h>
#define ll long long
#define endl "\n"
using namespace std;
std::vector<int> ucs(std::vector<int> a, std::vector<int> b)
{
set<ll> sa, sb;
for (ll i : a)
sa.insert(i);
for (ll i : b)
sb.insert(i);
{
vector<int> nv;
for (ll i : a)
if (sb.count(i))
nv.push_back(i);
a = nv;
nv.clear();
for (ll i : b)
if (sa.count(i))
nv.push_back(i);
b = nv;
}
vector<int> ans, ans1;
set<ll> s;
for (ll i : a)
if (!s.count(i))
ans.push_back(i), s.insert(i);
s.clear();
for (ll i : b)
if (!s.count(i))
ans1.push_back(i), s.insert(i);
if (ans == ans1) return ans;
return {-1};
}
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
