제출 #1272243

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1272243		lioow	Zemljište (COCI22_zemljiste)	C++20	0 / 70	1 ms	572 KiB

Main

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define pb push_back
#define int long long
#define repp(i,x,n) for(int i=x;i<=n;i++)
#define rep(i,x,n) for(int i=x;i>=n;i--)
#define r0 return 0
#define fi first
#define se second
#define liow ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define jelek cout<<"jelek"<<endl
#define pii pair<int,int>
#define all(v) v.begin(),v.end()
#define tp tuple<int,int,int>
#define fl fflush(stdout)
#define ld long double
#define p5 pair<int,pair<pair<int,int>,pair<int,int>>>
#pragma GCC optimize ("O2")
#pragma GCC optimize ("unroll-loops")  
#define pil pair<int,int>
#define p3 pair<int,pii>
using namespace std;
using namespace __gnu_pbds;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
typedef tree<pair<int,int>, null_type,  less<pair<int,int>>, rb_tree_tag, tree_order_statistics_node_update> ordered_multiset;
//const int mod=1e9+7;
const int SQMAX=635,INF=1e18;
const int mod=998244353;
//const int MOD=1e6+3;
mt19937_64 rng((unsigned int) chrono::steady_clock::now().time_since_epoch().count());
pii dr[8]={{-1,0},{-1,1},{0,1},{1,1},{1,0},{1,-1},{0,-1},{-1,-1}};
int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};
int dxx[4]={1,1,-1,-1};
int dyy[4]={1,-1,-1,1};
int mul(int x,int y){return (x%mod*y%mod)%mod;}
int expo(int b,int e){
  if(e==0) return 1;
  int tmp=expo(b,e/2);
  if(e%2) return mul(tmp,mul(tmp,b));
  else return mul(tmp,tmp);
}
const int maxn=100005;
const int N=1e5;

void solve(){
	int n,m,a,b;cin>>n>>m>>a>>b;
	int aa[n+2][m+2];
	repp(i,1,n){
		repp(j,1,m) cin>>aa[i][j];
	}
	vector<vector<int>>pf(n+2,vector<int>(m+2,0));
	repp(j,1,m){
		repp(i,1,n) pf[i][j]=aa[i][j]+pf[i-1][j];
	}
	int ans=INF;
	if(a>b) swap(a,b);
	repp(i,1,n){
		repp(k,i,n){
			int sum=0;
			repp(j,1,n){
				sum+=pf[k][j]-pf[i-1][j];
				if(a<=sum && sum<=b) ans=b-a;
				else {
					ans=min(ans,abs(a-sum)+abs(b-sum));
					if(b<sum){
						sum=0;
						if(pf[k][j]-pf[i-1][j]<=b) sum=pf[k][j]-pf[i-1][j];
					}
				}
			}
		}
	}
	cout<<ans<<endl;
}

signed main(){
  liow;
  int t=1;
 // cin>>t;
  while(t--){
    solve();
  }
}

• Subtask 1: 0 / 10
• Subtask 2: 0 / 20
• Subtask 3: 0 / 40