제출 #97201

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
97201		diamond_duke	무지개나라 (APIO17_rainbow)	C++11	100 / 100	1572 ms	167800 KiB

rainbow

#include "rainbow.h"
#include <algorithm>
#include <string>
#include <vector>
using ll = long long;
struct segT
{
	int rt[200005], lson[10000005], rson[10000005], sum[10000005], t_cnt = 0, lim;
	void modify(int &u, int v, int l, int r, int pos)
	{
		u = ++t_cnt;
		lson[u] = lson[v];
		rson[u] = rson[v];
		sum[u] = sum[v] + 1;
		if (l == r)
			return;
		int m = l + r >> 1;
		if (pos <= m)
			modify(lson[u], lson[v], l, m, pos);
		else
			modify(rson[u], rson[v], m + 1, r, pos);
	}
	int query(int u, int l, int r, int L, int R)
	{
		if (!u)
			return 0;
		if (L <= l && r <= R)
			return sum[u];
		int m = l + r >> 1, res = 0;
		if (L <= m)
			res += query(lson[u], l, m, L, R);
		if (m < R)
			res += query(rson[u], m + 1, r, L, R);
		return res;
	}
	int query(int l, int r, int L, int R)
	{
		if (l > r || L > R)
			return 0;
		return query(rt[r + 1], 0, lim, L, R) - query(rt[l], 0, lim, L, R);
	}
	inline void build(std::vector<int> *vec, int n, int m)
	{
		lim = m;
		for (int i = 0; i <= n; i++)
		{
			std::sort(vec[i].begin(), vec[i].end());
			vec[i].erase(std::unique(vec[i].begin(), vec[i].end()), vec[i].end());
			rt[i + 1] = rt[i];
			for (int x : vec[i])
				modify(rt[i + 1], rt[i + 1], 0, m, x);
		}
	}
} seg[4];
int row, col, mn_x, mn_y, mx_x, mx_y;
std::vector<int> vec[4][200005];
inline void add(int x, int y)
{
	vec[0][++x].push_back(++y);
	for (int i = 0; i < 2; i++)
	{
		vec[1][x - i].push_back(y);
		vec[2][x].push_back(y - i);
		for (int j = 0; j < 2; j++)
			vec[3][x - i].push_back(y - j);
	}
}
void init(int R, int C, int x, int y, int len, char *str)
{
	row = R;
	col = C;
	mn_x = mx_x = --x;
	mn_y = mx_y = --y;
	add(x, y);
	for (int i = 0; i < len; i++)
	{
		static constexpr int dx[] = { -1, 1, 0, 0}, dy[] = {0, 0, -1, 1};
		int d = std::string("NSWE").find(str[i]);
		x += dx[d];
		y += dy[d];
		mn_x = std::min(mn_x, x);
		mn_y = std::min(mn_y, y);
		mx_x = std::max(mx_x, x);
		mx_y = std::max(mx_y, y);
		add(x, y);
	}
	for (int i = 0; i < 4; i++)
		seg[i].build(vec[i], row, col);
}
int colour(int xl, int yl, int xr, int yr)
{
	xl--;
	xr--;
	yl--;
	yr--;
	ll ans = (ll)(xr - xl + 1) * (yr - yl + 1) - seg[0].query(xl + 1, xr + 1, yl + 1, yr + 1);
	ans -= (ll)(xr - xl) * (yr - yl + 1) - seg[1].query(xl + 1, xr, yl + 1, yr + 1);
	ans -= (ll)(xr - xl + 1) * (yr - yl) - seg[2].query(xl + 1, xr + 1, yl + 1, yr);
	ans += (ll)(xr - xl) * (yr - yl) - seg[3].query(xl + 1, xr, yl + 1, yr);
	return ans + (xl < mn_x && xr > mx_x && yl < mn_y && yr > mx_y);
}

컴파일 시 표준 에러 (stderr) 메시지

rainbow.cpp: In member function 'void segT::modify(int&, int, int, int, int)':
rainbow.cpp:17:13: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   int m = l + r >> 1;
           ~~^~~
rainbow.cpp: In member function 'int segT::query(int, int, int, int, int)':
rainbow.cpp:29:13: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   int m = l + r >> 1, res = 0;
           ~~^~~

• Subtask 1: 11 / 11
• Subtask 2: 12 / 12
• Subtask 3: 24 / 24
• Subtask 4: 27 / 27
• Subtask 5: 26 / 26