Codeforces Round #394 (Div. 2)Dasha and Very Difficult Problem

最新推荐文章于 2022-11-22 23:15:14 发布

Stone_____

最新推荐文章于 2022-11-22 23:15:14 发布

阅读量169

点赞数

本文链接：https://blog.csdn.net/zcy_2016/article/details/54809173

版权

通过 a[i] 和 p[i] 求出一组 b[i]（不一定在 [ l , r ] 区间内），求出这组 b[i] 值的区间（ ll <= b[i] <= rr），根据 l , r 求出 b[i] .

#include <iostream>
#include <stdio.h>
#include <string.h>
#include <algorithm>
#include <queue>
#include <vector>
#include <map>
#include <cmath>
#include <stdlib.h>
using namespace std;
const double PI = acos(-1.0);
const double eps = 1e-8;
const int MAX = 1e5+10;
const long long mod = 1e9+7;
const long long INF = 1e9+7;
long long n, l, r, ll, rr;
long long a[MAX], b[MAX], p[MAX];
int main()
{
    cin>>n>>l>>r;
    for(int i = 0; i<n; ++i)
        cin>>a[i];
    for(int i = 0; i<n; ++i)
        cin>>p[i];
    ll = INF;
    rr = -INF;
    for(int i = 0; i<n; ++i)
    {
        b[i] = a[i]+p[i];
        if(b[i]<ll)ll = b[i];
        if(b[i]>rr)rr = b[i];
    }
    if(rr-ll+1<=r-l+1)
    {
      //  cout<<ll<<rr<<endl;
        if(ll<l)
        {
            for(int i = 0; i<n; ++i)
                b[i] = b[i]-ll+l;
        }
        else if(rr>r)
        {
            for(int i = 0; i<n; ++i)
                b[i] = b[i]-rr+r;
        }
        for(int i = 0; i<n; ++i)
            cout<<b[i]<<((i==n-1)?'\n':' ');
    }
    else cout<<-1<<endl;
    return 0;
}