Submission #1291022

#	Time	Username	Problem	Language	Result	Execution time	Memory
1291022		maxphast	Two Antennas (JOI19_antennas)	C++20	2 / 100	3090 ms	4428 KiB

antennas

/*
* @Author: MaxPhast
* @File:   test.cpp
* @Date:   2025-11-15 02:53:07
*/
#include <bits/stdc++.h>
using namespace std;

#define int long long
#define ii pair <int , int>
#define iii pair <int , ii>
#define iiii pair <ii , ii>
#define FOR(i , l , r) for(int i = (l) , _r = (r) ; i <= _r ; ++ i)
#define FORD(i , r , l) for(int i = (r) , _l = (l) ; i >= _l ; -- i)
#define ALL(vec) vec.begin() , vec.end()
#define UNI(vec) sort(ALL(vec)) , vec.erase(unique(ALL(vec)) , vec.end())
#define pb push_back
#define MASK(i) (1ll << i)
#define BIT(mask , i) ((mask >> i) & 1ll)
#define ON(mask , i) (mask | MASK(i))
#define OFF(mask , i) (mask & (~MASK(i)))
#define TURN(mask , i) (mask ^ MASK(i))
#define BP(mask) __builtin_popcountll(mask)
#define sqr(x) (1ll * (x) * (x))
#define fi first
#define se second
#define oo 1e18
#define time() cerr << " \n " << "Time : " << 1000.0 * clock() / CLOCKS_PER_SEC << "ms."
#define IO(TASK) if(fopen(#TASK".INP" , "r")){freopen(#TASK".INP" , "r" , stdin); freopen(#TASK".OUT" , "w" , stdout);}

template <class X , class Y>
    bool maxz(X &a , const Y b)
    {
        if(a < b)
        {
            a = b;
            return true;
        }
        return false;
    }
template <class X , class Y>
    bool minz(X &a , const Y b)
    {
        if(a > b)
        {
            a = b;
            return true;
        }
        return false;
    }

namespace MaxPhast
{

    const int N = 2e5 + 5;

    int n , q;
    int h[N] , a[N] , b[N];

    void solve()
    {
        cin >> n;

        FOR(i , 1 , n)
            cin >> h[i] >> a[i] >> b[i];

        cin >> q;

        while(q--)
        {
            int l , r; cin >> l >> r;
            int res = -1;
            FOR(i , l , r)
            {
                FOR(j , i + 1 , r)
                {
                    if(j >= i + a[i] && j <= i + b[i])
                    {
                        if(i >= j - b[j] && i <= j - a[j])
                        {
                            maxz(res , abs(h[i] - h[j]));
                        }
                    }
                }
            }
            cout << res << "\n";
        }
    }

}

signed main()
{
    ios_base :: sync_with_stdio(false) ; cin.tie(nullptr) ; cout.tie(nullptr) ;
    IO(test);
    MaxPhast :: solve();
    time();
}
/*

*/

Compilation message (stderr)

antennas.cpp: In function 'int main()':
antennas.cpp:29:54: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   29 | #define IO(TASK) if(fopen(#TASK".INP" , "r")){freopen(#TASK".INP" , "r" , stdin); freopen(#TASK".OUT" , "w" , stdout);}
      |                                               ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
antennas.cpp:95:5: note: in expansion of macro 'IO'
   95 |     IO(test);
      |     ^~
antennas.cpp:29:90: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   29 | #define IO(TASK) if(fopen(#TASK".INP" , "r")){freopen(#TASK".INP" , "r" , stdin); freopen(#TASK".OUT" , "w" , stdout);}
      |                                                                                   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
antennas.cpp:95:5: note: in expansion of macro 'IO'
   95 |     IO(test);
      |     ^~

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