File size: 3,372 Bytes
5fed0fc |
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 |
#include "testlib.h"
#include <vector>
#include <deque>
#include <set>
#include <string>
int main(int argc, char* argv[]) {
registerInteraction(argc, argv);
int n = inf.readInt();
int k = inf.readInt();
std::vector<int> hidden_array(n + 1);
for (int i = 1; i <= n; ++i) {
hidden_array[i] = inf.readInt();
}
long long ref_cost = ans.readLong();
println(n, k);
const int MAX_OPERATIONS = 100000;
int query_count = 0;
int reset_count = 0;
std::deque<int> S; // Memory queue
while (true) {
std::string operation = ouf.readToken();
if (operation == "?") { // Query
query_count++;
if (query_count + reset_count > MAX_OPERATIONS) {
quitp(0.0, "Operation limit exceeded. Max operations: %d. Ratio: 0.0000", MAX_OPERATIONS);
}
int c = ouf.readInt();
if (c < 1 || c > n) {
quitf(_wa, "Invalid query: bakery index must be between 1 and %d", n);
}
int cake_type = hidden_array[c];
// Check if cake_type is in S
bool found = false;
for (int val : S) {
if (val == cake_type) {
found = true;
break;
}
}
// Output Y or N
if (found) {
println("Y");
} else {
println("N");
}
// Add cake_type to the end of S
S.push_back(cake_type);
// If |S| > k, remove front
if ((int)S.size() > k) {
S.pop_front();
}
} else if (operation == "R") { // Reset
reset_count++;
if (query_count + reset_count > MAX_OPERATIONS) {
quitp(0.0, "Operation limit exceeded. Max operations: %d. Ratio: 0.0000", MAX_OPERATIONS);
}
// Clear S (no response to contestant)
S.clear();
} else if (operation == "!") { // Final answer
int d = ouf.readInt();
if (d < 1 || d > n) {
quitf(_wa, "Invalid answer: d must be between 1 and %d", n);
}
// Calculate the actual number of distinct values
std::set<int> distinct_values;
for (int i = 1; i <= n; ++i) {
distinct_values.insert(hidden_array[i]);
}
int actual_d = distinct_values.size();
if (d != actual_d) {
quitp(0.0, "Wrong answer: expected %d, got %d. Ratio: 0.0000", actual_d, d);
}
// Calculate cost
long long your_cost = (long long)reset_count * n + query_count + 1;
double score_ratio = std::min(1.0, (double)ref_cost / your_cost);
double unbounded_ratio = (double)ref_cost / your_cost;
quitp(score_ratio, "Correct in %d queries and %d resets. Cost: %lld. Ratio: %.4f, RatioUnbounded: %.4f",
query_count, reset_count, your_cost, score_ratio, unbounded_ratio);
break;
} else {
quitf(_wa, "Invalid operation: expected '?', 'R', or '!', but got '%s'", operation.c_str());
}
}
return 0;
} |