제출 #1297915

#제출 시각아이디문제언어결과실행 시간메모리
1297915martin_011앵무새 (IOI11_parrots)C++20
17 / 100
2 ms836 KiB
#include "encoder.h" #include "encoderlib.h" #include <bits/stdc++.h> using namespace std; #define ll long long #define ld long double #define vi vector<int> #define vll vector<ll> #define str string #define vd void #define vb vector<bool> #define F first #define S second #define lbr '\n' #define all(x) x.begin(), x.end() const ll INF = 1E15; void encode(int n, int m[]) { ll r=0; for (int i=0; i<n; i++) { if (m[i]) r += (1<<i); } send(r); }
#include "decoder.h" #include "decoderlib.h" #include <bits/stdc++.h> using namespace std; #define ll long long #define ld long double #define vi vector<int> #define vll vector<ll> #define str string #define vd void #define vb vector<bool> #define F first #define S second #define lbr '\n' #define all(x) x.begin(), x.end() const ll INF = 1E15; void decode(int n, int l, int x[]) { for (int i=0; i<n; i++) { int a=0; if (x[0] & (1<<i)) a = 1; output(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...