oj.uz

답안 #482605

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
482605 2021-10-25T21:34:56 Z CSQ31 3D Histogram (COCI20_histogram) C++17
20 / 110
 1540 ms 716 KB 
#pragma GCC optimize("Ofast") 
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define sz(a) (int)(a.size())
#define all(a) a.begin(),a.end()
#define lb lower_bound
#define ub upper_bound
#define owo ios_base::sync_with_stdio(0);cin.tie(0);
#define MOD (ll)(998244353)
#define INF (ll)(1e18)
#define debug(...) fprintf(stderr, __VA_ARGS__),fflush(stderr)
#define time__(d) for(long blockTime = 0; (blockTime == 0 ? (blockTime=clock()) != 0 : false);\
debug("%s time : %.4fs\n", d, (double)(clock() - blockTime) / CLOCKS_PER_SEC))
typedef long long int ll;
typedef long double ld;
typedef pair<ll,ll> PII;
typedef pair<int,int> pii;
typedef vector<vector<int>> vii;
typedef vector<vector<ll>> VII;
ll gcd(ll a,ll b){if(!b)return a;else return gcd(b,a%b);}
ll a[10000],b[100000];
int main()
{
	int n;
	cin>>n;
	for(int i=0;i<n;i++)cin>>a[i]>>b[i];
		ll ans = 0;
	for(int i=0;i<n;i++){
		for(int j=i+1;j<n;j++){
			ll cost  =(j-i+1);
			ll mna = INF,mnb = INF;
			for(int k=i;k<=j;k++){
				mna = min(mna,ll(a[k]));
				mnb = min(mnb,ll(b[k]));
			}
			cost*=mna;
			cost*=mnb;
			ans = max(ans,cost);	
		}
	}
	for(int i=0;i<n;i++){
		for(int j=i;j<n;j++){
			ll cost  =(j-i+1);
			ll mna = INF,mnb = INF;
			for(int k=i;k<=j;k++){
				mna = min(mna,ll(a[k]));
				mnb = min(mnb,ll(b[k]));
			}
			cost*=mna;
			cost*=mnb;
			//if(cost == ans)cout<<i<<" "<<j<<'\n';
		}
	}
	cout<<ans;
}

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1190 ms 312 KB Output is correct
2 Correct 1420 ms 308 KB Output is correct
3 Correct 1337 ms 312 KB Output is correct
4 Correct 1283 ms 316 KB Output is correct
5 Correct 1069 ms 312 KB Output is correct
6 Correct 1450 ms 308 KB Output is correct
7 Correct 1118 ms 312 KB Output is correct
8 Correct 1200 ms 332 KB Output is correct
9 Correct 1430 ms 308 KB Output is correct
10 Correct 1445 ms 312 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1540 ms 308 KB Output is correct

Subtask #2
0 / 90.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1190 ms 312 KB Output is correct
2 Correct 1420 ms 308 KB Output is correct
3 Correct 1337 ms 312 KB Output is correct
4 Correct 1283 ms 316 KB Output is correct
5 Correct 1069 ms 312 KB Output is correct
6 Correct 1450 ms 308 KB Output is correct
7 Correct 1118 ms 312 KB Output is correct
8 Correct 1200 ms 332 KB Output is correct
9 Correct 1430 ms 308 KB Output is correct
10 Correct 1445 ms 312 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1540 ms 308 KB Output is correct
13 Runtime error 7 ms 716 KB Execution killed with signal 11
14 Halted 0 ms 0 KB -