ypThe 2021 ICPC Asia Regionals Online Contest (I) 补题

I Neiborhood Search

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int, int>
#define psi pair<string, int>
#define ull unsigned ll
#define ld long double
const int N = 1E5 + 7;
#define INF ~0ULL
vector<int> arr, brr;
int main()
{
    int now;
    while (cin >> now)
    {
        arr.push_back(now);
    }
    int len = arr.size();
    int A = arr[len-2];
    int r = arr[len-1];
    //cout << A << " " << r << " " << endl;

    for (int i = 0; i < len - 2; i++)
    {
        if (abs(A - arr[i]) <= r)
        {
            brr.push_back(arr[i]);
        }
    }
    sort(brr.begin(), brr.end());
    int lenb = brr.size();
    if (lenb == 0)
    {
        cout << endl;
    }
    else
        for (int i = lenb - 1; i >= 0; i--)
        {
            cout << brr[i] << " ";
        }
}

F Land Overseer

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int, int>
#define psi pair<string, int>
#define ull unsigned ll
#define ld long double
const int N = 1E5 + 7;
#define INF ~0ULL

int main()
{
    int t;
    cin >> t;
    int cc;
    cc = 1;
    while (t--)
    {
        double a, b, c;
        cin >> a >> b >> c;
        double ans = 0;
        if (b <= c)
            ans = a * 2 - c;
        else
            ans = 2 * sqrt(a * a + (b - c) * (b - c)) - c;
        printf("Case #%d: %.2f\n",cc,ans);cc++;
    }
}

A Busiest Computing Nodes

#include<bits/stdc++.h>
#define lson rt<<1,l,mid
#define rson rt<<1|1,mid+1,r
using namespace std;
typedef long long ll;
const int maxn=1e5+5;
const int INF=0x3f3f3f3f;
int k,n,h,m=1,mn[maxn<<2],prf[maxn],he[maxn];
void update(int rt,int l,int r,int x,int val){
	if(l==r){
		mn[rt]=val;
		return;
	}
	int mid=(l+r)>>1;
	if(x<=mid)update(lson,x,val);
	else update(rson,x,val);
	mn[rt]=min(mn[rt<<1],mn[rt<<1|1]);
}
int query(int rt,int l,int r,int x,int y){
	if(x<=l&&r<=y)return mn[rt];
	int mid=(l+r)>>1,ans=INF;
	if(x<=mid)ans=min(ans,query(lson,x,y));
	if(y>mid)ans=min(ans,query(rson,x,y));
	return ans;
}
int main(){
	scanf("%d%d",&k,&n);
	for(int i=0,x,y;i<n;i++){
		scanf("%d%d",&x,&y);
		if(i<k){
			update(1,0,k-1,i,x+y);he[i]++;
			continue;
		}
		if(mn[1]>x)continue;
		int d=i%k,l,r,ans;
		int you=query(1,0,k-1,d,k-1);
		if(you<=x)
		    l=d,r=k-1;
		else 
		    l=0,r=d-1; 
		while(l<=r){
			int mid=(l+r)>>1;
			if(query(1,0,k-1,l,mid)<=x)ans=mid,r=mid-1;
			else l=mid+1;
		}
		update(1,0,k-1,ans,x+y),he[ans]++,m=max(m,he[ans]);
	}
	for(int i=0;i<k;i++)
	    if(he[i]==m)prf[++h]=i;
	for(int i=1;i<=h;i++){
		if(i!=1)printf(" ");
		printf("%d",prf[i]);
	}
}

D

#include <bits/stdc++.h>
#define eps 1e-9
#define pb push_back
#define fi first
#define se second
#define endl '\n'
#define io                       \
    ios::sync_with_stdio(false); \
    cin.tie(0);                  \
    cout.tie(0);
using namespace std;
typedef long double llb;
typedef long long ll;
const int maxn = 1e5 + 7;
const int mod = 1e9 + 7;

vector<ll> a1[maxn], a2[maxn];
ll arr[maxn];

void solve(int _t)
{
    memset(a1, 0, sizeof(a1));
    memset(a2, 0, sizeof(a2));
    memset(arr, 0, sizeof(arr));
    ll n, m, l, r, v;
    cin >> n >> m;
    llb ans = 0;
    for (int i = 1; i <= m; i++)
    {
        cin >> l >> r >> v;
        a1[l + 1].pb(v);
        a2[r + 1].pb(v);
        ans += (r - l + 1) * (r - l) / 2 * v;
    }
    ll c = 0;
    priority_queue<int, vector<int>, greater<int>> que1, que2;
    for (int i = 2; i <= n; i++)
    {
        for (int j = 0; j < a1[i].size(); j++)
            que1.push(a1[i][j]);
        for (int j = 0; j < a2[i].size(); j++)
            que2.push(a2[i][j]);
        while (que1.size() > 0 && que2.size() > 0 && que1.top() == que2.top())
        {
            que1.pop();
            que2.pop();
        }
        if (que1.size() > 0)
            c++, arr[i] = que1.top();
    }
    printf("Case #%d: ", _t);
    if (c != n - 1)
    {
        printf("Gotta prepare a lesson\n");
    }
    else
    {
        for (int i = 2; i <= n; i++)
            ans -= arr[i];//减掉每一个的最短路
        printf("%.0Lf\n", ans);
    }
}

int main(){
    io;
    int t;
    cin>>t;
    for(int i=1;i<=t;i++){
        solve();
    }
}