olone

分类

/ 注册

全部文章（共67篇）

题解 | 【模板】多重背包

#include<bits/stdc++.h> #define int long long using namespace std; const int N = 3005; int T; int n, m; int w[N], v[N], s[N]; int dp[N]; inl...

2026-03-16

0 62

题解 | 显生之宙

import java.util.*; public class Main{ static Scanner in = new Scanner(System.in); public static void solve(){ int n = in.nextInt(); ...

2026-03-13

2 53

题解 | 食物链计数

import java.util.*; // 注意类名必须为 Main, 不要有任何 package xxx 信息 public class Main { public static void main(String[] args) { final int N = 1000...

2026-03-12

0 58

题解 | Tokitsukaze and Colorful Chessboard

#include<bits/stdc++.h> #define int long long using namespace std; int T; int a,b; vector<int>v; inline void solve(){ cin>>a...

2026-03-11

0 67

题解 | 连分数

#include<bits/stdc++.h> using namespace std; int T; int p,q; inline string work(int x,int y) { if(x%y == 0) return to_string(x/y); in...

2026-03-08

0 47

题解 | Rinne Loves Edges

#include<bits/stdc++.h> using namespace std; const int N = 1e5+5; int n,m,s; int fa[N]; vector< pair<int,int> >e[N]; inline int...

2026-03-07

1 63

题解 | 不点两面(hard version)

#include<bits/stdc++.h> using namespace std; const int M = 1e5+5; int m,q; int cnt[M]; int main() { ios::sync_with_stdio(false); cin...

2026-03-06

0 65

题解 | 走迷宫

#include<bits/stdc++.h> using namespace std; const int N = 1005; int n,m; int sx,sy,tx,ty; char ch[N][N]; int dx[4] = {0,1,-1,0}; int dy[4] =...

2026-03-05

0 69

题解 | 多米诺骨牌

#include<bits/stdc++.h> #define pii pair<int,int> using namespace std; const int N = 2e5+5; int T; int n,m; struct node{ int h; ...

2026-03-04

0 54

题解 | 子段和

#include<bits/stdc++.h> using namespace std; const int N = 5e5+5; int n; int a[N]; int main() { ios::sync_with_stdio(false); cin.tie...

2026-03-03

0 67