# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
119308 | 2019-06-21T02:23:34 Z | tmwilliamlin168 | Printed Circuit Board (CEOI12_circuit) | C++14 | 100 ms | 37352 KB |
#include <bits/stdc++.h> using namespace std; #define ll long long const int mxN=2e5; int n, b[mxN], c[mxN+1], e1[mxN], e2[mxN]; array<ll, 2> a[mxN+1]; vector<int> va[mxN], vr[mxN], vp[mxN], ans; 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]; } struct scmp { bool operator()(const int &i, const int &j) const { 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]); } }; set<int, scmp> s; int main() { scanf("%d", &n); for(int i=0; i<n; ++i) scanf("%d%d", &a[i][0], &a[i][1]); a[n]=a[0]; iota(b, b+n, 0); sort(b, b+n, pcmp); for(int i=0; i<n; ++i) { c[i]=lower_bound(b, b+n, i, pcmp)-b; vp[c[i]].push_back(i); } 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]]) { va[c[e1[i]]].push_back(i); vr[c[e2[i]]].push_back(i); } } for(int i=0; i<n; ++i) { for(int j : vr[i]) s.erase(j); for(int j : va[i]) s.insert(j); int mj=-1; for(int j : vp[i]) if(mj<0||a[j][0]+a[j][1]<a[mj][0]+a[mj][1]) mj=j; if(~mj&&(!s.size()||!cw(e1[*s.begin()], e2[*s.begin()], mj))) ans.push_back(mj); } printf("%d\n", ans.size()); sort(ans.begin(), ans.end()); for(int a : ans) printf("%d ", a+1); }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 13 ms | 14464 KB | Output is correct |
2 | Correct | 15 ms | 14592 KB | Output is correct |
3 | Correct | 15 ms | 14848 KB | Output is correct |
4 | Correct | 17 ms | 15052 KB | Output is correct |
5 | Correct | 26 ms | 15616 KB | Output is correct |
6 | Correct | 26 ms | 15608 KB | Output is correct |
7 | Correct | 43 ms | 16712 KB | Output is correct |
8 | Correct | 24 ms | 15352 KB | Output is correct |
9 | Correct | 21 ms | 15488 KB | Output is correct |
10 | Correct | 29 ms | 15608 KB | Output is correct |
11 | Correct | 28 ms | 15744 KB | Output is correct |
12 | Correct | 31 ms | 16760 KB | Output is correct |
13 | Correct | 66 ms | 17784 KB | Output is correct |
14 | Correct | 54 ms | 18808 KB | Output is correct |
15 | Correct | 57 ms | 19960 KB | Output is correct |
16 | Execution timed out | 109 ms | 25464 KB | Time limit exceeded |
17 | Execution timed out | 230 ms | 25976 KB | Time limit exceeded |
18 | Execution timed out | 208 ms | 36344 KB | Time limit exceeded |
19 | Execution timed out | 210 ms | 36416 KB | Time limit exceeded |
20 | Execution timed out | 536 ms | 37352 KB | Time limit exceeded |