# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
698479 | 2023-02-13T15:25:26 Z | Do_you_copy | 3D Histogram (COCI20_histogram) | C++17 | 17 ms | 3468 KB |
//Then #include <bits/stdc++.h> #define pb push_back #define fi first #define se second #define faster ios_base::sync_with_stdio(0); cin.tie(0); using namespace std; using ll = long long; using ld = long double; using pii = pair <int, int>; mt19937_64 Rand(chrono::steady_clock::now().time_since_epoch().count()); const int maxN = 1e5 + 1; //const int Mod = 1e9 + 7; const int inf = 0x3f3f3f3f; int n; pii a[maxN]; void Sub1(){ ll ans = 0; for (int i = 1; i <= n; ++i){ int min1 = inf; int min2 = inf; for (int j = i; j <= n; ++j){ min1 = min(min1, a[j].fi); min2 = min(min2, a[j].se); ans = max(ans, 1LL * (j - i + 1) * min1 * min2); } } cout << ans; } void Init(){ cin >> n; for (int i = 1; i <= n; ++i) cin >> a[i].fi >> a[i].se; if (n <= 2000) Sub1(); } #define debug #define taskname "histogram" signed main(){ faster if (fopen(taskname".inp", "r")){ freopen(taskname".inp", "r", stdin); freopen(taskname".out", "w", stdout); } int tt = 1; //cin >> tt; while (tt--){ Init(); } if (fopen("timeout.txt", "r")){ ofstream timeout("timeout.txt"); timeout << signed(double(clock()) / CLOCKS_PER_SEC * 1000); timeout.close(); #ifndef debug cerr << "Time elapsed: " << signed(double(clock()) / CLOCKS_PER_SEC * 1000) << "ms\n"; #endif // debug } }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 4 ms | 340 KB | Output is correct |
2 | Correct | 5 ms | 348 KB | Output is correct |
3 | Correct | 5 ms | 340 KB | Output is correct |
4 | Correct | 4 ms | 344 KB | Output is correct |
5 | Correct | 4 ms | 340 KB | Output is correct |
6 | Correct | 5 ms | 348 KB | Output is correct |
7 | Correct | 4 ms | 340 KB | Output is correct |
8 | Correct | 4 ms | 340 KB | Output is correct |
9 | Correct | 5 ms | 360 KB | Output is correct |
10 | Correct | 4 ms | 348 KB | Output is correct |
11 | Correct | 1 ms | 332 KB | Output is correct |
12 | Correct | 5 ms | 340 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 4 ms | 340 KB | Output is correct |
2 | Correct | 5 ms | 348 KB | Output is correct |
3 | Correct | 5 ms | 340 KB | Output is correct |
4 | Correct | 4 ms | 344 KB | Output is correct |
5 | Correct | 4 ms | 340 KB | Output is correct |
6 | Correct | 5 ms | 348 KB | Output is correct |
7 | Correct | 4 ms | 340 KB | Output is correct |
8 | Correct | 4 ms | 340 KB | Output is correct |
9 | Correct | 5 ms | 360 KB | Output is correct |
10 | Correct | 4 ms | 348 KB | Output is correct |
11 | Correct | 1 ms | 332 KB | Output is correct |
12 | Correct | 5 ms | 340 KB | Output is correct |
13 | Runtime error | 17 ms | 3468 KB | Execution killed with signal 11 |
14 | Halted | 0 ms | 0 KB | - |