File size: 3,126 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 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 |
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <vector>
#include <string>
#include "testlib.h"
using namespace std;
enum {
INVALID_INPUT = -1,
INVALID_T_LENGTH = 1,
INVALID_T_CHAR = 2,
WRONG_T = 3,
INVALID_S_LENGTH = 4,
INVALID_S_CHAR = 5,
QUERY_LIMIT_EXCEEDED = 6,
INVALID_OUTPUT = 9,
};
const int N_MAX = 8000;
const int QUERY_LIMIT = 5000;
int N, R;
std::vector<int> U, V;
std::string T;
int QUERY_COUNT = 0;
double score(int x){
if (x <= 900) return 1.0;
if (x >= 5000) return 0.0;
return (5000.0 - x) / (5000.0 - 900.0);
}
double score_unbounded(int x){
if (x >= 5000) return 0.0;
return (5000.0 - x) / (5000.0 - 900.0);
}
[[noreturn]] void wrong(const int num) {
fprintf(stdout, "-1\n");
fflush(stdout);
quitf(_wa, "translate:wrong\nWrong Answer [%d]\n", num);
}
[[noreturn]] void ok() {
double r = score(QUERY_COUNT);
double ru = score_unbounded(QUERY_COUNT);
quitp(r, "Ratio: %.4f , RatioUnbounded: %.4f , Queries: %d", r, ru, QUERY_COUNT);
}
int query(std::string s) {
const int M = 2 * N + 1;
if ((int)s.size() != M) {
wrong(INVALID_S_LENGTH);
}
for (char c : s) {
if (c != '0' && c != '1') wrong(INVALID_S_CHAR);
}
if (QUERY_COUNT == QUERY_LIMIT) {
wrong(QUERY_LIMIT_EXCEEDED);
}
QUERY_COUNT++;
for (char &c : s) c -= '0';
for (int i = N - 1; i >= 0; --i) {
const int u = U[i], v = V[i];
if (T[i] == '&') {
s[i] ^= (s[u] & s[v]);
} else {
s[i] ^= (s[u] | s[v]);
}
}
return s[0];
}
void answer(std::string t) {
if ((int)t.size() != N) {
wrong(INVALID_T_LENGTH);
}
for (char c : t) {
if (c != '&' && c != '|') wrong(INVALID_T_CHAR);
}
if (t != T) {
wrong(WRONG_T);
}
ok();
}
int main(int argc, char* argv[]) {
registerInteraction(argc, argv);
N = inf.readInt();
R = inf.readInt();
if (N < 1 || N > N_MAX) {
wrong(INVALID_INPUT);
}
cout << N << " " << R << endl;
U.resize(N);
V.resize(N);
for (int i = 0; i < N; ++i) {
U[i] = inf.readInt();
V[i] = inf.readInt();
cout << U[i] << " " << V[i] << endl;
}
T = inf.readToken();
if ((int)T.size() != N) {
wrong(INVALID_INPUT);
}
int orCount = 0;
for (char c : T) {
if (c != '&' && c != '|') wrong(INVALID_INPUT);
if (c == '|') ++orCount;
}
if (orCount > R) {
wrong(INVALID_INPUT);
}
while (true) {
std::string op = ouf.readToken();
if (op.empty()) wrong(INVALID_OUTPUT);
const char type = op[0];
if (type != '?' && type != '!') wrong(INVALID_OUTPUT);
std::string payload = ouf.readToken();
if (!payload.empty() && payload.back() == '\n') payload.pop_back();
if (type == '?') {
int res = query(payload);
fprintf(stdout, "%d\n", res);
fflush(stdout);
} else {
answer(payload);
}
}
}
|