Submission #123814

#TimeUsernameProblemLanguageResultExecution timeMemory
123814baluteshihParrots (IOI11_parrots)C++14
34 / 100
5 ms1520 KiB
#include "encoder.h" #include "encoderlib.h" #include<bits/stdc++.h> #define MP make_pair #define F first #define S second #define pb push_back #define MEM(i,j) memset(i,j,sizeof i) #define ET cout << "\n" #define ALL(v) v.begin(),v.end() #define DB(a,s,e) {for(int i=s;i<e;++i) cout << a[i] << " ";ET;} using namespace std; typedef long long ll; typedef pair<int,int> pii; typedef pair<ll,ll> pll; void encode(int N, int M[]) { for(int i=0;i<N;++i) send(M[i]<<4|i); }
#include "decoder.h" #include "decoderlib.h" #include<bits/stdc++.h> #define MP make_pair #define F first #define S second #define pb push_back #define MEM(i,j) memset(i,j,sizeof i) #define ET cout << "\n" #define ALL(v) v.begin(),v.end() #define DB(a,s,e) {for(int i=s;i<e;++i) cout << a[i] << " ";ET;} using namespace std; typedef long long ll; typedef pair<int,int> pii; typedef pair<ll,ll> pll; void decode(int N, int L, int X[]) { int ans[64]; for(int i=0;i<N;++i) ans[X[i]&15]=X[i]>>4; for(int i=0;i<N;++i) output(ans[i]); }
#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...