제출 #725121

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
725121		QwertyPi	Rectangles (IOI19_rect)	C++14	0 / 100	2137 ms	724904 KiB

rect

#include "rect.h"
#include <bits/stdc++.h>
#define fi first
#define se second
#define pii pair<int, int>
using namespace std;
const int N = 2500 + 11;
vector<pii> x[N], y[N];
 
struct DSU{
	int dsu[N], l[N], r[N];
	void init(int n){
		for(int i = 0; i <= n + 2; i++) dsu[i] = l[i] = r[i] = i;
	}
	int root(int x){
		if(x == dsu[x]) return x;
		return dsu[x] = root(dsu[x]);
	}
	void join(int x, int y){
		x = root(x), y = root(y);
		if(x == y) return;
		dsu[y] = x;
		l[x] = min(l[x], l[y]);
		r[x] = max(r[x], r[y]);
	}
} dsu;
 
int at(const vector<int>& v, int idx){
	if(idx < 0 || idx >= v.size()) return -(1 << 30);
	return v[idx];
}
 
vector<pii> build(const vector<int>& v){
	vector<pii> res;
	vector<pii> vp; int n = v.size();
	for(int i = 0; i < n; i++){
		vp.push_back({v[i], i});
	}
	sort(vp.begin(), vp.end());
	dsu.init(n);
	for(auto i : vp){
		dsu.join(i.se, i.se + 1);
		int rt = dsu.root(i.se);
		int b_l = dsu.l[rt], b_r = dsu.r[rt] - 1;
		if(at(v, b_l - 1) > i.fi && at(v, b_r + 1) > i.fi){
			res.push_back({b_l, b_r});
		}
	}
	return res;
}
 
 
struct Rect{
	int x1, x2, y1, y2;
	void pr() { printf("%d %d %d %d\n", x1, x2, y1, y2); }
	friend Rect operator+ (const Rect& a, const Rect& b){
		return {max(a.x1, b.x1), min(a.x2, b.x2), max(a.y1, b.y1), min(a.y2, b.y2)};
	}
};
 
long long ans = 0;
 
struct BIT2D{
    int bit[N][N];
    void add(int x, int y, int v){
        x++; y++;
        for(int i = x; i < N; i += i & -i){
            for(int j = y; j < N; j += j & -j){
                bit[i][j] += v;
            }
        }
    }
    void qry(int x, int y){
        x++; y++;
        for(int i = x; i; i -= i & -i){
            for(int j = y; j; j -= j & -j){
                ans += bit[i][j];
            }
        }
    }
} bit2;

void split(const vector<pii>& a, vector<pii>& al, vector<pii>& ar, int xm){
    for(auto r : a) {
        if(r.fi / N <= xm) al.push_back(r);
        else ar.push_back(r);
    }
}

void calc(const vector<pii>& ad, const vector<pii>& qr){
    int l = 0, r = 0;
    while(l + r < ad.size() + qr.size()){
        if(r == qr.size() || l != ad.size() && ad[l].fi % N <= qr[r].fi % N){
            bit2.add(ad[l].se / N, ad[l].se % N, 1); l++;
        }else{
            bit2.qry(qr[r].se / N, qr[r].se % N); r++;
        }
    }
    for(int l = 0; l < ad.size(); l++){
        bit2.add(ad[l].se / N, ad[l].se % N, -1);
    }
}
 
void solve(int xl, int xr, vector<pii>& A, vector<pii>& B) {
    if(xl == xr){
        calc(A, B);
    }else{
        int xm = (xl + xr) / 2;
        vector<pii> AL, AR, BL, BR; split(A, AL, AR, xm), split(B, BL, BR, xm);
        solve(xl, xm, AL, BL), solve(xm + 1, xr, AR, BR), calc(AL, BR);
        
    }
}
 
