forked from cutekyu/opensource-datastructure-algorithm
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathmail_server.txt
More file actions
320 lines (273 loc) · 7.07 KB
/
mail_server.txt
File metadata and controls
320 lines (273 loc) · 7.07 KB
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
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
#define R register
#define MAX_HEAP 100000
#define MAX_TABLE 20007
#define LL long long
#define MAXUSER 1000
#define MAXMAIL 10000
#define MAXW 10
int mailCnt, nodeCnt, k;
struct Mail {
LL name[10];
int textCount;
}mail[MAXMAIL];
struct User {
int num, sta, end;
int mailId[10000];
}user[MAXUSER];
struct Node {
int mailId;
Node *next;
}nodeRaw[MAX_HEAP], hTable[MAX_TABLE];
LL word[MAX_TABLE];
Node* getNewNode() {
return &nodeRaw[nodeCnt++];
}
void init(int N, int K)
{
// k를 전역화
k = K;
mailCnt = nodeCnt = 0;
for (R int i = 0; i < N; i++) {
user[i].num = user[i].sta = user[i].end = 0;
}
for (R int i = 0; i < MAX_TABLE; i++) {
hTable[i].next = nullptr;
}
}
LL name[MAXW];
int str2ll(char* str) {
LL index = 0;
for (R int i = 0, num = 0;; i++) {
if (str[i] < 'a') name[num++] = index, index = 0; // ' ' or '\0'
else index = (index << 5) + str[i] - 'a' + 1;
if (!str[i]) return num;
}
}
void sendMail(char subject[], int uID, int cnt, int rIDs[])
{
int num = str2ll(subject);
mail[mailCnt].textCount = num;
for (R int i = 0; i < num; i++) {
mail[mailCnt].name[i] = name[i];
}
int id;
for (R int i = 0; i < cnt; i++) {
id = rIDs[i];
user[id].mailId[user[id].end++] = mailCnt;
// 수신 가능한 메일이 꽉 찼을경우
if(user[id].num == k) {
int &j = ++user[id].sta;
while (user[id].mailId[j] < 0) j++;
}
else user[id].num++;
}
// add hash
for (R int i = 0; i < num; i++) {
for (R int j = name[i] % MAX_TABLE;; j = (j + 1) % MAX_TABLE) {
if (hTable[j].next && word[j] != name[i]) continue;
if (!hTable[j].next) word[j] = name[i];
Node* node = getNewNode();
node->mailId = mailCnt;
node->next = hTable[j].next;
hTable[j].next = node;
break;
}
}
mailCnt++;
}
int getCount(int uID)
{
return user[uID].num;
}
int deleteMail(int uID, char subject[])
{
int num = str2ll(subject);
int ans = 0, mid;
for (R int i = user[uID].sta; i < user[uID].end; i++) {
mid = user[uID].mailId[i];
if (mid == -1 || num != mail[mid].textCount) continue;
for (R int j = 0;; j++) {
if (j == num) {
user[uID].mailId[i] = -1;
ans++;
break;
}
if (mail[mid].name[j] != name[j]) break;
}
}
user[uID].num -= ans;
return ans;
}
//중복된 값 겁출
bool check[MAXMAIL];
int searchMail(int uID, char text[])
{
str2ll(text);
int ans = 0, mid, key;
for (key = name[0] % MAX_TABLE;; key = (key + 1) % MAX_TABLE) {
if (hTable[key].next && word[key] != name[0]) continue;
for (R Node* node = hTable[key].next; node; node = node->next) check[node->mailId] = true;
break;
}
for (R int i = user[uID].sta; i < user[uID].end; i++) {
mid = user[uID].mailId[i];
if (mid == -1) continue;
if (check[mid]) ans++;
}
for (R Node* node = hTable[key].next; node; node = node->next) check[node->mailId] = false;
return ans;
}
#ifndef _CRT_SECURE_NO_WARNINGS
#define _CRT_SECURE_NO_WARNINGS
#endif
#include <stdio.h>
#define INIT 0
#define SENDMAIL 1
#define GETCOUNT 2
#define DELETEMAIL 3
#define SEARCHMAIL 4
extern void init(int N, int K);
extern void sendMail(char subject[], int uID, int cnt, int rIDs[]);
extern int getCount(int uID);
extern int deleteMail(int uID, char subject[]);
extern int searchMail(int uID, char text[]);
/////////////////////////////////////////////////////////////////////////
/////////////////////////////////////////////////////////////////////////
#define MAX_WORD 10000
static char Word[MAX_WORD][11];
static int N, W, minR, maxR, SW;
static int mSeed;
static int pseudo_rand(void)
{
mSeed = mSeed * 214013 + 2531011;
return (mSeed >> 16) & 0x7FFF;
}
static void make_string(int seed)
{
mSeed = seed;
for (int i = 0; i < W; ++i) {
int length = 5 + pseudo_rand() % 6;
for (int k = 0; k < length; ++k) {
Word[i][k] = 'a' + pseudo_rand() % 26;
}
Word[i][length] = '\0';
}
}
static void send_mail(int seed)
{
char str[200];
int pos = 0;
mSeed = seed;
int wcnt = 1 + pseudo_rand() % SW;
for (int i = 0; i < wcnt; ++i) {
int widx = pseudo_rand() % W;
for (int k = 0; k < 10; ++k) {
if (Word[widx][k] == '\0') break;
str[pos++] = Word[widx][k];
}
str[pos++] = ' ';
}
str[pos - 1] = '\0';
int uid = pseudo_rand() % N;
int rcnt = minR + pseudo_rand() % (maxR - minR + 1);
int rids[50];
for (int i = 0; i < rcnt; ++i) {
rids[i] = pseudo_rand() % N;
}
sendMail(str, uid, rcnt, rids);
}
static int delete_mail(int uid, int seed)
{
char str[200];
int pos = 0;
mSeed = seed;
int wcnt = 1 + pseudo_rand() % SW;
for (int i = 0; i < wcnt; ++i) {
int widx = pseudo_rand() % W;
for (int k = 0; k < 10; ++k) {
if (Word[widx][k] == '\0') break;
str[pos++] = Word[widx][k];
}
str[pos++] = ' ';
}
str[pos - 1] = '\0';
return deleteMail(uid, str);
}
static int run(int answer)
{
int Q, K, cmd, sample, seed, param1, param2, ret;
char str[30];
scanf("%d %d %d %d", &Q, &sample, &N, &K);
if (sample == 0) {
scanf("%d %d %d %d %d", &W, &minR, &maxR, &SW, &seed);
make_string(seed);
}
init(N, K);
for (int i = 1; i < Q; ++i) {
scanf("%d", &cmd);
switch (cmd) {
case SENDMAIL:
if (sample == 1) {
int uid, rcnt;
int rids[10];
scanf("%s %d %d", str, &uid, &rcnt);
for (int k = 0; k < rcnt; ++k) scanf("%d", &rids[k]);
for (int k = 0; k < 30; ++k) {
if (str[k] == '\0') break;
if (str[k] == '_') str[k] = ' ';
}
sendMail(str, uid, rcnt, rids);
}
else {
scanf("%d", &seed);
send_mail(seed);
}
break;
case GETCOUNT:
scanf("%d %d", ¶m1, ¶m2);
ret = getCount(param1);
if (ret != param2)
answer = 0;
break;
case DELETEMAIL:
if (sample == 1) {
int uid;
scanf("%d %s %d", ¶m1, str, ¶m2);
for (int k = 0; k < 30; ++k) {
if (str[k] == '\0') break;
if (str[k] == '_') str[k] = ' ';
}
ret = deleteMail(param1, str);
if (ret != param2)
answer = 0;
}
else {
scanf("%d %d %d", ¶m1, &seed, ¶m2);
ret = delete_mail(param1, seed);
if (ret != param2)
answer = 0;
}
break;
case SEARCHMAIL:
scanf("%d %s %d", ¶m1, str, ¶m2);
ret = searchMail(param1, str);
if (ret != param2)
answer = 0;
break;
default:
break;
}
}
return answer;
}
int main()
{
setbuf(stdout, NULL);
//freopen("sample_input.txt", "r", stdin);
int T, Mark;
scanf("%d %d", &T, &Mark);
for (int tc = 1; tc <= T; tc++) {
printf("#%d %d\n", tc, run(Mark));
}
return 0;
}