Submission #1238942

#TimeUsernameProblemLanguageResultExecution timeMemory
1238942santi3223상형문자열 (IOI24_hieroglyphs)C++20
3 / 100
19 ms2084 KiB
#include <bits/stdc++.h> #include "hieroglyphs.h" using namespace std; #define ll long long #define vl vector<ll> #define all(aaa) aaa.begin(), aaa.end() #define ff(aa, bb, cc) for(ll aa = bb; aa < cc; aa++) #define vb vector<bool> #define ed "\n" #define pb push_back #define pll pair<ll, ll> #define fi first #define se second std::vector<int> ucs(std::vector<int> A, std::vector<int> B){ if(A == B){ return A; } else{ return {-1}; } return std::vector<int>(); } /* 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; }*/
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...