| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 51873 |
2018-06-22T09:52:50 Z |
aquablitz11 |
Wall (IOI14_wall) |
C++14 |
|
3000 ms |
34920 KB |
// headers
#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
// types
template<class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
using dbl = double;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pli = pair<ll, int>;
using piipi = pair<pii, int>;
using pipii = pair<int, pii>;
using plpii = pair<ll, pii>;
using ppii = pair<pii, pii>;
// loops
#define forx(i, x, y) for (int i = (x); i <= (y); ++i)
#define forn(i, n) for (int i = 0; i < (n); ++i)
#define for1(i, n) for (int i = 1; i <= (n); ++i)
#define rofx(i, x, y) for (int i = x; i >= y; --i)
#define rofn(i, n) for (int i = n-1; i >= 0; --i)
#define rof1(i, n) for (int i = n; i >= 1; --i)
#define fora(x, v) for (auto x : v)
// define shortcuts
#define all(x) begin(x), end(x)
#define pb push_back
#define eb emplace_back
#define F first
#define S second
#define X first
#define Y second
#define MP make_pair
#define MT make_tuple
// functions
template<class T> inline bool hasbit(T x, int i) { return x&(1<<i); }
template<class T> inline T togbit(T x, int i) { return x|(1<<i); }
template<class T> inline T setbit(T x, int i) { return x|(1<<i); }
template<class T> inline T rembit(T x, int i) { return x&~(1<<i); }
template<class T> inline bool setmax(T &a, const T &b) { return b > a ? a = b, true : false; }
template<class T> inline bool setmin(T &a, const T &b) { return b < a ? a = b, true : false; }
template<class T> int compress(vector<T> &v) { sort(all(v)); v.resize(unique(all(v))-v.begin()); return v.size(); }
// read functions
int read_int() { int x; scanf("%d", &x); return x; }
ll read_ll() { ll x; scanf("%" SCNd64, &x); return x; }
ull read_ull() { ull x; scanf("%" SCNu64, &x); return x; }
dbl read_dbl() { dbl x; scanf("%lf", &x); return x; }
void _R(int &x) { x = read_int(); }
void _R(ll &x) { x = read_ll(); }
void _R(dbl &x) { x = read_dbl(); }
void R() {}
template<class T, class... U> void R(T &head, U &... tail) { _R(head); R(tail...); }
// print functions
template<class T> void _W(const T &x) { cout << x; }
void _W(const int &x) { printf("%d", x); }
void _W(const ll &x) { printf("%" PRId64, x); }
void _W(const ull &x) { printf("%" PRIu64, x); }
void _W(const double &x) { printf("%.16f", x); }
void _W(const char &x) { putchar(x); }
void _W(const char *x) { printf("%s", x); }
template<class T> void _W(const vector<T> &x) { for (auto i = x.begin(); i != x.end(); _W(*i++)) if (i != x.cbegin()) putchar(' '); }
void W() {}
template<class T, class... U> void W(const T &head, const U &... tail) { _W(head); putchar(sizeof...(tail) ? ' ' : '\n'); W(tail...); }
// pseudo-random number generator
template<class T, T x1, T x2, T x3, int y1, int y2, int y3>
struct PRNG {
using S = typename make_signed<T>::type;
T s;
PRNG(T _s = 0) : s(_s) {}
T next() {
T z = (s += x1);
z = (z ^ (z >> y1)) * x2;
z = (z ^ (z >> y2)) * x3;
return z ^ (z >> y3);
}
T next(T n) { return next() % n; }
S next(S l, S r) { return l + next(r - l + 1); }
T operator()() { return next(); }
T operator()(T n) { return next(n); }
S operator()(S l, S r) { return next(l, r); }
static T gen(T s) { return PRNG(s)(); }
template<class U>
void shuffle(U first, U last) {
size_t n = last - first;
for (size_t i = 0; i < n; i++) swap(first[i], first[next(i + 1)]);
}
};
PRNG<uint32_t, 0x9E3779B1, 0x85EBCA6B, 0xC2B2AE35, 16, 13, 16> r32;
PRNG<uint64_t, 0x9E3779B97F4A7C15, 0xBF58476D1CE4E5B9, 0x94D049BB133111EB, 30, 27, 31> r64;
#include "wall.h"
const int N = 1<<21;
int n, lazyt[N<<1], lazyv[N<<1], mn[N<<1], mx[N<<1];
void push(int p, int b, int e);
void addtag(int t, int v, int p, int b, int e)
{
push(p, b, e);
lazyt[p] = t;
lazyv[p] = v;
}
void push(int p, int b, int e)
{
if (!lazyt[p]) return;
if (lazyt[p] == 1) {
setmax(mn[p], lazyv[p]);
setmax(mx[p], lazyv[p]);
} else {
setmin(mn[p], lazyv[p]);
setmin(mx[p], lazyv[p]);
}
if (b != e) {
int m = (b+e)/2;
addtag(lazyt[p], lazyv[p], p<<1, b, m);
addtag(lazyt[p], lazyv[p], p<<1|1, m+1, e);
}
lazyt[p] = lazyv[p] = 0;
}
void update(int l, int r, int t, int v, int p=1, int b=0, int e=n-1)
{
push(p, b, e);
if (e < l || b > r || b > e || l > r)
return;
if (b >= l && e <= r) {
addtag(t, v, p, b, e);
push(p, b, e);
return;
}
int m = (b+e)/2;
update(l, r, t, v, p<<1, b, m);
update(l, r, t, v, p<<1|1, m+1, e);
mn[p] = min(mn[p<<1], mn[p<<1|1]);
mx[p] = max(mx[p<<1], mx[p<<1|1]);
}
void build(int p, int b, int e, int ans[])
{
push(p, b, e);
if (b != e) {
int m = (b+e)/2;
build(p<<1, b, m, ans);
build(p<<1|1, m+1, e, ans);
} else {
ans[b] = mn[p];
}
}
void buildWall(int n, int k, int op[], int left[], int right[], int height[], int finalHeight[])
{
::n = n;
forn(i, k) update(left[i], right[i], op[i], height[i]);
build(1, 0, n-1, finalHeight);
return;
}
Compilation message
wall.cpp: In function 'll read_ll()':
wall.cpp:49:42: warning: format '%ld' expects argument of type 'long int*', but argument 2 has type 'll* {aka long long int*}' [-Wformat=]
ll read_ll() { ll x; scanf("%" SCNd64, &x); return x; }
~~^
wall.cpp: In function 'ull read_ull()':
wall.cpp:50:45: warning: format '%lu' expects argument of type 'long unsigned int*', but argument 2 has type 'ull* {aka long long unsigned int*}' [-Wformat=]
ull read_ull() { ull x; scanf("%" SCNu64, &x); return x; }
~~^
wall.cpp: In function 'void _W(const ll&)':
wall.cpp:60:44: warning: format '%ld' expects argument of type 'long int', but argument 2 has type 'll {aka long long int}' [-Wformat=]
void _W(const ll &x) { printf("%" PRId64, x); }
~^
wall.cpp: In function 'void _W(const ull&)':
wall.cpp:61:45: warning: format '%lu' expects argument of type 'long unsigned int', but argument 2 has type 'ull {aka long long unsigned int}' [-Wformat=]
void _W(const ull &x) { printf("%" PRIu64, x); }
~^
wall.cpp: In function 'int read_int()':
wall.cpp:48:30: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
int read_int() { int x; scanf("%d", &x); return x; }
~~~~~^~~~~~~~~~
wall.cpp: In function 'll read_ll()':
wall.cpp:49:27: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
ll read_ll() { ll x; scanf("%" SCNd64, &x); return x; }
~~~~~^~~~~~~~~~~~~~~~
wall.cpp: In function 'ull read_ull()':
wall.cpp:50:30: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
ull read_ull() { ull x; scanf("%" SCNu64, &x); return x; }
~~~~~^~~~~~~~~~~~~~~~
wall.cpp: In function 'dbl read_dbl()':
wall.cpp:51:30: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
dbl read_dbl() { dbl x; scanf("%lf", &x); return x; }
~~~~~^~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
376 KB |
Output is correct |
| 2 |
Correct |
4 ms |
616 KB |
Output is correct |
| 3 |
Correct |
8 ms |
616 KB |
Output is correct |
| 4 |
Correct |
289 ms |
1468 KB |
Output is correct |
| 5 |
Correct |
238 ms |
1596 KB |
Output is correct |
| 6 |
Correct |
247 ms |
1596 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
1596 KB |
Output is correct |
| 2 |
Correct |
186 ms |
14632 KB |
Output is correct |
| 3 |
Execution timed out |
3041 ms |
14964 KB |
Time limit exceeded |
| 4 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
14964 KB |
Output is correct |
| 2 |
Correct |
4 ms |
14964 KB |
Output is correct |
| 3 |
Correct |
8 ms |
14964 KB |
Output is correct |
| 4 |
Correct |
265 ms |
14964 KB |
Output is correct |
| 5 |
Correct |
231 ms |
14964 KB |
Output is correct |
| 6 |
Correct |
237 ms |
14964 KB |
Output is correct |
| 7 |
Correct |
2 ms |
14964 KB |
Output is correct |
| 8 |
Correct |
179 ms |
24752 KB |
Output is correct |
| 9 |
Execution timed out |
3024 ms |
24996 KB |
Time limit exceeded |
| 10 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
24996 KB |
Output is correct |
| 2 |
Correct |
4 ms |
24996 KB |
Output is correct |
| 3 |
Correct |
8 ms |
24996 KB |
Output is correct |
| 4 |
Correct |
272 ms |
24996 KB |
Output is correct |
| 5 |
Correct |
299 ms |
24996 KB |
Output is correct |
| 6 |
Correct |
234 ms |
24996 KB |
Output is correct |
| 7 |
Correct |
2 ms |
24996 KB |
Output is correct |
| 8 |
Correct |
181 ms |
34772 KB |
Output is correct |
| 9 |
Execution timed out |
3035 ms |
34920 KB |
Time limit exceeded |
| 10 |
Halted |
0 ms |
0 KB |
- |
