# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
14791 | 2015-06-24T07:29:21 Z | gs14004 | Parrots (IOI11_parrots) | C++14 | 179 ms | 70764 KB |
#include "encoder.h" #include "encoderlib.h" #include <cstring> #include <vector> using namespace std; struct bignum{ vector<short> arr; void init(char i){ arr.clear(); arr.push_back(i); } }; bignum operator+(bignum a, bignum b){ for (int i=0; i<a.arr.size(); i++) { a.arr[i] += b.arr[i]; if(a.arr[i] >= 256) { a.arr[i] -= 256; if(i + 1 == a.arr.size()) a.arr.push_back(0); a.arr[i+1] ++; } } for (int i=a.arr.size(); i<b.arr.size(); i++) { a.arr.push_back(b.arr[i]); } return a; } bool operator<(bignum a, bignum b){ if(a.arr.size() != b.arr.size()) return a.arr.size() < b.arr.size(); for (int i=a.arr.size(); i>=0; i--) { if(a.arr[i] < b.arr[i]) return 1; if(a.arr[i] > b.arr[i]) return 0; } return 0; } bignum bino[600][600]; void encode(int N, int* M){ for (int i=0; i<600; i++) { bino[i][0].init(1); for (int j=1; j<=i; j++) { bino[i][j] = bino[i-1][j] + bino[i-1][j-1]; } for (int j=i+1; j<600; j++) { bino[i][j].init(0); } } bignum base, t; t.init(0); for (int i=0; i<N; i++) { t.arr[i] = M[i]; } base.init(0); t = t + base; base.init(0); int length = 255 + 5 * N; for(int i=0; i<5*N; i++){ while (t < bino[length-1][5 * N - i] + base) { length--; } send(5 * N + 255 - length - i - 1); base = base + bino[length-1][5 * N - i]; length--; } }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 150 ms | 70264 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 164 ms | 70468 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 155 ms | 70656 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 156 ms | 70656 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 162 ms | 70656 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
2 | Runtime error | 159 ms | 70656 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
3 | Runtime error | 179 ms | 70656 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
4 | Runtime error | 163 ms | 70656 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
5 | Runtime error | 158 ms | 70656 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
6 | Runtime error | 169 ms | 70660 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
7 | Runtime error | 173 ms | 70764 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |