제출 #756033

#제출 시각아이디문제언어결과실행 시간메모리
756033That_Salamander앵무새 (IOI11_parrots)C++14
17 / 100
1 ms1012 KiB
#include <bits/stdc++.h> #define FOR(var,bound) for(int var = 0; var < bound; var++) #define FORB(var,lb,ub) for (int var = lb; var < ub; var++) #define FORR(var,bound) for(int var = bound-1; var >= 0; var--) using namespace std; typedef long long ll; typedef vector<int> vi; typedef vector<vector<int>> vvi; typedef pair<int, int> pii; void send(int x); void output(int x); void encode(int n, int m[]) { int x = 0; FOR(i, n) { x *= 2; x += m[i]; } send(x); }
#include <bits/stdc++.h> #define FOR(var,bound) for(int var = 0; var < bound; var++) #define FORB(var,lb,ub) for (int var = lb; var < ub; var++) #define FORR(var,bound) for(int var = bound-1; var >= 0; var--) using namespace std; typedef long long ll; typedef vector<int> vi; typedef vector<vector<int>> vvi; typedef pair<int, int> pii; void send(int x); void output(int x); void decode(int N, int L, int X[]) { int mask = 0b10000000; while (mask) { output((bool)(X[0]&mask)); mask>>= 1; } }
#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...