NOIp 1109

停课后的第一场模拟赛，应该不会怎么说今天的模拟赛，除了第一题不知道那种筛法的复杂度是$log$的没敢写，其他都挺水的。另外，第三题的数据也弱化了，建议去这里再交一遍。

贴一下AC代码，有兴趣可以参考一下。

T1:

//NOIP prime
//by Cydiater
//2016.11.9
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <queue>
#include <map>
#include <ctime>
#include <cmath>
#include <cstdlib>
#include <iomanip>
#include <bitset>
#include <set>
#include <string>
using namespace std;
#define ll long long
#define up(i,j,n)		for(ll i=j;i<=n;i++)
#define down(i,j,n)		for(ll i=j;i>=n;i--)
#define cmax(a,b)		a=max(a,b)
#define cmin(a,b)		a=min(a,b)
#define FILE "prime"
const int LIM=50000;
const int MAXN=1000005;
const int oo=2147483647;
inline int read(){
	char ch=getchar();int x=0,f=1;
	while(ch>'9'||ch<'0'){if(ch=='-')f=-1;ch=getchar();}
	while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
	return x*f;
}
int X,Y,prime[MAXN],cnt=0,ans=0;
bool vis[1000005];
namespace solution{
	void init(){
		X=read();Y=read();
		up(i,2,LIM){
			if(!vis[i])prime[++cnt]=i;
			up(j,1,cnt){
				if(i*prime[j]>LIM)break;
				vis[i*prime[j]]=1;
				if(i%prime[j]!=0)break;
			}
		}
	}
	void slove(){
		memset(vis,0,sizeof(vis));
		up(i,1,cnt)up(j,X/prime[i],oo){
			if(j*prime[i]>Y)break;
			if(j*prime[i]<X)continue;
			if(j>1){
				if(!vis[j*prime[i]-X])ans++;
				vis[j*prime[i]-X]=1;
			}
		}
		//up(i,X,Y)if(!vis[i-X])printf("%d\n",i);
		if(X==1)ans++;
		cout<<Y-X+1-ans<<endl;
	}
}
int main(){
	freopen(FILE".in","r",stdin);
	freopen(FILE".out","w",stdout);
	using namespace solution;
	init();
	slove();
	return 0;
}

T2:

//sky
//by Cydiater
//2016.11.9
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <ctime>
#include <cstring>
#include <string>
#include <algorithm>
#include <queue>
#include <map>
#include <iomanip>
#include <bitset>
#include <set>
using namespace std;
#define ll long long
#define up(i,j,n)		for(ll i=j;i<=n;i++)
#define down(i,j,n)		for(ll i=j;i>=n;i--)
#define cmax(a,b)		a=max(a,b)
#define cmin(a,b)		a=min(a,b)
#define FILE "sky"
const ll MAXN=1005;
const ll oo=1LL<<55;
inline ll read(){
	char ch=getchar();ll x=0,f=1;
	while(ch>'9'||ch<'0'){if(ch=='-')f=-1;ch=getchar();}
	while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
	return x*f;
}
ll N,M,g[MAXN][MAXN],a[MAXN],sum1,sum2,ans=0,siz1,siz2;
priority_queue<ll>q1;
priority_queue<ll,vector<ll>,greater<ll> >q2;
namespace solution{
	void init(){
		N=read();M=read();
		up(i,1,N)a[i]=read();
	}
	void slove(){
		up(i,1,N){
			while(!q1.empty())q1.pop();
			while(!q2.empty())q2.pop();
			siz1=siz2=0;
			sum1=sum2=0;
			up(j,i,N){
				siz1=q1.size();siz2=q2.size();
				if(siz1>0&&a[j]<=q1.top()){q1.push(a[j]);siz1++;sum1+=a[j];}
				else {q2.push(a[j]);siz2++;sum2+=a[j];}
				while(siz2-siz1>=2){
					ll tmp=q2.top();sum2-=tmp;sum1+=tmp;siz1++;siz2--;
					q2.pop();q1.push(tmp);
				}
				while(siz1-siz2>=2){
					ll tmp=q1.top();sum2+=tmp;sum1-=tmp;siz1--;siz2++;
					q1.pop();q2.push(tmp);
				}
				ll mid=siz1>=siz2?q1.top():q2.top();
				g[i][j]=mid*siz1-sum1+sum2-mid*siz2;
			}
		}
		while(M--){
			ll x=read(),y=read();
			ans+=g[x][y];
		}
		cout<<ans<<endl;
	}
}
int main(){
	freopen(FILE".in","r",stdin);
	freopen(FILE".out","w",stdout);
	using namespace solution;
	init();
	slove();
	return 0;
}

T3:

//tree
//by Cydiater
//2016.11.9
#include <iostream>
#include <iomanip>
#include <queue>
#include <map>
#include <ctime>
#include <cmath>
#include <cstring>
#include <string>
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <bitset>
#include <set>
using namespace std;
#define ll long long
#define up(i,j,n)		for(int i=j;i<=n;i++)
#define down(i,j,n)		for(int i=j;i>=n;i--)
#define cmax(a,b)		a=max(a,b)
#define cmin(a,b)		a=min(a,b)
#define Auto(i,node)	for(int i=LINK[node];i;i=e[i].next)
#define FILE "tree"
const int MAXN=2e5+5;
const int oo=0x3f3f3f3f;
inline int read(){
	char ch=getchar();int x=0,f=1;
	while(ch>'9'||ch<'0'){if(ch=='-')f=-1;ch=getchar();}
	while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
	return x*f;
}
int N,M,LINK[MAXN],len=0,dfn[MAXN],low[MAXN],dfs_clock=0,cnt=0;
struct edge{
	int y,next;
}e[MAXN];
bool iscut[MAXN];
namespace solution{
	inline void insert(int x,int y){e[++len].next=LINK[x];LINK[x]=len;e[len].y=y;}
	inline void Insert(int x,int y){insert(x,y);insert(y,x);}
	void init(){
		N=read();M=read();
		up(i,1,M){
			int x=read(),y=read();
			Insert(x,y);
		}
	}
	void tarjan(int node,int father){
		dfn[node]=low[node]=++dfs_clock;int child=0;
		if(father!=0)child++;int outdu=0;
		Auto(i,node)if(e[i].y!=father){
			child++;
			if(!dfn[e[i].y]){
				outdu++;
				tarjan(e[i].y,node);
				cmin(low[node],low[e[i].y]);
				if(low[e[i].y]>=dfn[node])iscut[node]=1;
			}else cmin(low[node],dfn[e[i].y]);
		}
		if(M-child!=N-2)iscut[node]=1;
		if(node==1&&outdu==1&&M-child==N-2)iscut[node]=0;
	}
	void slove(){
		up(i,1,N)if(!dfn[i])tarjan(i,0);
		up(i,1,N)if(!iscut[i])cnt++;
	}
	void output(){
		cout<<cnt<<endl;
		up(i,1,N)if(!iscut[i])printf("%d ",i);
	}
}
int main(){
	//freopen(FILE".in","r",stdin);
	//freopen(FILE".out","w",stdout);
	using namespace solution;
	init();
	slove();
	output();
	return 0;
}

距离NOIp2016还有11天。这几天什么事都可以干，也什么事都干不了，到现在还没有清晰的计划这几天要做些什么（似乎颓废才是坠吼的）。NOIp要考的东西也学的差不多了，这几天可能就是刷刷水题，练练模板然后愉快的去迈出OI生涯的最后几步吧。