Submission #60676

#TimeUsernameProblemLanguageResultExecution timeMemory
60676mhnd앵무새 (IOI11_parrots)C++14
0 / 100
7 ms2048 KiB
#include "encoder.h" #include "encoderlib.h" #include <bits/stdc++.h> using namespace std; typedef long long ll; typedef unsigned long long ull; const int N = 1e5+50; const ll oo = 1e18; const ll mod = 1e9+7; void encode(int N, int M[]) { for(int i=0;i<N;i++) for(int j=0;j<=i;j++)send(M[i]); }
#include "decoder.h" #include "decoderlib.h" #include <bits/stdc++.h> using namespace std; typedef long long ll; typedef unsigned long long ull; const int N = 1e5+50; const ll oo = 1e18; const ll mod = 1e9+7; pair<int,int> num[256]; void decode(int N, int L, int X[]){ for(int i=0;i<L;i++)num[X[i]].first++; for(int i=0;i<256;i++)num[i].second = i; sort(num,num+256); for(int i=0;i<256;i++){ if(!num[i].first)continue; output(num[i].second); } }
#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...