# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
923505 | Art_ogo | Fancy Fence (CEOI20_fancyfence) | C++17 | 81 ms | 10200 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define ve vector
#define ld long double
#define ll long long
#define all(x) x.begin(), x.end()
#define fi first
#define se second
using namespace std;
using namespace chrono;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#pragma GCC optimize("Ofast")
const int MAXN = 1e5+10;
const ll mod = 1e9+7;
struct rect{
ll h, w, id;
};
inline bool comp(const rect& r1, const rect& r2){
return r1.h < r2.h;
}
rect v[MAXN];
ll pref[MAXN];
# | 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... |