Submission #963575

#	Time	Username	Problem	Language	Result	Execution time	Memory
963575		Trisanu_Das	Garden (JOI23_garden)	C++17	Compilation error	0 ms	0 KiB

garden

#include <bits/stdc++.h> 
using namespace std;
 
#define REP(i, s, e) for (int i = (s); i < (e); i++)
#define RREP(i, s, e) for (int i = (s); i >= (e); i--)
template <class T>
inline bool mnto(T& a, T b) {return a > b ? a = b, 1 : 0;}
template <class T>
inline bool mxto(T& a, T b) {return a < b ? a = b, 1: 0;}
 
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
#define FI first
#define SE second
typedef pair<int, int> ii;
typedef pair<ll, ll> pll;
typedef tuple<int, int, int> iii;
#define ALL(_a) _a.begin(), _a.end()
#define SZ(_a) (int) _a.size()
#define pb push_back
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<ii> vii;
typedef vector<iii> viii;
 
#ifndef DEBUG
#define cerr if (0) cerr
#endif
 
const int INF = 1000000005;
const ll LINF = 1000000000000000005ll;
const int MAXN = 500005;
const int MAXD = 5005;
 
int n, m, d;
int p[MAXN * 2], q[MAXN * 2];
ii rs[MAXN * 2];
int occ[MAXD * 2];
set<int> st;
multiset<int> gap;
int ans;
 
int calcgap(int r, int l) {
    if (r > l) return r - l;
    return r - l + d;
}
void insert(int v) {
    if (occ[v]++ > 0) return;
    auto ptr = st.insert(v).FI;
    if (SZ(st) == 1) {
        gap.insert(0);
        return;
    }
    auto prv = prev(st.end());
    if (ptr != st.begin()) prv = prev(ptr);
    auto nxt = next(ptr);
    if (nxt == st.end()) nxt = st.begin();
    if (prv == nxt) gap.erase(gap.find(0));
    else gap.erase(gap.find(calcgap(*prv, *nxt)));
    gap.insert(calcgap(*prv, *ptr));
    gap.insert(calcgap(*ptr, *nxt));
}
void remove(int v) {
    if (--occ[v] > 0) return;
    auto ptr = st.find(v);
    auto prv = prev(st.end());
    if (ptr != st.begin()) prv = prev(ptr);
    auto nxt = next(ptr);
    if (nxt == st.end()) nxt = st.begin();
    gap.erase(gap.find(calcgap(*prv, *ptr)));
    gap.erase(gap.find(calcgap(*ptr, *nxt)));
    if (prv == nxt) gap.insert(0);
    else gap.insert(calcgap(*prv, *nxt));
    st.erase(ptr);
}
 
int main() {
    ios::sync_with_stdio(0), cin.tie(0);
    cin >> n >> m >> d;
    REP (i, 0, n) cin >> p[i] >> q[i];
    REP (i, 0, m)  >> rs[i].FI >> rs[i].SE;
    sort(rs, rs + m);
    REP (i, m, 2 * m) {
        rs[i] = rs[i - m];
        rs[i].FI += d;
    }
    sort(p, p + n);
    REP (i, n, 2 * n) [i] = p[i - n] + d;
    REP (i, 0, n) insert(q[i]);
    int rptr = 0, pptr = 0;
    ans = INF;
    REP (i, 0, d) {
        while (rs[rptr].FI < i) rptr++;
        while (p[pptr] < i) pptr++;
        int ptr = rptr + m - 1;
        RREP (j, i + d - 1, max(i, p[pptr + n - 1])) {
            while (ptr >= rptr && rs[ptr].FI > j) insert(rs[ptr--].SE);
            mnto(ans, (j - i + 1) * (*gap.begin() + 1));
        }
        while (ptr < rptr + m - 1) remove(rs[++ptr].SE);
    }
    cout << ans << '\n';
    return 0;
}

Compilation message (stderr)

garden.cpp: In function 'int main()':
garden.cpp:82:20: error: expected primary-expression before '>>' token
   82 |     REP (i, 0, m)  >> rs[i].FI >> rs[i].SE;
      |                    ^~
garden.cpp: In lambda function:
garden.cpp:89:27: error: expected '{' before '=' token
   89 |     REP (i, n, 2 * n) [i] = p[i - n] + d;
      |                           ^
garden.cpp: In function 'int main()':
garden.cpp:89:40: error: no match for 'operator=' (operand types are 'main()::<lambda()>' and 'int')
   89 |     REP (i, n, 2 * n) [i] = p[i - n] + d;
      |                                        ^
garden.cpp:89:25: note: candidate: 'main()::<lambda()>& main()::<lambda()>::operator=(const main()::<lambda()>&)' (deleted)
   89 |     REP (i, n, 2 * n) [i] = p[i - n] + d;
      |                         ^
garden.cpp:89:25: note:   no known conversion for argument 1 from 'int' to 'const main()::<lambda()>&'