Download frontier_cs/problems/144/interactor.cc from junlin-modal/frontier-cs: direct link, hf CLI and curl.
- Browser
- Download file 2.73 kB
-
https://huggingface.co/datasets/junlin-modal/frontier-cs/resolve/main/frontier_cs/problems/144/interactor.cc
- Command line
-
hf download hf://datasets/junlin-modal/frontier-cs/frontier_cs/problems/144/interactor.cc
-
curl -L -o interactor.cc https://huggingface.co/datasets/junlin-modal/frontier-cs/resolve/main/frontier_cs/problems/144/interactor.cc
2.73 kB
| int main(int argc, char* argv[]) { | |
| registerInteraction(argc, argv); | |
| int n = inf.readInt(); | |
| long long ref_queries = ans.readLong(); | |
| std::vector<int> hidden_permutation(n + 1); | |
| for (int i = 1; i <= n; ++i) { | |
| hidden_permutation[i] = inf.readInt(); | |
| } | |
| println(n); | |
| const int MAX_QUERIES = 500; | |
| int query_count = 0; | |
| while (true) { | |
| int action_type = ouf.readInt(); // 0 for query, 1 for answer | |
| if (action_type == 0) { // Query | |
| if (++query_count > MAX_QUERIES) { | |
| quitp(0.0, "Query limit exceeded. Max queries: %d. Ratio: 0.0000", MAX_QUERIES); | |
| } | |
| int k = ouf.readInt(); | |
| if (k < 4 || k > n || k % 2 != 0) { | |
| quitf(_wa, "Invalid k: %d", k); | |
| } | |
| std::vector<int> indices(k); | |
| std::vector<bool> used(n + 1, false); | |
| for (int i = 0; i < k; ++i) { | |
| indices[i] = ouf.readInt(); | |
| if (indices[i] < 1 || indices[i] > n || used[indices[i]]) { | |
| quitf(_wa, "Invalid query indices"); | |
| } | |
| used[indices[i]] = true; | |
| } | |
| std::vector<int> values(k); | |
| for (int i = 0; i < k; ++i) { | |
| values[i] = hidden_permutation[indices[i]]; | |
| } | |
| std::sort(values.begin(), values.end()); | |
| int median1 = values[k / 2 - 1]; | |
| int median2 = values[k / 2]; | |
| println(median1, median2); | |
| } else if (action_type == 1) { // Final answer | |
| int i1 = ouf.readInt(); | |
| int i2 = ouf.readInt(); | |
| if (i1 < 1 || i1 > n || i2 < 1 || i2 > n) { | |
| quitf(_wa, "Invalid answer indices"); | |
| } | |
| int target1 = n / 2; | |
| int target2 = n / 2 + 1; | |
| int val1 = hidden_permutation[i1]; | |
| int val2 = hidden_permutation[i2]; | |
| bool correct = (val1 == target1 && val2 == target2) || | |
| (val1 == target2 && val2 == target1); | |
| if (correct) { | |
| double unbounded_ratio = (double)ref_queries / query_count; | |
| double score_ratio = std::min(1.0, (double)ref_queries / query_count); | |
| quitp(score_ratio, "Correct in %d queries. Ratio: %.4f, RatioUnbounded: %.4f", query_count, score_ratio, unbounded_ratio); | |
| } else { | |
| quitp(0.0, "Wrong answer. Ratio: 0.0000, RatioUnbounded: 0.0000"); | |
| } | |
| break; | |
| } else { | |
| quitf(_wa, "Invalid action type: %d", action_type); | |
| } | |
| } | |
| return 0; | |
| } |