# | 제출 시각UTC-0 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1160085 | ocasu | 3D Histogram (COCI20_histogram) | C++20 | 2595 ms | 576 KiB |
#include <bits/stdc++.h>
using namespace std;
#define int long long
signed main(){
int n; cin>>n;
vector<int> a(n), b(n);
for (int i=0; i<n; i++) cin>>a[i]>>b[i];
int ans=0;
//cout<<'\n';
int mxChanged=0;
for (int i=0; i<n; i++){
int aL=-1, bL=-1, aR=-1, bR=-1;
for (int j=i-1; j>=0; j--) if (a[j] < a[i]) {
aL=a[j];
break;
}
for (int j=i-1; j>=0; j--) if (b[j] < b[i]) {
bL=b[j];
break;
}
for (int j=i+1; j<n; j++) if (a[j] < a[i]) {
aL=a[j];
break;
}
for (int j=i+1; j<n; j++) if (b[j] < b[i]) {
bL=b[j];
break;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |