随笔分类 -  CUGBACM

Diary_3.20
摘要：1. const int maxn = 1e6+10; bool is_not_pri[maxn]; int dp[maxn], tol; void presolve(){ is_not_pri[1] = true; for(int i=2; i<maxn; i++){ if(is_not_pri[ 阅读全文
posted @ 2025-03-20 13:38 Devpp 阅读(11) 评论(0) 推荐(0)
Diary_3.14
摘要：1. #define int long long const int maxn = 4e4+10; int n, ml, mr, inf = 1e10, tol, dis[1010]; struct Edge{ int u, v, w; }; Edge edge[maxn]; void solve( 阅读全文
posted @ 2025-03-14 15:17 Devpp 阅读(15) 评论(0) 推荐(0)
Diary_3.12
摘要：codeforces 1. void solve(){ int l, r, u, d; cin >> l >> r >> u >> d; if(l == r && u == d && l == u){ cout << "YES" << endl; }else{ cout << "NO" << end 阅读全文
posted @ 2025-03-12 09:09 Devpp 阅读(9) 评论(0) 推荐(0)
Diary_3.11
摘要：#define int long long void solve(){ int n; cin >> n; int ans = 0; for(int i=1; i<=n; i++){ int l = i; int r = n/(n/i); int len = r-l+1; ans += len*(n/ 阅读全文
posted @ 2025-03-11 16:26 Devpp 阅读(9) 评论(0) 推荐(0)
Diary_3.9
摘要：1. Good Key, Bad Key #define int long long const int maxn = 1e5+10; int n, k, a[maxn]; void solve(){ cin >> n >> k; vector<int> dp(n+1, 0); int mx = 0 阅读全文
posted @ 2025-03-09 10:44 Devpp 阅读(11) 评论(0) 推荐(0)
Diary_3.7
摘要：1. King Bombee #define int long long const int maxn = 2e3+10; int n, m, k, s, t, x, p = 998244353; vector<vector<int>> tree; int dp[maxn][maxn][2]; vo 阅读全文
posted @ 2025-03-07 15:25 Devpp 阅读(10) 评论(0) 推荐(0)
Diary_3.4
摘要：1.Long Inversions void solve(){ int n; cin >> n; string s; cin >> s; s = ' '+s; int ans = 1; for(int k=n; k>=2; k--){ vector<int> dif(n+k+1, 0); for(i 阅读全文
posted @ 2025-03-04 09:11 Devpp 阅读(12) 评论(0) 推荐(0)
Diary_3.3
摘要：1. Light Switches const int maxn = 2e5+10; int a[maxn], n, k; void solve(){ cin >> n >> k; int t = 2*k, mx = 0; set<int> q; for(int i=0;i <n; i++){ ci 阅读全文
posted @ 2025-03-03 13:49 Devpp 阅读(8) 评论(0) 推荐(0)
Diary_3.2
摘要：爽玩 1. Find the Permutation void solve(){ int n; cin >> n; string s[n]; for(int i=0; i<n; i++) cin >> s[i]; int ans[n]; for(int i=0; i<n; i++){ ans[i] 阅读全文
posted @ 2025-03-02 12:48 Devpp 阅读(23) 评论(0) 推荐(0)
Diary_3.1
摘要：codeforces 1. The Play Never Ends void solve(){ int n; cin >> n; if(n%3 == 1){ cout << "YES" << endl; }else{ cout << "NO" << endl; } } 2. Perfecto voi 阅读全文
posted @ 2025-03-01 00:26 Devpp 阅读(20) 评论(0) 推荐(0)
Diary_2.28
摘要：codeforces 3. Limited Repainting const int maxn = 3e5+10; int n, k, a[maxn]; string s; bool check(int mx){ int len = 0, cnt = 0; bool not_need = true; 阅读全文
posted @ 2025-02-28 11:09 Devpp 阅读(38) 评论(0) 推荐(0)
Diary_2.27
摘要：Codeforces 1. Swap Columns and Find a Path #define int long long void solve(){ int n; cin >> n; int a[2][n+2], cnt = 0; a[0][0] = a[1][0] = a[0][n+1] 阅读全文
posted @ 2025-02-27 16:35 Devpp 阅读(10) 评论(0) 推荐(0)
Diary_2.26
摘要：Codeforces Round 1006 (Div. 3) 1. New World, New Me, New Array int n, k, p; void solve(){ cin >> n >> k >> p; if((k>0 && n*p < k )|| (k<0 && -n*p > k) 阅读全文
posted @ 2025-02-26 09:19 Devpp 阅读(36) 评论(0) 推荐(0)
Diary_2.25
摘要：AtCoder 1. Paint to make a rectangle void solve(){ int h, w; cin >> h >> w; string a[h]; for(int i=0; i<h; i++) cin >> a[i]; int mxx = 0, mxy = 0, mnx 阅读全文
posted @ 2025-02-25 08:19 Devpp 阅读(8) 评论(0) 推荐(0)
Diary_2.24
摘要：爆学数据库的一天 Codeforces 1. Shashlik Cooking void solve(){ int n, k; cin >> n >> k; int len = 2*k+1; if(n % len <= k && n%len != 0){ cout << n/len+1 << end 阅读全文
posted @ 2025-02-24 22:40 Devpp 阅读(12) 评论(0) 推荐(0)
Diary_2.23
摘要：Codeforces Round 1005 (Div. 2) 1. Brogramming Contest void solve(){ int len; cin >> len; string s; cin >> s; s = '0'+s; len += 2; int cnt = 0; for(int 阅读全文
posted @ 2025-02-23 11:07 Devpp 阅读(19) 评论(0) 推荐(0)
Diary_2.22
摘要：1. Is It A Tree?-树，并查集 题意 给定多条有向边的图，问这个图是不是一个树 思路 有两种思路 一种是用邻接表构建这个图，然后以入度为 0 的点为根，遍历这个图 如果入度为 0 的点有多个，或者在遍历的时候访问到了已经访问过的点，则不是一棵树 另一种思路就是用并查集 如果合并的时候两 阅读全文
posted @ 2025-02-22 21:52 Devpp 阅读(12) 评论(0) 推荐(0)