Submission #293997

#	Time	Username	Problem	Language	Result	Execution time	Memory
293997		crossing0ver	Interval Collection (CCO20_day2problem2)	C++17	25 / 25	3279 ms	386628 KiB

Main

#include<bits/stdc++.h>
#pragma GCC optimize ("O3")
#pragma GCC optimize ("unroll-loops")
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#define ll long long
#define vi vector<int>
#define pii pair<int,int>
#define all(x) x.begin(),x.end()
#define fi first
#define se second
#define pb push_back
using namespace std;
const int N = 1e6+6,inf = 1e8;
int F[N],ANS[N];
vector<pii> Q[N*4];
int l1,r1,QL,QR;
void qer(int v,int tl,int tr) {
    if (l1 > tr || r1 < tl) return;
    if (l1 <= tl && r1  >= tr) {
        Q[v].pb({QL,QR});
        return;
    }
    int tm = (tl + tr)/2;
    qer(v*2,tl,tm);
    qer(v*2+1,tm+1,tr);
}
int cans=INT_MAX;
int t[2][4*N],timer;
int *H[100000000];
int val[100000000];
void change(int&x,int c) {
    H[++timer] = &x;
    val[timer] = x;
    x = c;
}
void rollback() {
    (*H[timer--]) = val[timer];
}
bool type;
int VAL,pos,L,R;
int BIT[2][N];
const int REV = 1e6+1;
void add1(int pos,int val,bool type) {
    if (type) {
    for (;pos <= 1e6; pos += pos&-pos)
        if (BIT[1][pos] < val)
            change(BIT[1][pos],val);
    }
    else {
        for (;pos <= 1e6; pos += pos&-pos)
        if (BIT[0][pos] > val)
            change(BIT[0][pos],val);
    }
}
int get1(int pos,bool type) {
    if (type == 0) {
        int s = inf;
    for (;pos;pos -= pos&-pos)
        s = min(s,BIT[0][pos]);
        return s;
    }else {
            int s = -inf;
    for (;pos;pos -= pos&-pos)
        s = max(s,BIT[1][pos]);
        return s;
    }
}
int L1=-inf,R1=inf,AR1[N],AL1[N],HANS=inf;

void dfs(int v,int tl,int tr) {
    int in_ans = cans;
    int start_time = timer;
    for (auto& i1 : Q[v]) {
        int l = i1.fi;
        int r = i1.se;
        if (R1 > r)
            change(R1,r);
        if (L1 < l)
            change(L1,l);
        if (AR1[l] > r)
            change(AR1[l],r);
        if (AL1[r] < l)
            change(AL1[r],l);
        {
        int l2 = L1;
        int r2 = R1;
        int len = max(0,r2 - l2);
        if (len) {
        int r3 = AR1[l2];
        int l3 = AL1[r2];
        change(HANS,r3-l3);
        add1(REV-l,r,0); // l-ze patara r-ebshi udidesi l, r-ze did l-ebshi umciresi r
        add1(r,l,1);
        continue;
        }
        }
        if (cans > r - l) {
        cans = min(cans, -l + get1(REV - r,0));
        }
        if (cans > r - l)
        cans = min(cans, r - get1(l,1));
        add1(REV-l,r,0); // l-ze patara r-ebshi udidesi l, r-ze did l-ebshi umciresi r
        add1(r,l,1);
    }
    if (tl != tr) {
        int tm = (tl + tr)/2;
        dfs(v*2,tl,tm);
        dfs(v*2+1,tm+1,tr);
    }else {
                if (cans > 1000000)
                ANS[tl] = HANS;
        else
            ANS[tl] = cans;
    }
    while(start_time != timer)
        rollback();
    cans = in_ans;
}
main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int q;
    cin >> q;
    for (int i =  0; i < N; i++)
        AR1[i] = BIT[0][i] = inf,AL1[i] = BIT[1][i]=-inf;
    for (int i = 0; i < 4*N;i ++)
        t[0][i] = inf, t[1][i] = -inf;
    vector<pair<pii,char> > query(q+1);
    vector<pii> t(q);
    for (int i = 1; i <= q; i++) {
        char c;
        int l,r;
        cin >> c >> l >> r;
        query[i] = {{l,r},c};
        t[i-1] = {l,r};
    }
    sort(all(t));
    t.resize(unique(all(t)) - t.begin());
    map<pii,int> ID;
    for (int i = 0; i < t.size(); i++) {
        ID[t[i]] = i;
    }
    set<int> cnt[1000005];
    for (int i = 1; i <= q; i++) {
            char c=  query[i].se;
    int l = query[i].fi.fi;
    int r = query[i].fi.se;
    int id = ID[{l,r}];
        if (c == 'A')
                cnt[id].insert(i);
                else {
                        l1=*cnt[id].begin();
                        r1 = i-1;
                        QL= l;
                        QR = r;
            qer(1,1,q);
            cnt[id].erase(cnt[id].begin());
        }
            F[i] = 1;
        }
        for (int i= 0; i < t.size(); i++)
            for (int j : cnt[i]) {
                l1 = j;
                r1 = q;
                QL = t[i].fi;
                QR = t[i].se;
                qer(1,1,q);
            }
        dfs(1,1,q);
        for (int i = 1; i <= q; i++)
            cout << ANS[i] <<'\n';
}

Compilation message (stderr)

Main.cpp: In function 'void rollback()':
Main.cpp:38:14: warning: operation on 'timer' may be undefined [-Wsequence-point]
   38 |     (*H[timer--]) = val[timer];
      |         ~~~~~^~
Main.cpp:38:14: warning: operation on 'timer' may be undefined [-Wsequence-point]
Main.cpp: In function 'int get1(int, bool)':
Main.cpp:59:5: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   59 |     for (;pos;pos -= pos&-pos)
      |     ^~~
Main.cpp:61:9: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   61 |         return s;
      |         ^~~~~~
Main.cpp:64:5: warning: this 'for' clause does not guard... [-Wmisleading-indentation]
   64 |     for (;pos;pos -= pos&-pos)
      |     ^~~
Main.cpp:66:9: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'for'
   66 |         return s;
      |         ^~~~~~
Main.cpp: At global scope:
Main.cpp:120:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
  120 | main() {
      |      ^
Main.cpp: In function 'int main()':
Main.cpp:142:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  142 |     for (int i = 0; i < t.size(); i++) {
      |                     ~~^~~~~~~~~~
Main.cpp:163:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  163 |         for (int i= 0; i < t.size(); i++)
      |                        ~~^~~~~~~~~~

• Subtask 1: 3 / 3
• Subtask 2: 8 / 8
• Subtask 3: 7 / 7
• Subtask 4: 4 / 4
• Subtask 5: 3 / 3