oj.uz

Submission #933485

# Submission time Handle Problem Language Result Execution time Memory
933485 2024-02-25T18:07:37 Z yeediot Inspections (NOI23_inspections) C++14
100 / 100
 378 ms 32296 KB 
#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

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.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 600 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 1 ms 348 KB Output is correct

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 600 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 46 ms 6844 KB Output is correct
14 Correct 47 ms 6852 KB Output is correct
15 Correct 49 ms 6908 KB Output is correct
16 Correct 44 ms 7996 KB Output is correct
17 Correct 45 ms 6916 KB Output is correct
18 Correct 42 ms 6700 KB Output is correct
19 Correct 49 ms 7716 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 46 ms 7660 KB Output is correct
4 Correct 48 ms 7064 KB Output is correct
5 Correct 149 ms 19468 KB Output is correct
6 Correct 140 ms 18588 KB Output is correct
7 Correct 130 ms 12852 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct

Subtask #4
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 600 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 46 ms 6844 KB Output is correct
14 Correct 47 ms 6852 KB Output is correct
15 Correct 49 ms 6908 KB Output is correct
16 Correct 44 ms 7996 KB Output is correct
17 Correct 45 ms 6916 KB Output is correct
18 Correct 42 ms 6700 KB Output is correct
19 Correct 49 ms 7716 KB Output is correct
20 Correct 46 ms 8208 KB Output is correct
21 Correct 44 ms 7348 KB Output is correct
22 Correct 50 ms 7936 KB Output is correct
23 Correct 51 ms 7004 KB Output is correct
24 Correct 49 ms 7228 KB Output is correct
25 Correct 49 ms 7848 KB Output is correct
26 Correct 49 ms 8012 KB Output is correct

Subtask #5
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 1 ms 600 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 46 ms 6844 KB Output is correct
14 Correct 47 ms 6852 KB Output is correct
15 Correct 49 ms 6908 KB Output is correct
16 Correct 44 ms 7996 KB Output is correct
17 Correct 45 ms 6916 KB Output is correct
18 Correct 42 ms 6700 KB Output is correct
19 Correct 49 ms 7716 KB Output is correct
20 Correct 1 ms 344 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 46 ms 7660 KB Output is correct
23 Correct 48 ms 7064 KB Output is correct
24 Correct 149 ms 19468 KB Output is correct
25 Correct 140 ms 18588 KB Output is correct
26 Correct 130 ms 12852 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 46 ms 8208 KB Output is correct
30 Correct 44 ms 7348 KB Output is correct
31 Correct 50 ms 7936 KB Output is correct
32 Correct 51 ms 7004 KB Output is correct
33 Correct 49 ms 7228 KB Output is correct
34 Correct 49 ms 7848 KB Output is correct
35 Correct 49 ms 8012 KB Output is correct
36 Correct 238 ms 22068 KB Output is correct
37 Correct 229 ms 21920 KB Output is correct
38 Correct 210 ms 22052 KB Output is correct
39 Correct 157 ms 18356 KB Output is correct
40 Correct 242 ms 21584 KB Output is correct
41 Correct 291 ms 25296 KB Output is correct
42 Correct 337 ms 27160 KB Output is correct
43 Correct 330 ms 32296 KB Output is correct
44 Correct 378 ms 29940 KB Output is correct
45 Correct 285 ms 21532 KB Output is correct
46 Correct 306 ms 21968 KB Output is correct
47 Correct 298 ms 20628 KB Output is correct
48 Correct 216 ms 22744 KB Output is correct