# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
387342 | milleniumEeee | Painting Walls (APIO20_paint) | C++17 | 276 ms | 269292 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>
#include "paint.h"
//#include "grader.cpp"
#define chkmin(a, b) a = min(a, b)
#define chkmax(a, b) a = max(a, b)
#define pb push_back
#define all(s) s.begin(), s.end()
#define szof(s) (int)s.size()
using namespace std;
const int MAXN = (int)1e5 + 5;
const int INF = 1e9 + 7;
int pos[MAXN];
int dp[MAXN];
int pref[MAXN];
struct Segment_Tree {
vector <int> tree;
vector <int> lazy;
Segment_Tree (int n) {
tree.resize(n * 4, INF);
lazy.resize(n * 4, INF);
}
void push(int v, int tl, int tr) {
if (lazy[v] == INF) {
return;
}
if (tl != tr) {
chkmin(lazy[v + v], lazy[v]);
# | 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... |