#include "bits/stdc++.h"
#ifndef LOCAL
#include "floppy.h"
#else
void read_array(int subtask_id, const vector<int> &v);
void save_to_floppy(const string &bits);
vector<int> solve_queries(int subtask_id, int N, const string &bits, const vector<int> &a, const vector<int> &b);
#endif
using namespace std;
void read_array(int subtask_id, const vector<int> &v) {
int n = (int)v.size();
int len = __lg(n << 1);
auto a = v;
sort(a.begin(), a.end());
map<int, int> b;
for (int i = 0; i < n; i++) {
b[a[i] + (int)1e9] = i;
}
string s;
for (int i = 0; i < n; i++) {
string c = bitset<32>(b[v[i] + (int)1e9]).to_string();
s += string(c.end() - len, c.end());
}
save_to_floppy(s);
}
vector<int> solve_queries(int subtask_id, int N, const string &bits, const vector<int> &a, const vector<int> &b) {
int m = (int)a.size();
int n = N;
int len = __lg(n << 1);
vector<int> a;
for (int i = 0; i < n; i++) {
a.push_back(bitset<32>(string(bits.begin() + i * len, bets.begin() + (i + 1) * len)).to_ulong());
}
return a;
}
#ifdef LOCAL
#define NMAX 100000
#define MMAX 100000
int subtask_id, N, M;
vector<int> v, sorted_v;
vector<int> a, b;
vector<int> correct_answers;
// Print score to stdout and exit.
void score_and_exit(const double pts, const char *verdict) {
fprintf(stderr, "%s", verdict);
fprintf(stdout, "%f", pts);
exit(0);
}
// Contestant sent too many bits.
void too_many_bits() {
score_and_exit(0, "Too many stored bits!");
}
// Contestant did not send any bits.
void misformatted_stored_bits() {
score_and_exit(0, "Misformatted stored bits or save_to_floppy not called!");
}
// Contestant did not call the answer function.
void answer_not_provided() {
score_and_exit(0, "Answer not provided!");
}
// Contestant sent a wrong answer.
void wrong_answer() {
score_and_exit(0, "Wrong answer to query!");
}
// Contestant sent a correct answer.
void correct_answer() {
score_and_exit(1, "OK!");
}
void read_test() {
assert(scanf("%d", &subtask_id) == 1);
assert(scanf("%d%d", &N, &M) == 2);
assert(1 <= N && N <= NMAX);
assert(0 <= M && M <= MMAX);
v.resize(N);
for (int i = 0; i < N; ++i) {
assert(scanf("%d", &v[i]) == 1);
}
// Check all values are distinct.
sorted_v.resize(N);
for (int i = 0; i < N; ++i) {
sorted_v[i] = v[i];
}
sort(sorted_v.begin(), sorted_v.end());
for (int i = 0; i + 1 < N; ++i) {
assert(sorted_v[i] < sorted_v[i + 1]);
}
a.resize(M);
b.resize(M);
correct_answers.resize(M);
for (int i = 0; i < M; ++i) {
assert(scanf("%d%d%d", &a[i], &b[i], &correct_answers[i]) == 3);
assert(0 <= a[i] && a[i] <= correct_answers[i] &&
correct_answers[i] <= b[i] && b[i] < N);
}
}
void save_to_floppy(const string &bits) {
vector<int> contestant_answers = solve_queries(subtask_id, N, bits, a, b);
for (int i = 0; i < M; ++i) {
if (contestant_answers[i] != correct_answers[i]) {
wrong_answer();
}
}
correct_answer();
exit(0);
}
int main(int argc, char **argv) {
// Read input data.
read_test();
// Send subtask_id, v.
read_array(subtask_id, v);
answer_not_provided();
return 0;
}
#endif
Compilation message
floppy.cpp: In function 'std::vector<int> solve_queries(int, int, const string&, const std::vector<int>&, const std::vector<int>&)':
floppy.cpp:49:17: error: declaration of 'std::vector<int> a' shadows a parameter
49 | vector<int> a;
| ^
floppy.cpp:43:89: note: 'const std::vector<int>& a' previously declared here
43 | vector<int> solve_queries(int subtask_id, int N, const string &bits, const vector<int> &a, const vector<int> &b) {
| ~~~~~~~~~~~~~~~~~~~^
floppy.cpp:52:63: error: 'bets' was not declared in this scope; did you mean 'bits'?
52 | a.push_back(bitset<32>(string(bits.begin() + i * len, bets.begin() + (i + 1) * len)).to_ulong());
| ^~~~
| bits
floppy.cpp:44:9: warning: unused variable 'm' [-Wunused-variable]
44 | int m = (int)a.size();
| ^
stub.cpp: In function 'void run2()':
stub.cpp:101:30: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
101 | if (query_answers.size() != M) {
| ~~~~~~~~~~~~~~~~~~~~~^~~~
