제출 #1170475

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1170475		Zbyszek99	Two Antennas (JOI19_antennas)	C++20	2 / 100	3094 ms	1160 KiB

antennas

#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define ff first
#define ss second
#define vi vector<int>
#define vl vector<long long>
#define pii pair<int,int>
#define pll pair<long long, long long>
#define pb push_back
#define rep(i, b) for(int i = 0; i < (b); ++i)
#define rep2(i,a,b) for(int i = a; i <= (b); ++i)
#define rep3(i,a,b,c) for(int i = a; i <= (b); i+=c)
#define count_bits(x) __builtin_popcountll((x))
#define all(x) (x).begin(),(x).end()
#define size(x) (int)(x).size()
#define forall(it,x) for(auto& it:(x))
using namespace std;
//mt19937 mt;void random(){mt.seed(chrono::time_point_cast<chrono::milliseconds>(chrono::high_resolution_clock::now()).time_since_epoch().count());}
//ll rand(ll a, ll b) {return a + (mt() % (b-a+1));}
const int INF = 1e9+50;
const ll INF_L = 1e18+40;
const ll MOD = 1e9+7;

int h[20000];
int a[20000];
int b[20000];

void solve()
{
    int n;
    cin >> n;
    rep(i,n) cin >> h[i] >> a[i] >> b[i];
    int q;
    cin >> q;
    rep(qq,q)
    {
        int l,r;
        cin >> l >> r;
        l--;
        r--;
        int ans = -1;
        rep2(i,l,r)
        {
            rep2(j,i,r)
            {
                if(j >= i + a[i] && j <= i + b[i] && i <= j - a[j] && i >= j-b[j])
                {
                    ans = max(ans,abs(h[i]-h[j]));
                }
            }
        }
        cout << ans << "\n";
    }
}

int main()
{
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    //random();
    int t = 1;
    //cin >> t;
    while(t--) solve();
}

• Subtask 1: 2 / 2
• Subtask 2: 0 / 11
• Subtask 3: 0 / 22
• Subtask 4: 0 / 65