Submission #1250626

#TimeUsernameProblemLanguageResultExecution timeMemory
1250626khoavn2008Hieroglyphs (IOI24_hieroglyphs)C++20
3 / 100
19 ms2084 KiB
#include "hieroglyphs.h" #include <bits/stdc++.h> using namespace std; #define ll int #define ld double #define endl '\n' #define fi first #define se second #define pb push_back #define REP(i,r) for(ll i=0,_r=(r);i<_r;i++) #define FOR(i,l,r) for(ll i=(l),_r=(r);i<=_r;i++) #define FORE(i,v) for(__typeof((v).begin()) i=(v).begin();i!=(v).end();i++) #define FORNG(i,r,l) for(ll i=(r),_l=(l);i>=_l;i--) #define MASK(i) (1LL<<(i)) #define BIT(x,i) (((x)>>(i))&1LL) #define all(v) (v).begin(),(v).end() #define size(v) ((ll)(v).size()) const ll MOD = 1e9+7, N = 2e5+10, INF = 1e9, LOG = 20; vector<ll> ucs(vector<ll> A, vector<ll> B) { REP(i,size(A))if(A[i] != B[i])return {-1}; return A; }
#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...