wu-kan

垫底进队之后第一次集训。Maximum Multiple3的倍数拆1,1,1，4的倍数拆1,1,2，优先拆3的倍数。#include<stdio.h>long long t,n;int main(){ for(scanf("%lld",&

Saving Tang Monk II按气罐数量分层建图跑最短路。#include<bits/stdc++.h>#define POS(i,j,k) ((k)*(n)*(m)+(i)*(m)+(j))using namespace std;typedef int ll;const int INF=1e9;struct Graph{ struct Vertex { ...

Live Love#include<stdio.h>int t,n,m;int main(){ for(scanf("%d",&t); t--;) { scanf("%d%d",&n,&m); if(n==1||!m)printf("%d %d\n",m,m); else for(int i=1,tmp,res; i<=m; ++i..

Magic Mirror#include <cstdio>#include <cstring>int T;char s[20],a[20]="JESSIE",b[20]="jessie";bool o;

GOV Chronicles体验极差的四级阅读理解，大致是在文章里找每个人参加了多少比赛…用一下Ctrl+F。漏了最后面还有两个人各参加了一场比赛还wa了一发。有几个人的信息比较含糊所幸样例里还给了答案。#include<stdio.h>int n,a[14]= {5,21,12,2,1,4,6,1,4,4,1,0,1,1};int main(){ scanf(&amp

Help in the RNOS#include<bits/stdc++.h>using namespace std;typedef long long ll;ll cal(char s[],int n){ char t[63]; fill(t,t+n,'0'); t[n-1]='1'; ll ans=0; for(int i=n-1; ~i; --i) if(...

Brainwashing Device#include<bits/stdc++.h>using namespace std;const int N=511,INF=1e9;int n,K,f[N][N],a[N][N],c[N][N],s[N][N],g[N][N];int main(){ scanf("%d%d",&n,&K); for(int i

Business Center#include <cstdlib>#include <algorithm>using namespace std;int n,m;int main(){ while (~scanf("%d%d",&amp

Tyvj 1728 普通平衡树#include<bits/stdc++.h>using namespace std;typedef int ll;struct FhqTreap{ struct Node { int ch[2],siz; ll key,val; }; vector&a

Kingdoms破产是收支不平衡时才有概率发生，并且一个国家破产之后有概率导致破产#include<bits/stdc++.h>using namespace std;int t,n,a[31][31],cnt[1<<20],ans;void dfs(int s){ if(cnt[s])return; for(int i=0; i&l

The House of Doctor Dee#include<bits/stdc++.h>#define X first#define Y secondusing namespace std;typedef long long ll;typedef pair<ll,ll> Coord;pair<Coord,Coord> v[2];int mai

Concerts辣鸡数据范围。滚动DP。#include<bits/stdc++.h>using namespace std;const int N=1e7+9,M=1e9+7;char a[N],b[N];int n,k,f[2][N],h[127];int main(){ scanf("%d%d",&k,&n); for(char c='A'; ...

Willem, Chtholly and Seniorious#include<bits/stdc++.h>#define mul(a,b,c) ((a)*(b)%(c))using namespace std;typedef long long ll;typedef pair<int,ll&am

