1
2

@WebSocketGateway({})
export class ChatGetWay {}

1
2
3
4
5
6
7
8

// server-side
const io = new Server(httpServer, {
  cors: {
    origin: "https://example.com",
    allowedHeaders: ["my-custom-header"],
    credentials: true
  }
});

1
2
3
4
5
6
7

@WebSocketGateway({
    cors: {
        origin: '*',
        methods: ['GET', 'POST']
    },
    namespace: 'chat'
})

1

@WebSocketGateway(80, { namespace: 'events' })

1
2
3
4
5
6
7

@SubscribeMessage('message') // 订阅`message`事件
handleMessage(
  @ConnectedSocket() client, // 发送消息的客户端引用
  @MessageBody() data // 事件携带的信息
) {
  // do something
}

1
2

@WebSocketServer()
server: Server;

1

this.server.to(group).emit('message', msg);

1

const connection = io(url, {transports: ['websocket'] });

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

#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
int a[N], stk[N], top = -1, t = 0;
struct Q{int id, l, r;};

inline int read() {
int x=0,f=1;char ch=getchar();
while (ch<'0'||ch>'9'){if (ch=='-') f=-1;ch=getchar();}
while (ch>='0'&&ch<='9'){x=x*10+ch-48;ch=getchar();}
return x*f;
}

void push(int i) {
    while (top != -1 && a[stk[top]] <= a[i]) top --;
    stk[++ top] = i;
}

int query(int b, int e) {
    while (t < e) push(++ t);
    int l = 0, r = top;
    while (l < r) {
        int mid = (l + r) >> 1;
        if (stk[mid] >= b) r = mid;
        else l = mid + 1;
    }
    return a[stk[l]];
}

int main () {
    int n = read(), m = read();
    for (int i = 1; i <= n; i ++) a[i] = read();
    vector<Q> q;
    for (int i = 0; i < m; i ++) {
        q.push_back({i, read(), read()});
    }
    sort(q.begin(), q.end(), [](auto &a, auto &b) {
        return a.r < b.r;
    });
    vector<int> res(m);
    for (auto &x : q) {
        res[x.id] = query(x.l, x.r);
    }
    for (int &x : res) printf("%d\n", x);
    return 0;
}

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

#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
int f[N][21];

inline int read() {
int x=0,f=1;char ch=getchar();
while (ch<'0'||ch>'9'){if (ch=='-') f=-1;ch=getchar();}
while (ch>='0'&&ch<='9'){x=x*10+ch-48;ch=getchar();}
return x*f;
}

int main () {
    int n = read(), m = read();
    for (int i = 1; i <= n; i ++) f[i][0] = read();
    for (int j = 1; j < 21; j ++)
        for (int i = 1; i + (1 << j) - 1 <= n; i ++) 
            f[i][j] = max(f[i][j - 1], f[i + (1 << (j - 1))][j - 1]);
    while (m --) {
        int l = read(), r = read();
        int len = log2(r - l + 1);
        printf("%d\n", max(f[l][len], f[r - (1 << len) + 1][len]));
    }
    return 0;
}

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16

15
0 1
0 2
0 3
0 1
0 1
0 2
0 3
1 3
1 3
1 3
1 3
1 2
1 1
1 1
1 1

1
2
3

3 2 2
3 1 4
The first win!

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

//
// Created by trudbot on 2023/7/15.
//

#include <bits/stdc++.h>
using namespace  std;

int main () {
    int n; cin >> n;
    vector<vector<int>> ans(2, vector<int>(4, 0));
    while (n --) {
        int c, p; cin >> c >> p;
        ans[c][p] ++;
    }
    for (auto &v : ans) {
        for (int i = 1; i <= 3; i ++) {
            cout << v[i];
            if (i != 3) cout << " ";
        }
        cout << endl;
    }
    auto t = ans;
    sort(ans.begin(), ans.end());
    if (t == ans) cout << "The second win!";
    else cout << "The first win!";
    return 0;
}

1
2
3
4
5

A：最近出了一个饮料营养等级你们知道吗？例如无糖的饮料是 A 级，可乐是 D 级……
B：那……无糖可乐是什么级别？
C：AD 级吧。
A：出院！
B：出什么院，你也给我进去！

1
2
3
4
5
6
7
8
9
10
11
12

5 6
Diet A
LowSugarTea B
Milk C
Coke D
Water A
DietCoke
Pepsi
Milk
CokeWater
GoodMilk
dietCoke

1
2
3
4
5
6

AD
D
C
DA
D
D

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

//
// Created by trudbot on 2023/7/15.
//
#include <bits/stdc++.h>
using namespace  std;
#define x first
#define y second

int main () {
    int n, m; cin >> n >> m;
    map<string, string> level;
    for (int i = 0; i < n; i ++) {
        string s, lev; cin >> s >> lev;
        level[s] = lev;
    }
    for (int i = 0; i < m; i ++) {
        string s; cin >> s;
        //如果已知等级
        if (level.count(s)) cout << level[s] << endl;
        else {
            int cnt = 0;
            string res;
            for (auto &p : level) {
                if (p.x.size() < s.size() 
                    && s.substr(0, p.x.size()) == p.x //是否为前缀
                    && level.count(s.substr(p.x.size()))) //后缀是否已知
                    cnt ++, res = p.y + level[s.substr(p.x.size())];
            }
            if (cnt != 1) res = "D";
            cout << res << endl;
        }
    }
    return 0;
}

