답안 #338771

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
338771	2020-12-23T21:12:31 Z	ogibogi2004	Jakarta Skyscrapers (APIO15_skyscraper)	C++14	36 / 100	958 ms	30044 KB

skyscraper

#include<bits/stdc++.h>
using namespace std;
const int MAXN=3e4+2;
const int INF=2e9;
int n,m;
struct doge
{
	int p,pos;
	bool operator<(const doge& other)
	{
		if(pos!=other.pos)return pos<other.pos;
		return p<=other.p;
	}
}d[MAXN];
struct state
{
	int pos,p,d;
	bool operator<(state const& other)const
	{
		if(d!=other.d)return d>other.d;
		return make_pair(p,pos)<make_pair(other.p,other.pos);
	}
};
set<pair<int,int> >doges;
set<int>doges1[MAXN];
vector<int>states;
map<int,int>dist;
int main()
{
	srand(654);
	int e=rand();
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cout.tie(NULL);
	cin>>n>>m;
	for(int i=0;i<m;++i)
	{
		cin>>d[i].pos>>d[i].p;
		doges.insert({d[i].p,d[i].pos%d[i].p});
		doges1[d[i].pos].insert(d[i].p);
	}
	for(auto t:doges)
	{
		for(int i=t.second;i<n;i+=t.first)
		{
			states.push_back(i*MAXN+t.first);
		}
	}
	//dist.reserve(states.size());
	for(auto s:states)
	{
		dist[(s^e)]=INF;
	}
	priority_queue<state>pq;
	pq.push({d[0].pos,d[0].p,0});
	dist[(d[0].pos*MAXN+d[0].p)^e]=0;
	while(!pq.empty())
	{
		state u=pq.top();pq.pop();
		if(dist[(u.pos*MAXN+u.p)^e]<u.d)continue;
		if(u.pos==d[1].pos&&u.p==d[1].p)break;
		if(clock()>0.9*CLOCKS_PER_SEC)break;
		//cout<<u.pos<<" "<<u.p<<endl;
		if(doges1[u.pos].size()>0)
		{
			auto it=doges1[u.pos].lower_bound(u.p);
			if(it!=doges1[u.pos].end()&&(*it)!=u.p)
			{
				auto d1=(*it);
				if(dist[(u.pos*MAXN+d1)^e]>u.d)
				{
					dist[(u.pos*MAXN+d1)^e]=u.d;
					pq.push({u.pos,d1,u.d});
				}
			}
			if(it!=doges1[u.pos].begin())
			{
				--it;
				auto d1=(*it);
				if(dist[(u.pos*MAXN+d1)^e]>u.d)
				{
					dist[(u.pos*MAXN+d1)^e]=u.d;
					pq.push({u.pos,d1,u.d});
				}
				++it;
			}
			//cout<<"**\n";
			if(it!=doges1[u.pos].end())++it;
			if(it!=doges1[u.pos].end())
			{
				auto d1=(*it);
				if(dist[(u.pos*MAXN+d1)^e]>u.d)
				{
					dist[(u.pos*MAXN+d1)^e]=u.d;
					pq.push({u.pos,d1,u.d});
				}
			}
		}
		//cout<<"***\n";
		/*for(auto d1:doges1[u.pos])
		{
			if(dist[(u.pos*MAXN+d1)^e]>u.d)
			{
				dist[(u.pos*MAXN+d1)^e]=u.d;
				pq.push({u.pos,d1,u.d});
			}
		}*/
		state v=u;
		if(v.pos+v.p<n)
		{
			v.pos+=v.p;
			if(dist[(v.pos*MAXN+v.p)^e]>u.d+1)
			{
				v.d=u.d+1;
				dist[(v.pos*MAXN+v.p)^e]=v.d;
				pq.push(v);
			}
		}
		v=u;
		if(v.pos-v.p>=0)
		{
			v.pos-=v.p;
			if(dist[(v.pos*MAXN+v.p)^e]>u.d+1)
			{
				v.d=u.d+1;
				dist[(v.pos*MAXN+v.p)^e]=v.d;
				pq.push(v);
			}
		}
	}
	if(dist[(d[1].pos*MAXN+d[1].p)^e]==INF)
	{
		cout<<-1<<"\n";
	}
	else cout<<dist[(d[1].pos*MAXN+d[1].p)^e]<<"\n";
return 0;
}

