oj.uz

답안 #338762

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
338762 2020-12-23T20:56:00 Z ogibogi2004 Jakarta Skyscrapers (APIO15_skyscraper) C++14
57 / 100
 1000 ms 103988 KB 
#include<bits/stdc++.h>
using namespace std;
const int MAXN=3e4+12;
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;
		//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 1920 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 5 ms 2284 KB Output is correct
15 Correct 4 ms 2284 KB Output is correct

Subtask #3
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 1772 KB Output is correct
2 Correct 1 ms 1772 KB Output is correct
3 Correct 2 ms 1772 KB Output is correct
4 Correct 1 ms 1772 KB Output is correct
5 Correct 2 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 5 ms 2284 KB Output is correct
15 Correct 4 ms 2284 KB Output is correct
16 Correct 2 ms 2028 KB Output is correct
17 Correct 5 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 2 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 4 ms 2156 KB Output is correct
24 Correct 6 ms 2540 KB Output is correct
25 Correct 3 ms 2284 KB Output is correct
26 Correct 3 ms 2156 KB Output is correct
27 Correct 3 ms 2156 KB Output is correct
28 Correct 8 ms 2944 KB Output is correct
29 Correct 25 ms 4456 KB Output is correct
30 Correct 7 ms 2540 KB Output is correct
31 Correct 13 ms 3452 KB Output is correct
32 Correct 9 ms 2796 KB Output is correct
33 Correct 54 ms 7268 KB Output is correct
34 Correct 36 ms 7268 KB Output is correct

Subtask #4
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 1792 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 5 ms 2284 KB Output is correct
15 Correct 4 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 2 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 4 ms 2156 KB Output is correct
24 Correct 6 ms 2540 KB Output is correct
25 Correct 3 ms 2284 KB Output is correct
26 Correct 3 ms 2156 KB Output is correct
27 Correct 3 ms 2156 KB Output is correct
28 Correct 8 ms 2924 KB Output is correct
29 Correct 26 ms 4584 KB Output is correct
30 Correct 7 ms 2560 KB Output is correct
31 Correct 13 ms 3304 KB Output is correct
32 Correct 9 ms 2796 KB Output is correct
33 Correct 53 ms 7268 KB Output is correct
34 Correct 37 ms 7268 KB Output is correct
35 Correct 56 ms 9192 KB Output is correct
36 Correct 6 ms 3052 KB Output is correct
37 Correct 54 ms 11488 KB Output is correct
38 Correct 55 ms 12004 KB Output is correct
39 Correct 51 ms 11748 KB Output is correct
40 Correct 50 ms 11880 KB Output is correct
41 Correct 76 ms 12388 KB Output is correct
42 Correct 7 ms 2284 KB Output is correct
43 Correct 7 ms 2284 KB Output is correct
44 Correct 6 ms 2156 KB Output is correct
45 Correct 361 ms 26204 KB Output is correct
46 Correct 276 ms 26348 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 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 2 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 5 ms 2284 KB Output is correct
15 Correct 4 ms 2284 KB Output is correct
16 Correct 2 ms 2028 KB Output is correct
17 Correct 5 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 2 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 4 ms 2156 KB Output is correct
24 Correct 6 ms 2540 KB Output is correct
25 Correct 3 ms 2284 KB Output is correct
26 Correct 3 ms 2156 KB Output is correct
27 Correct 3 ms 2156 KB Output is correct
28 Correct 8 ms 2924 KB Output is correct
29 Correct 24 ms 4456 KB Output is correct
30 Correct 7 ms 2540 KB Output is correct
31 Correct 14 ms 3304 KB Output is correct
32 Correct 9 ms 2796 KB Output is correct
33 Correct 51 ms 7268 KB Output is correct
34 Correct 40 ms 7268 KB Output is correct
35 Correct 56 ms 9192 KB Output is correct
36 Correct 7 ms 3052 KB Output is correct
37 Correct 52 ms 11488 KB Output is correct
38 Correct 57 ms 12004 KB Output is correct
39 Correct 50 ms 11748 KB Output is correct
40 Correct 53 ms 11880 KB Output is correct
41 Correct 74 ms 12388 KB Output is correct
42 Correct 7 ms 2284 KB Output is correct
43 Correct 7 ms 2284 KB Output is correct
44 Correct 6 ms 2156 KB Output is correct
45 Correct 364 ms 26204 KB Output is correct
46 Correct 271 ms 26312 KB Output is correct
47 Correct 229 ms 36824 KB Output is correct
48 Correct 61 ms 14184 KB Output is correct
49 Correct 42 ms 10212 KB Output is correct
50 Correct 33 ms 9440 KB Output is correct
51 Correct 124 ms 18652 KB Output is correct
52 Correct 148 ms 19932 KB Output is correct
53 Correct 36 ms 8676 KB Output is correct
54 Correct 7 ms 3052 KB Output is correct
55 Correct 10 ms 4080 KB Output is correct
56 Correct 16 ms 4716 KB Output is correct
57 Correct 105 ms 20576 KB Output is correct
58 Correct 22 ms 4844 KB Output is correct
59 Correct 27 ms 6252 KB Output is correct
60 Correct 32 ms 7404 KB Output is correct
61 Correct 35 ms 7012 KB Output is correct
62 Correct 365 ms 26204 KB Output is correct
63 Execution timed out 1105 ms 103988 KB Time limit exceeded
64 Halted 0 ms 0 KB -