답안 #549150

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
549150	2022-04-15T10:21:48 Z	kingfran1907	SIR (COI15_sir)	C++14	51 / 100	1000 ms	6056 KB

sir

#include <bits/stdc++.h>
#define X first
#define Y second

using namespace std;
typedef long long llint;

const int maxn = 3e5+10;
const int base = 31337;
const int mod = 1e9+7;
const int inf = 0x3f3f3f3f;
const int logo = 20;
const int off = 1 << logo;
const int treesiz = off << 1;

int n, m;
pair<int, int> niz[maxn], ss[maxn];
vector< int > hul, hul2;
vector< pair<int, int> > hull;
bool bio[maxn];

llint ccw(pair<int, int> a, pair<int, int> b, pair<int, int> c) {
	return (llint)a.X * (b.Y - c.Y) + (llint)b.X * (c.Y - a.Y) + (llint)c.X * (a.Y - b.Y);
} 

int main() {
	scanf("%d", &n);
	for (int i = 0; i < n; i++) {
		int x, y;
		scanf("%d%d", &x, &y);
		niz[i] = {x, y};
	}

	scanf("%d", &m);
	for (int i = 0; i < m; i++) {
		int x, y;
		scanf("%d%d", &x, &y);
		ss[i] = {x, y};
	}

	sort(ss, ss + m);
	for (int i = 0; i < m; i++) {
		while (hul.size() >= 2 && ccw(ss[hul[hul.size() - 2]], ss[hul.back()], ss[i]) >= 0) 
			hul.pop_back();
		hul.push_back(i);
	}

	//printf("debug: \n");
	//for (int i = 0; i < hul.size(); i++) {
	//	printf("%d %d\n", ss[hul[i]].X, ss[hul[i]].Y);
	//}

	reverse(ss, ss + m);
	for (int i = 0; i < m; i++) {
		while (hul2.size() >= 2 && ccw(ss[hul2[hul2.size() - 2]], ss[hul2.back()], ss[i]) >= 0)
			hul2.pop_back();
		hul2.push_back(i);
	}

	//printf("debug: \n");
	//for (int i = 0; i < hul2.size(); i++) {
	//	printf("%d %d\n", ss[hul2[i]].X, ss[hul2[i]].Y);
	//}

	reverse(hul2.begin(), hul2.end());
	reverse(ss, ss + m);
	for (int tren : hul2) hul.push_back(m - 1 - tren);
	memset(bio, false, sizeof bio);
	for (int i = 0; i < hul.size(); i++) {
		if (!bio[hul[i]]) hull.push_back(ss[hul[i]]);
		bio[hul[i]] = true;
	}
	reverse(hull.begin(), hull.end());

	llint sol = 0;
	int ptr = 0;
	llint tren = 0;
	for (int i = 0; i < n; i++) {
		while (true) {
			tren += abs(ccw(niz[i], niz[ptr], niz[(ptr + 1) % n]));
			bool flag = true;
			for (int k = 0; k < hull.size(); k++) {
				if (ccw(niz[i], niz[(ptr + 1) % n], hull[k]) <= 0) flag = false;
			}

			//if (flag) printf("%d --> %d (%lld)\n", i, ptr, tren);
			if (flag) sol = max(sol, tren), ptr++, ptr %= n;
			else {
				tren -= abs(ccw(niz[i], niz[ptr], niz[(ptr + 1) % n]));
				break;
			}
		}
		tren -= abs(ccw(niz[i], niz[(i + 1) % n], niz[ptr]));
	}
	printf("%lld\n", sol);
	return 0;
}

Compilation message

sir.cpp: In function 'int main()':
sir.cpp:69:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   69 |  for (int i = 0; i < hul.size(); i++) {
      |                  ~~^~~~~~~~~~~~
sir.cpp:82: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]
   82 |    for (int k = 0; k < hull.size(); k++) {
      |                    ~~^~~~~~~~~~~~~
sir.cpp:27:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   27 |  scanf("%d", &n);
      |  ~~~~~^~~~~~~~~~
sir.cpp:30:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   30 |   scanf("%d%d", &x, &y);
      |   ~~~~~^~~~~~~~~~~~~~~~
sir.cpp:34:7: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   34 |  scanf("%d", &m);
      |  ~~~~~^~~~~~~~~~
sir.cpp:37:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   37 |   scanf("%d%d", &x, &y);
      |   ~~~~~^~~~~~~~~~~~~~~~

Subtask #1

12.0 / 12.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	596 KB	Output is correct
2	Correct	1 ms	596 KB	Output is correct
3	Correct	1 ms	596 KB	Output is correct
4	Correct	1 ms	596 KB	Output is correct

Subtask #2

39.0 / 39.0

#	결과	실행 시간	메모리	Grader output
1	Correct	7 ms	596 KB	Output is correct
2	Correct	4 ms	596 KB	Output is correct
3	Correct	17 ms	696 KB	Output is correct
4	Correct	1 ms	596 KB	Output is correct
5	Correct	4 ms	724 KB	Output is correct
6	Correct	2 ms	720 KB	Output is correct

Subtask #3

0 / 49.0

#	결과	실행 시간	메모리	Grader output
1	Execution timed out	1081 ms	6056 KB	Time limit exceeded
2	Halted	0 ms	0 KB	-