#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define enl printf("\n")
#define case(t) printf("Case #%d: ", (t))
#define ni(n) scanf("%d", &(n))
#define nl(n) scanf("%I64d", &(n))
#define nai(a, n) for (int i = 0; i < (n); i++) ni(a[i])
#define nal(a, n) for (int i = 0; i < (n); i++) nl(a[i])
#define pri(n) printf("%d\n", (n))
#define prl(n) printf("%I64d\n", (n))
#define pii pair<int, int>
#define pll pair<long long, long long>
#define vii vector<pii>
#define vi vector<int>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef cc_hash_table<int,int,hash<int>> ht;
const double pi = acos(-1);
const int MOD = 1e9 + 7;
const int INF = 1e9 + 7;
const int MAXN = 1e6 + 5;
const double eps = 1e-9;
pair<pii,int> a[MAXN];
pii b[MAXN];
int n;
bitset<MAXN> ans, vis;
int sgn(int x, int y, int z)
{
ll ret = 1ll*(ll)(b[y].fi - b[x].fi) * (b[z].se - b[x].se) - 1ll*(ll)(b[z].fi - b[x].fi) * (b[y].se - b[x].se);
if (ret == 0)
return 0;
return ret > 0 ? 1 : -1;
}
bool dist(int l, int r)
{
return b[l].fi+b[l].se < b[r].fi+b[r].se;
}
int nx(int i, int d)
{
i += d;
if (i > n) return 1;
if (i < 1) return n;
return i;
}
int pr(int i, int d)
{
i -= d;
if (i > n) return 1;
if (i < 1) return n;
return i;
}
int d = 1;
struct cmp
{
bool operator()(int lh, int rh)
{
if (lh == rh)
return false;
if (sgn(0, lh, rh)>=0)
return (sgn(lh,nx(lh,d),rh)<=0);
else
return (sgn(rh,nx(rh,d),lh)>0);
}
};
set<int, cmp> q;
int p[MAXN];
int main()
{
ni(n);
int first = 1, last = 1;
b[0] = {0, 0};
for (int i = 1; i <= n; i++)
{
ni(b[i].fi), ni(b[i].se);
if (i == 1)
continue;
int o1 = sgn(0, first, i);
if (o1<0||o1==0&&b[i].fi<b[first].fi)
first = i;
o1 = sgn(0, last, i);
if (o1>0||o1==0&&b[i].fi<b[last].fi)
last = i;
}
int x1 = first + 1; if (x1 > n) x1 = 1;
int x2 = first - 1; if (x2 == 0) x2 = n;
if (sgn(first, x1, x2) < 0)
d = 1;
else
d = -1;
if (nx(first, d) == last)
{
pri(2);
if (nx(first, 1) < first)
printf("%d %d\n", nx(first, 1), first);
else
printf("%d %d\n", first, nx(first, 1));
return 0;
}
int m = 1, k = 0;
for (int i = first; i != nx(last, d); i = nx(i, d))
p[k++] = i;
sort(p, p + k, [](int l, int r) -> bool
{
int o = sgn(0, l, r);
if (o == 0)
return dist(l, r);
return o > 0 ? true : false;
});
ans[first] = 1;
vis[first] = 1;
q.insert(first);
for (int i = 1; i < k; i++)
{
int a1 = p[i];
int a2 = pr(p[i], d);
if (vis[a2])
{
if (*q.begin() == a2 && sgn(0, a1, p[i-1]) != 0)
ans[a1] = 1, m++;
q.erase(a2);
vis[a2] = false;
}
a2 = nx(p[i], d);
if (sgn(0, a1, a2) > 0)
{
vis[a1] = 1;
q.insert(a1);
if (*q.begin() == a1 && sgn(0, a1, p[i-1]) != 0 && !ans[a1])
ans[a1] = 1, m++;
}
}
if (!ans[last])
ans[last] = 1, m++;
pri(m);
for (int i = 1; i <= n; i++)
if (ans[i])
printf("%d ", i);
enl;
return 0;
}
Compilation message
circuit.cpp: In function 'int main()':
circuit.cpp:91:24: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
if (o1<0||o1==0&&b[i].fi<b[first].fi)
^
circuit.cpp:94:24: warning: suggest parentheses around '&&' within '||' [-Wparentheses]
if (o1>0||o1==0&&b[i].fi<b[last].fi)
^
circuit.cpp:7:20: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
#define ni(n) scanf("%d", &(n))
~~~~~^~~~~~~~~~~~
circuit.cpp:82:5: note: in expansion of macro 'ni'
ni(n);
^~
circuit.cpp:87:20: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
ni(b[i].fi), ni(b[i].se);
^
circuit.cpp:87:20: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
circuit.cpp:106:9: warning: assuming signed overflow does not occur when assuming that (X + c) < X is always false [-Wstrict-overflow]
if (nx(first, 1) < first)
^~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
3 ms |
248 KB |
Output is correct |
| 2 |
Correct |
4 ms |
484 KB |
Output is correct |
| 3 |
Correct |
4 ms |
484 KB |
Output is correct |
| 4 |
Incorrect |
4 ms |
588 KB |
Output isn't correct |
| 5 |
Correct |
10 ms |
696 KB |
Output is correct |
| 6 |
Correct |
10 ms |
696 KB |
Output is correct |
| 7 |
Correct |
14 ms |
844 KB |
Output is correct |
| 8 |
Correct |
7 ms |
844 KB |
Output is correct |
| 9 |
Incorrect |
5 ms |
844 KB |
Output isn't correct |
| 10 |
Correct |
2 ms |
844 KB |
Output is correct |
| 11 |
Correct |
12 ms |
844 KB |
Output is correct |
| 12 |
Correct |
13 ms |
844 KB |
Output is correct |
| 13 |
Correct |
25 ms |
1132 KB |
Output is correct |
| 14 |
Correct |
24 ms |
1132 KB |
Output is correct |
| 15 |
Correct |
47 ms |
1132 KB |
Output is correct |
| 16 |
Correct |
93 ms |
1644 KB |
Output is correct |
| 17 |
Correct |
70 ms |
1984 KB |
Output is correct |
| 18 |
Execution timed out |
143 ms |
2800 KB |
Time limit exceeded |
| 19 |
Execution timed out |
106 ms |
3044 KB |
Time limit exceeded |
| 20 |
Execution timed out |
203 ms |
3664 KB |
Time limit exceeded |
