usaco-camp

Short, concise solutions for problems from the USACO camp

  1. 1
  2. 2
  3. 3
  4. 4
  5. 5
  6. 6
  7. 7
  8. 8
  9. 9
  10. 10
  11. 11
  12. 12
  13. 13
  14. 14
  15. 15
  16. 16
  17. 17
  18. 18
  19. 19
  20. 20
  21. 21
  22. 22
  23. 23
  24. 24
  25. 25
  26. 26
  27. 27
  28. 28
  29. 29
  30. 30
  31. 31
  32. 32
  33. 33
  34. 34
  35. 35
  36. 36
  37. 37
  38. 38
  39. 39
  40. 40
  41. 41
  42. 42
  43. 43
  44. 44
  45. 45
  46. 46
  47. 47
  48. 48
  49. 49
  50. 50
  51. 51
  52. 52
  53. 53
  54. 54
  55. 55
  56. 56
  57. 57
  58. 58
  59. 59
  60. 60
  61. 61
  62. 62
  63. 63
  64. 64
  65. 65
  66. 66
  67. 67
  68. 68
  69. 69
  70. 70
  71. 71
  72. 72
  73. 73
  74. 74
  75. 75
  76. 76
  77. 77
  78. 78
  79. 79
  80. 80
  81. 81
  82. 82
  83. 83
  84. 84
  85. 85
  86. 86
  87. 87
  88. 88
  89. 89
  90. 90
  91. 91
  92. 92
  93. 93
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
constexpr int M1 = 8191, M2 = 1e9+7;

string s[10001];
vector<int> h[10001];
int r[10001], hs[2][10001];

inline void print(int x, int d) {
	cout << "MOO ";
	for (int i = 0; i < d; ++i) cout << (1 & (x >> i));
	cout << endl;
}

inline int read(int d) {
	int x = 0;
	for (int i = 0; i < 16; ++i) {
		char c;
		cin >> c;
		if (c == '1') x |= (1 << i);
	}
	return x;
}

inline int hsh(string& s, int m) {
	ll x = 0;
	for (auto& c : s) x *= 31, x += c - 'a', x %= m;
	return x;
}

int main() {
	ofstream debug("debug");

	int c, n[2];
	cin >> c >> n[0];
	for (int i = 0; i < n[0]; ++i) {
		cin >> s[i];
		hs[0][i] = hsh(s[i], M1);
		hs[1][i] = hsh(s[i], M2);
	}
	if (c) {
		print(n[0], 16);
		debug << 1 << ' ' << n[1];
		n[1] = read(16);

		for (int i = 0; i < n[0]; ++i) {
			print(hs[0][i], 13);
			bool b;
			cin >> b;
			if (b == 1) {
				print(hs[1][i], 30);
				cin >> b;
				if (b == 1) {
					cout << "RETURN " << s[i] << endl;
					return 0;
				}
			}
		}
	}
	else {
		n[1] = read(16);
		debug << 0 << ' ' << n[1];
		print(n[0], 16);
		
		for (int i = 0; i < n[0]; ++i) {
			h[hs[0][i]].push_back(i);
		}
		for (int i = 0; i < n[1]; ++i) {
			r[i] = read(13);
			if (h[r[i]].empty()) {
				print(0, 1);
			}
			else {
				print(1, 1);
				int x;
				x = read(30);
				bool ans = 0;
				for (auto& y : h[r[i]]) {
					if (hs[1][y] == x) {
						ans = 1;
						cout << "RETURN " << s[y] << endl;
						print(1, 1);
						return 0;
					}
				}
				if (!ans) {
					print(0, 1);
				}
			}
		}
	}
}