oj.uz

Submission #1036122

# Submission time Handle Problem Language Result Execution time Memory
1036122 2024-07-27T03:43:30 Z vjudge1 Zemljište (COCI22_zemljiste) C++17
30 / 70
 2000 ms 6748 KB 
#warning Check FastIO
// #pragma GCC optimize("Ofast,unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#include <iostream>
#include <algorithm>
#include <climits>
#include <queue>
#include <cmath>
#include <map>
#include <set>
#include <random>
#include <chrono>
#include <iomanip>
#include <vector>
#include <fstream>
using namespace std;
#define vll vector<ll>
#define sll set<ll>
#define vstr vector<string>
#define ll long long
#define ld long double
#define supra main
#define pb push_back
#define add insert
#define rall(x) rbegin(x),rend(x)
#define all(x) (x).begin(),(x).end()
#define I ios_base::sync_with_stdio(false);
#define Hear cin.tie(NULL);
#define Shots cout.tie(NULL);
#define Ratatatata
#define bits_on(a) (__builtin_popcountll(a))
#define mx_pw2(a) (__builtin_ctzll(a))
mt19937 RNG(chrono::steady_clock::now().time_since_epoch().count());  
#define SHUFFLE(v) shuffle(all(v), RNG); 
const ll inf=LLONG_MAX;
void input(vll& a)
{
    for(auto& i:a)
        cin>>i;
}
void pyn(bool a)
{
    cout<<(a?"YES":"NO")<<endl;
}
ll powmod(ll a,ll b,ll modulo)
{
  if(b==0){
    return 1;
  }
  ll temp=powmod(a,b/2,modulo);
  if(b%2==0){
    return (temp*temp)%modulo;
  }
  else{
    return (a*((temp*temp)%modulo))%modulo;
  }
}

bool Prime(ll n){
    for (ll i = 2; i*i <= n; i++)
        if (n % i == 0)
            return false;
    return (n>1);
}
const int N=502;
ll a[N][N],pre[N][N];
void solve()
{
    ll n,m,ax,bx;
    cin>>n>>m>>ax>>bx;
    if(ax>bx)
        swap(ax,bx);
    for(int i=1;i<=n;i++)
        for(int j=1;j<=m;j++)
            cin>>a[i][j];
    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=m;j++)
        {
            pre[i][j]=pre[i][j-1]+a[i][j];
        }
    }
    ll ans=ax+bx;
    for(int x=1;x<=m;x++)
    {
        for(int xp=x;xp<=m;xp++)
        {
            set<ll> pr;
            pr.insert(0);
            ll sm=0;
            for(int row=1;row<=n;row++)
            {
                sm+=pre[row][xp]-pre[row][x-1];
                auto it=pr.lower_bound(sm-bx);
                if(it!=pr.end())
                    ans=min(ans,abs(ax-sm+*it)+abs(bx-sm+*it));
                if(it!=pr.begin())
                {
                    it--;
                    ans=min(ans,abs(ax-sm+*it)+abs(bx-sm+*it));
                }
                pr.insert(sm);
            }
        }
    }
    cout<<ans<<'\n';
}
int supra(){
    I Hear Shots Ratatatata
    ll tqwertyuiop=1;
    for(int tp=1;tp<=tqwertyuiop;tp++)
    {
        // cout<<"Case #"<<tp<<": ";
        solve();
    }
    return 0;
}
/*
Bro use only in a emergency 
this is kind of hacking

*/

Compilation message

Main.cpp:1:2: warning: #warning Check FastIO [-Wcpp]
    1 | #warning Check FastIO
      |  ^~~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 604 KB Output is correct
2 Correct 1 ms 604 KB Output is correct
3 Correct 1 ms 604 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 1 ms 472 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 0 ms 392 KB Output is correct
10 Correct 9 ms 1072 KB Output is correct
11 Correct 23 ms 1112 KB Output is correct
12 Correct 23 ms 1116 KB Output is correct
13 Correct 39 ms 1116 KB Output is correct
14 Correct 2 ms 604 KB Output is correct
15 Correct 39 ms 1364 KB Output is correct
16 Correct 39 ms 1116 KB Output is correct
17 Correct 23 ms 1116 KB Output is correct
18 Correct 21 ms 1308 KB Output is correct
19 Correct 27 ms 1116 KB Output is correct
20 Correct 34 ms 1116 KB Output is correct
21 Correct 21 ms 1312 KB Output is correct
22 Correct 34 ms 1116 KB Output is correct

Subtask #3
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 604 KB Output is correct
2 Correct 1 ms 604 KB Output is correct
3 Correct 1 ms 604 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 604 KB Output is correct
6 Correct 1 ms 472 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 0 ms 392 KB Output is correct
10 Correct 9 ms 1072 KB Output is correct
11 Correct 23 ms 1112 KB Output is correct
12 Correct 23 ms 1116 KB Output is correct
13 Correct 39 ms 1116 KB Output is correct
14 Correct 2 ms 604 KB Output is correct
15 Correct 39 ms 1364 KB Output is correct
16 Correct 39 ms 1116 KB Output is correct
17 Correct 23 ms 1116 KB Output is correct
18 Correct 21 ms 1308 KB Output is correct
19 Correct 27 ms 1116 KB Output is correct
20 Correct 34 ms 1116 KB Output is correct
21 Correct 21 ms 1312 KB Output is correct
22 Correct 34 ms 1116 KB Output is correct
23 Execution timed out 2068 ms 6748 KB Time limit exceeded
24 Halted 0 ms 0 KB -