Subtask #1
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	1772 KB	Output is correct
2	Correct	1 ms	1772 KB	Output is correct
3	Correct	1 ms	1772 KB	Output is correct
4	Correct	1 ms	1772 KB	Output is correct
5	Correct	1 ms	1772 KB	Output is correct
6	Correct	1 ms	1772 KB	Output is correct
7	Correct	1 ms	1772 KB	Output is correct

Subtask #2
12.0 / 12.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	1772 KB	Output is correct
2	Correct	1 ms	1772 KB	Output is correct
3	Correct	1 ms	1772 KB	Output is correct
4	Correct	1 ms	1772 KB	Output is correct
5	Correct	1 ms	1772 KB	Output is correct
6	Correct	1 ms	1772 KB	Output is correct
7	Correct	1 ms	1772 KB	Output is correct
8	Correct	1 ms	1772 KB	Output is correct
9	Correct	1 ms	1772 KB	Output is correct
10	Correct	2 ms	1900 KB	Output is correct
11	Correct	3 ms	2156 KB	Output is correct
12	Correct	2 ms	1792 KB	Output is correct
13	Correct	2 ms	1772 KB	Output is correct
14	Correct	10 ms	2284 KB	Output is correct
15	Correct	8 ms	2284 KB	Output is correct

Subtask #3
14.0 / 14.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	1772 KB	Output is correct
2	Correct	1 ms	1772 KB	Output is correct
3	Correct	1 ms	1772 KB	Output is correct
4	Correct	1 ms	1772 KB	Output is correct
5	Correct	1 ms	1772 KB	Output is correct
6	Correct	1 ms	1772 KB	Output is correct
7	Correct	2 ms	1772 KB	Output is correct
8	Correct	1 ms	1772 KB	Output is correct
9	Correct	2 ms	1772 KB	Output is correct
10	Correct	2 ms	1900 KB	Output is correct
11	Correct	4 ms	2156 KB	Output is correct
12	Correct	2 ms	1772 KB	Output is correct
13	Correct	2 ms	1772 KB	Output is correct
14	Correct	10 ms	2284 KB	Output is correct
15	Correct	8 ms	2284 KB	Output is correct
16	Correct	2 ms	2028 KB	Output is correct
17	Correct	10 ms	2668 KB	Output is correct
18	Correct	3 ms	2156 KB	Output is correct
19	Correct	3 ms	2028 KB	Output is correct
20	Correct	4 ms	1900 KB	Output is correct
21	Correct	2 ms	2028 KB	Output is correct
22	Correct	3 ms	2156 KB	Output is correct
23	Correct	8 ms	2156 KB	Output is correct
24	Correct	14 ms	2560 KB	Output is correct
25	Correct	5 ms	2284 KB	Output is correct
26	Correct	6 ms	2156 KB	Output is correct
27	Correct	7 ms	2156 KB	Output is correct
28	Correct	32 ms	3052 KB	Output is correct
29	Correct	91 ms	4968 KB	Output is correct
30	Correct	23 ms	2668 KB	Output is correct
31	Correct	48 ms	3688 KB	Output is correct
32	Correct	36 ms	3216 KB	Output is correct
33	Correct	199 ms	8164 KB	Output is correct
34	Correct	132 ms	8164 KB	Output is correct

