#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define C complex<ll>
#define X real()
#define Y imag()
ll w,h,n,c;
C g;
C camp[2005];
C tree[10005];
bool can[15];
int sign(ll x) {
if(x > 0) {
return 1;
} else if(x == 0) {
return 0;
} else {
return -1;
}
}
ll cross(C a, C b) { //-1 bal, 0 egyenes, 1 jobb A hoz képest a B
return sign(((a*conj(b)).Y));
}
bool isbad[2005][2005];
bool isbadv[2005];
int leftest[2005];
int rightest[2005];
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
ll gx,gy;
cin >> w >> h >> gx >> gy >> c;
g = {gx,gy};
for(int i = 0; i < c; i++) {
ll x,y;
cin >> x >> y;
camp[i] = {x,y};
}
cin >> n;
for(int i = 0; i < n; i++) {
ll x,y;
cin >> x >> y;
tree[i] = {x,y};
}
for(int i = 0; i < n; i++) {
bool bad = false;
int fix = (i == 0 ? 1 : 0);
for(int j = 0; j < n; j++) {
if(j == i || j == fix) {
continue;
}
if(cross(tree[fix]-tree[i],tree[j]-tree[i]) > 0) {
fix = j;
}
}
for(int j = 0; j < n; j++) {
if(j == i || j == fix) {
continue;
}
if(cross(tree[fix]-tree[i],tree[j]-tree[i]) > 0) {
bad = true;
}
}
if(bad) {
isbadv[i] = true;
} else {
leftest[i] = fix;
}
}
for(int i = 0; i < n; i++) {
if(isbadv[i]) {
continue;
}
int fix = (i == 0 ? 1 : 0);
for(int j = 0; j < n; j++) {
if(j == i || j == fix) {
continue;
}
if(cross(tree[fix]-tree[i],tree[j]-tree[i]) < 0) {
fix = j;
}
}
rightest[i] = fix;
//cout << i << " " << leftest[i] << " " << rightest[i] << "a\n";
}
vector<int> pr;
for(int i = 0; i < c; i++) {
bool good = true;
/* for(int x = 0; x < n; x++) {
for(int y = x+1; y < n; y++) {
if(isbad[x][y]) {
if(cross(tree[y]-tree[x],g-tree[x]) == -cross(tree[y]-tree[x],camp[i]-tree[x])) {
good = false;
}
}
}
}
// cout << good << "\n";
if(!good) {
continue;
}*/
for(int a2 = 0; a2 < n && good; a2++) {
if(!isbadv[a2]) {
int b1 = a2;
int a1 = leftest[a2];
int b2 = rightest[a2];
if(b2 == a1 || b2 == a2) {
continue;
}
if(cross(tree[a2]-tree[a1],camp[i]-tree[a1]) != -cross(tree[a2]-tree[a1],g-tree[a1]) && cross(tree[b2]-tree[b1],camp[i]-tree[b1]) != -cross(tree[b2]-tree[b1],g-tree[b1])) {
continue;
}
if(cross(tree[a2]-tree[a1],tree[b2]-tree[a1]) == -cross(tree[a2]-tree[a1],camp[i]-tree[a1]) && cross(tree[b2]-tree[b1],tree[a1]-tree[b1]) == -cross(tree[b2]-tree[b1],camp[i]-tree[b1])) {
good = false;
// cout << a1 << " " << b1 << " " << b2 << endl;
}
if(cross(tree[a2]-tree[a1],tree[b2]-tree[a1]) == -cross(tree[a2]-tree[a1],g-tree[a1]) && cross(tree[b2]-tree[b1],tree[a1]-tree[b1]) == -cross(tree[b2]-tree[b1],g-tree[b1])) {
good = false;
// cout << a1 << " " << b1 << " " << b2 << endl;
}
} else {
int left1 = -1;
C tocheck = -g;
for(int x = 0; x < n; x++) {
if(x == a2) {
continue;
}
if(cross(tocheck-tree[a2],tree[x]-tree[a2]) < 0) {
if(left1 == -1 || cross(tree[x]-tree[a2],tree[left1]-tree[a2]) < 0) {
left1 = x;
}
}
}
int left2 = -1;
tocheck = -camp[i];
for(int x = 0; x < n; x++) {
if(x == a2) {
continue;
}
if(cross(tocheck-tree[a2],tree[x]-tree[a2]) < 0) {
if(left2 == -1 || cross(tree[x]-tree[a2],tree[left2]-tree[a2]) < 0) {
left2 = x;
}
}
}
if(left1 != left2) {
good = false;
}
}
}
if(good) {
pr.push_back(i+1);
}
}
cout << pr.size() << "\n";
for(int el : pr) {
cout << el << " ";
}
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
2 ms |
376 KB |
Output isn't correct |
| 2 |
Correct |
3 ms |
376 KB |
Output is correct |
| 3 |
Incorrect |
3 ms |
392 KB |
Output isn't correct |
| 4 |
Incorrect |
3 ms |
468 KB |
Output isn't correct |
| 5 |
Incorrect |
3 ms |
544 KB |
Output isn't correct |
| 6 |
Incorrect |
3 ms |
544 KB |
Output isn't correct |
| 7 |
Correct |
2 ms |
544 KB |
Output is correct |
| 8 |
Incorrect |
3 ms |
544 KB |
Output isn't correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
2 ms |
544 KB |
Output is correct |
| 2 |
Correct |
2 ms |
544 KB |
Output is correct |
| 3 |
Correct |
3 ms |
548 KB |
Output is correct |
| 4 |
Correct |
3 ms |
548 KB |
Output is correct |
| 5 |
Correct |
4 ms |
548 KB |
Output is correct |
| 6 |
Correct |
4 ms |
548 KB |
Output is correct |
| 7 |
Correct |
3 ms |
748 KB |
Output is correct |
| 8 |
Correct |
2 ms |
748 KB |
Output is correct |
| 9 |
Correct |
2 ms |
748 KB |
Output is correct |
| 10 |
Correct |
2 ms |
748 KB |
Output is correct |
| 11 |
Correct |
3 ms |
748 KB |
Output is correct |
| 12 |
Correct |
3 ms |
748 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
2 ms |
748 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Execution timed out |
3012 ms |
748 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
