oj.uz

Submission #100938

# Submission time Handle Problem Language Result Execution time Memory
100938 2019-03-15T10:39:30 Z E869120 The Forest of Fangorn (CEOI14_fangorn) C++14
80 / 100
 3000 ms 32812 KB 
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
#pragma warning (disable: 4996)

struct Point {
	int px, py;
};

int shogen(Point p1) {
	if (p1.py >= 0) return 1;
	return 2;
}

bool operator<(const Point &a1, const Point &a2) {
	int v1 = shogen(a1), v2 = shogen(a2);
	if (v1 < v2) return true;
	if (v1 > v2) return false;

	if (1LL * a1.px*a2.py > 1LL * a1.py*a2.px) return true;
	return false;
}

vector<Point>V[2009]; int H, W, sx, sy, N, C, ex[10009], ey[10009]; vector<int>vec;
Point G[2009];

bool solve(long long cx, long long cy, int ty) {
	for (int i = 1; i <= N; i++) {
		int pos1 = lower_bound(V[i].begin(), V[i].end(), Point{ cx - G[i].px, cy - G[i].py }) - V[i].begin();
		if (pos1 == N - 1) pos1 = 0;

		if (ty == 1 && vec[i - 1] != pos1) return false;
		if (ty == 0) vec.push_back(pos1);
	}
	return true;
}

int main() {
	scanf("%d%d%d%d%d", &H, &W, &sx, &sy, &C);
	for (int i = 1; i <= C; i++) scanf("%d%d", &ex[i], &ey[i]);
	scanf("%d", &N);
	for (int i = 1; i <= N; i++) scanf("%d%d", &G[i].px, &G[i].py);
	for (int i = 1; i <= N; i++) {
		for (int j = 1; j <= N; j++) {
			if (i == j) continue;
			V[i].push_back(Point{ G[i].px - G[j].px, G[i].py - G[j].py });
		}
		sort(V[i].begin(), V[i].end());
	}

	solve(sx, sy, 0);

	vector<int>res;
	for (int i = 1; i <= C; i++) {
		bool vec2 = solve(ex[i], ey[i], 1);
		if (vec2 == true) res.push_back(i);
	}
	printf("%d\n", (int)res.size());
	for (int i = 0; i < res.size(); i++) { if (i) printf(" "); printf("%d", res[i]); }
	if (res.size() != 0) printf("\n");
	return 0;
}

Compilation message

fangorn.cpp:5:0: warning: ignoring #pragma warning  [-Wunknown-pragmas]
 #pragma warning (disable: 4996)
 
fangorn.cpp: In function 'bool solve(long long int, long long int, int)':
fangorn.cpp:30:62: warning: narrowing conversion of '(cx - ((long long int)G[i].Point::px))' from 'long long int' to 'int' inside { } [-Wnarrowing]
   int pos1 = lower_bound(V[i].begin(), V[i].end(), Point{ cx - G[i].px, cy - G[i].py }) - V[i].begin();
                                                           ~~~^~~~~~~~~
fangorn.cpp:30:76: warning: narrowing conversion of '(cy - ((long long int)G[i].Point::py))' from 'long long int' to 'int' inside { } [-Wnarrowing]
   int pos1 = lower_bound(V[i].begin(), V[i].end(), Point{ cx - G[i].px, cy - G[i].py }) - V[i].begin();
                                                                         ~~~^~~~~~~~~
fangorn.cpp: In function 'int main()':
fangorn.cpp:60:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < res.size(); i++) { if (i) printf(" "); printf("%d", res[i]); }
                  ~~^~~~~~~~~~~~
fangorn.cpp:40:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d%d%d%d", &H, &W, &sx, &sy, &C);
  ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
fangorn.cpp:41:36: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for (int i = 1; i <= C; i++) scanf("%d%d", &ex[i], &ey[i]);
                               ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
fangorn.cpp:42:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &N);
  ~~~~~^~~~~~~~~~
fangorn.cpp:43:36: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for (int i = 1; i <= N; i++) scanf("%d%d", &G[i].px, &G[i].py);
                               ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 3 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 3 ms 512 KB Output is correct
8 Correct 3 ms 384 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 428 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 3 ms 512 KB Output is correct
4 Correct 3 ms 384 KB Output is correct
5 Correct 3 ms 512 KB Output is correct
6 Correct 4 ms 640 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 3 ms 384 KB Output is correct
9 Correct 3 ms 512 KB Output is correct
10 Correct 5 ms 768 KB Output is correct
11 Correct 4 ms 768 KB Output is correct
12 Correct 5 ms 768 KB Output is correct

Subtask #3
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 3 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 103 ms 8440 KB Output is correct
5 Correct 22 ms 2304 KB Output is correct
6 Correct 365 ms 32760 KB Output is correct

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 543 ms 32532 KB Output is correct
2 Execution timed out 3086 ms 32812 KB Time limit exceeded
3 Halted 0 ms 0 KB -