oj.uz

답안 #119317

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
119317 2019-06-21T02:43:56 Z tmwilliamlin168 Printed Circuit Board (CEOI12_circuit) C++14
50 / 100
 100 ms 37672 KB 
#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;
array<ll, 2> a[mxN+1];
vector<int> va[mxN], vr[mxN], vp[mxN];
bool tr[mxN], 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];
}

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]);
	}
};
priority_queue<int, vector<int>, scmp> pq;

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, 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;
			vp[c[b[j]]].push_back(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]]) {
			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])
			tr[j]=1;
		for(int j : va[i])
			pq.push(j);
		while(pq.size()&&tr[pq.top()])
			pq.pop();
		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&&(!pq.size()||!cw(e1[pq.top()], e2[pq.top()], mj)))
			ans[mj]=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(' ');
		}
	}
}

Subtask #1
50.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 14464 KB Output is correct
2 Correct 17 ms 14592 KB Output is correct
3 Correct 17 ms 14848 KB Output is correct
4 Correct 17 ms 14976 KB Output is correct
5 Correct 50 ms 15604 KB Output is correct
6 Incorrect 24 ms 15608 KB Output isn't correct
7 Incorrect 35 ms 16760 KB Output isn't correct
8 Incorrect 23 ms 15332 KB Output isn't correct
9 Correct 22 ms 15360 KB Output is correct
10 Incorrect 22 ms 15616 KB Output isn't correct
11 Incorrect 26 ms 15744 KB Output isn't correct
12 Correct 28 ms 16896 KB Output is correct
13 Incorrect 45 ms 17912 KB Output isn't correct
14 Correct 55 ms 19192 KB Output is correct
15 Correct 54 ms 20344 KB Output is correct
16 Correct 98 ms 26100 KB Output is correct
17 Execution timed out 150 ms 25716 KB Time limit exceeded
18 Execution timed out 196 ms 37616 KB Time limit exceeded
19 Execution timed out 206 ms 37672 KB Time limit exceeded
20 Execution timed out 349 ms 36724 KB Time limit exceeded