![](https://img-blog.csdnimg.cn/20201014180756928.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
杭电
龍木
若人生为棋,我愿为卒,漫漫征途,谁曾见我后退半步
展开
-
2020杭电多校第十场
1003.Mine Sweeper 构造 #include<bits/stdc++.h> using namespace std; #define ll long long const int maxn=6e6+10; const int mod=1e9+7; int a[30],b[30],f[27][27],c[30]; int main() { int t,n,x,y; a[9]=3,b[10]=2,c[11]=1,a[11]=1,a[12]=4,c[13]=1,b[原创 2020-09-16 15:48:34 · 148 阅读 · 0 评论 -
2020杭电多校第九场
1001.Tree 爆搜 #include<bits/stdc++.h> using namespace std; #define ll long long const long long N=5e5+10; ll n,t; ll a[N]; ll vis[N]; ll max1=0,ans=0,vvis[N],q[N]; vector<ll>p[N]; void dfs(ll i,ll x) { if(p[i].size()==0) { vvi原创 2020-09-16 15:44:15 · 106 阅读 · 0 评论 -
2020杭电多校第八场
1003.Clockwise or Counterclockwise 签到 #include<bits/stdc++.h> using namespace std; #define ll long long const int maxn=200005; ll t,n; ll a1,a2,a3,b1,b2,b3; int main() { cin>>t; while(t--) { cin>>a1>>b1>>原创 2020-09-16 15:42:53 · 144 阅读 · 0 评论 -
2020杭电多校第七场
1009.Increasing and Decreasing 模拟 #include<bits/stdc++.h> using namespace std; #define ll long long const int maxn=1e5+10; const int mod=1e9+7; int main() { int t,n,x,y; int a[maxn]; cin>>t; while(t--) { scanf("%原创 2020-09-16 15:38:48 · 141 阅读 · 0 评论 -
2020杭电多校第六场
1001.Road To The 3rd Building 前缀和快数幂 #include<bits/stdc++.h> using namespace std; #define ll long long #define sc(a) scanf("%d",&a) #define pf printf const int N=2e5+10; ll mod=1e9+7; ll n,t; ll a[N],b[N]; ll s[N]; ll sum[N]; ll ss[N]; ll p[N]原创 2020-09-16 15:36:45 · 143 阅读 · 0 评论 -
2020杭电多校第五场
1001.Tetrahedron 向量公式法求期望,前缀和 #include<bits/stdc++.h> using namespace std; typedef long long ll; ll t,n; const int mod=998244353; const int maxn=6e6+10; ll ny(ll x) { ll ans=1,n=mod-2; while(n) { if(n%2==1) ans*=x,a原创 2020-09-13 13:00:11 · 135 阅读 · 0 评论 -
2020杭电多校第三场
1004.Tokitsukaze and Multiple 强大的队友构造出来的 #include<bits/stdc++.h> using namespace std; typedef unsigned long long ll; const int mod=1e9+7; const int maxn=1e5+10; int a[maxn],cnt; ll s[maxn]; int t,n,p; int main() { cin>>t; while(t--)原创 2020-09-13 12:39:51 · 132 阅读 · 0 评论 -
2020杭电多校第二场
1001.Total Eclipse 并查集维护求和 #include <bits/stdc++.h> using namespace std; typedef long long ll; const int N=100010; int d[N],f[N],fa[N],vis[N],num[N]; vector<int> g[N]; int cmp(int a,int b) { return d[a]>d[b]; } int find(int x) { i原创 2020-09-13 12:27:38 · 122 阅读 · 0 评论 -
2020杭电多校第一场
1004.Distinct Sub-palindromes 签到 #include<bits/stdc++.h> using namespace std; #define ll long long #define pi acos(-1) const int maxn=1e6+10; const int mod=998244353; int f[maxn],n,t; int main() { cin>>t; while(t--) { cin原创 2020-09-13 12:16:20 · 154 阅读 · 0 评论 -
2020杭电多校第四场
1004.Deliver the Cake 赛时死都找不出bug,赛后看了题解,发现只要建2*n的边就可以了 #include<bits/stdc++.h> using namespace std; #define ll long long #define pf printf #define pi acos(-1) #define pb push_back const int mod=1e9+7; const int N=1e6+10; int n,m,st,en,x; struct no原创 2020-07-31 14:01:37 · 301 阅读 · 0 评论