Submission #1100991

# Submission time Handle Problem Language Result Execution time Memory
1100991 2024-10-15T08:03:16 Z Dreamy_lovesper San (COCI17_san) C++17
120 / 120
190 ms 31420 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=1e6+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;}
 
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,k,f[mxn],g[mxn],fen[mxn];
pll p[mxn];
vll graph[mxn];
void Lovesper(const ll&TestCase){
    cin>>n>>k;
    fu(i,0,n-1)cin>>p[i].fi>>p[i].se;
    ll half=n/2,sad=0;
    fu(msk,1,(1<<half)){
        ll sum=0,lst=0,gf=-1;
        ll o=1;
        fu(j,0,half-1){
            if(!Bitc(msk,j))continue;
            if(p[j].fi<lst){o=0;break;}
            sum+=p[j].se;lst=p[j].fi;
            gf=j;
        }
        if(o){
            graph[gf].pb(sum);
            if(sum>=k)sad+=1;
        }
    }
    fu(msk,1,(1<<(n-half))-1){
        ll sum=0,lst=0,gf=-1;
        ll o=1;
        fu(j,0,n-half){
            if(!Bitc(msk,j))continue;
            ll id=j+half;
            if(p[id].fi<lst){o=0;break;}
            sum+=p[id].se;lst=p[id].fi;
            if(gf==-1)gf=id;
        }
        if(o){
            graph[gf].pb(sum);
            if(sum>=k)sad+=1;
        }
    }
    fu(i,0,n-1)sort(all(graph[i]));
    fu(l,0,half-1)
        for(auto&j:graph[l])
            fu(r,half,n-1){
                if(p[l].fi>p[r].fi)continue;
                sad+=(graph[r].end()-lower_bound(all(graph[r]),k-j));
            }
    cout<<sad;
}
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

san.cpp:14:13: warning: ISO C++11 requires whitespace after the macro name
   14 |     #define Love<3 HerLoveForMeJustaDream
      |             ^~~~
san.cpp: In function 'std::ostream& operator<<(std::ostream&, __int128)':
san.cpp:67:5: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
   67 |     if(value<0)d--,*d='-';ll len=end(buffer)-d;
      |     ^~
san.cpp:67:27: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
   67 |     if(value<0)d--,*d='-';ll len=end(buffer)-d;
      |                           ^~
san.cpp: In function 'void OpenLove(const str&)':
san.cpp:56:16: 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);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
san.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);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
# Verdict Execution time Memory Grader output
1 Correct 5 ms 25168 KB Output is correct
2 Correct 4 ms 25224 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 4 ms 25168 KB Output is correct
2 Correct 5 ms 25208 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 19 ms 25952 KB Output is correct
2 Correct 6 ms 25172 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 37 ms 26472 KB Output is correct
2 Correct 22 ms 25428 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 190 ms 31420 KB Output is correct
2 Correct 101 ms 26532 KB Output is correct