Submission #795037

#TimeUsernameProblemLanguageResultExecution timeMemory
795037ono_de206Parrots (IOI11_parrots)C++14
0 / 100
4 ms1232 KiB
#include "encoder.h" #include "encoderlib.h" #include<bits/stdc++.h> using namespace std; #define in insert #define all(x) x.begin(),x.end() #define pb push_back #define eb emplace_back #define ff first #define ss second //#define int long long typedef long long ll; typedef vector<int> vi; typedef set<int> si; typedef multiset<int> msi; typedef pair<int, int> pii; typedef vector<pii> vpii; void encode(int n, int a[]) { for(int i = 0; i < n; i++) { for(int j = 0; j < 4; j++) { int times = a[i] & 3; for(int k = 0; k < times; k++) { send(i | (j >> 6)); } } } }
#include "decoder.h" #include "decoderlib.h" #include<bits/stdc++.h> using namespace std; #define in insert #define all(x) x.begin(),x.end() #define pb push_back #define eb emplace_back #define ff first #define ss second //#define int long long typedef long long ll; typedef vector<int> vi; typedef set<int> si; typedef multiset<int> msi; typedef pair<int, int> pii; typedef vector<pii> vpii; void decode(int n, int l, int x[]) { vector<int> ret(n); for(int i = 0; i < l; i++) { int id = x[i] & 63; int pos = x[i] >> 6; ret[id] += 1 << (pos * 2); } for(int i = 0; i < n; i++) { output(ret[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...