Submission #1352454

#	Time	Username	Problem	Language	Result	Execution time	Memory
1352454		mariza	Equalmex (CEOI25_equalmex)	C++20	Compilation error	0 ms	0 KiB

equalmex

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
const ll INF=1e18;
#define MID ((l+r)/2)

struct node{
    ll val;
    node *L, *R;

    void init(ll l, ll r){
        val=INF;
        if(l!=r){
            L=new node;
            L->init(l,MID);

            R=new node;
            R->init(MID+1,r);
        }
    }

    void reset(ll l, ll r){
        val=INF;
        if(l!=r){
            L->reset(l,MID);
            R->reset(MID+1,r);
        }
    }

    void upd(ll l, ll r, ll i, ll x){
        if(l==i && i==r){
            val=x;
        }
        else if(l<=i && i<=r){
            L->upd(l,MID,i,x);
            R->upd(MID+1,r,i,x);
            val=min(L->val,R->val);
        }
    }

    ll ans(ll l, ll r, ll tl, ll tr){
        if(tl<=l && r<=tr) return val;
        else if(r<tl || tr<l) return INF;
        else return min(L->ans(l,MID,tl,tr),R->ans(MID+1,r,tl,tr));
    }
};

vector<int> solve(vector<int> &v, vector<int> &w, vector<pair<int,int>> &q){
    ll n=v.size();
    ll dist[n][n];
    node seg;
    seg.init(0,n-1);
    
    for(ll e=0; e<n; e++){
        seg.reset(0,e);

        dist[e][e]=0;
        seg.upd(0,e,e,0);

        for(ll i=e-1; i>=0; i--){
            dist[i][e]=min(seg.ans(0,e,i+1,min(e,i+v[i]))+1,seg.ans(0,e,i+1,min(e,i+w[i]))+2);
            seg.upd(0,e,i,dist[i][e]);
        }
    }

    vector<int> ans;
    for(auto i:q){
        ans.push_back(dist[i.first][i.second]);
    }
    return ans;
}

Compilation message (stderr)

/usr/bin/ld: /tmp/ccwwfgeI.o: in function `main':
grader.cpp:(.text.startup+0x2d5): undefined reference to `solve(int, std::vector<int, std::allocator<int> >&, int, std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > >&)'
collect2: error: ld returned 1 exit status