oj.uz

답안 #366427

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
366427 2021-02-14T07:36:58 Z kartel 3D Histogram (COCI20_histogram) C++14
20 / 110
 8 ms 460 KB 
#include <bits/stdc++.h>
#define in(x) freopen(x, "r", stdin)
#define out(x) freopen(x, "w", stdout)
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("unroll-loops")
//#pragma GCC optimize("-O3")
#define F first
#define S second
#define pb push_back
#define M ll(1e9 + 7)
#define sz(x) (int)x.size()
#define re return
#define oo ll(1e18)
#define el '\n'
#define pii pair <int, int>
#define all(x) (x).begin(), (x).end()
#define arr_all(x, n) (x + 1), (x + 1 + n)
#define vi vector<int>
#define eps (ld)1e-6
using namespace std;
//using namespace __gnu_pbds;
//typedef tree <int, null_type, less_equal <int> , rb_tree_tag, tree_order_statistics_node_update> ordered_set;
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef short int si;

const int N = 2005;

int n;
int a[N], b[N];
int mxa, mxb;
ll ans;

int main()
{
//    srand(time(0));
	ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

//    in("turtle.in");
//    out("turtle.out");
//    inf("input.txt");
//    out("output.txt");

    cin >> n;

    for (int i = 1; i <= n; i++) {
        cin >> a[i] >> b[i];

        mxa = max(a[i], mxa);
        mxb = max(b[i], mxb);
    }

    for (int i = 1; i <= n; i++) {
        int mb = mxb;
        int ma = mxa;

        for (int j = i; j <= n; j++) {
            ma = min(ma, a[j]);
            mb = min(mb, b[j]);

            ans = max(ans, ma * 1ll * mb * (j - i + 1));
        }
    }

    cout << ans;
}

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 204 KB Output is correct
2 Correct 4 ms 324 KB Output is correct
3 Correct 4 ms 204 KB Output is correct
4 Correct 4 ms 328 KB Output is correct
5 Correct 4 ms 328 KB Output is correct
6 Correct 8 ms 332 KB Output is correct
7 Correct 5 ms 328 KB Output is correct
8 Correct 5 ms 204 KB Output is correct
9 Correct 5 ms 328 KB Output is correct
10 Correct 5 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 7 ms 204 KB Output is correct

Subtask #2
0 / 90.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 204 KB Output is correct
2 Correct 4 ms 324 KB Output is correct
3 Correct 4 ms 204 KB Output is correct
4 Correct 4 ms 328 KB Output is correct
5 Correct 4 ms 328 KB Output is correct
6 Correct 8 ms 332 KB Output is correct
7 Correct 5 ms 328 KB Output is correct
8 Correct 5 ms 204 KB Output is correct
9 Correct 5 ms 328 KB Output is correct
10 Correct 5 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 7 ms 204 KB Output is correct
13 Runtime error 1 ms 460 KB Execution killed with signal 11
14 Halted 0 ms 0 KB -