oj.uz

답안 #439207

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
439207 2021-06-29T11:42:58 Z kig9981 IOI 바이러스 (JOI21_fever) C++17
6 / 100
 15 ms 15988 KB 
#include <bits/stdc++.h>

#ifdef NON_SUBMIT
#define TEST(n) (n)
#define tout cerr
#else
#define TEST(n) ((void)0)
#define tout cin
#endif

using namespace std;

vector<int> x[4], X[4][100000];
vector<pair<int,int>> P;
int R[100000][8], dist[100000][8];

inline int get_d(int p, int d)
{
	switch(d&=3) {
		case 0: return P[p].first+P[p].second;
		case 1: return P[p].second;
		case 2: return P[p].first-P[p].second;
		case 3: return P[p].first;
	}
	return -1;
}

inline int get_d(int p)
{
	if(P[p].first>0) {
		if(P[p].second>=P[p].first) return 7;
		if(P[p].second<=-P[p].first) return 3;
		return 5;
	}
	if(P[p].second>-P[p].first) return 7;
	if(P[p].second<P[p].first) return 3;
	return 1;
}

inline int get_dist(int a, int b)
{
	if(P[a].first==P[b].first) return abs(P[a].second-P[b].second)>>1;
	if(P[a].second==P[b].second) return abs(P[a].first-P[b].first)>>1;
	return abs(P[a].first-P[b].first);
}

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(NULL); cout.tie(NULL);
	TEST(freopen("input.txt","r",stdin));
	TEST(freopen("output.txt","w",stdout));
	TEST(freopen("debug.txt","w",stderr));
	int N, ans=0, nxt[3], n;
	priority_queue<tuple<int,int,int>> Q;
	auto cmp=[&](int a, int b) {
		return P[a]<P[b];
	};
	auto cmp2=[&](pair<int,int> a, int b) {
		return a<P[b];
	};
	auto cmp3=[&](int a, pair<int,int> b) {
		return P[a]<b;
	};
	cin>>N; P.resize(N);
	for(int i=0;i<N;i++) {
		cin>>P[i].first>>P[i].second;
		P[i].first<<=1;
		P[i].second<<=1;
		if(i) {
			P[i].first-=P[0].first;
			P[i].second-=P[0].second;
		}
	}
	P[0]={0,0};
	for(int t=0;t<4;t++) {
		int res=0;
		memset(dist,0x7f,sizeof(dist));
		memset(R,-1,sizeof(R));
		for(int d=0;d<2;d++) Q.emplace(dist[0][d]=0,0,d);
		for(int d=0;d<4;d++) {
			x[d].clear();
			for(int i=0;i<N;i++) {
				x[d].push_back(get_d(i,d));
				X[d][i].clear();
			}
			sort(x[d].begin(),x[d].end()); x[d].resize(unique(x[d].begin(),x[d].end())-x[d].begin());
			for(int i=0;i<N;i++) X[d][lower_bound(x[d].begin(),x[d].end(),get_d(i,d))-x[d].begin()].push_back(i);
			for(int i=0;i<x[d].size();i++) {
				sort(X[d][i].begin(),X[d][i].end(),cmp);
				for(int j=1;j<X[d][i].size();j++) {
					R[X[d][i][j-1]][d]=X[d][i][j];
					R[X[d][i][j]][d|4]=X[d][i][j-1];
				}
			}
		}
		while(!Q.empty()) {
			auto[t,c,d]=Q.top();
			Q.pop();
			if(-t!=dist[c][d]) continue;
			nxt[0]=get_d(c);
			nxt[1]=nxt[0]-1;
			nxt[2]=(nxt[0]+1)&7;
			for(auto nd: nxt) {
				int j, dd=lower_bound(x[nd&3].begin(),x[nd&3].end(),get_d(c,nd))-x[nd&3].begin();
				if(nd&4) {
					if(nd==7) j=upper_bound(X[nd&3][dd].begin(),X[nd&3][dd].end(),make_pair(P[c].first,P[c].second-dist[c][d]),cmp2)-X[nd&3][dd].begin()-1;
					else j=upper_bound(X[nd&3][dd].begin(),X[nd&3][dd].end(),make_pair(P[c].first-dist[c][d],0x7fffffff),cmp2)-X[nd&3][dd].begin()-1;
				}
				else {
					if(nd==3) j=lower_bound(X[nd][dd].begin(),X[nd][dd].end(),make_pair(P[c].first,P[c].second+dist[c][d]),cmp3)-X[nd][dd].begin();
					else j=lower_bound(X[nd][dd].begin(),X[nd][dd].end(),make_pair(P[c].first+dist[c][d],-0x7fffffff),cmp3)-X[nd][dd].begin();
				}
				if(0<=j && j<X[nd&3][dd].size() && get_d(c)!=get_d(n=X[nd&3][dd][j]) && dist[n][nd]>get_dist(c,n)) Q.emplace(-(dist[n][nd]=get_dist(c,n)),n,nd);
			}
			if((n=R[c][d])>-1 && dist[n][d]>dist[c][d]+get_dist(c,n)) Q.emplace(-(dist[n][d]=dist[c][d]+get_dist(c,n)),n,d);
		}
		for(int i=0;i<N;i++) for(int j=0;j<8;j++) if(dist[i][j]<0x7f7f7f7f) {
			res++;
			break;
		}
		ans=max(ans,res);
		for(auto &[x,y]: P) tie(x,y)=make_pair(y,-x);
	}
	cout<<ans<<'\n';
	return 0;
}

