oj.uz

Submission #1109739

# Submission time Handle Problem Language Result Execution time Memory
1109739 2024-11-07T12:57:37 Z Dreamy_lovesper Curtains (NOI23_curtains) C++17
60 / 100
 453 ms 59280 KB 
#include<bits/stdc++.h>

using namespace std;
namespace std {
    // #include<Love>
    using ll=long long;
    using str=string;
    using int128=__int128_t;
    using ld=long double;

    typedef unsigned int ui;
    typedef unsigned long long ull;

    #define Love<3 HerLoveForMeJustaDream
}

#define Lovesper_ ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define pll pair<ll,ll>
#define mll map<ll,ll>
#define vll vector<ll>
#define pb push_back
#define all(c) c.begin(),c.end()
#define fi first
#define se second
#define debug cout<<"I Love You\n";
#define fu(i,a,b) for(ll i=a;i<=b;i++)
#define fd(i,a,b) for(int i=a;i>=b;i--)
#define fa(i,s) for(auto&i:s)
#define Bitc(x,i) (((x)>>(i))&1)
#define _log(_x) 63-__builtin_clzll(_x)
#define LoveTime chrono::steady_clock::now().time_since_epoch().count()

const pll dxy4[]={{-1,0},{0,-1},{0,1},{1,0}};
const pll dxy8[]={{-1,-1},{-1,0},{-1,1},{0,-1},{0,1},{1,-1},{1,0},{1,1}};
constexpr  ll Mod=1e9+7;
constexpr  ll mxn=1e5+7,mxm=3e3+7;
constexpr long long inf=(1ll<<31);
constexpr ll lnf=(1ll<<60);

struct __TS {
    ~__TS() {
        // cerr<<"Time elapsed: "<<clock()*1.0/CLOCKS_PER_SEC<<'\n';
    }
}__ts;

mt19937 rng(LoveTime);

#define setup ((1<<3)-1>>1)
void OpenLove(const str&name){

    // I'm So Lonely. I am Trying To Get Out This Lonely With Her Love

    Lovesper_
    if(fopen((name+".inp").c_str(),"r")){
        // freopen((name+".test").c_str(),"r",stdin);
       freopen((name+".inp").c_str(),"r",stdin);
        freopen((name+".out").c_str(),"w",stdout);
    }
}
template<class X,class Y>bool maximize(X&x,const Y&y){X eps=1e-18;if(x+eps<y){x=y;return 1;}return 0;}
template<class X,class Y>bool minimize(X&x,const Y&y){X eps=1e-18;if(x>y+eps){x=y;return 1;}return 0;}

template <class Fun>class y_combinator_result {
    Fun fun_;
    public:
    template<class T>explicit y_combinator_result(T &&fun): fun_(std::forward<T>(fun)) {}
    template<class ...Args>decltype(auto) operator()(Args &&...args) {return fun_(std::ref(*this), std::forward<Args>(args)...);}
};
template<class Fun>decltype(auto) y_combinator(Fun &&fun) {return y_combinator_result<std::decay_t<Fun>>(std::forward<Fun>(fun));}

ostream&operator<<( std::ostream& dest, __int128_t value){
    ostream::sentry s(dest);__uint128_t tmp=value<0?-value:value;
    char buffer[128];char*d=end(buffer);
    do{d--;*d="0123456789"[tmp%10];tmp/=10;}while(tmp);
    if(value<0)d--,*d='-';ll len=end(buffer)-d;
    if(dest.rdbuf()->sputn(d,len)!=len)dest.setstate(ios_base::badbit);
    return dest;
}

struct custom_hash{
    size_t operator()(uint64_t x)const{
        static const uint64_t HashRand=LoveTime;
        x^=HashRand;return x^(x>>16);
}};

int64_t add(ll&a,ll b){a+=b;if(a>=Mod)a%=Mod;while(a<0)a+=Mod;return a;}
int64_t mul(ll a,ll b,ll mod){a=1ll*a*b%mod;return a;}
int64_t mpow(ll a,ll b,ll mod){ll ans=1;for(;b;b>>=1,a=mul(a,a,mod))if(b&1)ans=mul(ans,a,mod);return ans;}

ll n,m,q,f[4*mxn],lz[4*mxn],g[mxn];
vll graph[mxn];
vector<pll>Qu[mxn];
vll c[mxn];
void Lovesper(const ll&TestCase){
    cin>>n>>m>>q;
    fu(i,1,m){
        ll l,r;cin>>l>>r;
        c[r].pb(l);
    }
    auto PushLazy=[&](ll id){
        auto SoLazy=[&](ll idx,ll val){maximize(f[idx],val);maximize(lz[idx],val);};
        ll x=lz[id];lz[id]=0;
        SoLazy(id<<1,x);
        SoLazy(id<<1|1,x);
    };
    function<void(ll,ll,ll,ll,ll,ll)>update=[&](ll id,ll l,ll r,ll u,ll v,ll val){
        if(r<u||v<l)return;
        if(u<=l&&r<=v){
            maximize(f[id],val);
            maximize(lz[id],val);
            return;
        }
        PushLazy(id);
        ll m=l+(r-l)/2;
        update(id<<1,l,m,u,v,val);
        update(id<<1|1,m+1,r,u,v,val);
        f[id]=min(f[id<<1],f[id<<1|1]);
    };
    function<ll(ll,ll,ll,ll,ll)>get=[&](ll id,ll l,ll r,ll u,ll v){
        if(r<u||v<l)return lnf;
        if(u<=l&&r<=v)return f[id];
        PushLazy(id);
        ll m=l+(r-l)/2;
        return  min(get(id<<1,l,m,u,v),get(id<<1|1,m+1,r,u,v));
    };
    vll ans(q+7,0);
    fu(i,1,q){
        ll l,r;cin>>l>>r;
        Qu[r].pb({l,i});
    }
    fu(r,1,n){
        for(auto&l:c[r])update(1,1,n,l,r,l);
        for(auto&[l,id]:Qu[r])ans[id]=(get(1,1,n,l,r)==l);
    }
    fu(i,1,q)cout<<(ans[i]?"YES":"NO")<<'\n';
}
signed main(int argc, char const *argv[]){
    OpenLove("lovesper");
    int tt=1;
    // cin>>tt;
    for(ll i=1;i<=tt;i++){
        Lovesper(i);
        if(i<tt)cout<<'\n';
    }
    return false;
}

Compilation message

curtains.cpp:14:13: warning: ISO C++11 requires whitespace after the macro name
   14 |     #define Love<3 HerLoveForMeJustaDream
      |             ^~~~
curtains.cpp: In function 'std::ostream& operator<<(std::ostream&, __int128)':
curtains.cpp:75:5: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
   75 |     if(value<0)d--,*d='-';ll len=end(buffer)-d;
      |     ^~
curtains.cpp:75:27: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
   75 |     if(value<0)d--,*d='-';ll len=end(buffer)-d;
      |                           ^~
curtains.cpp: In function 'void OpenLove(const str&)':
curtains.cpp:56:15: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   56 |        freopen((name+".inp").c_str(),"r",stdin);
      |        ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
