oj.uz

답안 #299615

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
299615 2020-09-15T10:43:13 Z square1001 늑대인간 (IOI18_werewolf) C++14
100 / 100
 2764 ms 159596 KB 
#include "werewolf.h"
#include <queue>
#include <string>
#include <vector>
#include <numeric>
#include <iostream>
#include <algorithm>
using namespace std;
class history {
public:
	int tl, tr, x;
	history() : tl(0), tr(0), x(-1) {};
	history(int tl_, int tr_, int x_) : tl(tl_), tr(tr_), x(x_) {};
};
class rectangle {
public:
	int xl, yl, xr, yr;
	rectangle() : xl(0), yl(0), xr(0), yr(0) {};
	rectangle(int xl_, int yl_, int xr_, int yr_) : xl(xl_), yl(yl_), xr(xr_), yr(yr_) {};
};
class query {
public:
	int y, x, tp;
	query() : y(0), x(0), tp(-1) {};
	query(int y_, int x_, int tp_) : y(y_), x(x_), tp(tp_) {};
};
std::vector<int> check_validity(int N, std::vector<int> X, std::vector<int> Y, std::vector<int> S, std::vector<int> E, std::vector<int> L, std::vector<int> R) {
	// step #1. setup
	int M = X.size(), Q = S.size();
	vector<vector<int> > GU(N), GD(N);
	for(int i = 0; i < M; ++i) {
		if(X[i] > Y[i]) {
			swap(X[i], Y[i]);
		}
		GU[X[i]].push_back(Y[i]);
		GD[Y[i]].push_back(X[i]);
	}
	// step #2. minimum-condition merge-tech
	vector<int> scomp(N, -1), slast(N, N - 1);
	vector<vector<int> > sgroup(N);
	vector<vector<history> > shistory(N);
	for(int i = 0; i < N; ++i) {
		scomp[i] = i;
		sgroup[i] = { i };
	}
	for(int i = N - 1; i >= 0; --i) {
		vector<int> g = { i };
		for(int j : GU[i]) {
			g.push_back(scomp[j]);
		}
		sort(g.begin(), g.end(), [&](int j, int k) { return sgroup[j].size() > sgroup[k].size(); });
		g.erase(unique(g.begin(), g.end()), g.end());
		for(int j : g) {
			if(j == g[0]) continue;
			for(int k : sgroup[j]) {
				shistory[k].push_back(history(i + 1, slast[k] + 1, j));
				scomp[k] = g[0];
				slast[k] = i;
			}
			sgroup[g[0]].insert(sgroup[g[0]].end(), sgroup[j].begin(), sgroup[j].end());
			sgroup[j].clear();
		}
	}
	for(int i = 0; i < N; ++i) {
		shistory[i].push_back(history(0, slast[i] + 1, scomp[i]));
		reverse(shistory[i].begin(), shistory[i].end());
	}
	// step #3. maximum-condition merge-tech
	vector<int> ecomp(N, -1), elast(N, 0);
	vector<vector<int> > egroup(N);
	vector<vector<history> > ehistory(N);
	for(int i = 0; i < N; ++i) {
		ecomp[i] = i;
		egroup[i] = { i };
	}
	for(int i = 0; i < N; ++i) {
		vector<int> g = { i };
		for(int j : GD[i]) {
			g.push_back(ecomp[j]);
		}
		sort(g.begin(), g.end(), [&](int j, int k) { return egroup[j].size() > egroup[k].size(); });
		g.erase(unique(g.begin(), g.end()), g.end());
		for(int j : g) {
			if(j == g[0]) continue;
			for(int k : egroup[j]) {
				ehistory[k].push_back(history(elast[k], i, j));
				ecomp[k] = g[0];
				elast[k] = i;
			}
			egroup[g[0]].insert(egroup[g[0]].end(), egroup[j].begin(), egroup[j].end());
			egroup[j].clear();
		}
	}
	for(int i = 0; i < N; ++i) {
		ehistory[i].push_back(history(elast[i], N, ecomp[i]));
	}
	// step #4. find component ID of S[i] and E[i]
	vector<int> sid(Q), eid(Q);
	for(int i = 0; i < Q; ++i) {
		for(history j : shistory[S[i]]) {
			if(j.tl <= L[i] && L[i] < j.tr) {
				sid[i] = j.x;
			}
		}
		for(history j : ehistory[E[i]]) {
			if(j.tl <= R[i] && R[i] < j.tr) {
				eid[i] = j.x;
			}
		}
	}
	// step #5. coordinate compression of (sid, eid)-pair
	vector<pair<int, int> > sepair(Q);
	for(int i = 0; i < Q; ++i) {
		sepair[i] = make_pair(sid[i], eid[i]);
	}
	sort(sepair.begin(), sepair.end());
	sepair.erase(unique(sepair.begin(), sepair.end()), sepair.end());
	int V = sepair.size();
	// step #6. calculate index list of (S[i], E[i])-pair
	vector<vector<int> > VI(V);
	for(int i = 0; i < Q; ++i) {
		int ptr = lower_bound(sepair.begin(), sepair.end(), make_pair(sid[i], eid[i])) - sepair.begin();
		VI[ptr].push_back(i);
	}
	// step #7. enumerate "valid (L, R)-range" for each (sid, eid)-pair
	vector<vector<rectangle> > VR(V);
	for(int i = 0; i < N; ++i) {
		for(history j : shistory[i]) {
			for(history k : ehistory[i]) {
				int ptr = lower_bound(sepair.begin(), sepair.end(), make_pair(j.x, k.x)) - sepair.begin();
				if(ptr != sepair.size() && sepair[ptr] == make_pair(j.x, k.x)) {
					VR[ptr].push_back(rectangle(j.tl, k.tl, j.tr, k.tr));
				}
			}
		}
	}
	// step #8. answer for each query!
	vector<int> ans(Q);
	for(int i = 0; i < V; ++i) {
		vector<int> cx;
		for(int j : VI[i]) {
			cx.push_back(L[j]);
		}
		sort(cx.begin(), cx.end());
		cx.erase(unique(cx.begin(), cx.end()), cx.end());
		vector<query> qs;
		for(int j : VI[i]) {
			int ptr = lower_bound(cx.begin(), cx.end(), L[j]) - cx.begin();
			qs.push_back(query(R[j], ptr, j));
		}
		for(rectangle j : VR[i]) {
			int pl = lower_bound(cx.begin(), cx.end(), j.xl) - cx.begin();
			int pr = lower_bound(cx.begin(), cx.end(), j.xr) - cx.begin();
			qs.push_back(query(j.yl, pl, -1));
			qs.push_back(query(j.yl, pr, -2));
			qs.push_back(query(j.yr, pl, -2));
			qs.push_back(query(j.yr, pr, -1));
		}
		sort(qs.begin(), qs.end(), [](const query& q1, const query& q2) {
			return q1.y != q2.y ? q1.y < q2.y : q1.tp < q2.tp;
		});
		int CS = cx.size();
		vector<int> bit(CS + 1);
		for(query j : qs) {
			if(j.tp == -1) {
				for(int k = j.x + 1; k <= CS; k += k & (-k)) {
					++bit[k];
				}
			}
			else if(j.tp == -2) {
				for(int k = j.x + 1; k <= CS; k += k & (-k)) {
					--bit[k];
				}
			}
			else {
				int sum = 0;
				for(int k = j.x + 1; k >= 1; k -= k & (-k)) {
					sum += bit[k];
				}
				if(sum > 0) {
					ans[j.tp] = 1;
				}
			}
		}
	}
	return ans;
}

