Submission #418647

#	Time	Username	Problem	Language	Result	Execution time	Memory
418647		JediMaster11	Meetings (IOI18_meetings)	C++17	Compilation error	0 ms	0 KiB

meetings

#include <bits/stdc++.h>
// #include "meetings.h"

using namespace std;
#define fo(a, b, c) for (int a = b; a < c; a++)
#define ll long long
#define print(x) cout << x << "\n";
#define vint vector<int>
#define vll vector<long long>

ll maxx[10000][10000]; // 750000

ll recur2(int l, int r, vint h)
{

    if (r - l == 1)
    {
        return h[l];
    }

    ll numOnes = 0;
    ll maxOnes = -1;
    bool onOne = false;

    fo(i, l, r)
    {

        if (h[i] == 1)
        {

            if (onOne)
            {
                numOnes++;
            }
            else
            {
                numOnes = 1;
                onOne = true;
            }
        }
        else if (onOne)
        {
            onOne = false;
            maxOnes = max(maxOnes, numOnes);
            numOnes = 0;
        }
    }
    if (onOne)
    {
        onOne = false;
        maxOnes = max(maxOnes, numOnes);
        numOnes = 0;
    }

return maxOnes + 2 * (r-l-maxOnes);


}

ll recur(int l, int r, vint h)
{ // r is non-inclsuive

    if (r - l == 1)
    {
        return h[l];
    }
    else if (r == l)
    {
        return 0;
    }

    if (maxx[l][r - 1] != 0)
    {

        return maxx[l][r - 1];
    }

    ll maxH = -1;

    fo(i, l, r)
    {

        maxH = max(maxH, (ll)h[i]);
    }

    vector<pair<pair<int, int>, ll>> aves;
    // stores the left and right, and then the sum of the middle

    int leftH = l;
    fo(i, l, r)
    {
        if (h[i] == maxH)
        {
            if (i == l || h[i] != h[i - 1])
            {

                ll tmp = recur(leftH, i, h);
                aves.push_back({{leftH, i}, tmp});
            }
            leftH = i + 1;
        }
    }

    if (leftH != r)
    {
        ll tmp = recur(leftH, r, h);
        aves.push_back({{leftH, r}, tmp});
    }

    // int index=-1;
    ll smallest = 0ll + maxH * (r - l) + 1;

    fo(i, 0, aves.size())
    {
        ll maxtmp = 0ll + aves[i].second + maxH * ((r - aves[i].first.second) + (aves[i].first.first - l));

        if (maxtmp < smallest)
        {
            smallest = maxtmp;
        }
    }

    maxx[l][r - 1] = smallest;
    return smallest;
}

// h - heights
// l, r - left and right bounds of each meeting

vll minCosts;
vll minimum_costs(vint h, vint l, vint r)
{

    int numMeetings = l.size();

    minCosts.reserve(numMeetings);

    // fo(i, 0, h.size())
    // {
    //     maxx[i].assign(h.size(), -1);
    // }

    int maxx = 0;

    fo(i, 0, h.size())
    {
        maxx = max(maxx, h[i]);
    }

    if (maxx == 2)
    {

        fo(i, 0, (int)numMeetings)
        {

            minCosts.push_back(recur2(l[i], r[i] + 1, h));
        }
    }
    else
    {

        fo(i, 0, (int)numMeetings)
        {

            minCosts.push_back(recur(l[i], r[i] + 1, h));
        }
    }

    return minCosts;
}

int main()
{

    ios::sync_with_stdio(0);
    cin.tie(0);

    // vint h = {2, 5, 1, 6, 8, 1, 4};
    // vint l = {0};
    // vint r = {6};

    int n, q;

    cin >> n >> q;

    vint h;

    int tmpa;
    fo(i, 0, n)
    {
        cin >> tmpa;
        h.push_back(tmpa);
    }

    vint l, r;
    int lH, rH;
    fo(i, 0, q)
    {
        cin >> lH >> rH;
        l.push_back(lH);
        r.push_back(rH);
    }

    // vint h = {877914575};
    // vint l = {0};
    // vint r = {(int)h.size() - 1};

    vll tmp = minimum_costs(h, l, r);

    fo(i, 0, tmp.size())
    {
        print(tmp[i]);
    }
}

Compilation message (stderr)

meetings.cpp: In function 'long long int recur(int, int, std::vector<int>)':
meetings.cpp:5:39: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<std::pair<int, int>, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    5 | #define fo(a, b, c) for (int a = b; a < c; a++)
......
  113 |     fo(i, 0, aves.size())
      |        ~~~~~~~~~~~~~~~~~               
meetings.cpp:113:5: note: in expansion of macro 'fo'
  113 |     fo(i, 0, aves.size())
      |     ^~
meetings.cpp: In function 'std::vector<long long int> minimum_costs(std::vector<int>, std::vector<int>, std::vector<int>)':
meetings.cpp:5:39: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    5 | #define fo(a, b, c) for (int a = b; a < c; a++)
......
  145 |     fo(i, 0, h.size())
      |        ~~~~~~~~~~~~~~                  
meetings.cpp:145:5: note: in expansion of macro 'fo'
  145 |     fo(i, 0, h.size())
      |     ^~
meetings.cpp: In function 'int main()':
meetings.cpp:5:39: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    5 | #define fo(a, b, c) for (int a = b; a < c; a++)
......
  210 |     fo(i, 0, tmp.size())
      |        ~~~~~~~~~~~~~~~~                
meetings.cpp:210:5: note: in expansion of macro 'fo'
  210 |     fo(i, 0, tmp.size())
      |     ^~
/usr/bin/ld: /tmp/ccSGGJYS.o: in function `main':
grader.cpp:(.text.startup+0x0): multiple definition of `main'; /tmp/ccNgnYtU.o:meetings.cpp:(.text.startup+0x0): first defined here
collect2: error: ld returned 1 exit status