Compilation message

fever.cpp: In function 'int main()':
fever.cpp:89:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   89 |    for(int i=0;i<x[d].size();i++) {
      |                ~^~~~~~~~~~~~
fever.cpp:91:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   91 |     for(int j=1;j<X[d][i].size();j++) {
      |                 ~^~~~~~~~~~~~~~~
fever.cpp:114:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  114 |     if(0<=j && j<X[nd&3][dd].size() && get_d(c)!=get_d(n=X[nd&3][dd][j]) && dist[n][nd]>get_dist(c,n)) Q.emplace(-(dist[n][nd]=get_dist(c,n)),n,nd);
      |                ~^~~~~~~~~~~~~~~~~~~

Subtask #1
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 15948 KB Output is correct
2 Correct 15 ms 15948 KB Output is correct
3 Correct 15 ms 15948 KB Output is correct
4 Correct 12 ms 15968 KB Output is correct
5 Correct 12 ms 15920 KB Output is correct
6 Correct 13 ms 15968 KB Output is correct
7 Correct 12 ms 15860 KB Output is correct
8 Correct 13 ms 15948 KB Output is correct
9 Correct 12 ms 15860 KB Output is correct
10 Correct 12 ms 15948 KB Output is correct
11 Correct 12 ms 15964 KB Output is correct
12 Correct 13 ms 15948 KB Output is correct
13 Correct 12 ms 15948 KB Output is correct
14 Correct 12 ms 15948 KB Output is correct
15 Correct 12 ms 15948 KB Output is correct
16 Correct 12 ms 15948 KB Output is correct
17 Correct 12 ms 15948 KB Output is correct
18 Correct 13 ms 15948 KB Output is correct
19 Correct 12 ms 15848 KB Output is correct
20 Correct 12 ms 15948 KB Output is correct
21 Correct 12 ms 15856 KB Output is correct
22 Correct 11 ms 15852 KB Output is correct
23 Correct 13 ms 15948 KB Output is correct
24 Correct 11 ms 15948 KB Output is correct
25 Correct 13 ms 15964 KB Output is correct
26 Correct 13 ms 15872 KB Output is correct
27 Correct 13 ms 15972 KB Output is correct
28 Incorrect 12 ms 15948 KB Output isn't correct
29 Halted 0 ms 0 KB -

Subtask #2
0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 15948 KB Output is correct
2 Correct 15 ms 15948 KB Output is correct
3 Correct 15 ms 15948 KB Output is correct
4 Correct 12 ms 15968 KB Output is correct
5 Correct 12 ms 15920 KB Output is correct
6 Correct 13 ms 15968 KB Output is correct
7 Correct 12 ms 15860 KB Output is correct
8 Correct 13 ms 15948 KB Output is correct
9 Correct 12 ms 15860 KB Output is correct
10 Correct 12 ms 15948 KB Output is correct
11 Correct 12 ms 15964 KB Output is correct
12 Correct 13 ms 15948 KB Output is correct
13 Correct 12 ms 15948 KB Output is correct
14 Correct 12 ms 15948 KB Output is correct
15 Correct 12 ms 15948 KB Output is correct
16 Correct 12 ms 15948 KB Output is correct
17 Correct 12 ms 15948 KB Output is correct
18 Correct 13 ms 15948 KB Output is correct
19 Correct 12 ms 15848 KB Output is correct
20 Correct 12 ms 15948 KB Output is correct
21 Correct 12 ms 15856 KB Output is correct
22 Correct 11 ms 15852 KB Output is correct
23 Correct 13 ms 15948 KB Output is correct
24 Correct 11 ms 15948 KB Output is correct
25 Correct 13 ms 15964 KB Output is correct
26 Correct 13 ms 15872 KB Output is correct
27 Correct 13 ms 15972 KB Output is correct
28 Incorrect 12 ms 15948 KB Output isn't correct
29 Halted 0 ms 0 KB -

Subtask #3
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 15948 KB Output is correct
2 Correct 12 ms 15896 KB Output is correct
3 Correct 13 ms 15940 KB Output is correct
4 Correct 13 ms 15972 KB Output is correct
5 Correct 13 ms 15980 KB Output is correct
6 Correct 13 ms 15948 KB Output is correct
7 Correct 13 ms 15988 KB Output is correct
8 Correct 14 ms 15924 KB Output is correct

Subtask #4
0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 15948 KB Output is correct
2 Correct 15 ms 15948 KB Output is correct
3 Correct 15 ms 15948 KB Output is correct
4 Correct 12 ms 15968 KB Output is correct
5 Correct 12 ms 15920 KB Output is correct
6 Correct 13 ms 15968 KB Output is correct
7 Correct 12 ms 15860 KB Output is correct
8 Correct 13 ms 15948 KB Output is correct
9 Correct 12 ms 15860 KB Output is correct
10 Correct 12 ms 15948 KB Output is correct
11 Correct 12 ms 15964 KB Output is correct
12 Correct 13 ms 15948 KB Output is correct
13 Correct 12 ms 15948 KB Output is correct
14 Correct 12 ms 15948 KB Output is correct
15 Correct 12 ms 15948 KB Output is correct
16 Correct 12 ms 15948 KB Output is correct
17 Correct 12 ms 15948 KB Output is correct
18 Correct 13 ms 15948 KB Output is correct
19 Correct 12 ms 15848 KB Output is correct
20 Correct 12 ms 15948 KB Output is correct
21 Correct 12 ms 15856 KB Output is correct
22 Correct 11 ms 15852 KB Output is correct
23 Correct 13 ms 15948 KB Output is correct
24 Correct 11 ms 15948 KB Output is correct
25 Correct 13 ms 15964 KB Output is correct
26 Correct 13 ms 15872 KB Output is correct
27 Correct 13 ms 15972 KB Output is correct
28 Incorrect 12 ms 15948 KB Output isn't correct
29 Halted 0 ms 0 KB -

Subtask #5
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 15948 KB Output is correct
2 Correct 15 ms 15948 KB Output is correct
3 Correct 15 ms 15948 KB Output is correct
4 Correct 12 ms 15968 KB Output is correct
5 Correct 12 ms 15920 KB Output is correct
6 Correct 13 ms 15968 KB Output is correct
7 Correct 12 ms 15860 KB Output is correct
8 Correct 13 ms 15948 KB Output is correct
9 Correct 12 ms 15860 KB Output is correct
10 Correct 12 ms 15948 KB Output is correct
11 Correct 12 ms 15964 KB Output is correct
12 Correct 13 ms 15948 KB Output is correct
13 Correct 12 ms 15948 KB Output is correct
14 Correct 12 ms 15948 KB Output is correct
15 Correct 12 ms 15948 KB Output is correct
16 Correct 12 ms 15948 KB Output is correct
17 Correct 12 ms 15948 KB Output is correct
18 Correct 13 ms 15948 KB Output is correct
19 Correct 12 ms 15848 KB Output is correct
20 Correct 12 ms 15948 KB Output is correct
21 Correct 12 ms 15856 KB Output is correct
22 Correct 11 ms 15852 KB Output is correct
23 Correct 13 ms 15948 KB Output is correct
24 Correct 11 ms 15948 KB Output is correct
25 Correct 13 ms 15964 KB Output is correct
26 Correct 13 ms 15872 KB Output is correct
27 Correct 13 ms 15972 KB Output is correct
28 Incorrect 12 ms 15948 KB Output isn't correct
29 Halted 0 ms 0 KB -

Subtask #6
0 / 32.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 15948 KB Output is correct
2 Correct 15 ms 15948 KB Output is correct
3 Correct 15 ms 15948 KB Output is correct
4 Correct 12 ms 15968 KB Output is correct
5 Correct 12 ms 15920 KB Output is correct
6 Correct 13 ms 15968 KB Output is correct
7 Correct 12 ms 15860 KB Output is correct
8 Correct 13 ms 15948 KB Output is correct
9 Correct 12 ms 15860 KB Output is correct
10 Correct 12 ms 15948 KB Output is correct
11 Correct 12 ms 15964 KB Output is correct
12 Correct 13 ms 15948 KB Output is correct
13 Correct 12 ms 15948 KB Output is correct
14 Correct 12 ms 15948 KB Output is correct
15 Correct 12 ms 15948 KB Output is correct
16 Correct 12 ms 15948 KB Output is correct
17 Correct 12 ms 15948 KB Output is correct
18 Correct 13 ms 15948 KB Output is correct
19 Correct 12 ms 15848 KB Output is correct
20 Correct 12 ms 15948 KB Output is correct
21 Correct 12 ms 15856 KB Output is correct
22 Correct 11 ms 15852 KB Output is correct
23 Correct 13 ms 15948 KB Output is correct
24 Correct 11 ms 15948 KB Output is correct
25 Correct 13 ms 15964 KB Output is correct
26 Correct 13 ms 15872 KB Output is correct
27 Correct 13 ms 15972 KB Output is correct
28 Incorrect 12 ms 15948 KB Output isn't correct
29 Halted 0 ms 0 KB -

Subtask #7
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 15948 KB Output is correct
2 Correct 15 ms 15948 KB Output is correct
3 Correct 15 ms 15948 KB Output is correct
4 Correct 12 ms 15968 KB Output is correct
5 Correct 12 ms 15920 KB Output is correct
6 Correct 13 ms 15968 KB Output is correct
7 Correct 12 ms 15860 KB Output is correct
8 Correct 13 ms 15948 KB Output is correct
9 Correct 12 ms 15860 KB Output is correct
10 Correct 12 ms 15948 KB Output is correct
11 Correct 12 ms 15964 KB Output is correct
12 Correct 13 ms 15948 KB Output is correct
13 Correct 12 ms 15948 KB Output is correct
14 Correct 12 ms 15948 KB Output is correct
15 Correct 12 ms 15948 KB Output is correct
16 Correct 12 ms 15948 KB Output is correct
17 Correct 12 ms 15948 KB Output is correct
18 Correct 13 ms 15948 KB Output is correct
19 Correct 12 ms 15848 KB Output is correct
20 Correct 12 ms 15948 KB Output is correct
21 Correct 12 ms 15856 KB Output is correct
22 Correct 11 ms 15852 KB Output is correct
23 Correct 13 ms 15948 KB Output is correct
24 Correct 11 ms 15948 KB Output is correct
25 Correct 13 ms 15964 KB Output is correct
26 Correct 13 ms 15872 KB Output is correct
27 Correct 13 ms 15972 KB Output is correct
28 Incorrect 12 ms 15948 KB Output isn't correct
29 Halted 0 ms 0 KB -