Submission #933485

#	Time	Username	Problem	Language	Result	Execution time	Memory
933485		yeediot	Inspections (NOI23_inspections)	C++14	100 / 100	378 ms	32296 KiB

Main

#include<bits/stdc++.h>
using namespace std;
#define int long long
#define F first
#define S second
#define all(x) x.begin(),x.end()
#define pii pair<int,int>
#define pb push_back
#define sz(x) (int)(x.size())
#define chmin(x,y) x=min(x,y)
#define chmax(x,y) x=max(x,y)
#define vi vector<int>
#define vp vector<pii>
#define vvi vector<vi>
#define ykh mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count())
#define __lg(x) 63-__builtin_clzll(x)
#define pow2(x) (1LL<<x)
void __print(int x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}

template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifdef local
void setio(){freopen("/Users/iantsai/Library/Mobile Documents/com~apple~CloudDocs/cpp/Empty.md","r",stdin);}
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
void setio(){}
#define debug(x...)
#endif
void setIO(string s) {
    freopen((s + ".in").c_str(), "r", stdin);
    freopen((s + ".out").c_str(), "w", stdout);
}
struct line{
    int a,b;
    int operator()(const int x)const{
        return a*x+b;
    }
};
bool check(line l1,line l2,line l3){
    return (l3.b-l2.b)*(l1.a-l2.a)<=(l2.b-l1.b)*(l2.a-l3.a);
}
multiset<pair<pii,int>>st;
int cur;
pair<pair<int,int>,int> mp(int a,int b,int c){
    return make_pair(make_pair(a,b),c);
}
auto split(int x){
    auto it=st.lower_bound(mp(x,0,0));
    bool ok=0;
    if(it!=st.begin()){
        it=prev(it);
        ok=1;
    }
    if(it->F.F<x and it->F.S>=x){
        auto p=*it;
        st.erase(it);
        st.insert(mp(p.F.F,x-1,p.S));
        it=st.insert(mp(x,p.F.S,p.S));
    }
    else if(ok){
        it=next(it);
    }
    return it;
}
vector<pii>temp;
signed main(){
    setio();
    ios::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
    int n,m,q;
    cin>>n>>m>>q;
    for(int i=0;i<m;i++){
        int l,r;
        cin>>l>>r;
        if(sz(st)!=0){
            auto it2=split(r+1);
            auto it=split(l);
            while(it!=it2){
                temp.pb({cur-l+1-it->S,it->F.S-it->F.F+1});
                it=st.erase(it);
            }
        }
        st.insert({{l,r},cur-l+1});
        debug(st,temp);
        cur+=r-l+1;
    }
    sort(all(temp),greater<>());
    debug(temp);
    vector<pii>qq;
    for(int i=0;i<q;i++){
        int x;
        cin>>x;
        qq.pb({x,i});
    }
    sort(all(qq),greater<>());
    debug(qq);
    int pos=0;
    cur=0;
    vector<int>ans(q);
    for(int i=0;i<q;i++){
        while(pos<sz(temp) and temp[pos].F>qq[i].F){
            cur+=temp[pos].S;
            pos++;
        }
        ans[qq[i].S]=cur;
    }
    for(int i=0;i<q;i++){
        cout<<ans[i]<<' ';
    }
}
 /*
 input:
 
 */















 

Compilation message (stderr)

Main.cpp: In function 'void setIO(std::string)':
Main.cpp:42:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   42 |     freopen((s + ".in").c_str(), "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:43:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   43 |     freopen((s + ".out").c_str(), "w", stdout);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 11 / 11
• Subtask 2: 18 / 18
• Subtask 3: 22 / 22
• Subtask 4: 26 / 26
• Subtask 5: 23 / 23