oj.uz

답안 #338770

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
338770 2020-12-23T21:11:28 Z ogibogi2004 Jakarta Skyscrapers (APIO15_skyscraper) C++14
57 / 100
 1000 ms 103732 KB 
#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;
unordered_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 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 2 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 1792 KB Output is correct
14 Correct 8 ms 2284 KB Output is correct
15 Correct 6 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 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 8 ms 2284 KB Output is correct
15 Correct 6 ms 2284 KB Output is correct
16 Correct 2 ms 2028 KB Output is correct
17 Correct 7 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 2 ms 2028 KB Output is correct
22 Correct 2 ms 2028 KB Output is correct
23 Correct 6 ms 2156 KB Output is correct
24 Correct 8 ms 2540 KB Output is correct
25 Correct 4 ms 2284 KB Output is correct
26 Correct 4 ms 2156 KB Output is correct
27 Correct 5 ms 2156 KB Output is correct
28 Correct 17 ms 2924 KB Output is correct
29 Correct 55 ms 4456 KB Output is correct
30 Correct 16 ms 2668 KB Output is correct
31 Correct 29 ms 3304 KB Output is correct
32 Correct 20 ms 2796 KB Output is correct
33 Correct 114 ms 7396 KB Output is correct
34 Correct 74 ms 7268 KB Output is correct

Subtask #4
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1772 KB Output is correct
2 Correct 2 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 2 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 8 ms 2284 KB Output is correct
15 Correct 6 ms 2284 KB Output is correct
16 Correct 2 ms 2028 KB Output is correct
17 Correct 7 ms 2668 KB Output is correct
18 Correct 3 ms 2156 KB Output is correct
19 Correct 2 ms 2028 KB Output is correct
20 Correct 3 ms 1900 KB Output is correct
21 Correct 2 ms 2028 KB Output is correct
22 Correct 2 ms 2028 KB Output is correct
23 Correct 6 ms 2156 KB Output is correct
24 Correct 9 ms 2540 KB Output is correct
25 Correct 4 ms 2284 KB Output is correct
26 Correct 4 ms 2156 KB Output is correct
27 Correct 6 ms 2156 KB Output is correct
28 Correct 17 ms 3052 KB Output is correct
29 Correct 53 ms 4476 KB Output is correct
30 Correct 15 ms 2540 KB Output is correct
31 Correct 29 ms 3304 KB Output is correct
32 Correct 21 ms 2796 KB Output is correct
33 Correct 111 ms 7268 KB Output is correct
34 Correct 68 ms 7268 KB Output is correct
35 Correct 76 ms 9192 KB Output is correct
36 Correct 7 ms 3052 KB Output is correct
37 Correct 60 ms 11488 KB Output is correct
38 Correct 60 ms 12024 KB Output is correct
39 Correct 52 ms 11748 KB Output is correct
40 Correct 54 ms 11880 KB Output is correct
41 Correct 90 ms 12388 KB Output is correct
42 Correct 9 ms 2284 KB Output is correct
43 Correct 10 ms 2284 KB Output is correct
44 Correct 7 ms 2156 KB Output is correct
45 Correct 660 ms 26204 KB Output is correct
46 Correct 411 ms 26204 KB Output is correct

Subtask #5
0 / 43.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 2 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 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 8 ms 2284 KB Output is correct
15 Correct 6 ms 2284 KB Output is correct
16 Correct 2 ms 2028 KB Output is correct
17 Correct 6 ms 2668 KB Output is correct
18 Correct 3 ms 2156 KB Output is correct
19 Correct 2 ms 2028 KB Output is correct
20 Correct 3 ms 1900 KB Output is correct
21 Correct 2 ms 2028 KB Output is correct
22 Correct 2 ms 2028 KB Output is correct
23 Correct 6 ms 2156 KB Output is correct
24 Correct 9 ms 2540 KB Output is correct
25 Correct 4 ms 2284 KB Output is correct
26 Correct 4 ms 2156 KB Output is correct
27 Correct 5 ms 2156 KB Output is correct
28 Correct 17 ms 2924 KB Output is correct
29 Correct 54 ms 4584 KB Output is correct
30 Correct 15 ms 2540 KB Output is correct
31 Correct 29 ms 3304 KB Output is correct
32 Correct 20 ms 2816 KB Output is correct
33 Correct 118 ms 7396 KB Output is correct
34 Correct 71 ms 7284 KB Output is correct
35 Correct 77 ms 9192 KB Output is correct
36 Correct 7 ms 3052 KB Output is correct
37 Correct 60 ms 11488 KB Output is correct
38 Correct 67 ms 12004 KB Output is correct
39 Correct 54 ms 11748 KB Output is correct
40 Correct 55 ms 11880 KB Output is correct
41 Correct 92 ms 12516 KB Output is correct
42 Correct 9 ms 2284 KB Output is correct
43 Correct 9 ms 2284 KB Output is correct
44 Correct 5 ms 2156 KB Output is correct
45 Correct 636 ms 26336 KB Output is correct
46 Correct 416 ms 26332 KB Output is correct
47 Correct 242 ms 36824 KB Output is correct
48 Correct 61 ms 14184 KB Output is correct
49 Correct 43 ms 10212 KB Output is correct
50 Correct 32 ms 9440 KB Output is correct
51 Correct 162 ms 18780 KB Output is correct
52 Correct 179 ms 19872 KB Output is correct
53 Correct 42 ms 8676 KB Output is correct
54 Correct 14 ms 3052 KB Output is correct
55 Correct 22 ms 4200 KB Output is correct
56 Correct 31 ms 4716 KB Output is correct
57 Correct 108 ms 20576 KB Output is correct
58 Correct 55 ms 4844 KB Output is correct
59 Correct 56 ms 6124 KB Output is correct
60 Correct 61 ms 7404 KB Output is correct
61 Correct 57 ms 7012 KB Output is correct
62 Correct 568 ms 26204 KB Output is correct
63 Execution timed out 1027 ms 103732 KB Time limit exceeded
64 Halted 0 ms 0 KB -