NOIP2018热身赛 第一场

题比较没有营养，本来不想发的，就当督促自己赛后补题好了。

array

考场上看错数据范围了，实际上用 map 就能过，结果写了个 bitset 乱搞。

#include <cstdio>
#include <map>
typedef long long int ll;
std::map<ll,ll> m0;
int main() {
	int n,m;scanf("%d%d",&n,&m);
	ll p=1,q=0,sum=(1LL+n)*n/2;
	for(int i=0;i<m;++i) {
		char s[2];ll x,y;scanf("%s%lld%lld",s,&x,&y);
		if(s[0]=='A') {
			p=x;q=y;sum=x*(1LL+n)*n/2+n*q;
			m0.clear();
		}
		else if(s[0]=='B') {
			std::map<ll,ll>::iterator it=m0.find(x);
			if(it!=m0.end()) {sum-=it->second;m0[x]=y;sum+=y;}
			else {sum-=p*x+q;m0[x]=y;sum+=y;}
		}
		printf("%lld\n",sum);
	}
	return 0;
}

computer

发现其实是裸的最短路。

#include <cstdio>
#include <queue>
#include <vector>
#include <utility>
#include <functional>
typedef std::pair<int,int> P;
const int maxn=100005;
const int maxm=300005;
struct edge {int u,v,w;} edges[maxm<<1];
int head[maxn],nxt[maxm<<1],idx=0;
inline void add(int u,int v,int w) {
	edges[++idx]=(edge){u,v,w};
	nxt[idx]=head[u];head[u]=idx;
}
int d[maxn];
int main() {
	int n,m;scanf("%d%d",&n,&m);
	for(register int i=1;i<=m;++i) {
		int u,v;scanf("%d%d",&u,&v);
		add(u,v,i);add(v,u,i);
	}
	std::priority_queue<P,std::vector<P>,std::greater<P> > pq;
	d[1]=0;for(int i=2;i<=n;++i) d[i]=(int)1e9;pq.push(P(0,1));
	while(pq.size()) {
		P x=pq.top();pq.pop();int u=x.second;
		if(d[u]<x.first) continue;
		for(int i=head[u];i;i=nxt[i]) {
			edge &e=edges[i];
			if(std::max(d[u],e.w)<d[e.v]) {
				d[e.v]=std::max(d[u],e.w);
				pq.push(P(d[e.v],e.v));
			}
		}
	}
	for(int i=1;i<=n;++i) printf("%d\n",d[i]);
	return 0;
}

eval

考场上懒得判太大的情况少了10分。

#include <cstdio>
#include <cstring>
typedef long long int ll;
const int mod=1000000000;
struct Int {
	int s;bool up;
	Int() {s=up=0;}
	Int(int s,bool up):s(s),up(up) {}
	Int operator += (const Int &rhs) {
		s+=rhs.s;up|=rhs.up;
		if(s>=mod) {s-=mod;up=true;}
		return *this;
	}
} val[26];
char s[105];int n;bool up[26];
inline Int get(char c) {
	if('0'<=c&&c<='9') return Int(c-'0',0);
	return val[c-'A'];
}
void search(int i) {
	if(i>=n) return;
	if(s[i+1-1]=='f'&&s[i+2-1]=='o'&&s[i+3-1]=='r') {
		int id=s[i+5-1]-'A';Int a=get(s[i+7-1]),b=get(s[i+9-1]);
		val[id]=a;
		while(true) {
			search(i+10);
			if(val[id].s==b.s) break;
			val[id]+=Int(1,0);
		}
	}
	else if(s[i+2-1]=='=') {
		int id=s[i+1-1]-'A';Int v=get(s[i+3-1]);
		val[id]=v;
		search(i+3);
	}
	else if(s[i+2-1]=='+'&&s[i+3-1]=='=') {
		int id=s[i+1-1]-'A';Int v=get(s[i+4-1]);
		val[id]+=v;
		search(i+4);
	}
}
int main() {
	while(scanf("%s",s)==1) {
		n=strlen(s);
		search(0);
	}
	for(register int i=0;i<26;++i) {
		if(val[i].up) printf("%c=...%09d\n",i+'A',val[i].s);
		else if(val[i].s) printf("%c=%d\n",i+'A',val[i].s);
	}
	return 0;
}