| # | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 934455 | 2024-02-27T10:49:06 Z | vjudge1 | Wall (IOI14_wall) | C++17 | 0 ms | 0 KB |
#include <bits/stdc++.h>
#define pb push_back
#define pf push_front
using namespace std;
#define F first
#define S second
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
typedef long long ll;
#define pii pair <int, int>
#define pll pair <ll, ll>
typedef long double ld;
const ll N = 2 * 1e5 + 10, M = 1e6 + 10, inf = 1e18;
const ll mod = 1e9 + 7;
ll um(ll a, ll b){
return (1LL * a * b) % mod;
}
ll subr(ll a, ll b){
return ((1LL * a - b) % mod + mod) % mod;
}
void buildWall(int n, int k, vector <int> op, vector <int> left, vector <int> right,
vector <int> h, vector <int> &ans){
for(int i = 0; i < n; i++){
ans.pb(0);
}
for(int i = 0; i < k; i++){
for(int j = left[i]; j <= right[i]; j++){
if(op[i] == 1) ans[j] = max(h[i], ans[j]);
else ans[j] = min(ans[j], h[i]);
}
}
}