curtains.cpp:57:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   57 |         freopen((name+".out").c_str(),"w",stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8784 KB Output is correct
2 Correct 2 ms 8784 KB Output is correct
3 Correct 2 ms 8784 KB Output is correct
4 Correct 3 ms 8784 KB Output is correct
5 Correct 2 ms 8848 KB Output is correct
6 Correct 2 ms 8784 KB Output is correct
7 Correct 3 ms 8784 KB Output is correct
8 Correct 2 ms 8784 KB Output is correct
9 Correct 2 ms 8784 KB Output is correct
10 Correct 2 ms 8784 KB Output is correct
11 Correct 3 ms 8784 KB Output is correct
12 Correct 2 ms 8784 KB Output is correct

Subtask #2
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8784 KB Output is correct
2 Correct 2 ms 8784 KB Output is correct
3 Correct 2 ms 8784 KB Output is correct
4 Correct 3 ms 8784 KB Output is correct
5 Correct 2 ms 8848 KB Output is correct
6 Correct 2 ms 8784 KB Output is correct
7 Correct 3 ms 8784 KB Output is correct
8 Correct 2 ms 8784 KB Output is correct
9 Correct 2 ms 8784 KB Output is correct
10 Correct 2 ms 8784 KB Output is correct
11 Correct 3 ms 8784 KB Output is correct
12 Correct 2 ms 8784 KB Output is correct
13 Correct 4 ms 9208 KB Output is correct
14 Correct 4 ms 9040 KB Output is correct
15 Correct 5 ms 9040 KB Output is correct
16 Correct 5 ms 8784 KB Output is correct
17 Correct 4 ms 8868 KB Output is correct
18 Correct 4 ms 9044 KB Output is correct
19 Correct 5 ms 9040 KB Output is correct
20 Correct 4 ms 9040 KB Output is correct
21 Correct 4 ms 9040 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8784 KB Output is correct
2 Correct 2 ms 8784 KB Output is correct
3 Correct 2 ms 8784 KB Output is correct
4 Correct 3 ms 8784 KB Output is correct
5 Correct 2 ms 8848 KB Output is correct
6 Correct 2 ms 8784 KB Output is correct
7 Correct 3 ms 8784 KB Output is correct
8 Correct 2 ms 8784 KB Output is correct
9 Correct 2 ms 8784 KB Output is correct
10 Correct 2 ms 8784 KB Output is correct
11 Correct 3 ms 8784 KB Output is correct
12 Correct 2 ms 8784 KB Output is correct
13 Correct 4 ms 9208 KB Output is correct
14 Correct 4 ms 9040 KB Output is correct
15 Correct 5 ms 9040 KB Output is correct
16 Correct 5 ms 8784 KB Output is correct
17 Correct 4 ms 8868 KB Output is correct
18 Correct 4 ms 9044 KB Output is correct
19 Correct 5 ms 9040 KB Output is correct
20 Correct 4 ms 9040 KB Output is correct
21 Correct 4 ms 9040 KB Output is correct
22 Correct 235 ms 30564 KB Output is correct
23 Correct 221 ms 30984 KB Output is correct
24 Correct 280 ms 33096 KB Output is correct
25 Correct 453 ms 41032 KB Output is correct
26 Correct 205 ms 30768 KB Output is correct
27 Correct 430 ms 40996 KB Output is correct
28 Correct 442 ms 41040 KB Output is correct
29 Correct 190 ms 29256 KB Output is correct
30 Correct 142 ms 30536 KB Output is correct
31 Correct 177 ms 31560 KB Output is correct
32 Correct 405 ms 40496 KB Output is correct
33 Correct 137 ms 30536 KB Output is correct

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 8952 KB Output is correct
2 Correct 2 ms 8784 KB Output is correct
3 Correct 2 ms 8784 KB Output is correct
4 Correct 2 ms 8784 KB Output is correct
5 Correct 4 ms 9040 KB Output is correct
6 Correct 4 ms 9040 KB Output is correct
7 Correct 4 ms 9040 KB Output is correct
8 Correct 145 ms 30460 KB Output is correct
9 Correct 175 ms 31560 KB Output is correct
10 Correct 386 ms 40520 KB Output is correct
11 Correct 151 ms 30536 KB Output is correct
12 Correct 162 ms 20552 KB Output is correct
13 Correct 164 ms 20452 KB Output is correct
14 Correct 126 ms 20552 KB Output is correct
15 Correct 103 ms 20296 KB Output is correct
16 Correct 106 ms 20552 KB Output is correct
17 Correct 105 ms 20336 KB Output is correct
18 Runtime error 143 ms 59280 KB Execution killed with signal 11
19 Halted 0 ms 0 KB -

Subtask #5
36.0 / 36.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8784 KB Output is correct
2 Correct 2 ms 8784 KB Output is correct
3 Correct 2 ms 8784 KB Output is correct
4 Correct 3 ms 8784 KB Output is correct
5 Correct 2 ms 8848 KB Output is correct
6 Correct 2 ms 8784 KB Output is correct
7 Correct 3 ms 8784 KB Output is correct
8 Correct 2 ms 8784 KB Output is correct
9 Correct 2 ms 8784 KB Output is correct
10 Correct 2 ms 8784 KB Output is correct
11 Correct 3 ms 8784 KB Output is correct
12 Correct 2 ms 8784 KB Output is correct
13 Correct 4 ms 9208 KB Output is correct
14 Correct 4 ms 9040 KB Output is correct
15 Correct 5 ms 9040 KB Output is correct
16 Correct 5 ms 8784 KB Output is correct
17 Correct 4 ms 8868 KB Output is correct
18 Correct 4 ms 9044 KB Output is correct
19 Correct 5 ms 9040 KB Output is correct
20 Correct 4 ms 9040 KB Output is correct
21 Correct 4 ms 9040 KB Output is correct
22 Correct 114 ms 16076 KB Output is correct
23 Correct 115 ms 15956 KB Output is correct
24 Correct 155 ms 20304 KB Output is correct
25 Correct 166 ms 20276 KB Output is correct
26 Correct 110 ms 21588 KB Output is correct
27 Correct 113 ms 21524 KB Output is correct
28 Correct 90 ms 19176 KB Output is correct
29 Correct 129 ms 20920 KB Output is correct
30 Correct 176 ms 20232 KB Output is correct
31 Correct 173 ms 20296 KB Output is correct
32 Correct 143 ms 20552 KB Output is correct
33 Correct 124 ms 20808 KB Output is correct
34 Correct 143 ms 20052 KB Output is correct
35 Correct 145 ms 20220 KB Output is correct
36 Correct 137 ms 20560 KB Output is correct
37 Correct 127 ms 20808 KB Output is correct
38 Correct 122 ms 20552 KB Output is correct
39 Correct 97 ms 20552 KB Output is correct
40 Correct 113 ms 20296 KB Output is correct
41 Correct 94 ms 20468 KB Output is correct
42 Correct 99 ms 20296 KB Output is correct

Subtask #6
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 8784 KB Output is correct
2 Correct 2 ms 8784 KB Output is correct
3 Correct 2 ms 8784 KB Output is correct
4 Correct 3 ms 8784 KB Output is correct
5 Correct 2 ms 8848 KB Output is correct
6 Correct 2 ms 8784 KB Output is correct
7 Correct 3 ms 8784 KB Output is correct
8 Correct 2 ms 8784 KB Output is correct
9 Correct 2 ms 8784 KB Output is correct
10 Correct 2 ms 8784 KB Output is correct
11 Correct 3 ms 8784 KB Output is correct
12 Correct 2 ms 8784 KB Output is correct
13 Correct 4 ms 9208 KB Output is correct
14 Correct 4 ms 9040 KB Output is correct
15 Correct 5 ms 9040 KB Output is correct
16 Correct 5 ms 8784 KB Output is correct
17 Correct 4 ms 8868 KB Output is correct
18 Correct 4 ms 9044 KB Output is correct
19 Correct 5 ms 9040 KB Output is correct
20 Correct 4 ms 9040 KB Output is correct
21 Correct 4 ms 9040 KB Output is correct
22 Correct 235 ms 30564 KB Output is correct
23 Correct 221 ms 30984 KB Output is correct
24 Correct 280 ms 33096 KB Output is correct
25 Correct 453 ms 41032 KB Output is correct
26 Correct 205 ms 30768 KB Output is correct
27 Correct 430 ms 40996 KB Output is correct
28 Correct 442 ms 41040 KB Output is correct
29 Correct 190 ms 29256 KB Output is correct
30 Correct 142 ms 30536 KB Output is correct
31 Correct 177 ms 31560 KB Output is correct
32 Correct 405 ms 40496 KB Output is correct
33 Correct 137 ms 30536 KB Output is correct
34 Correct 3 ms 8952 KB Output is correct
35 Correct 2 ms 8784 KB Output is correct
36 Correct 2 ms 8784 KB Output is correct
37 Correct 2 ms 8784 KB Output is correct
38 Correct 4 ms 9040 KB Output is correct
39 Correct 4 ms 9040 KB Output is correct
40 Correct 4 ms 9040 KB Output is correct
41 Correct 145 ms 30460 KB Output is correct
42 Correct 175 ms 31560 KB Output is correct
43 Correct 386 ms 40520 KB Output is correct
44 Correct 151 ms 30536 KB Output is correct
45 Correct 162 ms 20552 KB Output is correct
46 Correct 164 ms 20452 KB Output is correct
47 Correct 126 ms 20552 KB Output is correct
48 Correct 103 ms 20296 KB Output is correct
49 Correct 106 ms 20552 KB Output is correct
50 Correct 105 ms 20336 KB Output is correct
51 Runtime error 143 ms 59280 KB Execution killed with signal 11
52 Halted 0 ms 0 KB -