GCD - Extreme (II)求∑i=1n∑j=i+1ngcd⁡(i,j)\sum_{i=1}^n\sum_{j=i+1}^n\gcd(i,j)∑i=1n​∑j=i+1n​gcd(i,j)。解法一：蓝书解法，计算贡献设f(n)=∑i=1n−1gcd⁡(i,n)f(n)=\sum_{i=1}^{n-1}\gcd(i,n)f(n)=∑i=1n−1​gcd(i,n)，则所求答案为f(n)f(...

Maximum Product#include<bits/stdc++.h>using namespace std;typedef long long ll;vector<ll> a,b,ans;ll n;ll product(const vector<ll> &v){ ll ret=1,i=0; while(!v[i])++i; f...

队伍人不齐打这场真心累啊…BE, GE or NE#include <cstdio>#include <cstring>#include <algorithm>using namespace std;const int maxn=1000+10;int

Sequence#include<bits/stdc++.h>#define mul(a,b,c) (1LL*(a)*(b)%(c))using namespace std;typedef int ll;const ll N=3,M=1e9+7;struct Matrix{ static int n; ll a[N][N]; Matrix(ll ...

单调栈可以找到从左/右遍历第一个比当前元素小/大的元素的位置，以及比当前元素小的元素的数量。单调队列可用于求连续区间最值。Sliding Window单调队列模板题，求n个数每k个连续的数的最小最大值；最大值可直接插相反数进去，取出的时候再取回即可。poj上STL特别的慢了，语言要选C++而非G++才能勉强跑过…大致能看个做法即可。用数组模拟STL队列直接快了一倍多…#include&...

Game先手的人可以通过选1,不选1的方式操纵游戏的进程，因此有必胜策略。#include<stdio.h>int main(){ for(int n; ~scanf("%d",&n);)printf("Yes\n");}Swaps and Inversions一个逆序对对答案的贡

Ascending Rating从后向前扫描维护当前位置开始的m个区间的LIS。 全程使用long long减少取模次数，否则会T。#include<stdio.h>#define N 10000009long long t,n,m,k,p,q,r,M,a[N],Q[N];int main(){ for(scanf("%lld",&t); t--;)...

Wedding of Sultan#include<stdio.h>char s[63];int t,k,kase=0,ans[99];void dfs(char u){ for(; s[++k]!=u; dfs(s[k]))++ans[s[k]],++ans[u];}int main(){ for(scanf("%d",&t); t--;)...

Problem B. Harvest of Apples#include<bits/stdc++.h>#define mul(a,b,c) ((a)*(b)%(c))#define inv(a,m) pow(a,m-2,m)#define C(n,m) mul(mul(f.fac[n],f.ifac[m],M),f.ifac[(n)-(m)],M)using namespa...

Character Encoding容斥一下即可。#include<bits/stdc++.h>#define mul(a,b,c) ((a)*(b)%(c))#define inv(a,b) pow(a,(b)-2,b)using namespace std;typedef long long ll;const ll N=1e5+7,M=998244353;ll ...

Decoding Baby Boos另解：使用链表快速合并。#include<bits/stdc++.h>using namespace std;char s[1000009],a[9],b[9];int t,r;int main(){ for(scanf("%d",&t); t--;) { vector<list&l

Beautiful Now以为是贪心但是贪心的策略过不了2311，于是暴搜。#include<bits/stdc++.h>using namespace std;char s[15];int t,k,mi,ma;void dfs(int n,int k,int v){ if(k<0)return; if(!s[n])mi=min(mi,v),ma...

Rikka with Nash Equilibrium#include<stdio.h>#include<string.h>typedef long long ll;ll t,n,m,k,f[2][99][99];int main(){ for(scanf("%lld",&t); t-

Bonus Cards概率dp。#include<bits/stdc++.h>#define cin fin#define cout foutusing namespace std;ifstream fin("bonus.in");ofstream fout("bonus.out");double f[3009][3009]/*= {1}*/;//去掉注释会因为生成...

Automatic Cheater Detection没注意到难度取值范围小于十，于是写了个二分跑过去了，还挺快的。#include<bits/stdc++.h>using namespace std;char r[9];int t,q;int main(){ for(scanf("%d",&t); t--;) {

Problem G. Cyclic递推。#include<stdio.h>#define N 100009#define M 998244353#define mul(a,b,c) ((a)*(b)%(c))typedef long long ll;ll t,n,f[N]= {0,1,0,1,1};int main(){ for(ll i=5; i<...

oval-and-rectangle#include<stdio.h>#include<math.h>int t,a,b;int main(){ for(scanf("%d",&t); t--; printf(&

怒草评测姬Buy and Resell#include<bits/stdc++.h>using namespace std;typedef long long ll;struct Node{ ll val,last; bool operator<(const Node &u)const

An Olympian Math Problem#include<stdio.h>int main(){ long long t,n; for(scanf("%lld",&t); t--; printf("%lld\n",n

Made In HeavenAstar求K短路。#include<cstdio>#include<vector>#include<queue>using namespace std;typedef int ll;const ll INF=1e9;struct Graph{ struct Vertex { ve...

Binary Matrix#include <cstdio>#include <cstdlib>#include <cstring>#include <algorithm>#include <queue>#define N 2010using namesp