vector<int> xs[N * N], ys[N * N];
vector<Rect> xr, yr;
vector<pair<int, int>> xt[N * N], yt[N * N];
vector<pair<int, int>> h, k;
long long count_rectangles(std::vector<std::vector<int>> a) {
	int n = a.size(), m = a[0].size();
	for(int i = 0; i < n; i++){
		vector<int> v; for(int j = 0; j < m; j++) v.push_back(a[i][j]);
		x[i] = build(v);
		for(pii p : x[i]){
			xs[p.fi * m + p.se].push_back(i);
		}
	}
	for(int i = 0; i < m * m; i++){
		int x1 = i / m, x2 = i % m; if(x1 > x2) continue;
		int y1 = -2, y2 = -2;
		for(auto j : xs[i]){
			if(j == y2 + 1){
				y2++;
			}else{
				if(y1 != -2) xr.push_back({x1, x2, y1, y2});
				y1 = y2 = j;
			}
		}
		if(y1 != -2) xr.push_back({x1, x2, y1, y2});
	}
	for(int j = 0; j < m; j++){
		vector<int> v; for(int i = 0; i < n; i++) v.push_back(a[i][j]);
		y[j] = build(v);
		for(pii p : y[j]){
			ys[p.fi * n + p.se].push_back(j);
		}
	}
	for(int i = 0; i < n * n; i++){
		int y1 = i / n, y2 = i % n; if(y1 > y2) continue;
		int x1 = -2, x2 = -2;
		for(auto j : ys[i]){
			if(j == x2 + 1){
				x2++;
			}else{
				if(x1 != -2) yr.push_back({x1, x2, y1, y2});
				x1 = x2 = j;
			}
		}
		if(x1 != -2) yr.push_back({x1, x2, y1, y2});
	}
	for(auto& r1 : xr) r1.x1 = m - 1 - r1.x1, r1.y2 = n - 1 - r1.y2;
	for(auto& r2 : yr) r2.x1 = m - 1 - r2.x1, r2.y2 = n - 1 - r2.y2;

	for(auto& r1 : xr) {
		xt[r1.x2].push_back({r1.x1 * N + r1.x2, r1.y1 * N + r1.y2});
	}
	for(int i = 0; i < m; i++){
		for(auto& r : xt[i]){
			h.push_back(r);
		}
	}
	
	for(auto& r1 : yr) {
		yt[r1.x2].push_back({r1.x1 * N + r1.x2, r1.y1 * N + r1.y2});
	}
	for(int i = 0; i < n; i++){
		for(auto& r : yt[i]){
			k.push_back(r);
		}
	}

	solve(0, m - 1, h, k);
	return ans;
}

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

rect.cpp: In function 'int at(const std::vector<int>&, int)':
rect.cpp:29:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   29 |  if(idx < 0 || idx >= v.size()) return -(1 << 30);
      |                ~~~~^~~~~~~~~~~
rect.cpp: In function 'void calc(const std::vector<std::pair<int, int> >&, const std::vector<std::pair<int, int> >&)':
rect.cpp:92:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   92 |     while(l + r < ad.size() + qr.size()){
      |           ~~~~~~^~~~~~~~~~~~~~~~~~~~~~~
rect.cpp:93:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   93 |         if(r == qr.size() || l != ad.size() && ad[l].fi % N <= qr[r].fi % N){
      |            ~~^~~~~~~~~~~~
rect.cpp:93:32: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   93 |         if(r == qr.size() || l != ad.size() && ad[l].fi % N <= qr[r].fi % N){
      |                              ~~^~~~~~~~~~~~
rect.cpp:93:45: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
   93 |         if(r == qr.size() || l != ad.size() && ad[l].fi % N <= qr[r].fi % N){
      |                              ~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
rect.cpp:99:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   99 |     for(int l = 0; l < ad.size(); l++){
      |                    ~~^~~~~~~~~~~

• Subtask 1: 0 / 8
• Subtask 2: 0 / 7
• Subtask 3: 0 / 12
• Subtask 4: 0 / 22
• Subtask 5: 0 / 10
• Subtask 6: 0 / 13
• Subtask 7: 0 / 28