제출 #756034

#제출 시각아이디문제언어결과실행 시간메모리
756034That_Salamander앵무새 (IOI11_parrots)C++14
34 / 100
2 ms1044 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[]) { FOR (i, n) { send(i * 256 + m[i]); } }
#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[]) { sort(X, X + L); FOR (i, N) { output(X[i] % 256); } }
#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...