#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define getchar_unlocked getchar
#define putchar_unlocked putchar
int in() {
char c=0;
while(c<'0'||c>'9')
c=getchar_unlocked();
int r=0;
while(c>='0'&&c<='9') {
r=r*10+c-'0';
c=getchar_unlocked();
}
return r;
}
void out(int x) {
int c=0, r=0;
for(; x%10==0; ++c, x/=10);
for(; x; x/=10)
r=r*10+x%10;
for(; r; r/=10)
putchar_unlocked(r%10+'0');
while(c--)
putchar_unlocked('0');
}
const int mxN=2e5;
int n, b[mxN], c[mxN+1], e1[mxN], e2[mxN], a1, t[2][mxN], tp[mxN];
array<ll, 2> a[mxN+1];
vector<array<int, 2>> r[18];
bool ans[mxN];
bool cw(int x, int y, int z) {
return (a[z][1]-a[x][1])*(a[y][0]-a[x][0])<(a[y][1]-a[x][1])*(a[z][0]-a[x][0]);
}
bool pcmp(const int &i, const int &j) {
return a[i][1]*a[j][0]<a[j][1]*a[i][0];
}
bool scmp(const int &i, const int &j) {
if(i<0)
return 0;
if(j<0)
return 1;
if(e1[i]==e1[j])
return c[e2[i]]<c[e2[j]]?!cw(e1[j], e2[j], e2[i]):cw(e1[i], e2[i], e2[j]);
return c[e1[i]]<c[e1[j]]?cw(e1[i], e2[i], e1[j]):!cw(e1[j], e2[j], e1[i]);
}
int main() {
n=in();
for(int i=0; i<n; ++i)
a[i]={in(), in()};
a[n]=a[0];
iota(b, b+n, 0);
sort(b, b+n, pcmp);
memset(tp, -1, 4*n);
for(int i=0, j=0; i<n; i=j) {
for(; j<n&&a[b[i]][1]*a[b[j]][0]==a[b[j]][1]*a[b[i]][0]; ++j) {
c[b[j]]=i;
if(tp[i]<0||a[b[j]][0]+a[b[j]][1]<a[tp[i]][0]+a[tp[i]][1])
tp[i]=b[j];
}
}
c[n]=c[0];
for(int i=0; i<n; ++i) {
e1[i]=i;
e2[i]=i+1;
if(c[e2[i]]<c[e1[i]])
swap(e1[i], e2[i]);
if(c[e1[i]]<c[e2[i]]) {
int k=31-__builtin_clz(c[e2[i]]-c[e1[i]]);
r[k].push_back({c[e1[i]], i});
r[k].push_back({c[e2[i]]-(1<<k), i});
}
}
memset(t[1], -1, 4*n);
for(int i=17; ~i; --i) {
for(array<int, 2> a : r[i])
t[i&1][a[0]]=min(a[1], t[i&1][a[0]], scmp);
if(i) {
memset(t[i&1^1], -1, 4*n);
for(int j=0; j<=n-(1<<i); ++j) {
t[i&1^1][j]=min(t[i&1][j], t[i&1^1][j], scmp);
t[i&1^1][j+(1<<i-1)]=min(t[i&1][j], t[i&1^1][j+(1<<i-1)], scmp);
}
}
}
for(int i=0; i<n; ++i)
if(~tp[i]&&(t[0][i]<0||!cw(e1[t[0][i]], e2[t[0][i]], tp[i])))
ans[tp[i]]=1;
for(int i=0; i<n; ++i)
a1+=ans[i];
out(a1);
putchar_unlocked('\n');
for(int i=0; i<n; ++i) {
if(ans[i]) {
out(i+1);
putchar_unlocked(' ');
}
}
}
Compilation message
circuit.cpp: In function 'int main()':
circuit.cpp:87:14: warning: suggest parentheses around arithmetic in operand of '^' [-Wparentheses]
memset(t[i&1^1], -1, 4*n);
~^~
circuit.cpp:89:8: warning: suggest parentheses around arithmetic in operand of '^' [-Wparentheses]
t[i&1^1][j]=min(t[i&1][j], t[i&1^1][j], scmp);
~^~
circuit.cpp:89:35: warning: suggest parentheses around arithmetic in operand of '^' [-Wparentheses]
t[i&1^1][j]=min(t[i&1][j], t[i&1^1][j], scmp);
~^~
circuit.cpp:90:8: warning: suggest parentheses around arithmetic in operand of '^' [-Wparentheses]
t[i&1^1][j+(1<<i-1)]=min(t[i&1][j], t[i&1^1][j+(1<<i-1)], scmp);
~^~
circuit.cpp:90:21: warning: suggest parentheses around '-' inside '<<' [-Wparentheses]
t[i&1^1][j+(1<<i-1)]=min(t[i&1][j], t[i&1^1][j+(1<<i-1)], scmp);
~^~
circuit.cpp:90:44: warning: suggest parentheses around arithmetic in operand of '^' [-Wparentheses]
t[i&1^1][j+(1<<i-1)]=min(t[i&1][j], t[i&1^1][j+(1<<i-1)], scmp);
~^~
circuit.cpp:90:57: warning: suggest parentheses around '-' inside '<<' [-Wparentheses]
t[i&1^1][j+(1<<i-1)]=min(t[i&1][j], t[i&1^1][j+(1<<i-1)], scmp);
~^~
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
2 ms |
384 KB |
Output is correct |
| 2 |
Correct |
3 ms |
512 KB |
Output is correct |
| 3 |
Correct |
3 ms |
640 KB |
Output is correct |
| 4 |
Correct |
3 ms |
640 KB |
Output is correct |
| 5 |
Correct |
6 ms |
1024 KB |
Output is correct |
| 6 |
Correct |
6 ms |
1024 KB |
Output is correct |
| 7 |
Correct |
12 ms |
1792 KB |
Output is correct |
| 8 |
Correct |
6 ms |
896 KB |
Output is correct |
| 9 |
Correct |
5 ms |
1024 KB |
Output is correct |
| 10 |
Correct |
7 ms |
1024 KB |
Output is correct |
| 11 |
Correct |
7 ms |
1152 KB |
Output is correct |
| 12 |
Correct |
9 ms |
1792 KB |
Output is correct |
| 13 |
Correct |
18 ms |
2440 KB |
Output is correct |
| 14 |
Correct |
17 ms |
2944 KB |
Output is correct |
| 15 |
Correct |
21 ms |
3572 KB |
Output is correct |
| 16 |
Correct |
42 ms |
6532 KB |
Output is correct |
| 17 |
Correct |
67 ms |
6632 KB |
Output is correct |
| 18 |
Correct |
89 ms |
12696 KB |
Output is correct |
| 19 |
Correct |
88 ms |
12768 KB |
Output is correct |
| 20 |
Execution timed out |
165 ms |
12868 KB |
Time limit exceeded |
