2020.04.18【NOIP普及组】模拟赛C组27

最新推荐文章于 2022-09-09 01:30:27 发布

VL——MOESR

最新推荐文章于 2022-09-09 01:30:27 发布

阅读量170

点赞数

分类专栏：比赛

本文链接：https://blog.csdn.net/liuziha/article/details/105603099

版权

比赛专栏收录该内容

45 篇文章 1 订阅

订阅专栏

链接

T1:

简单模拟

var
i,j,k,m,n,a,a1,b,b1,c,c1:longint;
begin
    assign(input,'mixmilk.in');
    assign(output,'mixmilk.out');
    reset(input);
    rewrite(output);
    readln(a,a1);
    readln(b,b1);
    read(c,c1);
    for i:=1 to 33 do
    begin
        k:=b1;
        b1:=(a1+b1);
        if b1>b then
        begin
            b1:=b;
        end;
        a1:=a1-(b-k);
        if a1<0 then a1:=0;
        k:=c1;
        c1:=(b1+c1);
        if c1>c then
        begin
            c1:=c;
        end;
        b1:=b1-(c1-k);
        if b1<0 then b1:=0;
        k:=a1;
        a1:=(c1+a1);
        if a1>a then
        begin
            a1:=a;
        end;
        c1:=c1-(a1-k);
        if c1<0 then c1:=0;
    end;
    k:=b1;
    b1:=(a1+b1);
    if b1>b then
    begin
        b1:=b;
    end;
    a1:=a1-(b-k);
    if a1<0 then a1:=0;
    writeln(a1);
    writeln(b1);
    write(c1);
    close(input);
    close(output);
end.

I’m sorry

T2:

简单差分（前缀和爆力也行）

var
i,j,k,m,n,x,y,b:longint;
a:array[-1..2000]of longint;
begin
    assign(input,'blist.in');
    assign(output,'blist.out');
    reset(input);
    rewrite(output);
    read(n);
    for i:=1 to n do
    begin
        read(x,y,b);
        a[x]:=a[x]+b;
        a[y+1]:=a[y+1]-b;
    end;
    for i:=0 to 2000 do
    a[i]:=a[i]+a[i-1];
    for i:=0 to 2000 do
    if(a[i]>m)then m:=a[i];
    write(m);
    close(input);
    close(output);
end.

I’m so sorry

T3:

暴力DFS，代码看的懂

#include<iostream>
#include<cstdio>
using namespace std;
int n,m,k,x,y;
int a[100],f[100],ans[100];
void dfs(int x,int y){
	if(x>=6){
		for(int i=1;i<=m;i++){
			if(y==ans[i])return;
		}
		ans[++m]=y;
		return;
	}
	for(int i=1;i<=20;i++){
		if(x%2==0&&f[i]==1){
			f[i]=2;
			dfs(x+1,y-a[i]);
			f[i]=1;
		}
		if(x%2==1&&f[i]==2){
			f[i]=1;
			dfs(x+1,y+a[i]);
			f[i]=2;
		}
	}
}
int main(){
	freopen("backforth.in","r",stdin);
	freopen("backforth.out","w",stdout);
	for(int i=1;i<=20;i++){
		cin>>a[i];
		if(i<=10)f[i]=1;
		else f[i]=2;
	}
	dfs(2,1000);
	cout<<m;
	return 0;
}