| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1333695 | i271828 | IMO (EGOI25_imo) | C++20 | 1 ms | 344 KiB |
#include <bits/stdc++.h>
#define pii pair<int,int>
#define ll long long
using namespace std;
const int MAX=2e4+5;
const int MAXM=105;
const int INF=1<<30;
int N,M,K;
int A[2][2];
bool X[2][2];
int L[2],R[2];
int main(){
ios::sync_with_stdio(0);cin.tie(0);
cin>>N>>M>>K;
for (int i=0;i<N;i++) for (int j=0;j<M;j++) cin>>A[i][j];
int ans=0;
for (int bm=0;bm<16;bm++){
L[0]=L[1]=R[0]=R[1]=0;
for (int i=0;i<2;i++) for (int j=0;j<2;j++){
if (bm&(1<<(i*2+j))) R[i]+=K;
else L[i]+=A[i][j],R[i]+=A[i][j];
}
if (R[0]<L[1]||R[1]<=L[0]) ans=max(ans,__builtin_popcount(bm));
}
cout<<N*M-ans<<'\n';
}
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
