제출 #1310782

#제출 시각아이디문제언어결과실행 시간메모리
1310782nikaa123Data Transfer (IOI19_transfer)C++20
0 / 100
5 ms1720 KiB
#include <bits/stdc++.h> #include "transfer.h" using namespace std; std::vector<int> get_attachment(std::vector<int> source) { int n = source.size(); int res = 0; for (int i = 0; i < n; i++) { res ^= source[i]*(i+1); } if (n == 63) { vector <int> k(7,0); for (int i = 0; i < 6; i++) { if (res & (1<<i)) k[i] = 1; } k[6] = (__builtin_popcount(res)%2); return k; } else { vector <int> k(9,0); for (int i = 0; i < 9; i++) { if (res & (1<<i)) k[i] = 1; } k[8] = (__builtin_popcount(res)%2); return k; } } std::vector<int> retrieve(std::vector<int> data) { int n = data.size(); int sum = 0; for (auto x:data) sum+= x; if (sum == 1) { if (n == 70) { return vector <int> (63,0); } else { return vector <int> (255,0); } } if (n == 70) { int res = 0; for (int i = 0; i < 6; i++) { res |= (data[i+63] << i); } if ((__builtin_popcount(res) % 2) == data[69]) { for (int i = 0; i < 63; i++) { res ^= (data[i] * (i+1)); } } vector <int> answer; for (int i = 0; i < 63; i++) { answer.push_back(data[i]); } return answer; } if (n == 264) { int res = 0; for (int i = 0; i < 8; i++) { res ^= (data[i+255] << i); } if ((__builtin_popcount(res) % 2) == data[263]) { for (int i = 0; i < 255; i++) { res ^= (data[i] * (i+1)); } res--; res = max(res,0); data[res] = 1 - data[res]; } vector <int> answer; for (int i = 0; i < 255; i++) { answer.push_back(data[i]); } return answer; } }

컴파일 시 표준 에러 (stderr) 메시지

transfer.cpp: In function 'std::vector<int> retrieve(std::vector<int>)':
transfer.cpp:77:1: warning: control reaches end of non-void function [-Wreturn-type]
   77 | }
      | ^
grader.cpp: In instantiation of 'void shuffle(std::vector<T>&) [with T = Scenario]':
grader.cpp:200:10:   required from here
grader.cpp:28:23: warning: 'void std::random_shuffle(_RAIter, _RAIter) [with _RAIter = __gnu_cxx::__normal_iterator<Scenario*, vector<Scenario> >]' is deprecated: use 'std::shuffle' instead [-Wdeprecated-declarations]
   28 |         random_shuffle(v.begin(), v.end());
      |         ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/13/algorithm:61,
                 from grader.cpp:8:
/usr/include/c++/13/bits/stl_algo.h:4581:5: note: declared here
 4581 |     random_shuffle(_RandomAccessIterator __first, _RandomAccessIterator __last)
      |     ^~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...