# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
895500 | Shayan86 | 무지개나라 (APIO17_rainbow) | C++14 | 0 ms | 0 KiB |
이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include "rainbow.h"
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O3,unroll-loops")
// #pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
// Ofast, O0, O1, O2, O3, unroll-loops, fast-math, trapv
typedef long long ll;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
#define Mp make_pair
#define sep ' '
#define endl '\n'
#define F first
#define S second
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define kill(res) cout << res << '\n', exit(0);
#define set_dec(x) cout << fixed << setprecision(x);
#define fast_io ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define file_io freopen("input.txt", "r", stdin) ; freopen("output.txt", "w", stdout);
#define lid (id<<1)
#define rid (lid|1)
#define mid ((l+r)>>1)
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const ll N = 2e5 + 50;
const ll Mod = 1e9 + 7;
struct segment{
vector<int> idx[N], seg[N*4];
void build(int l = 0, int r = N, int id = 1){
if(l+1 == r){
seg[id] = idx[l];
sort(all(seg[id]));
seg[id].resize(unique(all(seg[id])) - seg[id].begin());
return;
}
build(l, mid, lid);
build(mid, r, rid);
seg[id].resize(seg[lid].size() + seg[rid].size());
merge(all(seg[lid]), all(seg[rid]), seg[id].begin());
}
int get(int ql, int qr, int dwn, int up, int l = 0, int r = N, int id = 1){
if(ql <= l && r <= qr){
int x1 = lower_bound(all(seg[id]), up) - seg[id].begin();
int x2 = lower_bound(all(seg[id]), dwn) - seg[id].begin();
return x2 - x1;
}
if(qr <= l || r <= ql) return 0;
return get(ql, qr, dwn, up, l, mid, lid) + get(ql, qr, dwn, up, mid, r, rid);
}
} pnt, vert, horiz, riv;
int R, C, sr, sc, M, x0 = N, y0 = N, x1, y1;
string s;
void add(int x, int y){
riv.idx[x].pb(y);
vert.idx[x-1].pb(y);
vert.idx[x].pb(y);
horiz.idx[x].pb(y-1);
horiz.idx[x].pb(y);
pnt.idx[x-1].pb(y-1);
pnt.idx[x-1].pb(y);
pnt.idx[x].pb(y-1);
pnt.idx[x].pb(y);
x0 = min(x0, x);
x1 = max(x1, x);
y0 = min(y0, y);
y1 = max(y1, y);
}
void init(int _R, int _C, int _sr, int _sc, int _M, char *S){
R = _R; C = _C; sr = _sr; sc = _sc; M = _M; s = S;
int x = sc, y = sr; add(x, y);
for(int i = 0; i < M; i++){
if(s[i] == 'N') y--;
else if(s[i] == 'S') y++;
else if(s[i] == 'E') x++;
else x--;
add(x, y);
}
pnt.build(); vert.build(); horiz.build(); riv.build();
}
int colour(int ar, int ac, int br, int bc){
ll m = vert.get(ac, bc, br + 1, ar) + horiz.get(ac, bc + 1, br, ar) + 2 * (br - ar + 1 + bc - ac + 1);
ll n = pnt.get(ac, bc, br, ar) + 2 * (br - ar + 1 + bc - ac + 1);
ll r = riv.get(ac, bc + 1, br + 1, ar);
ll x = (ac < x0 && x1 < bc && ar < y0 && br < y1;
ll res = m - n + 1 - r + x;
return res;
}