1
2
3
4

3
1 1 2 2 3
1 1 2 3 4
1 1 1 2 3

1
2
3

3 4 9
3 13 18
2 4 9

1

鱼越大，鱼刺越大；鱼刺越大，肉越少；肉越少，鱼越小；所以鱼越大，鱼越小

1

YuCi 0 Rou 1

1

Yu 0 YuCi 0 YuCi 0 Rou 1 Rou 1 Yu 1 = Yu 0 Yu 1

1
2
3
4
5
6

5
Yu 0 Yuci 0
Rou 1 Yu 1
Yuci 0 Rou 1
Yuci 0 Gutou 0
Gutou 0 Rou 0

1

Yu 0 Yuci 0 Yuci 0 Rou 1 Rou 1 Yu 1 = Yu 0 Yu 1

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

#include <bits/stdc++.h>
using namespace std;
const int N = 4010;
int n, m;
string name[N];
vector<int> g[N];
unordered_map<string, int> id;

vector<int> bfs(int start, int end) {
    queue<int> q;
    vector<int> last(n + 1, 0);
    q.push(start);
    while (!q.empty()) {
        int u = q.front(); q.pop();
        if (u == end) break;
        for (auto &v : g[u])
            if (last[v] == 0)
                last[v] = u, q.push(v);
    }
    vector<int> res;
    do {
        res.push_back(end), end = last[end];
    } while (end != 0);
    return res;
}

void print(int u, bool space) {
    cout << name[u] << " " << u - id[name[u]];
    if (space) cout << " ";
}

int main () {
    cin >> m;
  //编号、建图
    for (int i = 1; i <= m; i ++) {
        string s1, s2;
        int st1, st2;
        cin >> s1 >> st1 >> s2 >> st2;
        if (!id.count(s1)) {
            n += 2, id[s1] = n - 1, name[n - 1] = name[n] = s1;
        }
        if (!id.count(s2)) {
            n += 2, id[s2] = n - 1, name[n - 1] = name[n] = s2;
        }
        g[id[s1] + st1].push_back(id[s2] + st2);
    }
  //取最短路径
    vector<int> res(2000);
    for (int i = 1; i <= n; i += 2) {
        auto p1 = bfs(i, i + 1), p2 = bfs(i + 1, i);
        if (res.size() > p1.size() && p1.size() > 1) res = p1;
        if (res.size() > p2.size() && p2.size() > 1) res = p2;
    }
  //打印格式
    for (int i = res.size() - 1; i >= 1; i --) {
        print(res[i], true), print(res[i - 1], true);
    }
    cout << "= ", print(res.back(), true), print(res[0], false);
    return 0;
}

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22

3
5
1 0
1 0
0 0
0 0
0 1
1 2 3 4 5
5
1 0
1 0
0 0
0 0
0 1
5 4 3 2 1
5
1 0
0 1
0 0
0 1
1 1
4 2 1 3 5

1
2
3

0
3
2

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

//
// Created by trudbot on 2023/7/15.
//
#include <bits/stdc++.h>
using namespace std;

int main () {
    int T; cin >> T;
    for (int t = 1; t <= T; t++) {
        int n; cin >> n;
        vector<int> s(n + 1, 0);
        for (int i = 1; i <= n; i ++) {
            int a, b; cin >> a >> b;
            s[i] = a + 1 - b;
        }
        vector<int> dp(3, 0);
        int mx = 0;
        for (int i = 0; i < n; i ++) {
            int x; cin >> x;
            for (int j = s[x]; j < 3; j ++)
                dp[s[x]] = max(dp[s[x]], dp[j] + 1);
            mx = max(dp[s[x]], mx);
        }
        cout << n - mx << endl;
    }
    return 0;
}

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

//
// Created by trudbot on 2023/7/14.
//
#include "complex"

//sign为1时是FFT， -1是IFFT
//n必须为2的整数次幂
const double pi = acos(-1);
void FFT(std::complex<double> *a, int n, int sign) {
    if (n == 1) return;
    std::complex<double> g[n / 2], h[n / 2];
    for (int i = 0, j = 0; i < n; i += 2, j ++) {
        g[j] = a[i], h[j] = a[i + 1];
    }
    FFT(g, n / 2, sign), FFT(h, n / 2, sign);
    std::complex<double> w(1, 0), u(cos(2 * pi) / n, sign * sin(2 * pi / n));
    for (int i = 0; i < n / 2; i ++, w *= u) {
        a[i] = g[i] + w * h[i];
        a[i + n / 2] = g[i] - w * h[i];
    }
}

void DFT(std::complex<double> *a, int n) {
    FFT(a, n, 1);
}

void IDFT(std::complex<double> *a, int n) {
    FFT(a, n, -1);
    for (int i = 0; i < n; i ++) {
        a[i] /= n;
    }
}