cz_xuyixuan的博客

【比赛链接】Div.1Div.2【题解链接】点击打开链接【Div.2 A】Friends Meeting【思路要点】模拟两个角色向中间移动即可。时间复杂度\(O(B-A)\)。【代码】#include<bits/stdc++.h> using namespace std; const int MAXN = 100005; template <typename T> void...

【题目链接】点击打开链接【思路要点】补档博客，无题解。【代码】#include<bits/stdc++.h> using namespace std; #define MAXN 5005 int main() { int n; for (cin >> n; n; cin >> n) { if (n & 1) cout << "Bob"...

【题目链接】点击打开链接【思路要点】补档博客，无题解。【代码】#include<bits/stdc++.h> using namespace std; #define MAXN 45 #define MAXK 1005 #define MAXP 1605 #define INF 1e9 struct edge {int dest, flow; unsigned pos; }; vect...

【题目链接】点击打开链接【思路要点】补档博客，无题解。【代码】#include<bits/stdc++.h> using namespace std; #define MAXN 105 #define MAXP 10005 #define INF 1e9 struct edge {int dest, flow; unsigned pos; }; vector <edge> ...