Subtask #4
0 / 21.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	1772 KB	Output is correct
2	Correct	1 ms	1772 KB	Output is correct
3	Correct	1 ms	1772 KB	Output is correct
4	Correct	1 ms	1772 KB	Output is correct
5	Correct	1 ms	1772 KB	Output is correct
6	Correct	1 ms	1772 KB	Output is correct
7	Correct	1 ms	1772 KB	Output is correct
8	Correct	1 ms	1772 KB	Output is correct
9	Correct	1 ms	1772 KB	Output is correct
10	Correct	2 ms	1900 KB	Output is correct
11	Correct	3 ms	2156 KB	Output is correct
12	Correct	2 ms	1772 KB	Output is correct
13	Correct	2 ms	1772 KB	Output is correct
14	Correct	10 ms	2284 KB	Output is correct
15	Correct	8 ms	2284 KB	Output is correct
16	Correct	3 ms	2028 KB	Output is correct
17	Correct	10 ms	2668 KB	Output is correct
18	Correct	3 ms	2156 KB	Output is correct
19	Correct	3 ms	2028 KB	Output is correct
20	Correct	3 ms	1900 KB	Output is correct
21	Correct	3 ms	2028 KB	Output is correct
22	Correct	3 ms	2156 KB	Output is correct
23	Correct	8 ms	2156 KB	Output is correct
24	Correct	13 ms	2540 KB	Output is correct
25	Correct	5 ms	2284 KB	Output is correct
26	Correct	5 ms	2156 KB	Output is correct
27	Correct	7 ms	2156 KB	Output is correct
28	Correct	28 ms	3052 KB	Output is correct
29	Correct	96 ms	4968 KB	Output is correct
30	Correct	23 ms	2668 KB	Output is correct
31	Correct	48 ms	3580 KB	Output is correct
32	Correct	35 ms	3052 KB	Output is correct
33	Correct	200 ms	8164 KB	Output is correct
34	Correct	136 ms	8164 KB	Output is correct
35	Correct	130 ms	9960 KB	Output is correct
36	Correct	11 ms	3180 KB	Output is correct
37	Correct	133 ms	12768 KB	Output is correct
38	Correct	126 ms	13156 KB	Output is correct
39	Correct	100 ms	12900 KB	Output is correct
40	Correct	116 ms	13032 KB	Output is correct
41	Correct	193 ms	13680 KB	Output is correct
42	Correct	11 ms	2412 KB	Output is correct
43	Correct	11 ms	2412 KB	Output is correct
44	Correct	8 ms	2156 KB	Output is correct
45	Incorrect	958 ms	30044 KB	Output isn't correct
46	Halted	0 ms	0 KB	-

Subtask #5
0 / 43.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	1772 KB	Output is correct
2	Correct	1 ms	1772 KB	Output is correct
3	Correct	1 ms	1772 KB	Output is correct
4	Correct	1 ms	1772 KB	Output is correct
5	Correct	1 ms	1772 KB	Output is correct
6	Correct	2 ms	1772 KB	Output is correct
7	Correct	1 ms	1772 KB	Output is correct
8	Correct	1 ms	1772 KB	Output is correct
9	Correct	1 ms	1772 KB	Output is correct
10	Correct	2 ms	1900 KB	Output is correct
11	Correct	4 ms	2156 KB	Output is correct
12	Correct	2 ms	1772 KB	Output is correct
13	Correct	2 ms	1772 KB	Output is correct
14	Correct	10 ms	2284 KB	Output is correct
15	Correct	9 ms	2284 KB	Output is correct
16	Correct	3 ms	2028 KB	Output is correct
17	Correct	10 ms	2668 KB	Output is correct
18	Correct	4 ms	2156 KB	Output is correct
19	Correct	3 ms	2028 KB	Output is correct
20	Correct	4 ms	1900 KB	Output is correct
21	Correct	2 ms	2028 KB	Output is correct
22	Correct	6 ms	2156 KB	Output is correct
23	Correct	8 ms	2156 KB	Output is correct
24	Correct	15 ms	2540 KB	Output is correct
25	Correct	5 ms	2284 KB	Output is correct
26	Correct	6 ms	2156 KB	Output is correct
27	Correct	7 ms	2156 KB	Output is correct
28	Correct	29 ms	3144 KB	Output is correct
29	Correct	93 ms	4968 KB	Output is correct
30	Correct	23 ms	2668 KB	Output is correct
31	Correct	51 ms	3560 KB	Output is correct
32	Correct	33 ms	3052 KB	Output is correct
33	Correct	205 ms	8164 KB	Output is correct
34	Correct	134 ms	8164 KB	Output is correct
35	Correct	137 ms	9832 KB	Output is correct
36	Correct	11 ms	3180 KB	Output is correct
37	Correct	139 ms	12764 KB	Output is correct
38	Correct	120 ms	13072 KB	Output is correct
39	Correct	112 ms	12968 KB	Output is correct
40	Correct	113 ms	13032 KB	Output is correct
41	Correct	186 ms	13540 KB	Output is correct
42	Correct	12 ms	2412 KB	Output is correct
43	Correct	17 ms	2412 KB	Output is correct
44	Correct	8 ms	2156 KB	Output is correct
45	Incorrect	957 ms	30044 KB	Output isn't correct
46	Halted	0 ms	0 KB	-

답안 #338771

Compilation message

Subtask #1 10.0 / 10.0

Subtask #2 12.0 / 12.0

Subtask #3 14.0 / 14.0

Subtask #4 0 / 21.0

Subtask #5 0 / 43.0

Subtask #1
10.0 / 10.0

Subtask #2
12.0 / 12.0

Subtask #3
14.0 / 14.0

Subtask #4
0 / 21.0

Subtask #5
0 / 43.0