oj.uz

Submission #1104524

# Submission time Handle Problem Language Result Execution time Memory
1104524 2024-10-24T02:01:57 Z Dreamy_lovesper Zemljište (COCI22_zemljiste) C++17
70 / 70
 203 ms 29680 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;}
 
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){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))if(b&1)ans=mul(ans,a);return ans;}
 
ll n,m,f[507][507],g[507][507];
ll a,b;
vll graph[mxn];
void Lovesper(const ll&TestCase){
    cin>>n>>m;
    cin>>a>>b;
    fu(i,1,n)
        fu(j,1,m){
            ll x;cin>>x;
            f[i][j]=f[i-1][j]+f[i][j-1]-f[i-1][j-1]+x;
        }
    if(a>b)swap(a,b);
    auto get=[&](ll i,ll j,ll u,ll v){return f[i][j]-f[u-1][j]-f[i][v-1]+f[u-1][v-1];};
    ll sad=lnf;
    fu(i,1,n)fu(j,i,n){
        ll l=1,r=1;
        while(r<=m){
            ll x=get(j,r,i,l);
            minimize(sad,abs(x-a)+abs(x-b));
            if(x>b)l++,r+=(l>r);
            else if(x>=a)return void(cout<<b-a);
            else r++;
        }
    }
    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

Main.cpp:14:13: warning: ISO C++11 requires whitespace after the macro name
   14 |     #define Love<3 HerLoveForMeJustaDream
      |             ^~~~
Main.cpp: In function 'std::ostream& operator<<(std::ostream&, __int128)':
Main.cpp:75:5: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
   75 |     if(value<0)d--,*d='-';ll len=end(buffer)-d;
      |     ^~
Main.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;
      |                           ^~
Main.cpp: In function 'void OpenLove(const str&)':
Main.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);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Main.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
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 25168 KB Output is correct
2 Correct 5 ms 25168 KB Output is correct
3 Correct 6 ms 25168 KB Output is correct
4 Correct 5 ms 25168 KB Output is correct
5 Correct 5 ms 25168 KB Output is correct
6 Correct 5 ms 25168 KB Output is correct
7 Correct 5 ms 25168 KB Output is correct
8 Correct 5 ms 25168 KB Output is correct
9 Correct 6 ms 25168 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 25168 KB Output is correct
2 Correct 5 ms 25168 KB Output is correct
3 Correct 6 ms 25168 KB Output is correct
4 Correct 5 ms 25168 KB Output is correct
5 Correct 5 ms 25168 KB Output is correct
6 Correct 5 ms 25168 KB Output is correct
7 Correct 5 ms 25168 KB Output is correct
8 Correct 5 ms 25168 KB Output is correct
9 Correct 6 ms 25168 KB Output is correct
10 Correct 7 ms 25424 KB Output is correct
11 Correct 6 ms 25680 KB Output is correct
12 Correct 7 ms 25680 KB Output is correct
13 Correct 7 ms 25680 KB Output is correct
14 Correct 6 ms 25168 KB Output is correct
15 Correct 7 ms 25536 KB Output is correct
16 Correct 8 ms 25680 KB Output is correct
17 Correct 8 ms 25696 KB Output is correct
18 Correct 6 ms 25852 KB Output is correct
19 Correct 6 ms 25712 KB Output is correct
20 Correct 6 ms 25680 KB Output is correct
21 Correct 7 ms 25720 KB Output is correct
22 Correct 6 ms 25680 KB Output is correct

Subtask #3
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 25168 KB Output is correct
2 Correct 5 ms 25168 KB Output is correct
3 Correct 6 ms 25168 KB Output is correct
4 Correct 5 ms 25168 KB Output is correct
5 Correct 5 ms 25168 KB Output is correct
6 Correct 5 ms 25168 KB Output is correct
7 Correct 5 ms 25168 KB Output is correct
8 Correct 5 ms 25168 KB Output is correct
9 Correct 6 ms 25168 KB Output is correct
10 Correct 7 ms 25424 KB Output is correct
11 Correct 6 ms 25680 KB Output is correct
12 Correct 7 ms 25680 KB Output is correct
13 Correct 7 ms 25680 KB Output is correct
14 Correct 6 ms 25168 KB Output is correct
15 Correct 7 ms 25536 KB Output is correct
16 Correct 8 ms 25680 KB Output is correct
17 Correct 8 ms 25696 KB Output is correct
18 Correct 6 ms 25852 KB Output is correct
19 Correct 6 ms 25712 KB Output is correct
20 Correct 6 ms 25680 KB Output is correct
21 Correct 7 ms 25720 KB Output is correct
22 Correct 6 ms 25680 KB Output is correct
23 Correct 25 ms 29680 KB Output is correct
24 Correct 28 ms 29460 KB Output is correct
25 Correct 26 ms 29556 KB Output is correct
26 Correct 26 ms 29520 KB Output is correct
27 Correct 20 ms 28752 KB Output is correct
28 Correct 27 ms 29580 KB Output is correct
29 Correct 27 ms 28744 KB Output is correct
30 Correct 26 ms 29512 KB Output is correct
31 Correct 9 ms 27216 KB Output is correct
32 Correct 200 ms 29660 KB Output is correct
33 Correct 185 ms 28744 KB Output is correct
34 Correct 191 ms 29512 KB Output is correct
35 Correct 190 ms 29428 KB Output is correct
36 Correct 203 ms 29544 KB Output is correct
37 Correct 189 ms 29532 KB Output is correct
38 Correct 201 ms 28752 KB Output is correct
39 Correct 194 ms 29520 KB Output is correct
40 Correct 183 ms 28752 KB Output is correct
41 Correct 18 ms 27984 KB Output is correct
42 Correct 18 ms 28240 KB Output is correct
43 Correct 18 ms 28284 KB Output is correct
44 Correct 18 ms 28240 KB Output is correct