# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1139076 | btninh | Building Bridges (CEOI17_building) | C++20 | 65 ms | 63812 KiB |
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define fi first
#define se second
#define all(x) x.begin(), x.end()
#define sz(x) (int)x.size()
#define pii pair<int,int>
#define INF 1e18
#define FOR(i, a, b) for(int i = a; i <= b; ++i)
#define FORD(i, a, b) for(int i = a; i >= b; --i)
#define TASK "test"
using namespace std;
const int N = 100005;
const int mod = 1e9 + 7;
int n, h[N], w[N];
struct Line{
ll a, b;
Line(ll a = 0, ll b = INF): a(a), b(b) {}
ll calc(int x){
return a * x + b;
}
ll sl(){
return a;
}
};
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |