제출 #788202

#제출 시각아이디문제언어결과실행 시간메모리
788202horiiseun앵무새 (IOI11_parrots)C++17
34 / 100
2 ms1032 KiB
#include <iostream> #include <vector> #include <tuple> #include <queue> #include <stack> #include <deque> #include <set> #include <map> #include <cmath> #include <random> #include <string> #include <cassert> #include <climits> #include <algorithm> #include <unordered_set> #include <unordered_map> #include "encoder.h" #include "encoderlib.h" using namespace std; void encode(int N, int M[]) { for (int i = 0; i < N; i++) { send(i * 1000 + M[i]); } }
#include <iostream> #include <vector> #include <tuple> #include <queue> #include <stack> #include <deque> #include <set> #include <map> #include <cmath> #include <random> #include <string> #include <cassert> #include <climits> #include <algorithm> #include <unordered_set> #include <unordered_map> #include "decoder.h" #include "decoderlib.h" using namespace std; void decode(int N, int L, int X[]) { vector<int> ans(N, 0); for (int i = 0; i < L; i++) { ans[X[i] / 1000] = X[i] % 1000; } 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...