oj.uz

Submission #119312

# Submission time Handle Problem Language Result Execution time Memory
119312 2019-06-21T02:30:32 Z tmwilliamlin168 Printed Circuit Board (CEOI12_circuit) C++14
80 / 100
 100 ms 37240 KB 
#include <bits/stdc++.h>
using namespace std;

#define ll long long

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];
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() {
	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);
	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);
	}
	out(ans.size());
	putchar_unlocked('\n');
	sort(ans.begin(), ans.end());
	for(int a : ans) {
		out(a+1);
		putchar_unlocked(' ');
	}
}

Subtask #1
80.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 16 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 16 ms 14976 KB Output is correct
5 Correct 25 ms 15608 KB Output is correct
6 Correct 25 ms 15612 KB Output is correct
7 Correct 42 ms 16760 KB Output is correct
8 Correct 22 ms 15360 KB Output is correct
9 Correct 20 ms 15488 KB Output is correct
10 Correct 25 ms 15616 KB Output is correct
11 Correct 26 ms 15616 KB Output is correct
12 Correct 29 ms 16640 KB Output is correct
13 Correct 57 ms 17784 KB Output is correct
14 Correct 46 ms 18816 KB Output is correct
15 Correct 52 ms 19960 KB Output is correct
16 Correct 90 ms 25492 KB Output is correct
17 Execution timed out 214 ms 25852 KB Time limit exceeded
18 Execution timed out 198 ms 36472 KB Time limit exceeded
19 Execution timed out 182 ms 36472 KB Time limit exceeded
20 Execution timed out 550 ms 37240 KB Time limit exceeded