Compilation message

werewolf.cpp: In function 'std::vector<int> check_validity(int, std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>, std::vector<int>)':
werewolf.cpp:131:12: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  131 |     if(ptr != sepair.size() && sepair[ptr] == make_pair(j.x, k.x)) {
      |        ~~~~^~~~~~~~~~~~~~~~

Subtask #1
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 1 ms 512 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 1 ms 512 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 13 ms 2176 KB Output is correct
11 Correct 13 ms 2244 KB Output is correct
12 Correct 18 ms 2560 KB Output is correct
13 Correct 14 ms 2176 KB Output is correct
14 Correct 13 ms 2304 KB Output is correct
15 Correct 14 ms 2292 KB Output is correct

Subtask #3
34.0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2764 ms 159596 KB Output is correct
2 Correct 927 ms 110428 KB Output is correct
3 Correct 1032 ms 121864 KB Output is correct
4 Correct 1512 ms 145372 KB Output is correct
5 Correct 1649 ms 150052 KB Output is correct
6 Correct 2262 ms 159068 KB Output is correct
7 Correct 2438 ms 153368 KB Output is correct
8 Correct 829 ms 110372 KB Output is correct
9 Correct 864 ms 119228 KB Output is correct
10 Correct 1123 ms 129956 KB Output is correct
11 Correct 1259 ms 132944 KB Output is correct
12 Correct 1411 ms 138200 KB Output is correct
13 Correct 949 ms 123740 KB Output is correct
14 Correct 952 ms 124196 KB Output is correct
15 Correct 944 ms 124476 KB Output is correct
16 Correct 932 ms 124892 KB Output is correct
17 Correct 2363 ms 150192 KB Output is correct

Subtask #4
51.0 / 51.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 1 ms 512 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 13 ms 2176 KB Output is correct
11 Correct 13 ms 2244 KB Output is correct
12 Correct 18 ms 2560 KB Output is correct
13 Correct 14 ms 2176 KB Output is correct
14 Correct 13 ms 2304 KB Output is correct
15 Correct 14 ms 2292 KB Output is correct
16 Correct 2764 ms 159596 KB Output is correct
17 Correct 927 ms 110428 KB Output is correct
18 Correct 1032 ms 121864 KB Output is correct
19 Correct 1512 ms 145372 KB Output is correct
20 Correct 1649 ms 150052 KB Output is correct
21 Correct 2262 ms 159068 KB Output is correct
22 Correct 2438 ms 153368 KB Output is correct
23 Correct 829 ms 110372 KB Output is correct
24 Correct 864 ms 119228 KB Output is correct
25 Correct 1123 ms 129956 KB Output is correct
26 Correct 1259 ms 132944 KB Output is correct
27 Correct 1411 ms 138200 KB Output is correct
28 Correct 949 ms 123740 KB Output is correct
29 Correct 952 ms 124196 KB Output is correct
30 Correct 944 ms 124476 KB Output is correct
31 Correct 932 ms 124892 KB Output is correct
32 Correct 2363 ms 150192 KB Output is correct
33 Correct 1723 ms 137516 KB Output is correct
34 Correct 405 ms 27280 KB Output is correct
35 Correct 1339 ms 120052 KB Output is correct
36 Correct 2011 ms 146432 KB Output is correct
37 Correct 1410 ms 122192 KB Output is correct
38 Correct 1831 ms 139932 KB Output is correct
39 Correct 1456 ms 128072 KB Output is correct
40 Correct 1373 ms 132984 KB Output is correct
41 Correct 1122 ms 110740 KB Output is correct
42 Correct 1283 ms 121704 KB Output is correct
43 Correct 1132 ms 110600 KB Output is correct
44 Correct 1187 ms 111856 KB Output is correct
45 Correct 957 ms 109380 KB Output is correct
46 Correct 1033 ms 113524 KB Output is correct
47 Correct 954 ms 117476 KB Output is correct
48 Correct 921 ms 124864 KB Output is correct
49 Correct 938 ms 124068 KB Output is correct
50 Correct 911 ms 117716 KB Output is correct
51 Correct 1238 ms 129060 KB Output is correct
52 Correct 1296 ms 123436 KB Output is correct