-
Notifications
You must be signed in to change notification settings - Fork 0
/
F.cpp
153 lines (130 loc) · 3.52 KB
/
F.cpp
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
142
143
144
145
146
147
148
149
150
151
152
153
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include <algo/debug.h>
#else
#define debug(...) void(31)
#endif
#define pb push_back
#define mp make_pair
#define all(x) x.begin(), x.end()
#define REP(i, n) for (int i = 0; i < (int)n; ++i)
#define FOR(i, a, b) for (int i = (int)a; i <= (int)b; ++i)
#define FORD(i, b, a) for (int i = (int)b; i >= (int)a; --i)
#define EACH(v, a) for (auto& v : a)
#define SZ(a) ((int) a.size())
using ll = long long;
using pii = pair<int, int>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vll = vector<ll>;
using vvi = vector<vector<int> >;
const int INF = 1e8;
struct Trie {
Trie *child[2] = {};
int minAccept = INF;
int minDeny = INF;
};
// A -> accept = true, D -> accept = false;
// node a.b.c.d has state = a * 256^3 + b * 256^2 + c * 256 + d
void update(Trie *root, bool accept, ll state, int bit, int queryId) {
debug("update", accept, state, bit, queryId);
Trie *cur = root;
for (int i = 1; i <= bit; i++) {
// left or right
bool bitI = (state >> (32 - i)) & 1;
if (cur->child[bitI] == NULL) {
cur->child[bitI] = new Trie;
}
cur = cur->child[bitI];
}
if (accept) {
cur->minAccept = min(queryId, cur->minAccept);
} else {
cur->minDeny = min(queryId, cur->minDeny);
}
}
bool isAccept(Trie *root, ll state) {
Trie *cur = root;
int minAcceptSoFar = root->minAccept;
int minDenySofar = root->minDeny;
for (int i = 1; i <= 32; i++) {
// left or right
bool bitI = (state >> (32 - i)) & 1;
if (cur->child[bitI] == NULL) {
cur->child[bitI] = new Trie;
}
cur = cur->child[bitI];
minAcceptSoFar = min(minAcceptSoFar, cur->minAccept);
minDenySofar = min(minDenySofar, cur->minDeny);
}
debug(minDenySofar, minAcceptSoFar);
// return minAcceptSoFar <= minDenySofar;
if (minDenySofar == INF && minAcceptSoFar == INF) {
return true;
}
if (minDenySofar == INF) {
// no deny rule
return true;
}
if (minAcceptSoFar == INF) {
// because we have deny rule, and no accept rule
return false;
}
return minAcceptSoFar <= minDenySofar;
}
pair<ll, int> extract(string s) {
int pos = s.find("/");
ll state = 0;
int bit = 0;
int l = s.length();
if (pos == s.npos) {
// not found
pos = l;
bit = 32;
} else {
for (int j = pos + 1; j < l; ++j) {
bit = bit * 10 + s[j] - '0';
}
s = s.substr(0, pos);
}
int curNum = 0;
for (int i = 0; i < pos; i++) {
if (s[i] == '.') {
state = state * 256 + curNum;
debug(curNum);
curNum = 0;
} else {
curNum = curNum * 10 + s[i] - '0';
}
}
debug(curNum);
state = (state << 8) + curNum;
debug(s, state, bit);
return {state, bit};
}
int main() {
#ifdef LOCAL
freopen("inp/F/09", "r", stdin);
freopen("out/09.out", "w", stdout);
#endif
ios::sync_with_stdio(false);
cin.tie(nullptr);
Trie r;
int query;
cin >> query;
char cmd;
string cidr;
REP(i, query) {
cin >> cmd >> cidr;
pair<ll, int> info = extract(cidr);
if (cmd != '?') {
update(&r, cmd == 'A', info.first, info.second, i);
} else {
assert(info.second == 32);
bool ok = isAccept(&r, info.first);
cout << (ok ? "Y" : "N") << endl;
}
}
}