Submission #14791

#TimeUsernameProblemLanguageResultExecution timeMemory
14791gs14004Parrots (IOI11_parrots)C++14
0 / 100
179 ms70764 KiB
#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--; } }
#include "decoder.h" #include "decoderlib.h" #include <algorithm> #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 decode(int N, int L, int X[]) { for (int i=0; i<600; i++) { bino[i][0].init(1); for (int j=1; j<=i; j++) { bino[i][j].init(0); 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); } } sort(X,X+L); bignum ret; ret.init(0); for (int i=0; i<L; i++) { ret = ret + bino[5 * N + 255 - X[i] - i - 2][5 * N - i]; } while(ret.arr.size() < N)ret.arr.push_back(0); for (int i=0; i<N; i++) { output(ret.arr[i]); } }

Compilation message (stderr)

encoder.cpp: In function 'bignum operator+(bignum, bignum)':
encoder.cpp:16:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i=0; i<a.arr.size(); i++) {
                   ~^~~~~~~~~~~~~
encoder.cpp:20:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             if(i + 1 == a.arr.size()) a.arr.push_back(0);
                ~~~~~~^~~~~~~~~~~~~~~
encoder.cpp:24:31: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i=a.arr.size(); i<b.arr.size(); i++) {
                              ~^~~~~~~~~~~~~

decoder.cpp: In function 'bignum operator+(bignum, bignum)':
decoder.cpp:17:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i=0; i<a.arr.size(); i++) {
                   ~^~~~~~~~~~~~~
decoder.cpp:21:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
             if(i + 1 == a.arr.size()) a.arr.push_back(0);
                ~~~~~~^~~~~~~~~~~~~~~
decoder.cpp:25:31: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for (int i=a.arr.size(); i<b.arr.size(); i++) {
                              ~^~~~~~~~~~~~~
decoder.cpp: In function 'void decode(int, int, int*)':
decoder.cpp:60:26: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     while(ret.arr.size() < N)ret.arr.push_back(0);
           ~~~~~~~~~~~~~~~^~~
#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...