Submission #1072238

#	Time	Username	Problem	Language	Result	Execution time	Memory
1072238		vjudge1	Radio Towers (IOI22_towers)	C++17	Compilation error	0 ms	0 KiB

towers

#include <bits/stdc++.h>
// #pragma GCC optimize("Ofast")
// #pragma GCC target("avx2")
// #pragma GCC target("popcnt")
using namespace std;
 
using ll = long long;
using ull = unsigned long long;
using lld = long double;
using vi = vector<int>;
using vll = vector<ll>;
using ii = pair<int,int>;
using pll = pair<ll, ll>;
using vii = vector<ii>;
using vpll = vector<pll>;
 
#define endl '\n'
#define all(x) x.begin(),x.end()
#define lsb(x) x&(-x)
#define gcd(a,b) __gcd(a,b)
#define sz(x) (int)x.size()
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define fls cout.flush()
 
#define fore(i,l,r) for(auto i=l;i<r;i++)
#define fo(i,n) fore(i,0,n)
#define forex(i,r,l) for(auto i=r; i>=l;i--)
#define ffo(i,n) forex(i,n-1,0)

bool cmin(int &a, int b){if(b<a){a=b;return 1;}return 0;}
bool cmax(int &a, int b){if(b>a){a=b;return 1;}return 0;}
void valid(ll in){cout<<((in)?"YES\n":"NO\n");}
ll lcm(ll a, ll b){return (a/gcd(a,b))*b;}
ll gauss(ll n){return (n*(n+1))/2;}
const int LOG = 20;
struct SparseTable{
    vector<vpll> sp;
    ll n;
    SparseTable() {}
    SparseTable(ll n): n(n), sp(n+3, vpll(LOG, mp(0,0))) {}
    pll merge(pll a, pll b){
        return {min(a.fi, b.fi), max(a.se,b.se)};
    }
    void build(){
        fore(b, 1, LOG) {
            fo(i, n-(1<<b)+1) {
                sp[i][b] = merge(sp[i][b-1], sp[i+(1<<(b-1))][b-1]);
            }
        }
    }
};
ll n;
vll h;
SparseTable qs;
void init(int nn, vll hh){
    n = nn;
    h = hh;
    qs = SparseTable(n);
    fo(i, n) qs.sp[i][0] = {h[i], h[i]};
    qs.build();
}
int max_towers(int l,int r,int d){
    vi dp(n+1, 1);
    int ans = 0;
    fore(i, l, r+1){
        ll mx = -1e18;
        fore(j, i+1, r+1){
            if(mx-d >= h[i] && mx-d >= h[j]){
                dp[j] == max(dp[j], dp[i] + 1);
            }
            mx = max(mx, h[j]);
        }
        ans = max(ans, dp[i]);
    }
    return ans;
}
void test_case(){
    ll n;
    cin >> n;
    vll h(n);
    fo(i, n) cin >> h[i];
    init(n, h);
    ll Q;
    cin >> Q;
    while(Q--) {
        ll l, r, d;
        cin >> l >> r >> d;
        cout << max_towers(l, r, d) << '\n';
    }
}

int main(){cin.tie(0)->sync_with_stdio(0);
    int t=1;
    // cin >> t;
    while(t--)test_case();
}

Compilation message (stderr)

towers.cpp: In constructor 'SparseTable::SparseTable(ll)':
towers.cpp:41:8: warning: 'SparseTable::n' will be initialized after [-Wreorder]
   41 |     ll n;
      |        ^
towers.cpp:40:18: warning:   'std::vector<std::vector<std::pair<long long int, long long int> > > SparseTable::sp' [-Wreorder]
   40 |     vector<vpll> sp;
      |                  ^~
towers.cpp:43:5: warning:   when initialized here [-Wreorder]
   43 |     SparseTable(ll n): n(n), sp(n+3, vpll(LOG, mp(0,0))) {}
      |     ^~~~~~~~~~~
towers.cpp: In function 'int max_towers(int, int, int)':
towers.cpp:72:23: warning: value computed is not used [-Wunused-value]
   72 |                 dp[j] == max(dp[j], dp[i] + 1);
/usr/bin/ld: /tmp/cc1E1qRf.o: in function `main':
stub.cpp:(.text.startup+0x0): multiple definition of `main'; /tmp/ccDiVVNi.o:towers.cpp:(.text.startup+0x0): first defined here
/usr/bin/ld: /tmp/cc1E1qRf.o: in function `main':
stub.cpp:(.text.startup+0x179): undefined reference to `init(int, std::vector<int, std::allocator<int> >)'
collect2: error: ld returned 1 exit status