#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define f first
#define s second
const int maxn = 1 << 17;
struct line {
int a, b;
};
int n, k;
pair<pii, int> p[maxn];
pii org[maxn];
int arr[maxn];
vector<line> add[maxn];
vector<line> rem[maxn];
vector<pair<pii, int> > query[maxn];
vector<int> ans;
pii zero;
ll ccw(const pii &a, const pii &b, const pii &c) {
return ll(a.f) * (b.s - c.s) + ll(b.f) * (c.s - a.s) + ll(c.f) * (a.s - b.s);
}
bool comp(pair<pii, int> a, pair<pii, int> b) {
ll c = ccw(zero, a.f, b.f);
if(c == 0)
return a.s < b.s;
return c > 0;
}
// bool operator==(line x, line y) {
// return org[x.a] == org[y.a] && org[x.b] == org[y.b];
// }
bool operator<(line x, line y) {
const pii &xa = org[x.a];
const pii &xb = org[x.b];
const pii &ya = org[y.a];
const pii &yb = org[y.b];
if(xa == ya && xb == yb)
return false;
ll sum = ccw(xa, ya, xb) + ccw(xb, ya, yb);
if(!sum) {
if(xa.s == ya.s)
return xa.f < ya.f;
return xa.f < ya.f;
}
return sum > 0;
}
void sweep() {
// multiset<line> st;
for(int t = 1; t <= k; t++) {
for(const line &i : add[t]) {
// st.insert(i);
}
// if(!st.empty()) {
// line f = *st.begin();
// auto mnm = *min_element(query[t].begin(), query[t].end());
// if(ccw(org[f.a], org[f.b], mnm.f) == 0) {
// ans.push_back(mnm.s);
// }
// }
for(const line &i : rem[t]) {
// auto it = st.find(i);
// st.erase(it);
}
}
}
void add_edge(int i, int j, int x, int y) {
if(i < j) {
add[i].push_back(line{x, y});
rem[j].push_back(line{x, y});
} else {
add[j].push_back(line{y, x});
rem[i].push_back(line{y, x});
}
}
void compress() {
sort(p, p + n, comp);
for(int i = 0; i < n; i++) {
if(i == 0 || ccw(pii(0, 0), p[i].f, p[i - 1].f))
k++;
arr[p[i].s] = k;
query[k].push_back(p[i]);
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cin >> n;
for(int i = 0; i < n; i++) {
pii tmp;
cin >> tmp.f >> tmp.s;
p[i].f = tmp;
p[i].s = i;
org[i] = p[i].f;
}
compress();
for(int i = 0; i < n - 1; i++)
add_edge(arr[i], arr[i + 1], i, i + 1);
add_edge(arr[n - 1], arr[0], n - 1, 0);
sweep();
cout << ans.size() << endl;
sort(ans.begin(), ans.end());
for(int i : ans) {
cout << i + 1 << " ";
}
cout << endl;
return 0;
}
Compilation message
circuit.cpp: In function 'void sweep()':
circuit.cpp:69:19: warning: unused variable 'i' [-Wunused-variable]
for(const line &i : add[t]) {
^
circuit.cpp:83:19: warning: unused variable 'i' [-Wunused-variable]
for(const line &i : rem[t]) {
^
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
9 ms |
9596 KB |
Output isn't correct |
| 2 |
Incorrect |
10 ms |
9700 KB |
Output isn't correct |
| 3 |
Incorrect |
11 ms |
10032 KB |
Output isn't correct |
| 4 |
Incorrect |
14 ms |
10288 KB |
Output isn't correct |
| 5 |
Incorrect |
19 ms |
10604 KB |
Output isn't correct |
| 6 |
Incorrect |
17 ms |
10608 KB |
Output isn't correct |
| 7 |
Incorrect |
27 ms |
11632 KB |
Output isn't correct |
| 8 |
Incorrect |
15 ms |
11632 KB |
Output isn't correct |
| 9 |
Incorrect |
16 ms |
11632 KB |
Output isn't correct |
| 10 |
Incorrect |
24 ms |
11632 KB |
Output isn't correct |
| 11 |
Incorrect |
18 ms |
11632 KB |
Output isn't correct |
| 12 |
Incorrect |
23 ms |
11836 KB |
Output isn't correct |
| 13 |
Incorrect |
32 ms |
12608 KB |
Output isn't correct |
| 14 |
Incorrect |
39 ms |
13884 KB |
Output isn't correct |
| 15 |
Incorrect |
47 ms |
14892 KB |
Output isn't correct |
| 16 |
Incorrect |
76 ms |
19996 KB |
Output isn't correct |
| 17 |
Execution timed out |
104 ms |
19996 KB |
Time limit exceeded |
| 18 |
Runtime error |
63 ms |
27116 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
| 19 |
Runtime error |
71 ms |
29576 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
| 20 |
Runtime error |
54 ms |
29576 KB |
Execution killed with signal 11 (could be triggered by violating memory limits) |
