#line 1 "main.cpp"
/**
* @title Template
*/
#line 1 "rainbow.h"
#ifdef LOCAL
#ifndef __RAINBOW_H
#define __RAINBOW_H
#include <cstdint>
void init(int32_t R, int32_t C, int32_t sr, int32_t sc, int32_t M, char * S);
int32_t colour(int32_t ar, int32_t ac, int32_t br, int32_t bc);
#endif // __RAINBOW_H
#endif
#line 7 "main.cpp"
#include <iostream>
#include <algorithm>
#include <utility>
#include <numeric>
#include <vector>
#include <array>
#include <cassert>
#line 2 "/Users/kodamankod/Desktop/Programming/Library/other/chmin_chmax.cpp"
template <class T, class U>
constexpr bool chmin(T &lhs, const U &rhs) {
if (lhs > rhs) {
lhs = rhs;
return true;
}
return false;
}
template <class T, class U>
constexpr bool chmax(T &lhs, const U &rhs) {
if (lhs < rhs) {
lhs = rhs;
return true;
}
return false;
}
/**
* @title Chmin/Chmax
*/
#line 2 "/Users/kodamankod/Desktop/Programming/Library/other/range.cpp"
#line 4 "/Users/kodamankod/Desktop/Programming/Library/other/range.cpp"
class range {
public:
class iterator {
private:
int64_t M_position;
public:
constexpr iterator(int64_t position) noexcept: M_position(position) { }
constexpr void operator ++ () noexcept { ++M_position; }
constexpr bool operator != (iterator other) const noexcept { return M_position != other.M_position; }
constexpr int64_t operator * () const noexcept { return M_position; }
};
class reverse_iterator {
private:
int64_t M_position;
public:
constexpr reverse_iterator(int64_t position) noexcept: M_position(position) { }
constexpr void operator ++ () noexcept { --M_position; }
constexpr bool operator != (reverse_iterator other) const noexcept { return M_position != other.M_position; }
constexpr int64_t operator * () const noexcept { return M_position; }
};
private:
const iterator M_first, M_last;
public:
constexpr range(int64_t first, int64_t last) noexcept: M_first(first), M_last(std::max(first, last)) { }
constexpr iterator begin() const noexcept { return M_first; }
constexpr iterator end() const noexcept { return M_last; }
constexpr reverse_iterator rbegin() const noexcept { return reverse_iterator(*M_last - 1); }
constexpr reverse_iterator rend() const noexcept { return reverse_iterator(*M_first - 1); }
};
/**
* @title Range
*/
#line 2 "/Users/kodamankod/Desktop/Programming/Library/other/rev.cpp"
#include <type_traits>
#include <iterator>
#line 6 "/Users/kodamankod/Desktop/Programming/Library/other/rev.cpp"
template <class T>
class rev_impl {
public:
using iterator = typename std::decay<T>::type::reverse_iterator;
private:
const iterator M_begin;
const iterator M_end;
public:
constexpr rev_impl(T &&cont) noexcept: M_begin(std::rbegin(cont)), M_end(std::rend(cont)) { }
constexpr iterator begin() const noexcept { return M_begin; }
constexpr iterator end() const noexcept { return M_end; }
};
template <class T>
constexpr decltype(auto) rev(T &&cont) {
return rev_impl<T>(std::forward<T>(cont));
}
/**
* @title Reverser
*/
#line 2 "/Users/kodamankod/Desktop/Programming/Library/other/fix_point.cpp"
#line 4 "/Users/kodamankod/Desktop/Programming/Library/other/fix_point.cpp"
template <class Func>
struct fix_point_impl: private Func {
explicit constexpr fix_point_impl(Func &&func): Func(std::forward<Func>(func)) { }
template <class... Args>
constexpr decltype(auto) operator () (Args &&... args) const {
return Func::operator()(*this, std::forward<Args>(args)...);
}
};
template <class Func>
constexpr decltype(auto) fix_point(Func &&func) {
return fix_point_impl<Func>(std::forward<Func>(func));
}
/**
* @title Lambda Recursion
*/
#line 19 "main.cpp"
using i32 = int32_t;
using i64 = int64_t;
using u32 = uint32_t;
using u64 = uint64_t;
constexpr i32 inf32 = (i32(1) << 30) - 1;
constexpr i64 inf64 = (i64(1) << 62) - 1;
constexpr i32 dx[] = { 0, 1, 0, -1 };
constexpr i32 dy[] = { 1, 0, -1, 0 };
i32 H, W;
std::vector<std::vector<bool>> river;
std::array<std::vector<i32>, 3> sum;
void init(i32 R, i32 C, i32 sr, i32 sc, i32 M, char * S) {
H = R, W = C;
river = std::vector<std::vector<bool>>(H, std::vector<bool>(W));
// assert(R <= 50 && C <= 50);
assert(R == 2);
{
i32 x = sr - 1, y = sc - 1;
river[x][y] = true;
for (auto i: range(0, M)) {
char c = S[i];
if (c == 'N') --x;
if (c == 'E') ++y;
if (c == 'W') --y;
if (c == 'S') ++x;
river[x][y] = true;
}
}
sum.fill(std::vector<i32>(W));
for (auto i: range(0, 2)) {
for (auto j: range(0, W)) {
if (j > 0) {
sum[i][j] += sum[i][j - 1] + (river[i][j] != river[i][j - 1]);
}
}
}
for (auto j: range(0, W)) {
if (j > 0) {
sum[2][j] += sum[2][j - 1] + ((river[0][j] && river[1][j]) != (river[0][j - 1] && river[1][j - 1]));
}
}
}
i32 colour(i32 ar, i32 ac, i32 br, i32 bc) {
--ar; --ac;
if (br - ar == 1) {
i32 tmp = sum[ar][bc - 1] - sum[ar][ac];
tmp += (!river[ar][ac]) + (!river[ar][bc - 1]);
tmp /= 2;
return tmp;
}
else {
i32 tmp = sum[2][bc - 1] - sum[2][ac];
tmp += (!(river[0][ac] && river[1][ac])) + (!(river[0][bc - 1] && river[1][bc - 1]));
tmp /= 2;
return tmp;
}
}
#ifdef LOCAL
#include <stdio.h>
static int R, C, M, Q;
static int sr, sc;
static char S[100000 + 5];
int main() {
scanf("%d %d %d %d", &R, &C, &M, &Q);
scanf("%d %d", &sr, &sc);
if (M > 0) {
scanf(" %s ", S);
}
init(R, C, sr, sc, M, S);
int query;
for (query = 0; query < Q; query++) {
int ar, ac, br, bc;
scanf("%d %d %d %d", &ar, &ac, &br, &bc);
printf("%d\n", colour(ar, ac, br, bc));
}
return 0;
}
#endif
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
1 ms |
512 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
256 KB |
Output is correct |
| 2 |
Correct |
0 ms |
256 KB |
Output is correct |
| 3 |
Correct |
70 ms |
6408 KB |
Output is correct |
| 4 |
Correct |
67 ms |
6372 KB |
Output is correct |
| 5 |
Correct |
73 ms |
6376 KB |
Output is correct |
| 6 |
Correct |
71 ms |
6372 KB |
Output is correct |
| 7 |
Correct |
65 ms |
6500 KB |
Output is correct |
| 8 |
Correct |
64 ms |
6376 KB |
Output is correct |
| 9 |
Correct |
65 ms |
6372 KB |
Output is correct |
| 10 |
Correct |
66 ms |
6504 KB |
Output is correct |
| 11 |
Correct |
66 ms |
6372 KB |
Output is correct |
| 12 |
Correct |
57 ms |
6376 KB |
Output is correct |
| 13 |
Correct |
58 ms |
6376 KB |
Output is correct |
| 14 |
Correct |
60 ms |
6376 KB |
Output is correct |
| 15 |
Correct |
59 ms |
6376 KB |
Output is correct |
| 16 |
Correct |
68 ms |
6376 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
1 ms |
512 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
1 ms |
512 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Runtime error |
1 ms |
512 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
| 2 |
Halted |
0 ms |
0 KB |
- |
